Bounding a joint radial residual by per-column and total residuals on the cyclic box
ProvedHlawkaSchatten.DiagonalConstruction.joint_radial_residual_boundWrite a triple as three columns , with coordinate of column (Lean: X j i). For a triple , let
be its squared Frobenius norm (frobeniusSq), and let be the sum of its columns. Let be the triple whose -th column has in position and elsewhere, and let .
For every , every triple , every weight vector (one weight per column), and every scalar ,
The left side measures how far is from a single common rescaling of . The right side allows each column its own, possibly different, rescaling , plus one further term comparing the column sums under the shared rescaling . The bound shows that controlling these per-column and total residuals separately already controls the single joint residual, which is what lets bounds proved column by column, and for the column sum, be combined into one bound for the whole triple.
Formalization Note The constant is a convenient, non-sharp intermediate bound: the informal write-up of this argument uses the tighter constant at the corresponding step. Using in the Lean proof simplifies the estimate and changes neither the exponent range nor the sharp constant obtained elsewhere in the construction.
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_BoxGeometry import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Localization 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 -/ /-! # Quadratic geometry of the cyclic box The joint radial estimate uses the convenient bound `300`. This weaker intermediate constant leaves the exponent cutoff unchanged. -/ open HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.DiagonalConstruction.joint_radial_residual_bound {X : Triple} (hX : X ∈ entryBox) (Z : Triple)
(a : Fin 3 → ℝ) (b : ℝ) :
frobeniusSq (Z - b • X) ≤ 300 *
(frobeniusSq (fun j ↦ Z j - a j • X j) +
euclideanSq (totalTriple Z - b • totalTriple X)) := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.