we-solve (beta)

Math-2605-A1 · revision r1 · on Math-2605

OpenAI claim summary for Math-2605

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status: open. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

Chromatic number beyond clique-minor size: The named fractional-coloring corollary displays chi_f(G)>h(G) for arbitrarily large finite nonempty simple graphs. It refutes the relevant assertion using the ordinary complete-minor number h, and does not require a fractional-minor definition.

Colin de Verdière chromatic obstruction: The named fractional-coloring corollary displays chi_f(G)>h(G) for arbitrarily large finite nonempty simple graphs. It refutes the relevant assertion using the ordinary complete-minor number h, and does not require a fractional-minor definition.

The claimed counterexample lies within the question’s hypotheses and contradicts its universal conclusion.

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Fractional chromatic number versus ordinary Hadwiger number
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Mathematical claim 1.
  5. Mathematical claim 2.
  6. Outline of the argument
  7. Formal verification
  8. Status caveat
  9. Sources

Fractional chromatic number versus ordinary Hadwiger number

OpenAI's claim

Chromatic number beyond clique-minor size: The counterexample paper claims arbitrarily large finite graphs with $\chi_f(G)>h(G)$, hence also $\chi(G)>h(G)$; no independent vertex set in an example contains three vertices.

Colin de Verdière chromatic obstruction: The manuscript claims finite graphs whose fractional chromatic number is greater than $\mu(G)+1$, and therefore whose ordinary chromatic number violates the same bound; such examples exist at arbitrarily large orders.

Mathematical statement of the claimed result

Mathematical claim 1.
There are finite simple graphs $G$ of arbitrarily large order $m$ with independence number $\alpha(G)\le2$ and maximum size of a pairwise-touching matching less than $m/100$. The resulting corollary states \[h(G)<26m/75+2/3<m/2\le\chi_f(G)\le\chi(G),\] where $h(G)=\max\{t:K_t\text{ is a minor of }G\}$ and $\chi_f,\chi$ are fractional and ordinary chromatic numbers. Thus the exact inequalities $\chi\le h$ and $\chi_f\le h$ fail; no conclusion about replacing $h$ by a fractional minor parameter is supplied.
Mathematical claim 2.
The claimed counterexamples are finite simple graphs of arbitrarily large order $m$ with \[\alpha(G)\le2,\qquad\mu(G)+1<m/2\le\chi(G),\] where $\mu(G)$ is the Colin de Verdière spectral graph invariant. The fractional-coloring corollary strengthens the obstruction to \[\chi_f(G)\ge m/\alpha(G)\ge m/2>\kappa(G)+1\ge\mu(G)+1\ge h(G).\] Here $\kappa$ is its strong-Arnold-property-free spectral relaxation, and $h$ is the largest complete-minor order. In particular both $\chi\le\mu+1$ and $\chi_f\le h$ are refuted. A further corollary gives $\chi_{\mathrm{list}}(G)\le C(\mu(G)+1)$ with an absolute $C$.

Outline of the argument

Chromatic number beyond clique-minor size: The graph construction uses Boolean moment representations and paired frames to control compatible vertex distributions. Entropy projection, fingerprints for independent sets, and a capacitated-cut argument transfer the distributional constraints to finite graphs. The resulting obstruction limits clique-minor size, while the small independence number gives a larger fractional chromatic number.

Colin de Verdière chromatic obstruction: Allowed channel images are thinned while preserving the primal distribution, supplying enough compatible pairs for the conflict estimates. A Boolean moment argument restricts low-rank matrix representations. Entropy and finite sampling then produce graphs for which every well-signed matrix with a single negative eigenvalue has too much rank to support the proposed chromatic inequality.

Formal verification

Family 157 describes Lean coverage for the list-coloring upper bound with a universal multiple of clique-minor size; neither chromatic counterexample is part of this selection.

Chromatic number beyond clique-minor size: No manuscript-specific Comparator is listed in the pinned inventory.

The documented selection does not cover the entire manuscript assertion relevant here.

Colin de Verdière chromatic obstruction: No manuscript-specific Comparator is listed in the pinned inventory.

The documented selection does not cover the entire manuscript assertion relevant here.

This site has not run the Lean development. These links describe OpenAI’s selected formal statements and should be read with their stated scope.

Status caveat

OpenAI reports that an internal model produced the manuscripts. Their arguments have not been independently verified as proofs by this site. Any portion outside the documented formal scope may contain mistakes, and the catalogue label reports the announced mathematical claim.

Sources