geometry-topology / Convex geometry; projection bodies, reverse affine isoperimetric inequalities

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.

12Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

geometry-topologySep 24, 2026Significance 12/100Registry: lean checked

Brannen's simplex conjecture for projection-body volume

Prior state unknown→disproved

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 C…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

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.

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.

Recorded attempts

Evidence graph

Connected research record

Brannen's simplex conjecture for projection-body volume — Mathematical Frontier Network