Finite centered grid: exact mean power and Gaussian tail
OpenQAlgorithms.Papers.Independent.Intakenext100.P08.classicalGrid_gaussianTailLet be an integer, , and . Use symbols , , and the nearest-symbol decoder. Their exact uniform mean power and conditional symbol errors under additive noise satisfy
In particular, for any , the choice gives mean power at most and
This retains the source's conservative spacing while replacing its explicitly approximate integral power calculation with the exact finite sum. Uniform mean-symbol power alone does not enforce a power bound for every outer-code word.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P08
namespace QAlgorithms.Papers.Independent.Intakenext100.P08
open MeasureTheory ProbabilityTheory Matrix
open scoped BigOperators ENNReal
-- Accepted grouped index and source-sign matrix; no paper-local copies.
open QAlgorithms.Papers.Independent.Dependency50.P10 (Phase sigma)
-- The accepted predicate uses column bases and -sigma: apply it to S.transpose.
open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)
-- The accepted pairing has the opposite sign: exchange its two arguments below.
open QAlgorithms.Papers.Independent.Frontier30.P10 (symplecticPair)
/-- PDF p.10, (90)–(92): finite centered-grid power and nearest-decoding tail.
Printed/changed/why: (90) is explicitly an integral approximation; the finite
alphabet has exact power (d^2-1)t^2/3. The source's t=sqrt(3P)/d therefore
satisfies the conservative mean-symbol power inequality. No assertion is made
that every outer-code word meets the block-power constraint. -/
theorem classicalGrid_gaussianTail (d : ℕ) [NeZero d] (hd : 2 ≤ d)
(v : NNReal) (hv : 0 < v) (t : ℝ) (ht : 0 < t) :
gridMeanPower d t = ((d : ℝ) ^ 2 - 1) * t ^ 2 / 3 ∧
(∀ y : ℝ, ∀ j : Fin d,
|y - gridSymbol d t (gridDecode d t y)| ≤ |y - gridSymbol d t j|) ∧
(∀ j : Fin d, gridSymbolError d t v j ≤
complementaryErrorFunction (t / Real.sqrt (2 * (v : ℝ)))) ∧
(∀ P : ℝ, 0 < P →
let spacing := Real.sqrt (3 * P) / (d : ℝ)
gridMeanPower d spacing ≤ P ∧
∀ j : Fin d, gridSymbolError d spacing v j ≤
complementaryErrorFunction (Real.sqrt (3 * P / (2 * (d : ℝ) ^ 2 * (v : ℝ))))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P08
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every nonzero natural number with , every strictly positive nonnegative real number , and every positive real number , define for . For a positive spacing , define the decoded index
where rounding produces an integer and its nonnegative part is regarded as a natural number. Let be the real Gaussian probability measure of mean and variance , and set . Then the mean squared grid symbol satisfies
For every real and every ,
and for every such ,
Moreover, for every positive real number , setting gives
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.