analysis / Asymptotic geometric analysis; covering numbers

The duality conjecture for metric entropy (Pietsch)

Theorem 1.1: for every a,b≥1a,b\ge1 there exist nn and an origin-symmetric convex body K⊂RnK\subset\mathbb R^n such that, with LL the cube, log⁡N(K,L)>blog⁡N(L∘,a−1K∘)\log N(K,L)>b\log N(L^\circ,a^{-1}K^\circ). A further construction (per the Lean scope note) makes the dual-to-primal entropy ratio tend to zero. This disproves the two-sided dimension-free conjecture. It leaves intact the ellipsoid case, the convexified-packing duality, bounds with constants depending on the K-convexity constant, and Milman's logarithmic-loss comparison; no fixed-dimension claim is made.

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

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

analysisSep 24, 2026Significance 36/100Registry: lean checked

The duality conjecture for metric entropy (Pietsch)

Prior state unknown→disproved

Theorem 1.1: for every a,b≥1a,b\ge1 there exist nn and an origin-symmetric convex body K⊂RnK\subset\mathbb R^n such that, with LL the cube, log⁡N(K,L)>blog⁡N(L∘,a−1K∘)\log N(K,L)>b\log N(L^\circ,a^{-1}K^\circ). A further construction (per the Lean scope note) makes the dual-to-primal entropy ratio tend to zero. This disproves the two-sided dimension-free conjecture. It leaves intact the ellipsoid case, the convexified-packing duality, bounds w…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for every a,b≥1a,b\ge1 there exist nn and an origin-symmetric convex body K⊂RnK\subset\mathbb R^n such that, with LL the cube, log⁡N(K,L)>blog⁡N(L∘,a−1K∘)\log N(K,L)>b\log N(L^\circ,a^{-1}K^\circ). A further construction (per the Lean scope note) makes the dual-to-primal entropy ratio tend to zero. This disproves the two-sided dimension-free conjecture. It leaves intact the ellipsoid case, the convexified-packing duality, bounds with constants depending on the K-convexity constant, and Milman's logarithmic-loss comparison; no fixed-dimension claim is made.

Theorem 1.1: for every a,b≥1a,b\ge1 there exist nn and an origin-symmetric convex body K⊂RnK\subset\mathbb R^n such that, with LL the cube, log⁡N(K,L)>blog⁡N(L∘,a−1K∘)\log N(K,L)>b\log N(L^\circ,a^{-1}K^\circ). A further construction (per the Lean scope note) makes the dual-to-primal entropy ratio tend to zero. This disproves the two-sided dimension-free conjecture. It leaves intact the ellipsoid case, the convexified-packing duality, bounds with constants depending on the K-convexity constant, and Milman's logarithmic-loss comparison; no fixed-dimension claim is made.

Recorded attempts

Evidence graph

Connected research record