Source authenticated

Brannen's simplex conjecture for projection-body volume

Theorem 1: for K=T10×T10⊂R20K=T_{10}\times T_{10}\subset\mathbb R^{20}, R20(K)/c20=121(2010)/(21⋅220)>1R_{20}(K)/c_{20}=121\binom{20}{10}/(21\cdot2^{20})>1, so the simplex bound fails in dimension 20; iterating the product identity Rr+s(A×B)=Rr(A)Rs(B)R_{r+s}(A\times B)=R_r(A)R_s(B) gives Rn(Kn)≥λncnR_n(K_n)\ge\lambda^nc_n for some λ>1\lambda>1 and all large nn. Priority: Feng, Hu, Liu and Xu (preprint, August 2026) already disproved the conjecture in every dimension d≥9d\ge9, and Chen et al. proved it in dimension 3; the paper cites both and presents its result as a direct product construction with an exact value. It does not determine the optimal upper constant or the maximizers.

Exact FrontierDelta

Prior state unknown→disproved

Scope and record

Occurred: Sep 24, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Brannen's simplex conjecture for projection-body volume · Brannen's simplex conjecture

Confidence: Not scored

Registry verification: lean checked · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Artifacts and verifiers

Lean proof (OAI.ProjectionCounterexample.universal_simplex_upper_bound_false)

lean artifact · pending

Artifact ↗
Lean proof (OAI.Paper092.product_counterexample)

lean artifact · pending

Artifact ↗
Comparator statement: ProjectionCounterexample.lean

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

Theorem 1: for K=T10×T10⊂R20K=T_{10}\times T_{10}\subset\mathbb R^{20}, R20(K)/c20=121(2010)/(21⋅220)>1R_{20}(K)/c_{20}=121\binom{20}{10}/(21\cdot2^{20})>1, so the simplex bound fails in dimension 20; iterating the product identity Rr+s(A×B)=Rr(A)Rs(B)R_{r+s}(A\times B)=R_r(A)R_s(B) gives Rn(Kn)≥λncnR_n(K_n)\ge\lambda^nc_n for some λ>1\lambda>1 and all large nn. Priority: Feng, Hu, Liu and Xu (preprint, August 2026) already disproved the conjecture in every dimension d≥9d\ge9, and Chen et al. proved it in dimension 3; the paper cites both and presents its result as a direct product construction with an exact value. It does not determine the optimal upper constant or the maximizers. parent of this event

This event attributed to Unreleased internal OpenAI model

Lean proof (OAI.Paper092.product_counterexample) evidence for this event

Brannen's simplex conjecture for projection-body volume parent of this event

Comparator statement: ProjectionCounterexample.lean evidence for this event

Brannen's simplex conjecture for projection-body volume evidence for this event

Lean proof (OAI.ProjectionCounterexample.universal_simplex_upper_bound_false) evidence for this event

VibeMathed record: Brannen's simplex conjecture for projection-body volume evidence for this event

Act on this frontier

Verify, challenge, or extend the result.