Strict integer-scale geometric family
OpenQAlgorithms.Papers.Independent.Intakenext100.P08.strictInteger_geometricFamilyLet , let be the Gaussian displacement variance per real coordinate, and let be an integer with . One can choose a single with and symplectic row matrices for every . Define
These lattices have covolume and geometric decoding failures satisfying
Here has independent coordinates. The dimensionless lattice has dual quotient of size , hence algebraic multiplicity . No normalized physical encoder or decoder is asserted. At an integer, this result permits only .
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 pp.6–7, (64)–(68): strict integer-scale geometric family, with one epsilon
chosen before all N. The omitted tail is restored, and tends to zero. There is
no endpoint extension and no assertion about normalized physical quantum codes. -/
theorem strictInteger_geometricFamily (hbar : ℝ) (hhbar : 0 < hbar)
(v : NNReal) (hv : 0 < v) (lambda : ℕ) (hlambda : 1 ≤ lambda)
(hstrict : (lambda : ℝ) < hbar / (Real.exp 1 * (v : ℝ))) :
∃ epsilon : ℝ, 0 < epsilon ∧
Real.exp 1 * (lambda : ℝ) * ((v : ℝ) + epsilon) / hbar < 1 ∧
∃ S : (N : ℕ) → Generator N,
(∀ N, 1 ≤ N →
IsSymplectic (S N).transpose ∧ (S N).det ≠ 0 ∧
Nat.card (DualCosets (Real.sqrt (lambda : ℝ) • S N)) = lambda ^ (2 * N) ∧
|(physicalNormalizer hbar lambda (S N)).det| =
(2 * Real.pi * hbar / (lambda : ℝ)) ^ N ∧
decodingFailure (physicalNormalizer hbar lambda (S N)) v ≤
displacementTail N v (Real.sqrt (2 * (N : ℝ) * ((v : ℝ) + epsilon))) +
(Real.exp 1 * (lambda : ℝ) * ((v : ℝ) + epsilon) / hbar) ^ N) ∧
Filter.Tendsto (fun N =>
displacementTail N v (Real.sqrt (2 * (N : ℝ) * ((v : ℝ) + epsilon))))
Filter.atTop (nhds 0) ∧
Filter.Tendsto (fun N => decodingFailure (physicalNormalizer hbar lambda (S N)) v)
Filter.atTop (nhds 0) := 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 positive real number , every strictly positive nonnegative real number , and every natural number satisfying , there exists a real number such that , and there exists a family of real matrices , defined for every natural number , with the following properties. Write , , and . For any such matrix , let be the set of integer linear combinations of its rows, let , and let be the collection of additive cosets modulo having a representative such that for every . Let be the law on Euclidean of independent mean-zero Gaussian coordinates of variance . For every ,
and
Here is the number of elements for a finite collection and is for an infinite collection. Both
as through the natural numbers. The family includes a matrix , but the displayed matrix, cardinality, determinant, and error-bound requirements are imposed only for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.