Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Scalar confinement of a normalized strict Hlawka failure, for p≥256p\ge256p≥256

Proved
HlawkaSchatten.DiagonalConstruction.normalized_failure_confinement

by savarin · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

confinementcounterexamplehlawka-schattenscalar-estimate

Let ι\iotaι be a finite index set and p≥256p\ge256p≥256. For t∈[1/2,2]t\in[1/2,2]t∈[1/2,2] define

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

and let Kp=sup⁡{Rp(t):t∈[1/2,2]}K_p = \sup\{R_p(t): t\in[1/2,2]\}Kp​=sup{Rp​(t):t∈[1/2,2]} be the cyclic constant (proved sharp for complex diagonal triples, in every finite dimension at least three, once p≥256p\ge256p≥256, by other theorems not used on this page). For x,y,z:ι→Rx,y,z:\iota\to\mathbb Rx,y,z:ι→R write ∥v∥p=(∑i∣vi∣p)1/p\|v\|_p=\big(\sum_i|v_i|^p\big)^{1/p}∥v∥p​=(∑i​∣vi​∣p)1/p, and suppose:

  1. the singleton norms already sum to one, ∥x∥p+∥y∥p+∥z∥p=1\|x\|_p+\|y\|_p+\|z\|_p=1∥x∥p​+∥y∥p​+∥z∥p​=1;
  2. the total-sum norm dominates each singleton norm, ∥x∥p≤∥x+y+z∥p\|x\|_p\le\|x+y+z\|_p∥x∥p​≤∥x+y+z∥p​, ∥y∥p≤∥x+y+z∥p\|y\|_p\le\|x+y+z\|_p∥y∥p​≤∥x+y+z∥p​, ∥z∥p≤∥x+y+z∥p\|z\|_p\le\|x+y+z\|_p∥z∥p​≤∥x+y+z∥p​;
  3. (x,y,z)(x,y,z)(x,y,z) is a strict failure of the KpK_pKp​-Hlawka inequality:
(2Kp−1)+∥x+y+z∥p−Kp(∥x+y∥p+∥x+z∥p+∥y+z∥p)<0(2K_p-1)+\|x+y+z\|_p-K_p\big(\|x+y\|_p+\|x+z\|_p+\|y+z\|_p\big)<0(2Kp​−1)+∥x+y+z∥p​−Kp​(∥x+y∥p​+∥x+z∥p​+∥y+z∥p​)<0

(using Hypothesis 1 to write the singleton-norm sum as 111).

Then the total-sum norm, the sum of the three pairwise deficits, and the three singleton norms are all confined to explicit narrow ranges:

13≤∥x+y+z∥p<53150,\tfrac13 \le \|x+y+z\|_p < \tfrac{53}{150},31​≤∥x+y+z∥p​<15053​, (∥x∥p+∥y∥p−∥x+y∥p)+(∥x∥p+∥z∥p−∥x+z∥p)+(∥y∥p+∥z∥p−∥y+z∥p)<2p,\big(\|x\|_p+\|y\|_p-\|x+y\|_p\big)+\big(\|x\|_p+\|z\|_p-\|x+z\|_p\big)+\big(\|y\|_p+\|z\|_p-\|y+z\|_p\big) < \tfrac2p,(∥x∥p​+∥y∥p​−∥x+y∥p​)+(∥x∥p​+∥z∥p​−∥x+z∥p​)+(∥y∥p​+∥z∥p​−∥y+z∥p​)<p2​, 2275<∥x∥p<53150,2275<∥y∥p<53150,2275<∥z∥p<53150.\tfrac{22}{75}<\|x\|_p<\tfrac{53}{150},\qquad \tfrac{22}{75}<\|y\|_p<\tfrac{53}{150},\qquad \tfrac{22}{75}<\|z\|_p<\tfrac{53}{150}.7522​<∥x∥p​<15053​,7522​<∥y∥p​<15053​,7522​<∥z∥p​<15053​.

This converts the linear growth rate of KpK_pKp​ into concrete numeric bounds — total norm just above 1/31/31/3, singleton norms clustered near 1/31/31/3, and a pair-deficit sum shrinking like 1/p1/p1/p — that are exactly the data the later coordinate-geometry arguments of the sharp diagonal construction take as their starting hypotheses.

Preamble
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Basic
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Normalization
import Definitions.Def_HlawkaSchatten_GapComparison
import Mathlib.Analysis.Complex.ExponentialBounds
import Mathlib.Analysis.Convex.Deriv
import Mathlib.Analysis.Convex.Function
import Mathlib.Analysis.Convex.Jensen
import Mathlib.Analysis.Convex.SpecificFunctions.Basic
import Mathlib.Analysis.InnerProductSpace.Basic
import Mathlib.Analysis.InnerProductSpace.Dual
import Mathlib.Analysis.InnerProductSpace.NormPow
import Mathlib.Analysis.Normed.Lp.PiLp
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity
import Mathlib.Data.Fin.VecNotation
import Mathlib.Data.Real.Basic
import Mathlib.Data.Sign.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Topology.Instances.Sign
import Mathlib.Topology.Order.Compact

/-
Copyright (c) 2026 Ezzeri Esa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ezzeri Esa
-/

/-! # Scalar confinement of a normalized strict counterexample -/


variable {ι : Type*} [Fintype ι]

open HlawkaSchatten
open HlawkaSchatten.DiagonalConstruction
Formal statement
theorem HlawkaSchatten.DiagonalConstruction.normalized_failure_confinement {p : ℝ} (hp : 256 ≤ p)
    (x y z : ι → ℝ) (hS : lpNorm p x + lpNorm p y + lpNorm p z = 1)
    (hx : lpNorm p x ≤ lpNorm p (x + y + z))
    (hy : lpNorm p y ≤ lpNorm p (x + y + z))
    (hz : lpNorm p z ≤ lpNorm p (x + y + z))
    (hf : hlawkaDeficit p (cyclicConstant p) x y z < 0) :
    (1 / 3 ≤ lpNorm p (x + y + z) ∧ lpNorm p (x + y + z) < 53 / 150) ∧
      pairGapSum (lpNorm p) x y z < 2 / p ∧
      (22 / 75 < lpNorm p x ∧ lpNorm p x < 53 / 150) ∧
      (22 / 75 < lpNorm p y ∧ lpNorm p y < 53 / 150) ∧
      (22 / 75 < lpNorm p z ∧ lpNorm p z < 53 / 150) := by sorry
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/Confinement.lean#L73-L97
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Sep 29, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by marwahaha · Sep 30, 2026

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me