Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The cyclic constant is at least one

Proved
HlawkaSchatten.DiagonalConstruction.cyclicConstant_ge_one

by Nihal · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

hlawka-schattensharp-constant

For a real exponent p>1p > 1p>1 and a parameter t∈[1/2,2]t \in [1/2, 2]t∈[1/2,2], put

Ap(t)=(tp+2)1/p,Bp(t)=(2 ∣1−t∣p+2p)1/p,A_p(t) = \bigl(t^p + 2\bigr)^{1/p}, \qquad B_p(t) = \bigl(2\,|1-t|^p + 2^p\bigr)^{1/p},Ap​(t)=(tp+2)1/p,Bp​(t)=(2∣1−t∣p+2p)1/p,

and define the cyclic ratio

Rp(t)  =  3Ap(t)−31/p ∣2−t∣6Ap(t)−3Bp(t).R_p(t) \;=\; \frac{3A_p(t) - 3^{1/p}\,|2-t|}{6A_p(t) - 3B_p(t)} .Rp​(t)=6Ap​(t)−3Bp​(t)3Ap​(t)−31/p∣2−t∣​.

The denominator is strictly positive on the parameter range, the function t↦Rp(t)t \mapsto R_p(t)t↦Rp​(t) is continuous there, and the interval [1/2,2][1/2,2][1/2,2] is compact, so RpR_pRp​ attains a maximum. The cyclic constant is that maximum,

Kp  =  sup⁡t∈[1/2, 2]Rp(t).K_p \;=\; \sup_{t \in [1/2,\,2]} R_p(t).Kp​=t∈[1/2,2]sup​Rp​(t).

Geometrically, Rp(t)R_p(t)Rp​(t) is the ratio of the triple deficit to the pair-deficit sum of the three real vectors (−t,1,1)(-t,1,1)(−t,1,1), (1,−t,1)(1,-t,1)(1,−t,1), (1,1,−t)(1,1,-t)(1,1,−t) under the coordinate norm Np(x)=(∑i∣xi∣p)1/pN_p(x) = \bigl(\sum_i |x_i|^p\bigr)^{1/p}Np​(x)=(∑i​∣xi​∣p)1/p; the constant KpK_pKp​ is the comparison ratio this one-parameter family forces, and it is the sharp constant in the diagonal Hlawka problem.

The theorem asserts a universal lower bound for this supremum:

Kp  ≥  1for every p>1.K_p \;\ge\; 1 \qquad \text{for every } p > 1 .Kp​≥1for every p>1.

The proof is a single evaluation: at the right endpoint t=2t = 2t=2 the two auxiliary quantities coincide, Bp(2)=Ap(2)B_p(2) = A_p(2)Bp​(2)=Ap​(2), because ∣1−2∣=1|1-2| = 1∣1−2∣=1 and ∣2−2∣=0|2-2| = 0∣2−2∣=0, so both the numerator and the denominator of Rp(2)R_p(2)Rp​(2) equal 3Ap(2)3A_p(2)3Ap​(2) and Rp(2)=1R_p(2) = 1Rp​(2)=1. Since 222 lies in the parameter interval, a maximum of RpR_pRp​ over that interval is at least the value at 222, hence Kp≥1K_p \ge 1Kp​≥1.

The bound is not an artefact of the endpoint: it is exactly what makes the normalization hypotheses in the downstream reduction and curvature criteria satisfiable, so the statement is recorded for every p>1p > 1p>1 even though the extremal ratio can dip below 111 strictly inside the interval when ppp is small.

Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic
import Definitions.Def_HlawkaSchatten_GapComparison

open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalConstruction.cyclicConstant_ge_one {p : ℝ} (hp : 1 < p) :
    1 ≤ cyclicConstant p := by sorry
Source
Elementary lower bound for the sharp cyclic constant of the diagonal Hlawka construction on Prove2Me (campaign sharp-diagonal-hlawka-constant); constant as in E. Esa, Hlawka-Schatten inequalities: sharp diagonal construction, https://github.com/savarin/hlawka-schatten/tree/79aa498bfcf7b22bd91d771fb32ec278e2d4704b .

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me