Lemma 4.5 —
ProvedIntMul.HvdH.lemma_4_5Let and be positive integers with , and let . The resampling map ,
satisfies
where is the operator norm with respect to the supremum norms on and .
This bound keeps the forward resampling step numerically stable, with growth by at most a constant factor.
import Mathlib import Definitions.Def_IntMul_HvdH_Resampling
namespace IntMul.HvdH
theorem lemma_4_5 (s t : ℕ) [NeZero s] [NeZero t] (hst : s < t) (hcop : Nat.Coprime s t)
(α : ℝ) (hα : 0 < α) :
‖resS s t α‖ < 1 + α⁻¹ := by sorry
end IntMul.HvdHRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement (IntMul.HvdH.lemma_4_5). Let be natural numbers with and , with , and with . Let be a real number with . Then the operator norm of the linear map defined below satisfies the strict inequality
The spaces and the norm. here means the space of functions , indices taken as residues . Each such space carries the supremum norm (with the complex modulus). The norm is the operator norm of as a map between these sup-normed spaces, i.e. (the operator norm). For a matrix this equals the maximum absolute row sum .
The map , unfolded. is the linear map given by the complex matrix , with rows indexed by and columns by , whose entries are the real numbers (viewed as complex numbers)
so that . Equivalently, writing and reading as ,
The sum over is an unconditional infinite sum; by convention it would be assigned the value if it failed to converge, but for the Gaussian terms are summable, so it is the genuine series value. All entries are strictly positive reals. Consequently the claim is equivalent to
Binders and hypotheses.
- , each assumed nonzero (so ; together with this forces ).
- (strict).
- and coprime. This includes with any .
- with (strict). There is no upper or lower bound on beyond positivity; both and arbitrarily large are covered.
Edge cases and remarks. The hypotheses are jointly satisfiable (e.g. , , ), so the statement is not vacuous. The hypotheses and do not enter the definition of ; they only restrict which pairs the bound is asserted for. The row is included, where the row sum is . The conclusion is a strict inequality (), not .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.