Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (34), last identity — (1/n^k)/det[C + G†G/2] = 1/((n+1)^k − n^k) for the circulant matrices G, A of (27)–(28) and C of (26)

Proved
GaussAddit.Noise.eq_34

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

circulant-matrixdeterminantgaussian-channelp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n>0n>0n>0 and k≥1k\ge1k≥1. Let PPP be the k×kk\times kk×k cyclic shift matrix, Pst=1P_{st}=1Pst​=1 if t=s+1t=s+1t=s+1 (indices mod kkk) and 000 otherwise, and put

G=P−1,A=PT−P,C=1n+A2.G=P-\mathbb 1,\qquad A=P^{\mathsf T}-P,\qquad C=\frac{\mathbb 1}{n}+\frac A2 .G=P−1,A=PT−P,C=n1​+2A​.

For k≥3k\ge3k≥3 these are the matrices (27), (28) and (26); for k=2k=2k=2, A=0A=0A=0, and for k=1k=1k=1, G=A=0G=A=0G=A=0, as the paper states. Then

1/nkdet⁡ ⁣[C+G†G/2]=1(n+1)k−nk.\frac{1/n^k}{\det\!\big[C+G^{\dagger}G/2\big]}=\frac{1}{(n+1)^k-n^k}.det[C+G†G/2]1/nk​=(n+1)k−nk1​.

Raised to the mmm-th power this is the last identity of (34): it evaluates the eigenvalue λ0\lambda_0λ0​ of Θ\ThetaΘ of maximum modulus as [(n+1)k−nk]−m[(n+1)^k-n^k]^{-m}[(n+1)k−nk]−m, which turns (22) into the bound (12). The first two identities of (34), which express λ0\lambda_0λ0​ through the eigenvalues dj,ejd_j,e_jdj​,ej​ of (29), are not part of this item.

Differences from the source:

  • encoding: {(1/n^k)/det[C + G†G/2]}^m = [1/((n + 1)^k − n^k)]^m → the identity of the bases, without the m-th power; reason: both bases are positive reals, so the two forms are equivalent
  • encoding: G, A of (27)–(28) (printed for k ⩾ 3; A null for k = 2; G, A null for k = 1); G† → G = P − 1, A = Pᵀ − P with P the cyclic shift; Gᵀ; reason: entrywise equal to (27)–(28) for k ⩾ 3 and to the stated null cases for k ⩽ 2; G is real
  • encoding: C = 11/n + A/2 of (26) and 1/n^k written with 1/n (defined only for n > 0) → hypothesis 0 < n; reason: excludes only n = 0, where the printed formula is undefined (P_n of (7) divides by n)
Preamble
import Mathlib
import Definitions.Def_GaussAddit_Noise_Channel

open MeasureTheory
open scoped ENNReal InnerProductSpace Matrix
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity rankOne)
open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix)
Formal statement
namespace GaussAddit.Noise

theorem eq_34 (n : ℝ) (hn : 0 < n) (k : ℕ) (hk : 1 ≤ k) :
    let P : Matrix (Fin k) (Fin k) ℝ := fun s t => if t = finRotate k s then 1 else 0
    let G : Matrix (Fin k) (Fin k) ℝ := P - 1
    let A : Matrix (Fin k) (Fin k) ℝ := Pᵀ - P
    let C : Matrix (Fin k) (Fin k) ℝ := (1 / n) • (1 : Matrix (Fin k) (Fin k) ℝ) + (1 / 2 : ℝ) • A
    (1 / n ^ k) / (C + (1 / 2 : ℝ) • (Gᵀ * G)).det = 1 / ((n + 1) ^ k - n ^ k) := by sorry

end GaussAddit.Noise
Source
Giovannetti & Lloyd, Additivity properties of a Gaussian channel, arXiv:quant-ph/0403075v3, p. 4, eq. (34) (last identity), with eqs. (26)–(28), p. 3
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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