Lemma 4.6 —
ProvedIntMul.HvdH.lemma_4_6Let and be positive integers with , let , and put . Let and . Define the maps:
- the row-deleting map , ;
- the diagonal map , ;
- , where is the resampling map of §4.1;
- .
If , then
where is the operator norm for the supremum norm on .
Consequently is invertible by a rapidly converging Neumann series, and is an explicit left inverse of . This is how the resampling identity is inverted in Theorem 4.1.
import Mathlib import Definitions.Def_IntMul_HvdH_Resampling
namespace IntMul.HvdH
open Real
theorem lemma_4_6 (s t : ℕ) [NeZero s] [NeZero t] (hst : s < t) (hcop : Nat.Coprime s t)
(α : ℝ) (hα : 0 < α) (hθ : 1 ≤ α ^ 2 * theta s t) :
‖errE s t α‖ < 2.01 * Real.exp (-π * α ^ 2 * theta s t / 2) ∧
2.01 * Real.exp (-π * α ^ 2 * theta s t / 2) < (2 : ℝ) ^ (-(α ^ 2 * theta s t)) := by sorry
end IntMul.HvdHRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. For all natural numbers with , , and , and for every real satisfying
both of the following strict inequalities hold:
Here is the exact rational , is computed in the reals (real division ), and is the real power with positive base. The hypotheses , enter as typeclass assumptions; is in any case implied by . Nothing else is assumed: in particular is allowed (then coprimality is automatic and is arbitrary), and no parity or size condition is placed on or . Since , , so the hypothesis is satisfiable (e.g. by any sufficiently large ); the hypotheses are not vacuous.
The space and the norm. Vectors in are functions , indexed by residues ; each residue is identified with its canonical representative in when an integer or real value of the index is needed. Likewise for with . The vector norm is the supremum norm (complex modulus), and is the operator norm of the -linear map with respect to the sup norm on both sides, i.e. , which for this norm equals the maximum absolute row sum of its matrix.
Unfolding . By definition , where is the identity on and is the composite of three maps:
- Nearest integer and . For real , (nearest integer, ties rounded upward). For an integer , .
- Diagonal map : for .
- Resampling map : for ,
which is the same as . (The inner series is an unconditional sum over , assigned the value if not summable; for it is a convergent Gaussian series, so this junk convention plays no role.)
- Row-deleting map : for , , where is the residue of the integer modulo . Note: since , one has , and the value (which occurs when ) is reduced to ; then the row index fed into is , not .
Composing, is the matrix with entries ()
with the Kronecker delta, and claim (i) says . The definition file also defines maps , , and the DFT, but none of them enters this theorem.
Remarks on the two conjuncts. The theorem is a conjunction; both parts are asserted under the same hypotheses. Conjunct (ii) does not involve at all: it depends on only through the single real number , and asserts for that (which satisfies by hypothesis). Coprimality of and and the strict inequality are hypotheses of the whole statement, and are not otherwise encoded in the definitions of or (which make sense for any nonzero ).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.