Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The hard family for hot states: occupation matrices NX=m(1+ξX)N_X=m(1+\xi X)NX​=m(1+ξX) give passive Gaussian states of the promise class with Rényi-2 overlap ≤e21ξ2n\le e^{21\xi^2n}≤e21ξ2n

Proved
BosonicLearn.occupation_family

by Senrui Chen · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

The ensemble used for Theorem 9, parametrized so that the occupation matrix (not the fugacity matrix) is linear in XXX; all bounds are uniform in the temperature scale mmm.

Let XXX be a Hermitian n×nn\times nn×n matrix with −4⋅1⪯X⪯4⋅1-4\cdot\mathbf 1\preceq X\preceq4\cdot\mathbf 1−4⋅1⪯X⪯4⋅1, m≥1m\ge1m≥1, 0<ξ≤1320<\xi\le\frac1{32}0<ξ≤321​, N=m(1+ξX)N=m(\mathbf 1+\xi X)N=m(1+ξX), R=N(1+N)−1R=N(\mathbf 1+N)^{-1}R=N(1+N)−1 and r0=m1+mr_0=\frac{m}{1+m}r0​=1+mm​. Then

  1. 78m 1⪯N⪯98m 1\frac78m\,\mathbf 1\preceq N\preceq\frac98m\,\mathbf 187​m1⪯N⪯89​m1, R⪰0R\succeq0R⪰0, 1−R≻0\mathbf 1-R\succ01−R≻0 and R2≺r01R^2\prec r_0\mathbf 1R2≺r0​1;
  2. for every 0<ν≤78m0<\nu\le\frac78m0<ν≤87​m there is a density operator with Fock coefficients ρR=det⁡(1−R)Γ(R)\rho_R=\det(\mathbf 1-R)\Gamma(R)ρR​=det(1−R)Γ(R) which is a passive Gaussian state with Σ⪰(12+ν)1\Sigma\succeq(\frac12+\nu)\mathbf 1Σ⪰(21​+ν)1;
  3. det⁡(1−R)2(1−r0)ndet⁡(1−R2/r0)≤e21ξ2n\displaystyle\frac{\det(\mathbf 1-R)^2}{(1-r_0)^n\det(\mathbf 1-R^2/r_0)}\le e^{21\xi^2n}(1−r0​)ndet(1−R2/r0​)det(1−R)2​≤e21ξ2n.

The quantity in 3 is Tr⁡(ρRσ−1/2ρRσ−1/2)\operatorname{Tr}(\rho_R\sigma^{-1/2}\rho_R\sigma^{-1/2})Tr(ρR​σ−1/2ρR​σ−1/2) for the thermal state σ\sigmaσ of fugacity r0r_0r0​ (see BosonicLearn.fugacity_renyi2_tensorPow); in an eigenbasis of XXX it is ∏i(1+m2ξ2xi2m+2mNi−Ni2)\prod_i\big(1+\frac{m^2\xi^2x_i^2}{m+2mN_i-N_i^2}\big)∏i​(1+m+2mNi​−Ni2​m2ξ2xi2​​).

Formalization Note NNN and RRR are introduced by equations Nm = …, R = Nm * (1 + Nm)⁻¹. The determinants are positive reals; their real parts are used.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff
import Definitions.Def_BosonicLearn_IsPassive
import Definitions.Def_BosonicLearn_promiseClass

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity traceSize)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
open scoped ENNReal Matrix ComplexOrder
Formal statement
namespace BosonicLearn

/-- **The hard family for hot states: occupation matrices `N_X = m(1 + ξX)`.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §8, proof of Theorem 9, Eq. (222), p. 65 (the ensemble `ρ_U` of passive Gaussian states with `Σ ⪰ (½ + ν)I`), in the
parametrization of §5.1, Eqs. (30)–(31), p. 30, with the occupation matrix (rather than the fugacity matrix) linear in `X`.

Let `X` be Hermitian with `−4·1 ⪯ X ⪯ 4·1`, `m ≥ 1`, `0 < ξ ≤ 1/32`, `N = m(1 + ξX)` and `R = N(1 + N)⁻¹`. Then
1. `(7/8)m·1 ⪯ N ⪯ (9/8)m·1`, `0 ⪯ R`, `1 − R` is positive definite, and `R² ≺ r₀·1` for `r₀ = m/(1 + m)`;
2. for every `0 < ν ≤ (7/8)m` there is a state with Fock coefficients `ρ_R = det(1 − R)Γ(R)` which is a passive Gaussian
   state of the promise class `Σ ⪰ (½ + ν)I`;
3. the Rényi-2 overlap with the thermal state of fugacity `r₀` satisfies
   `det(1 − R)² / ((1 − r₀)ⁿ det(1 − R²/r₀)) ≤ exp(21 ξ² n)`.

**Formalization Note.** In an eigenbasis of `X` with eigenvalues `x_i`, `N_i = m(1 + ξx_i)` and the quantity in 3 is
`∏ᵢ (1 + m²ξ²x_i²/(m + 2mN_i − N_i²)) ≤ ∏ᵢ (1 + (64/49)ξ²x_i²)`. Real parts of the (positive real) determinants are used. -/
theorem occupation_family {n : ℕ} (X : Matrix (Fin n) (Fin n) ℂ) (hX : X.IsHermitian)
    (h4 : (((4 : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - X).PosSemidef)
    (h4' : (((4 : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) + X).PosSemidef)
    (m ξ : ℝ) (hm : 1 ≤ m) (hξ0 : 0 < ξ) (hξ : ξ ≤ 1 / 32)
    (Nm R : Matrix (Fin n) (Fin n) ℂ)
    (hN : Nm = ((m : ℝ) : ℂ) • ((1 : Matrix (Fin n) (Fin n) ℂ) + ((ξ : ℝ) : ℂ) • X))
    (hRdef : R = Nm * (1 + Nm)⁻¹) :
    (Nm - ((7 / 8 * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ)).PosSemidef ∧
    (((9 / 8 * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - Nm).PosSemidef ∧
    R.PosSemidef ∧ (1 - R).PosDef ∧
    (((m / (1 + m) : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - R * R).PosDef ∧
    (∀ ν : ℝ, 0 < ν → ν ≤ 7 / 8 * m →
      ∃ ρ : State (Occupation (Fin n)), ρ.coefficients = fugacityCoeff R ∧ IsPassive ρ ∧
        ρ ∈ promiseClass n ν) ∧
    (1 - R).det.re ^ 2 /
        ((1 - m / (1 + m)) ^ n * (1 - (((m / (1 + m))⁻¹ : ℝ) : ℂ) • (R * R)).det.re) ≤
      Real.exp (21 * ξ ^ 2 * n) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §8, proof of Theorem 9, pp. 65–67 (Eq. (222): the ensemble of passive Gaussian states with Σ⪰(12+ν)I\Sigma\succeq(\frac12+\nu)IΣ⪰(21​+ν)I); parametrization of §5.1, Eqs. (30)–(31), p. 30

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