Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Achievable rates for the Gaussian quantum channel

Definition
QAlgorithms_Papers_Independent_Intakenext100_P08

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

The objects the formalized statements of Achievable rates for the Gaussian quantum channel (arXiv:quant-ph/0105058) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • Generator: Real row-generator matrices (28), PDF p.3. Nonsingularity is a theorem hypothesis.
  • rowLattice: Source (28), PDF p.3: the integer span of the rows, with their actual Euclidean metric.
  • alternatingGram: Source (29), PDF p.4: alternating pairing matrix of the row basis.
  • SymplecticallyIntegral: Source p.4: every entry of the alternating pairing matrix is an integer.
  • symplecticDual: Source p.4: vectors pairing integrally with every point of the row lattice.
  • dualGenerator: Source (31), PDF p.4: the computed dual generator, not a free parameter.
  • DualCosets: Source (43), PDF p.4: actual cosets represented by dual-lattice vectors. For integral M, these are the elements of Ldual/L. The finite-cardinality assertion is a conclusion, never a field of this definition.
  • unitBallVolume: Source (48), PDF p.5: Lebesgue volume of the open Euclidean unit ball.
  • displacementLaw: Source (2), (6), PDF pp.1–2: independent N(0,v) coordinates, transported by a measurable equivalence to Euclidean phase space. Here v is the variance.
  • voronoiCell: Source p.5: the closed central Voronoi cell. Gaussian-null boundaries permit this definite choice of tie convention.
  • decodingFailure: Geometric decoding failure, PDF pp.5–7, computed from the normalized noise law. It is not a quantum error or a free error parameter.
  • displacementTail: Atypical-displacement tail omitted explicitly in the source's (59)–(64), PDF pp.6–7.
  • physicalNormalizer: Physical normalizer scale from (52), (62), for integer multiplicity lambda^N.
  • complementaryErrorFunction: Complementary error function in (71), (92), PDF pp.7,10. This standard finite-interval formula avoids improper-integral default values.
  • roundedResidue: Source p.7: nearest-integer square-lattice syndrome, reduced modulo d. Mathlib's round breaks half-integer ties upwards; all such shifts are Gaussian-null.
  • xErrorProbability: The X-error probability in (71), computed from the q displacement.
  • zErrorProbability: The Z-error probability in (71), computed from the independent p displacement.
  • cyclicX: The finite cyclic shift in (69), PDF p.7. No ideal oscillator eigenspace is assumed.
  • cyclicZ: The finite clock in (69), PDF p.7, with the source's positive phase.
  • gridSymbol: The exact centered alphabet underlying (90)–(92), PDF p.10; adjacent symbols differ by 2t.
  • gridDecode: Nearest-symbol decoder for the finite centered alphabet, PDF p.10. Rounding gives an index on the infinite grid; clipping gives the nearest finite symbol.
  • gridMeanPower: Exact uniform mean-symbol power of the finite alphabet (source (90) uses an approximation).
  • gridSymbolError: Error probability conditional on the actual transmitted symbol, PDF p.10.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P02
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P10

/-!
Statements from Harrington–Preskill, quant-ph/0105058v1.
Only the algebraic and classical geometric results are asserted. Ideal Weyl
comb states are not treated as normalized oscillator states. See HARD.md for
operational claims and the Gram-classification ambiguity. Compilation pending.
-/

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)

/-- Real row-generator matrices (28), PDF p.3. Nonsingularity is a theorem hypothesis. -/
abbrev Generator (N : ℕ) := Matrix (Phase N) (Phase N) ℝ

/-- Source (28), PDF p.3: the integer span of the rows, with their actual Euclidean metric. -/
def rowLattice {N : ℕ} (M : Generator N) : Submodule ℤ (EuclideanSpace ℝ (Phase N)) :=
  Submodule.span ℤ (Set.range fun i => WithLp.toLp 2 (M i))

/-- Source (29), PDF p.4: alternating pairing matrix of the row basis. -/
def alternatingGram {N : ℕ} (M : Generator N) : Generator N :=
  M * sigma N * M.transpose

/-- Source p.4: every entry of the alternating pairing matrix is an integer. -/
def SymplecticallyIntegral {N : ℕ} (M : Generator N) : Prop :=
  ∀ i j, ∃ z : ℤ, alternatingGram M i j = (z : ℝ)

/-- Source p.4: vectors pairing integrally with every point of the row lattice. -/
def symplecticDual {N : ℕ} (M : Generator N) : Set (EuclideanSpace ℝ (Phase N)) :=
  {x | ∀ y ∈ rowLattice M, ∃ z : ℤ, symplecticPair (WithLp.ofLp y) (WithLp.ofLp x) = (z : ℝ)}

/-- Source (31), PDF p.4: the computed dual generator, not a free parameter. -/
noncomputable def dualGenerator {N : ℕ} (M : Generator N) : Generator N :=
  (alternatingGram M)⁻¹ * M

/-- Source (43), PDF p.4: actual cosets represented by dual-lattice vectors.
For integral M, these are the elements of Ldual/L. The finite-cardinality
assertion is a conclusion, never a field of this definition. -/
def DualCosets {N : ℕ} (M : Generator N) :=
  {c : EuclideanSpace ℝ (Phase N) ⧸ (rowLattice M).toAddSubgroup //
    ∃ x ∈ symplecticDual M, (QuotientAddGroup.mk x :
      EuclideanSpace ℝ (Phase N) ⧸ (rowLattice M).toAddSubgroup) = c}

/-- Source (48), PDF p.5: Lebesgue volume of the open Euclidean unit ball. -/
noncomputable def unitBallVolume (n : ℕ) : ℝ :=
  (volume (Metric.ball (0 : EuclideanSpace ℝ (Fin n)) 1)).toReal

/-- Source (2), (6), PDF pp.1–2: independent N(0,v) coordinates, transported
by a measurable equivalence to Euclidean phase space. Here v is the variance. -/
noncomputable def displacementLaw (N : ℕ) (v : NNReal) : Measure (EuclideanSpace ℝ (Phase N)) :=
  Measure.map (MeasurableEquiv.toLp 2 (Phase N → ℝ))
    (Measure.pi fun _ : Phase N => gaussianReal 0 v)

/-- Source p.5: the closed central Voronoi cell. Gaussian-null boundaries
permit this definite choice of tie convention. -/
def voronoiCell {N : ℕ} (M : Generator N) : Set (EuclideanSpace ℝ (Phase N)) :=
  {x | ∀ y ∈ rowLattice M, ‖x‖ ≤ ‖x - y‖}

/-- Geometric decoding failure, PDF pp.5–7, computed from the normalized noise law.
It is not a quantum error or a free error parameter. -/
noncomputable def decodingFailure {N : ℕ} (M : Generator N) (v : NNReal) : ℝ :=
  (displacementLaw N v (voronoiCell M)ᶜ).toReal

/-- Atypical-displacement tail omitted explicitly in the source's (59)–(64), PDF pp.6–7. -/
noncomputable def displacementTail (N : ℕ) (v : NNReal) (a : ℝ) : ℝ :=
  (displacementLaw N v {x | a < ‖x‖}).toReal

/-- Physical normalizer scale from (52), (62), for integer multiplicity lambda^N. -/
noncomputable def physicalNormalizer {N : ℕ} (hbar : ℝ) (lambda : ℕ)
    (S : Generator N) : Generator N :=
  Real.sqrt (2 * Real.pi * hbar / (lambda : ℝ)) • S

/-- Complementary error function in (71), (92), PDF pp.7,10.
This standard finite-interval formula avoids improper-integral default values. -/
noncomputable def complementaryErrorFunction (x : ℝ) : ℝ :=
  1 - (2 / Real.sqrt Real.pi) * ∫ t in (0 : ℝ)..x, Real.exp (-(t ^ 2))

/-- Source p.7: nearest-integer square-lattice syndrome, reduced modulo d.
Mathlib's round breaks half-integer ties upwards; all such shifts are Gaussian-null. -/
noncomputable def roundedResidue (d : ℕ) (delta x : ℝ) : ZMod d :=
  (round (x / delta) : ℤ)

/-- The X-error probability in (71), computed from the q displacement. -/
noncomputable def xErrorProbability (d : ℕ) (delta : ℝ) (v : NNReal) : ℝ :=
  (((gaussianReal 0 v).prod (gaussianReal 0 v))
    {x : ℝ × ℝ | roundedResidue d delta x.1 ≠ 0}).toReal

/-- The Z-error probability in (71), computed from the independent p displacement. -/
noncomputable def zErrorProbability (d : ℕ) (delta : ℝ) (v : NNReal) : ℝ :=
  (((gaussianReal 0 v).prod (gaussianReal 0 v))
    {x : ℝ × ℝ | roundedResidue d delta x.2 ≠ 0}).toReal

/-- The finite cyclic shift in (69), PDF p.7. No ideal oscillator eigenspace is assumed. -/
def cyclicX (d : ℕ) : Matrix (Fin d) (Fin d) ℂ :=
  fun i j => if i.val = (j.val + 1) % d then 1 else 0

/-- The finite clock in (69), PDF p.7, with the source's positive phase. -/
noncomputable def cyclicZ (d : ℕ) : Matrix (Fin d) (Fin d) ℂ :=
  Matrix.diagonal fun j =>
    Complex.exp (Complex.I * (2 * Real.pi * (j.val : ℝ) / (d : ℝ) : ℝ))

/-- The exact centered alphabet underlying (90)–(92), PDF p.10; adjacent symbols differ by 2t. -/
def gridSymbol (d : ℕ) (t : ℝ) (j : Fin d) : ℝ :=
  (2 * (j.val : ℝ) - (d : ℝ) + 1) * t

/-- Nearest-symbol decoder for the finite centered alphabet, PDF p.10.
Rounding gives an index on the infinite grid; clipping gives the nearest finite symbol. -/
noncomputable def gridDecode (d : ℕ) [NeZero d] (t y : ℝ) : Fin d :=
  ⟨min (round ((y / t + (d : ℝ) - 1) / 2)).toNat (d - 1),
    lt_of_le_of_lt (min_le_right _ _) (Nat.sub_lt (NeZero.pos d) (by decide))⟩

/-- Exact uniform mean-symbol power of the finite alphabet (source (90) uses an approximation). -/
noncomputable def gridMeanPower (d : ℕ) (t : ℝ) : ℝ :=
  (∑ j : Fin d, (gridSymbol d t j) ^ 2) / (d : ℝ)

/-- Error probability conditional on the actual transmitted symbol, PDF p.10. -/
noncomputable def gridSymbolError (d : ℕ) [NeZero d] (t : ℝ) (v : NNReal)
    (j : Fin d) : ℝ :=
  (gaussianReal 0 v {x | gridDecode d t (gridSymbol d t j + x) ≠ j}).toReal

/-! Sanity examples pin definitions without proving any source theorem. -/

example : sigma 1 (Sum.inl 0) (Sum.inr 0) = 1 := by
  norm_num [sigma, Matrix.fromBlocks]

example {N : ℕ} (y : EuclideanSpace ℝ (Phase N)) :
    symplecticPair (WithLp.ofLp y) 0 = 0 := by
  simp [symplecticPair]

example {N : ℕ} (M : Generator N) : (0 : EuclideanSpace ℝ (Phase N)) ∈ rowLattice M :=
  Submodule.zero_mem _

example {N : ℕ} (M : Generator N) : (0 : EuclideanSpace ℝ (Phase N)) ∈ symplecticDual M := by
  intro y hy
  exact ⟨0, by simp [symplecticPair]⟩

example (N : ℕ) : IsSymplectic (1 : Generator N).transpose := by
  simp [IsSymplectic]

example {N : ℕ} (M : Generator N) : (0 : EuclideanSpace ℝ (Phase N)) ∈ voronoiCell M := by
  intro y hy
  simp

example : complementaryErrorFunction 0 = 1 := by
  simp [complementaryErrorFunction]

example (d : ℕ) (delta : ℝ) : roundedResidue d delta 0 = 0 := by
  simp [roundedResidue]

example : cyclicX 2 1 0 = 1 := by
  norm_num [cyclicX]

example (d : ℕ) : cyclicZ d = Matrix.diagonal (fun j =>
    Complex.exp (Complex.I * (2 * Real.pi * (j.val : ℝ) / (d : ℝ) : ℝ))) := rfl

example (t : ℝ) : gridSymbol 2 t 0 = -t := by
  norm_num [gridSymbol]

example (t : ℝ) : gridMeanPower 2 t = t ^ 2 := by
  simp [gridMeanPower, gridSymbol, Fin.sum_univ_two] <;> ring

example {N : ℕ} (M : Generator N) :
    dualGenerator M = (alternatingGram M)⁻¹ * M := rfl

example {N : ℕ} (M : Generator N) : Nonempty (DualCosets M) := by
  refine ⟨⟨QuotientAddGroup.mk (0 : EuclideanSpace ℝ (Phase N)), 0, ?_, rfl⟩⟩
  intro y hy
  exact ⟨0, by simp [symplecticPair]⟩

example : unitBallVolume 2 = Real.pi := by
  norm_num [unitBallVolume, EuclideanSpace.volume_ball, Real.Gamma_two,
    Real.sq_sqrt (le_of_lt Real.pi_pos), Real.pi_pos.le]

example (N : ℕ) (v : NNReal) : displacementLaw N v Set.univ = 1 := by
  simp [displacementLaw,
    Measure.map_apply (MeasurableEquiv.toLp 2 (Phase N → ℝ)).measurable
      MeasurableSet.univ]

example {N : ℕ} (lambda : ℕ) (S : Generator N) :
    physicalNormalizer 0 lambda S = 0 := by
  simp [physicalNormalizer]

end QAlgorithms.Papers.Independent.Intakenext100.P08
Source
Achievable rates for the Gaussian quantum channel, arXiv:quant-ph/0105058v1, https://arxiv.org/abs/quant-ph/0105058v1
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

QAlgorithms.Papers.Independent.Intakenext100.P08.DualCosets

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, let LLL be the additive subgroup of Euclidean R2N\mathbb R^{2N}R2N consisting of all integer linear combinations of its rows. The type of dual cosets consists of those cosets ccc in the ambient additive quotient R2N/L\mathbb R^{2N}/LR2N/L for which there exists a representative xxx such that, for every y∈Ly\in Ly∈L, the number ∑j=0N−1(ypjxqj−yqjxpj)\sum_{j=0}^{N-1}(y_{p_j}x_{q_j}-y_{q_j}x_{p_j})∑j=0N−1​(ypj​​xqj​​−yqj​​xpj​​) is an integer, and x+L=cx+L=cx+L=c. Here qj,pjq_j,p_jqj​,pj​ label the first and second coordinate blocks. This is an existence condition on a representative; no hypothesis requires LLL itself to lie in the set of such representatives, and no finiteness condition is imposed on the resulting type. For N=0N=0N=0, there is exactly one such coset.

QAlgorithms.Papers.Independent.Intakenext100.P08.Generator

For every natural number NNN, including N=0N=0N=0, a generator is any real matrix whose rows and columns are indexed by two disjoint copies of {0,…,N−1}\{0,\ldots,N-1\}{0,…,N−1}, hence a 2N×2N2N\times2N2N×2N real matrix. There are no invertibility, rank, or integrality requirements. For N=0N=0N=0, this is the unique empty matrix.

QAlgorithms.Papers.Independent.Intakenext100.P08.SymplecticallyIntegral

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, being symplectically integral means that for every pair of row indices i,ki,ki,k there exists an integer zzz, allowed to depend on i,ki,ki,k, such that

∑j=0N−1(Mi,qjMk,pj−Mi,pjMk,qj)=z,\sum_{j=0}^{N-1} \bigl(M_{i,q_j}M_{k,p_j}-M_{i,p_j}M_{k,q_j}\bigr)=z,j=0∑N−1​(Mi,qj​​Mk,pj​​−Mi,pj​​Mk,qj​​)=z,

where qj,pjq_j,p_jqj​,pj​ label the first and second coordinate blocks. No invertibility assumption is included. For N=0N=0N=0, the condition is vacuous; the zero matrix satisfies it for every NNN.

QAlgorithms.Papers.Independent.Intakenext100.P08.alternatingGram

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, the alternating Gram matrix is

M(0IN−IN0)MT.M\begin{pmatrix}0&I_N\\-I_N&0\end{pmatrix}M^{\mathsf T}.M(0−IN​​IN​0​)MT.

Here the first and second coordinate blocks are indexed by qjq_jqj​ and pjp_jpj​, respectively, for 0≤j<N0\le j<N0≤j<N. Its entry in row iii and column kkk is ∑j=0N−1(Mi,qjMk,pj−Mi,pjMk,qj)\sum_{j=0}^{N-1}(M_{i,q_j}M_{k,p_j}-M_{i,p_j}M_{k,q_j})∑j=0N−1​(Mi,qj​​Mk,pj​​−Mi,pj​​Mk,qj​​). This definition applies to singular matrices as well, and for N=0N=0N=0 gives the empty matrix.

QAlgorithms.Papers.Independent.Intakenext100.P08.complementaryErrorFunction

For every real number xxx, this defines the real number

1−2π∫0xe−t2 dt.1-\frac{2}{\sqrt{\pi}}\int_0^x e^{-t^2}\,dt.1−π​2​∫0x​e−t2dt.

The integral is an oriented interval integral: when x<0x<0x<0, it is the negative of the integral from xxx to 000. In particular, the value at x=0x=0x=0 is 111.

QAlgorithms.Papers.Independent.Intakenext100.P08.cyclicX

For every natural number ddd, this defines a complex d×dd\times dd×d matrix XXX whose rows and columns are indexed by 0,…,d−10,\ldots,d-10,…,d−1, with entries

Xij={1,i=(j+1) mod d,0,otherwise.X_{ij}= \begin{cases} 1,&i=(j+1)\bmod d,\\ 0,&\text{otherwise}. \end{cases}Xij​={1,0,​i=(j+1)modd,otherwise.​

For d=0d=0d=0, this is an empty matrix, with no entries to evaluate; for d=1d=1d=1, its single entry is 111.

QAlgorithms.Papers.Independent.Intakenext100.P08.cyclicZ

For every natural number ddd, this defines the complex diagonal d×dd\times dd×d matrix ZZZ with

Zjj=exp⁡ ⁣(i 2πjd)(0≤j<d),Z_{jj}=\exp\!\left(i\,\frac{2\pi j}{d}\right) \qquad(0\leq j<d),Zjj​=exp(id2πj​)(0≤j<d),

and every off-diagonal entry equal to zero. The case d=0d=0d=0 gives an empty matrix, so no diagonal entry is evaluated; the case d=1d=1d=1 gives the single entry 111.

QAlgorithms.Papers.Independent.Intakenext100.P08.decodingFailure

For every natural number NNN, every real 2N×2N2N\times2N2N×2N matrix MMM, and every nonnegative real number vvv, the decoding failure is the real-valued measure of the set

{x∈R2N:∃y∈L, ∥x−y∥<∥x∥},\left\{x\in\mathbb R^{2N}: \exists y\in L,\ \|x-y\|<\|x\|\right\},{x∈R2N:∃y∈L, ∥x−y∥<∥x∥},

where LLL consists of all integer linear combinations of the rows of MMM, and the measure is the law of a vector with independent real Gaussian coordinates of mean 000 and variance vvv. The measure's extended nonnegative value is converted to a real number; it is finite here because the law is a probability measure. A tie alone does not place a vector in this failure set. No invertibility assumption is imposed on MMM. The value is zero if v=0v=0v=0, if M=0M=0M=0, or if N=0N=0N=0.

QAlgorithms.Papers.Independent.Intakenext100.P08.displacementLaw

For every natural number NNN and every nonnegative real number vvv, the displacement law is the measure on Euclidean R2N\mathbb R^{2N}R2N obtained by taking the product, over the two copies of {0,…,N−1}\{0,\ldots,N-1\}{0,…,N−1}, of real Gaussian measures with mean 000 and variance vvv, and then transporting this product measure through the coordinate identification with Euclidean space. Thus its coordinates are independent with those Gaussian laws. The value v=0v=0v=0 is allowed and gives a point mass at zero; for N=0N=0N=0, the law is the point mass on the unique vector of the zero-dimensional space.

QAlgorithms.Papers.Independent.Intakenext100.P08.displacementTail

For every natural number NNN, every nonnegative real number vvv, and every real threshold aaa, the displacement tail is the real-valued measure

P(∥X∥>a),\mathbb P(\|X\|>a),P(∥X∥>a),

where XXX lies in Euclidean R2N\mathbb R^{2N}R2N and has independent real Gaussian coordinates with mean 000 and variance vvv. It is defined by converting the extended nonnegative measure of the indicated set to a real number, which is finite because the law is a probability measure. The inequality is strict, and negative thresholds are allowed: the value is 111 when a<0a<0a<0. If v=0v=0v=0 or N=0N=0N=0, it is 111 for a<0a<0a<0 and 000 for a≥0a\ge0a≥0.

QAlgorithms.Papers.Independent.Intakenext100.P08.dualGenerator

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, its dual generator is defined to be

(M(0IN−IN0)MT)−1M.\left(M\begin{pmatrix}0&I_N\\-I_N&0\end{pmatrix}M^{\mathsf T}\right)^{-1}M.(M(0−IN​​IN​0​)MT)−1M.

The inverse here is the total matrix inverse: it is the ordinary inverse when the matrix is invertible and is the zero matrix when the matrix is singular. Thus the definition requires no invertibility hypothesis and returns zero whenever the displayed alternating Gram matrix is singular. For N=0N=0N=0, it returns the empty matrix.

QAlgorithms.Papers.Independent.Intakenext100.P08.gridDecode

For every natural number ddd assumed to be nonzero, and every pair of real numbers t,yt,yt,y, this defines an index in {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1} by

min⁡ ⁣{max⁡ ⁣{⌊y/t+d−12+12⌋, 0}, d−1}.\min\!\left\{ \max\!\left\{ \left\lfloor\frac{y/t+d-1}{2}+\frac12\right\rfloor,\ 0 \right\}, \ d-1 \right\}.min{max{⌊2y/t+d−1​+21​⌋, 0}, d−1}.

Thus the real quantity (y/t+d−1)/2(y/t+d-1)/2(y/t+d−1)/2 is rounded to the nearest integer, with half-integers rounded upward, negative integer results are replaced by zero, and the result is capped at d−1d-1d−1. There is no assumption that ttt is positive or nonzero: when t=0t=0t=0, division gives y/t=0y/t=0y/t=0, so the output is independent of yyy. When d=1d=1d=1, the output is always the sole index 000.

QAlgorithms.Papers.Independent.Intakenext100.P08.gridMeanPower

For every natural number ddd and real number ttt, this defines the real number

1d∑j=0d−1((2j−d+1)t)2.\frac{1}{d}\sum_{j=0}^{d-1}\bigl((2j-d+1)t\bigr)^2.d1​j=0∑d−1​((2j−d+1)t)2.

No positivity assumption is imposed on ddd or ttt. When d=0d=0d=0, the sum is empty and equals zero, and division by zero is defined to be zero, so the result is zero. The result is also zero when t=0t=0t=0.

QAlgorithms.Papers.Independent.Intakenext100.P08.gridSymbol

For every natural number ddd, real number ttt, and integer index jjj satisfying 0≤j<d0\leq j<d0≤j<d, this defines the real number

(2j−d+1)t.(2j-d+1)t.(2j−d+1)t.

There is no sign or nonzero assumption on ttt; in particular, t=0t=0t=0 makes every available symbol zero. When d=0d=0d=0, there is no admissible index jjj.

QAlgorithms.Papers.Independent.Intakenext100.P08.gridSymbolError

For every nonzero natural number ddd, real number ttt, nonnegative real variance vvv, and index j∈{0,…,d−1}j\in\{0,\ldots,d-1\}j∈{0,…,d−1}, let XXX have the real Gaussian distribution with mean 000 and variance vvv. This defines the real-valued probability

P ⁣(min⁡ ⁣{max⁡ ⁣{⌊((2j−d+1)t+X)/t+d−12+12⌋, 0}, d−1}≠j).\mathbb P\!\left( \min\!\left\{ \max\!\left\{ \left\lfloor \frac{\bigl((2j-d+1)t+X\bigr)/t+d-1}{2}+\frac12 \right\rfloor,\ 0 \right\}, \ d-1 \right\}\neq j \right).P(min{max{⌊2((2j−d+1)t+X)/t+d−1​+21​⌋, 0}, d−1}=j).

The floor expression implements nearest-integer rounding with half-integers rounded upward, followed by clipping to the index range. The definition permits t=0t=0t=0, using division by zero equal to zero, so in that case the decoded index is constant and the probability is zero or one according to whether that index equals jjj. It also permits v=0v=0v=0, when X=0X=0X=0 with probability one. For d=1d=1d=1, the error probability is zero.

QAlgorithms.Papers.Independent.Intakenext100.P08.physicalNormalizer

For every natural number NNN, real number ℏ\hbarℏ, natural number λ\lambdaλ, and real matrix SSS indexed by two copies of {0,…,N−1}\{0,\ldots,N-1\}{0,…,N−1} in each dimension, this defines the real matrix

2πℏλ S.\sqrt{\frac{2\pi\hbar}{\lambda}}\,S.λ2πℏ​​S.

There are no positivity assumptions on ℏ\hbarℏ or λ\lambdaλ. Division by zero is defined to be zero, and the real square root of a nonpositive number is zero; consequently, the result is the zero matrix when λ=0\lambda=0λ=0 or ℏ≤0\hbar\leq 0ℏ≤0. The case N=0N=0N=0 is included and gives an empty matrix.

QAlgorithms.Papers.Independent.Intakenext100.P08.roundedResidue

For every natural number ddd and real numbers δ,x\delta,xδ,x, this defines the residue class modulo ddd of the integer obtained by rounding x/δx/\deltax/δ to the nearest integer, with half-integers rounded upward:

[⌊xδ+12⌋]d.\left[\left\lfloor\frac{x}{\delta}+\frac12\right\rfloor\right]_d.[⌊δx​+21​⌋]d​.

When d=0d=0d=0, the target is the integers themselves, so no modular reduction occurs; when d=1d=1d=1, every result is zero. No assumption excludes δ=0\delta=0δ=0: in that case x/δ=0x/\delta=0x/δ=0, and the result is zero.

QAlgorithms.Papers.Independent.Intakenext100.P08.rowLattice

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, write the coordinate indices as qj,pjq_j,p_jqj​,pj​ for 0≤j<N0\le j<N0≤j<N. The set rowLattice⁡(M)\operatorname{rowLattice}(M)rowLattice(M) is the Z\mathbb ZZ-submodule of Euclidean R2N\mathbb R^{2N}R2N generated by the rows of MMM: it consists precisely of the vectors ∑ikiMi,∙\sum_i k_i M_{i,\bullet}∑i​ki​Mi,∙​ with arbitrary integers kik_iki​, where each row is regarded as a vector with the Euclidean norm. No independence or discreteness condition is imposed on these rows. For N=0N=0N=0, or for the zero matrix, this submodule is {0}\{0\}{0}.

QAlgorithms.Papers.Independent.Intakenext100.P08.symplecticDual

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, its symplectic dual is the set of all vectors xxx in Euclidean R2N\mathbb R^{2N}R2N such that, for every integer linear combination yyy of the rows of MMM, there exists an integer zzz satisfying

∑j=0N−1(ypjxqj−yqjxpj)=z,\sum_{j=0}^{N-1}(y_{p_j}x_{q_j}-y_{q_j}x_{p_j})=z,j=0∑N−1​(ypj​​xqj​​−yqj​​xpj​​)=z,

where qj,pjq_j,p_jqj​,pj​ label the first and second coordinate blocks. The integer may depend on both yyy and xxx. No invertibility or integrality assumption on MMM is required. If M=0M=0M=0, this set is all of R2N\mathbb R^{2N}R2N; for N=0N=0N=0, it consists of the unique vector in the zero-dimensional space.

QAlgorithms.Papers.Independent.Intakenext100.P08.unitBallVolume

For every natural number nnn, the unit ball volume is the real number obtained by taking the standard volume measure of the open Euclidean ball {x∈Rn:∥x∥<1}\{x\in\mathbb R^n:\|x\|<1\}{x∈Rn:∥x∥<1} and converting its extended nonnegative value to a real number. This conversion sends finite values to their usual real values and sends infinity to zero; the ball here has finite volume. The case n=0n=0n=0 is included: the ball is the singleton zero-dimensional space and its volume is 111.

QAlgorithms.Papers.Independent.Intakenext100.P08.voronoiCell

For every natural number NNN and every real 2N×2N2N\times2N2N×2N matrix MMM, its Voronoi cell is the set of all vectors xxx in Euclidean R2N\mathbb R^{2N}R2N such that

∥x∥≤∥x−y∥for every integer linear combination y of the rows of M.\|x\|\le \|x-y\| \quad\text{for every integer linear combination }y\text{ of the rows of }M.∥x∥≤∥x−y∥for every integer linear combination y of the rows of M.

Equality is allowed, so ties are included. No invertibility or discreteness assumption is imposed on the row-generated subgroup. If M=0M=0M=0, the cell is all of R2N\mathbb R^{2N}R2N; for N=0N=0N=0, it is the entire singleton space.

QAlgorithms.Papers.Independent.Intakenext100.P08.xErrorProbability

For every natural number ddd, real number δ\deltaδ, and nonnegative real variance vvv, take two independent real Gaussian variables U,VU,VU,V, each with mean 000 and variance vvv. This defines the real-valued probability

P ⁣([⌊Uδ+12⌋]d≠0).\mathbb P\!\left( \left[\left\lfloor\frac{U}{\delta}+\frac12\right\rfloor\right]_d\neq 0 \right).P([⌊δU​+21​⌋]d​=0).

Here rounding is to the nearest integer with half-integers rounded upward, residues modulo 000 are integers, and residues modulo 111 are always zero. The event depends only on the first coordinate UUU. The definition includes δ=0\delta=0δ=0, using division by zero equal to zero, and v=0v=0v=0, when both Gaussian measures are point masses at zero; the probability is zero in either of these cases, and also when d=1d=1d=1.

QAlgorithms.Papers.Independent.Intakenext100.P08.zErrorProbability

For every natural number ddd, real number δ\deltaδ, and nonnegative real variance vvv, take two independent real Gaussian variables U,VU,VU,V, each with mean 000 and variance vvv. This defines the real-valued probability

P ⁣([⌊Vδ+12⌋]d≠0).\mathbb P\!\left( \left[\left\lfloor\frac{V}{\delta}+\frac12\right\rfloor\right]_d\neq 0 \right).P([⌊δV​+21​⌋]d​=0).

Here rounding is to the nearest integer with half-integers rounded upward, residues modulo 000 are integers, and residues modulo 111 are always zero. The event depends only on the second coordinate VVV. The definition includes δ=0\delta=0δ=0, using division by zero equal to zero, and v=0v=0v=0, when both Gaussian measures are point masses at zero; the probability is zero in either of these cases, and also when d=1d=1d=1.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me