we-solve (beta)

Math-269-A2 · revision r1 · on Math-269

OpenAI claim summary for Math-269

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 at unsolvedmath.com: 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.

Sidorenko and forcing counterexamples: The explicit finite bipartite graph H and host G satisfy t(H,G)<t(K_2,G)^e(H). Passing to the associated step graphon also refutes the graphon formulation.

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. Sidorenko's Conjecture for Bipartite Graphons
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Mathematical claim 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Sidorenko's Conjecture for Bipartite Graphons

OpenAI's claim

Sidorenko and forcing counterexamples: A connected bipartite graph with 35 vertices and 66 edges is claimed to violate Sidorenko’s homomorphism-density lower bound in a finite host. The same pattern is also claimed not to force quasirandomness when the edge and pattern densities match their random values.

Mathematical statement of the claimed result

Mathematical claim 1.
Let $H$ be the incidence graph of the explicitly tabulated $22$ triples on $13$ points: it is connected and bipartite with $35$ vertices and $66$ edges. For $t(H,G)=\operatorname{hom}(H,G)/|V(G)|^{35}$ and $p(G)=2|E(G)|/|V(G)|^2$, a finite simple graph $G$ with $p(G)>0$ is claimed to satisfy $t(H,G)<p(G)^{66}$. Moreover, for every $c>0$ another graph $F$ has $0<t(K_2,F)$ and $t(H,F)<c\,p(F)^{66}$. The forcing corollary claims some $p\in(0,1)$ and a nonconstant symmetric measurable graphon $W:[0,1]^2\to[0,1]$ with \[t(K_2,W)=p,\qquad t(H,W)=p^{66},\qquad t(H,W)=\int_{[0,1]^{35}}\prod_{ij\in E(H)}W(x_i,x_j)\,dx.\] Thus equality at that density does not force this cyclic bipartite graph to be quasirandom.

Outline of the argument

Sidorenko and forcing counterexamples: The construction combines rank and discriminant relations for symmetric matrices with counts of symplectic intersections. Quadratic Gauss-sum estimates control joint signs, while type scores distinguish the desired vertex roles. Singular configurations are estimated separately so that the signed rank-layer correlations survive normalization and transfer to a finite host graph.

Formal verification

Family 161 describes Lean coverage for the fixed-pattern Sidorenko deficit; the forcing consequence is not selected.

Sidorenko and forcing counterexamples: The manuscript links SidorenkoCounterexample.lean.

The documented selection includes this manuscript’s main assertion; that assertion retains the restrictions stated above.

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