Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Gaussian hypothesis testing and quantum illumination

Definition
QAlgorithms_Papers_Independent_Support50_P03

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

The objects the formalized statements of Gaussian hypothesis testing and quantum illumination (arXiv:1608.06991) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • HalfVacuumCovariance: Physical covariances in vacuum-I/2 units, PDF p.2, (3)--(4). Unlike accepted interleaved vacuum-I PhysicalCovariance predicates, this uses grouped coordinates and V+iOmega/2. Positivity is Hermitian, not entrywise.
  • repeatBlock: Repeated block A direct-sum A, PDF pp.2,7,12.
  • GroupedWilliamsonData: Williamson data with the source's transpose convention, PDF p.2. Unlike Frontier30.P02.WilliamsonData, the modes are unordered and the reconstruction is S D S^T, rather than M^T D M. This is normal-mode data, not an ordinary diagonalization hypothesis.
  • realArcoth: Real inverse hyperbolic cotangent, PDF p.3, after (6). Only abs x > 1 is used in matrix-function conclusions; its endpoint default is never used to model the source's singular Gibbs matrix.
  • FaithfulSpectrum: Faithful Gaussian covariance spectrum, PDF pp.2,10.
  • gibbsMatrix: Equation (6); used only with a faithful spectrum and symplectic S.
  • modeEigenbasis: U tensor I from (A3), PDF p.7.
  • signedDiagonal: The compatible eigenvalue diagonal [-D] direct-sum D in (A4).
  • arcothNodes: DISTINCT nodes of the finite real spectrum of 2iVOmega. Finset.image removes repetitions, including repeated symplectic eigenvalues.
  • arcothPolynomial: Primary matrix-function interpolation polynomial for Appendix A. On the diagonalizable matrices asserted below, interpolation on distinct spectral points is the usual spectral matrix function, independently of any choice of eigenvectors. Its values use real arcoth only at real eigenvalues.
  • spectralArcoth: Polynomial functional calculus, defined independently of S and U (A5). The theorem guards the spectrum away from the poles at plus/minus one.
  • pureModeF1: Grouped continuous extension f1 at a pure mode, (D2), PDF pp.10--11.
  • pureModeF2: Grouped continuous extension f2 at a pure mode, (D2), PDF pp.10--11.
  • standardV0: The reduced covariance V0 of (E2), PDF p.12.
  • pauliZ: Pauli Z in (E1), PDF p.12.
  • standardParity: I2 direct-sum Pauli Z in (E1), PDF p.12.
  • standardCovariance: The complete standard covariance (E1), in grouped quadrature order.
  • standardY: Discriminant y in (E6), PDF p.12; positivity is a conclusion below.
  • standardSpectrum: Spectrum ordered as (nu_minus, nu_plus), exactly the diagonal in (E5).
  • standardOmegaPlus: The positive diagonal entry omega_plus in (E5), PDF p.12.
  • standardOmegaMinus: Signed omega_minus: (E5) needs sign(c), and zero at c=0. The printed positive root is correct for the application's c >= 0 only.
  • standardS0: Signed S0 from (E5), PDF p.12.
  • standardS: Constructed full symplectic matrix of (E4), PDF p.12.
  • standardReducedGibbs: Reduced Gibbs factor S0 arcoth(2D) S0 in (E9), PDF p.12. Only faithful standard spectra are used in the Gibbs equality below.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P10
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P02

/-!
Gaussian hypothesis testing and quantum illumination, arXiv:1608.06991v2.
The three independent algebraic/endpoint nodes below do not replace oscillator
states by finite matrices: their objects are the actual finite covariance matrices.
Operator-dependent nodes are explicitly deferred in this unit's HARD.md/GAPS.json.
Exact coordinate and matrix primitives reuse pinned accepted modules.
The remaining paper-specific definitions are local, with complete bodies. Compilation is
pending the separately authorized batch handoff.
-/

noncomputable section

open Filter
open scoped BigOperators ComplexOrder Topology Matrix

namespace QAlgorithms.Papers.Independent.Support50.P03

-- These accepted primitives use exactly the grouped coordinate type and matrix entries.
open QAlgorithms.Papers.Independent.Dependency50.P10
  (Phase complexify sigma thermalCovariance)
open QAlgorithms.Papers.Independent.Frontier30.P02 (PhaseMatrix)

/-- Physical covariances in vacuum-I/2 units, PDF p.2, (3)--(4).
Unlike accepted interleaved vacuum-I PhysicalCovariance predicates, this uses
grouped coordinates and V+iOmega/2. Positivity is Hermitian, not entrywise. -/
def HalfVacuumCovariance {n : ℕ} (V : PhaseMatrix n) : Prop :=
  V.transpose = V ∧ V.PosDef ∧
    (complexify V + (Complex.I / 2) • complexify (sigma n)).PosSemidef

/-- Repeated block A direct-sum A, PDF pp.2,7,12. -/
def repeatBlock {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) : PhaseMatrix n :=
  Matrix.fromBlocks A 0 0 A

/-- Williamson data with the source's transpose convention, PDF p.2.
Unlike Frontier30.P02.WilliamsonData, the modes are unordered and the
reconstruction is S D S^T, rather than M^T D M. This is normal-mode data,
not an ordinary diagonalization hypothesis. -/
def GroupedWilliamsonData {n : ℕ} (V : PhaseMatrix n) (nu : Fin n → ℝ)
    (S : PhaseMatrix n) : Prop :=
  (∀ j, (1 / 2 : ℝ) ≤ nu j) ∧
    S ∈ Matrix.symplecticGroup (Fin n) ℝ ∧
    V = S * thermalCovariance nu * S.transpose

/-- Real inverse hyperbolic cotangent, PDF p.3, after (6).
Only abs x > 1 is used in matrix-function conclusions; its endpoint default
is never used to model the source's singular Gibbs matrix. -/
def realArcoth (x : ℝ) : ℝ := Real.log ((x + 1) / (x - 1)) / 2

/-- Faithful Gaussian covariance spectrum, PDF pp.2,10. -/
def FaithfulSpectrum {n : ℕ} (nu : Fin n → ℝ) : Prop :=
  ∀ j, (1 / 2 : ℝ) < nu j

/-- Equation (6); used only with a faithful spectrum and symplectic S. -/
def gibbsMatrix {n : ℕ} (S : PhaseMatrix n) (nu : Fin n → ℝ) : PhaseMatrix n :=
  (-2 : ℝ) • (sigma n * S * thermalCovariance (fun j => realArcoth (2 * nu j)) *
    S.transpose * sigma n)

/-- U tensor I from (A3), PDF p.7. -/
def modeEigenbasis (n : ℕ) : Matrix (Phase n) (Phase n) ℂ :=
  ((Real.sqrt 2 : ℂ)⁻¹) •
    Matrix.fromBlocks (1 : Matrix (Fin n) (Fin n) ℂ) 1
      (Complex.I • (1 : Matrix (Fin n) (Fin n) ℂ))
      ((-Complex.I) • (1 : Matrix (Fin n) (Fin n) ℂ))

/-- The compatible eigenvalue diagonal [-D] direct-sum D in (A4). -/
def signedDiagonal {n : ℕ} (nu : Fin n → ℝ) : PhaseMatrix n :=
  Matrix.fromBlocks (Matrix.diagonal (fun j => -nu j)) 0 0 (Matrix.diagonal nu)

/-- DISTINCT nodes of the finite real spectrum of 2iVOmega.
Finset.image removes repetitions, including repeated symplectic eigenvalues. -/
def arcothNodes {n : ℕ} (nu : Fin n → ℝ) : Finset ℂ := by
  classical
  exact Finset.univ.image (fun k : Phase n =>
    match k with
    | Sum.inl j => ((-2 * nu j : ℝ) : ℂ)
    | Sum.inr j => ((2 * nu j : ℝ) : ℂ))

/-- Primary matrix-function interpolation polynomial for Appendix A.
On the diagonalizable matrices asserted below, interpolation on distinct
spectral points is the usual spectral matrix function, independently of any
choice of eigenvectors. Its values use real arcoth only at real eigenvalues. -/
def arcothPolynomial {n : ℕ} (nu : Fin n → ℝ) : Polynomial ℂ := by
  classical
  exact Lagrange.interpolate (arcothNodes nu) (fun z : ℂ => z)
    (fun z => (realArcoth z.re : ℂ))

/-- Polynomial functional calculus, defined independently of S and U (A5).
The theorem guards the spectrum away from the poles at plus/minus one. -/
def spectralArcoth {n : ℕ} (nu : Fin n → ℝ)
    (B : Matrix (Phase n) (Phase n) ℂ) : Matrix (Phase n) (Phase n) ℂ :=
  Polynomial.aeval B (arcothPolynomial nu)

/-- Grouped continuous extension f1 at a pure mode, (D2), PDF pp.10--11. -/
def pureModeF1 (lambda : ℝ) : ℝ :=
  if lambda = 1 / 2 then 0
  else (realArcoth (2 * lambda)) ^ 2 * ((2 * lambda) ^ 2 - 1)

/-- Grouped continuous extension f2 at a pure mode, (D2), PDF pp.10--11. -/
def pureModeF2 (lambda : ℝ) : ℝ :=
  if lambda = 1 / 2 then 0
  else realArcoth (2 * lambda) * ((2 * lambda) ^ 2 - 1)

/-- The reduced covariance V0 of (E2), PDF p.12. -/
def standardV0 (a b c : ℝ) : Matrix (Fin 2) (Fin 2) ℝ := !![a, c; c, b]

/-- Pauli Z in (E1), PDF p.12. -/
def pauliZ : Matrix (Fin 2) (Fin 2) ℝ := Matrix.diagonal ![1, -1]

/-- I2 direct-sum Pauli Z in (E1), PDF p.12. -/
def standardParity : PhaseMatrix 2 :=
  Matrix.fromBlocks (1 : Matrix (Fin 2) (Fin 2) ℝ) 0 0 pauliZ

/-- The complete standard covariance (E1), in grouped quadrature order. -/
def standardCovariance (a b c : ℝ) : PhaseMatrix 2 :=
  standardParity * repeatBlock (standardV0 a b c) * standardParity

/-- Discriminant y in (E6), PDF p.12; positivity is a conclusion below. -/
def standardY (a b c : ℝ) : ℝ := (a + b) ^ 2 - 4 * c ^ 2

/-- Spectrum ordered as (nu_minus, nu_plus), exactly the diagonal in (E5). -/
def standardSpectrum (a b c : ℝ) : Fin 2 → ℝ :=
  ![(Real.sqrt (standardY a b c) - (b - a)) / 2,
    (Real.sqrt (standardY a b c) + (b - a)) / 2]

/-- The positive diagonal entry omega_plus in (E5), PDF p.12. -/
def standardOmegaPlus (a b c : ℝ) : ℝ :=
  Real.sqrt ((a + b + Real.sqrt (standardY a b c)) /
    (2 * Real.sqrt (standardY a b c)))

/-- Signed omega_minus: (E5) needs sign(c), and zero at c=0.
The printed positive root is correct for the application's c >= 0 only. -/
def standardOmegaMinus (a b c : ℝ) : ℝ :=
  if c = 0 then 0
  else (if 0 < c then 1 else -1) *
    Real.sqrt ((a + b - Real.sqrt (standardY a b c)) /
      (2 * Real.sqrt (standardY a b c)))

/-- Signed S0 from (E5), PDF p.12. -/
def standardS0 (a b c : ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
  !![standardOmegaPlus a b c, standardOmegaMinus a b c;
     standardOmegaMinus a b c, standardOmegaPlus a b c]

/-- Constructed full symplectic matrix of (E4), PDF p.12. -/
def standardS (a b c : ℝ) : PhaseMatrix 2 :=
  standardParity * repeatBlock (standardS0 a b c) * standardParity

/-- Reduced Gibbs factor S0 arcoth(2D) S0 in (E9), PDF p.12.
Only faithful standard spectra are used in the Gibbs equality below. -/
def standardReducedGibbs (a b c : ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=
  standardS0 a b c *
    Matrix.diagonal (fun j => realArcoth (2 * standardSpectrum a b c j)) *
    standardS0 a b c

example : sigma 1 (Sum.inl 0) (Sum.inr 0) = 1 := by
  simp [sigma]

example : sigma 1 (Sum.inr 0) (Sum.inl 0) = -1 := by
  simp [sigma]

example (n : ℕ) (nu : Fin n → ℝ) (j : Fin n) :
    thermalCovariance nu (Sum.inl j) (Sum.inl j) = nu j := by
  simp [thermalCovariance]

example (n : ℕ) (nu : Fin n → ℝ) (j : Fin n) :
    signedDiagonal nu (Sum.inl j) (Sum.inl j) = -nu j := by
  simp [signedDiagonal]

example : pureModeF1 (1 / 2) = 0 := by simp [pureModeF1]

example : pureModeF2 (1 / 2) = 0 := by simp [pureModeF2]

example (a b : ℝ) : standardOmegaMinus a b 0 = 0 := by
  simp [standardOmegaMinus]

example (a b c : ℝ) : standardV0 a b c 0 1 = c := by
  rfl

example (a b c : ℝ) :
    standardCovariance a b c (Sum.inr 0) (Sum.inr 1) = -c := by
  simp [standardCovariance, standardParity, repeatBlock, standardV0, pauliZ,
    Matrix.mul_apply, Fin.sum_univ_two, Fintype.sum_sum_type]

end QAlgorithms.Papers.Independent.Support50.P03
Source
Gaussian hypothesis testing and quantum illumination, arXiv:1608.06991v2, https://arxiv.org/abs/1608.06991v2
Read-back

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

QAlgorithms.Papers.Independent.Support50.P03.FaithfulSpectrum

For any natural number nnn and real-valued function ν\nuν on {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, this predicate means

∀j∈{0,…,n−1},12<νj.\forall j\in\{0,\ldots,n-1\},\qquad \frac12<\nu_j.∀j∈{0,…,n−1},21​<νj​.

When n=0n=0n=0, this condition is vacuously true.

QAlgorithms.Papers.Independent.Support50.P03.GroupedWilliamsonData

For any natural number nnn, real 2n×2n2n\times2n2n×2n matrices V,SV,SV,S, and real numbers νj\nu_jνj​ indexed by j∈{0,…,n−1}j\in\{0,\ldots,n-1\}j∈{0,…,n−1}, this predicate means that every νj≥12\nu_j\ge\frac12νj​≥21​, that SSS belongs to the real symplectic group for the standard alternating form

Σn=(0In−In0),\Sigma_n=\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix},Σn​=(0−In​​In​0​),

so that STΣnS=ΣnS^{\mathsf T}\Sigma_nS=\Sigma_nSTΣn​S=Σn​, and that

V=S(diag⁡(νj)00diag⁡(νj))ST.V=S\begin{pmatrix}\operatorname{diag}(\nu_j)&0\\0&\operatorname{diag}(\nu_j)\end{pmatrix}S^{\mathsf T}.V=S(diag(νj​)0​0diag(νj​)​)ST.

The indices of these block matrices are two disjoint copies of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}. When n=0n=0n=0, the bounds on νj\nu_jνj​ are vacuous and the matrix conditions hold for the empty matrices.

QAlgorithms.Papers.Independent.Support50.P03.HalfVacuumCovariance

For any natural number nnn and real 2n×2n2n\times2n2n×2n matrix VVV, whose indices are two disjoint copies of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, this predicate means that VT=VV^{\mathsf T}=VVT=V, that VVV is positive definite, and that the complex matrix

V+i2(0In−In0)V+\frac{i}{2}\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix}V+2i​(0−In​​In​0​)

is positive semidefinite, where VVV is regarded entrywise as a complex matrix and i2=−1i^2=-1i2=−1. The case n=0n=0n=0 is included: the unique empty matrix satisfies these conditions, with positive definiteness vacuous because there are no nonzero vectors.

QAlgorithms.Papers.Independent.Support50.P03.arcothNodes

For any natural number nnn and real-valued function ν\nuν on {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, this defines the finite set of complex numbers

Nν={−2νj:j∈{0,…,n−1}} ∪ {2νj:j∈{0,…,n−1}},N_\nu=\{-2\nu_j:j\in\{0,\ldots,n-1\}\}\,\cup\, \{2\nu_j:j\in\{0,\ldots,n-1\}\},Nν​={−2νj​:j∈{0,…,n−1}}∪{2νj​:j∈{0,…,n−1}},

where every displayed real number is embedded into C\mathbb CC. Repeated values appear only once, including coincidences between positive and negative expressions; if νj=0\nu_j=0νj​=0, both expressions contribute the same node zero. When n=0n=0n=0, the set is empty.

QAlgorithms.Papers.Independent.Support50.P03.arcothPolynomial

For any natural number nnn and real-valued function ν\nuν on {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, let Nν⊆CN_\nu\subseteq\mathbb CNν​⊆C be the finite set of distinct values −2νj-2\nu_j−2νj​ and 2νj2\nu_j2νj​, with the real values embedded into C\mathbb CC. This defines the complex Lagrange interpolation polynomial

pν(z)=∑a∈Nν(12log⁡ ⁣(Re⁡(a)+1Re⁡(a)−1))∏b∈Nνb≠az−ba−b,p_\nu(z)= \sum_{a\in N_\nu} \left(\frac12\log\!\left(\frac{\operatorname{Re}(a)+1}{\operatorname{Re}(a)-1}\right)\right) \prod_{\substack{b\in N_\nu\\b\ne a}}\frac{z-b}{a-b},pν​(z)=a∈Nν​∑​(21​log(Re(a)−1Re(a)+1​))b∈Nν​b=a​∏​a−bz−b​,

where each real coefficient in parentheses is embedded into C\mathbb CC. Division by zero is zero, and the real logarithm is zero at zero and equals ln⁡∣t∣\ln|t|ln∣t∣ for nonzero real ttt, so the prescribed values are defined at every node, including a=±1a=\pm1a=±1. Duplicate nodes are removed before interpolation, empty products equal one, and when n=0n=0n=0 the empty sum gives the zero polynomial.

QAlgorithms.Papers.Independent.Support50.P03.gibbsMatrix

For any natural number nnn, any real 2n×2n2n\times2n2n×2n matrix SSS, and any real-valued function ν\nuν on {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, this defines

−2 ΣnS(diag⁡(aj)00diag⁡(aj))STΣn,Σn=(0In−In0),aj=12log⁡ ⁣(2νj+12νj−1).-2\,\Sigma_nS \begin{pmatrix}\operatorname{diag}(a_j)&0\\0&\operatorname{diag}(a_j)\end{pmatrix} S^{\mathsf T}\Sigma_n, \qquad \Sigma_n=\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix}, \qquad a_j=\frac12\log\!\left(\frac{2\nu_j+1}{2\nu_j-1}\right).−2Σn​S(diag(aj​)0​0diag(aj​)​)STΣn​,Σn​=(0−In​​In​0​),aj​=21​log(2νj​−12νj​+1​).

The matrix indices are two disjoint copies of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}. There are no hypotheses on SSS or ν\nuν. Division by zero is zero, and the real logarithm is zero at zero and equals ln⁡∣t∣\ln|t|ln∣t∣ for nonzero real ttt; consequently the coefficients are defined even when νj=12\nu_j=\frac12νj​=21​, where aj=0a_j=0aj​=0. When n=0n=0n=0, the result is the empty matrix.

QAlgorithms.Papers.Independent.Support50.P03.modeEigenbasis

For every natural number nnn, this defines the complex 2n×2n2n\times2n2n×2n matrix

12(InIniIn−iIn),\frac{1}{\sqrt2} \begin{pmatrix} I_n&I_n\\ iI_n&-iI_n \end{pmatrix},2​1​(In​iIn​​In​−iIn​​),

where i2=−1i^2=-1i2=−1, 2\sqrt22​ is the nonnegative real square root regarded as a complex number, and the rows and columns are indexed by two disjoint copies of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}. For n=0n=0n=0, this is the empty matrix.

QAlgorithms.Papers.Independent.Support50.P03.pauliZ

This defines the real 2×22\times22×2 diagonal matrix, with rows and columns ordered 0,10,10,1,

Z=(100−1).Z= \begin{pmatrix} 1&0\\ 0&-1 \end{pmatrix}.Z=(10​0−1​).

QAlgorithms.Papers.Independent.Support50.P03.pureModeF1

For every real number λ\lambdaλ, this defines

F1(λ)={0,λ=12,[12log⁡ ⁣(2λ+12λ−1)]2((2λ)2−1),λ≠12.F_1(\lambda)= \begin{cases} 0,&\lambda=\frac12,\\[2mm] \displaystyle \left[\frac12\log\!\left(\frac{2\lambda+1}{2\lambda-1}\right)\right]^2 \bigl((2\lambda)^2-1\bigr),&\lambda\ne\frac12. \end{cases}F1​(λ)=⎩⎨⎧​0,[21​log(2λ−12λ+1​)]2((2λ)2−1),​λ=21​,λ=21​.​

There is no restriction on λ\lambdaλ. In the second branch, division by zero is zero, and the real logarithm is zero at zero and equals ln⁡∣t∣\ln|t|ln∣t∣ for nonzero real ttt; in particular, λ=−12\lambda=-\frac12λ=−21​ lies in this branch and gives zero.

QAlgorithms.Papers.Independent.Support50.P03.pureModeF2

For every real number λ\lambdaλ, this defines the real-valued function

f2(λ)={0,λ=12,12log⁡ ⁣(2λ+12λ−1)((2λ)2−1),λ≠12.f_2(\lambda)= \begin{cases} 0,&\lambda=\frac12,\\[2pt] \displaystyle \frac12\log\!\left(\frac{2\lambda+1}{2\lambda-1}\right)\bigl((2\lambda)^2-1\bigr),&\lambda\ne\frac12. \end{cases}f2​(λ)=⎩⎨⎧​0,21​log(2λ−12λ+1​)((2λ)2−1),​λ=21​,λ=21​.​

There is no restriction on λ\lambdaλ. Here the real logarithm is total: log⁡0=0\log 0=0log0=0, and for a negative argument its value is the logarithm of the argument’s absolute value; real division by zero has value zero.

QAlgorithms.Papers.Independent.Support50.P03.realArcoth

For every real number xxx, this defines the real-valued function

r(x)=12log⁡ ⁣(x+1x−1).r(x)=\frac12\log\!\left(\frac{x+1}{x-1}\right).r(x)=21​log(x−1x+1​).

Here division and the real logarithm are total: division by zero gives zero, the logarithm of zero is zero, and the logarithm of a nonzero real number ttt is ln⁡∣t∣\ln|t|ln∣t∣. Thus this definition has no restriction such as ∣x∣>1|x|>1∣x∣>1; in particular, r(1)=r(−1)=0r(1)=r(-1)=0r(1)=r(−1)=0.

QAlgorithms.Papers.Independent.Support50.P03.repeatBlock

For any natural number nnn and real n×nn\times nn×n matrix AAA, this defines the real 2n×2n2n\times2n2n×2n matrix

(A00A),\begin{pmatrix}A&0\\0&A\end{pmatrix},(A0​0A​),

with rows and columns indexed by two disjoint copies of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}. When n=0n=0n=0, both the input and the output are empty matrices.

QAlgorithms.Papers.Independent.Support50.P03.signedDiagonal

For any natural number nnn and real-valued function ν\nuν on {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, this defines the real 2n×2n2n\times2n2n×2n matrix

(diag⁡(−νj)00diag⁡(νj)),\begin{pmatrix} \operatorname{diag}(-\nu_j)&0\\ 0&\operatorname{diag}(\nu_j) \end{pmatrix},(diag(−νj​)0​0diag(νj​)​),

with indices given by two disjoint copies of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}. No sign restrictions are imposed on the νj\nu_jνj​. When n=0n=0n=0, the result is the empty matrix.

QAlgorithms.Papers.Independent.Support50.P03.spectralArcoth

For any natural number nnn, any real-valued function ν\nuν on {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, and any complex 2n×2n2n\times2n2n×2n matrix BBB, this defines pν(B)p_\nu(B)pν​(B) by polynomial evaluation: if pν(z)=∑kckzkp_\nu(z)=\sum_k c_kz^kpν​(z)=∑k​ck​zk, the result is ∑kckBk\sum_k c_kB^k∑k​ck​Bk, with B0=I2nB^0=I_{2n}B0=I2n​. Here pνp_\nupν​ is the Lagrange interpolation polynomial on the finite set NνN_\nuNν​ of distinct complex numbers ±2νj\pm2\nu_j±2νj​, explicitly

pν(z)=∑a∈Nν(12log⁡ ⁣(Re⁡(a)+1Re⁡(a)−1))∏b∈Nνb≠az−ba−b,p_\nu(z)= \sum_{a\in N_\nu} \left(\frac12\log\!\left(\frac{\operatorname{Re}(a)+1}{\operatorname{Re}(a)-1}\right)\right) \prod_{\substack{b\in N_\nu\\b\ne a}}\frac{z-b}{a-b},pν​(z)=a∈Nν​∑​(21​log(Re(a)−1Re(a)+1​))b∈Nν​b=a​∏​a−bz−b​,

with the real values embedded into C\mathbb CC. Division by zero is zero, and the real logarithm is zero at zero and equals ln⁡∣t∣\ln|t|ln∣t∣ for nonzero real ttt. There are no assumptions on the spectrum or diagonalizability of BBB, or on the values of ν\nuν. For n=0n=0n=0, the polynomial is zero and its evaluation is the empty zero matrix.

QAlgorithms.Papers.Independent.Support50.P03.standardCovariance

For arbitrary real numbers a,b,ca,b,ca,b,c, this defines a real matrix indexed by two disjoint copies of {0,1}\{0,1\}{0,1}. Ordering the first copy before the second, with each copy ordered 0,10,10,1, its value is

V(a,b,c)=(ac00cb0000a−c00−cb).V(a,b,c)= \begin{pmatrix} a&c&0&0\\ c&b&0&0\\ 0&0&a&-c\\ 0&0&-c&b \end{pmatrix}.V(a,b,c)=​ac00​cb00​00a−c​00−cb​​.

Equivalently, it is P diag⁡(V0,V0) PP\,\operatorname{diag}(V_0,V_0)\,PPdiag(V0​,V0​)P, where V0=(accb)V_0=\begin{pmatrix}a&c\\c&b\end{pmatrix}V0​=(ac​cb​) and P=diag⁡(1,1,1,−1)P=\operatorname{diag}(1,1,1,-1)P=diag(1,1,1,−1).

QAlgorithms.Papers.Independent.Support50.P03.standardOmegaMinus

For arbitrary real numbers a,b,ca,b,ca,b,c, putting r=(a+b)2−4c2r=\sqrt{(a+b)^2-4c^2}r=(a+b)2−4c2​, this defines

ω−(a,b,c)={0,c=0,a+b−r2r,c>0,−a+b−r2r,c<0.\omega_-(a,b,c)= \begin{cases} 0,&c=0,\\[2pt] \displaystyle \sqrt{\frac{a+b-r}{2r}},&c>0,\\[6pt] \displaystyle -\sqrt{\frac{a+b-r}{2r}},&c<0. \end{cases}ω−​(a,b,c)=⎩⎨⎧​0,2ra+b−r​​,−2ra+b−r​​,​c=0,c>0,c<0.​

Every real square root is zero when its argument is negative, and division by zero has value zero. Thus the definition applies to all a,b,ca,b,ca,b,c, including r=0r=0r=0, when its value is zero.

QAlgorithms.Papers.Independent.Support50.P03.standardOmegaPlus

For arbitrary real numbers a,b,ca,b,ca,b,c, this defines

ω+(a,b,c)=a+b+(a+b)2−4c22(a+b)2−4c2.\omega_+(a,b,c)= \sqrt{\frac{a+b+\sqrt{(a+b)^2-4c^2}} {2\sqrt{(a+b)^2-4c^2}}}.ω+​(a,b,c)=2(a+b)2−4c2​a+b+(a+b)2−4c2​​​.

Every real square root is zero when its argument is negative, and division by zero has value zero. In particular, if (a+b)2−4c2≤0(a+b)^2-4c^2\le0(a+b)2−4c2≤0, this definition gives ω+(a,b,c)=0\omega_+(a,b,c)=0ω+​(a,b,c)=0.

QAlgorithms.Papers.Independent.Support50.P03.standardParity

This defines a real matrix indexed by two disjoint copies of {0,1}\{0,1\}{0,1}. Ordering the first copy before the second, and ordering each copy as 0,10,10,1, the matrix is

P=(100001000010000−1).P=\begin{pmatrix} 1&0&0&0\\ 0&1&0&0\\ 0&0&1&0\\ 0&0&0&-1 \end{pmatrix}.P=​1000​0100​0010​000−1​​.

QAlgorithms.Papers.Independent.Support50.P03.standardReducedGibbs

For arbitrary real numbers a,b,ca,b,ca,b,c, define

r=(a+b)2−4c2,p=a+b+r2r,m={0,c=0,a+b−r2r,c>0,−a+b−r2r,c<0,r=\sqrt{(a+b)^2-4c^2},\qquad p=\sqrt{\frac{a+b+r}{2r}},\qquad m= \begin{cases} 0,&c=0,\\ \displaystyle\sqrt{\frac{a+b-r}{2r}},&c>0,\\[4pt] \displaystyle-\sqrt{\frac{a+b-r}{2r}},&c<0, \end{cases}r=(a+b)2−4c2​,p=2ra+b+r​​,m=⎩⎨⎧​0,2ra+b−r​​,−2ra+b−r​​,​c=0,c>0,c<0,​

and

g0=12log⁡ ⁣(r−(b−a)+1r−(b−a)−1),g1=12log⁡ ⁣(r+(b−a)+1r+(b−a)−1).g_0=\frac12\log\!\left(\frac{r-(b-a)+1}{r-(b-a)-1}\right), \qquad g_1=\frac12\log\!\left(\frac{r+(b-a)+1}{r+(b-a)-1}\right).g0​=21​log(r−(b−a)−1r−(b−a)+1​),g1​=21​log(r+(b−a)−1r+(b−a)+1​).

This defines the real 2×22\times22×2 matrix, with rows and columns ordered 0,10,10,1,

(pmmp)(g000g1)(pmmp).\begin{pmatrix}p&m\\m&p\end{pmatrix} \begin{pmatrix}g_0&0\\0&g_1\end{pmatrix} \begin{pmatrix}p&m\\m&p\end{pmatrix}.(pm​mp​)(g0​0​0g1​​)(pm​mp​).

These formulas impose no restrictions on a,b,ca,b,ca,b,c: real square roots of negative arguments are zero, division by zero is zero, and the real logarithm satisfies log⁡0=0\log 0=0log0=0 and log⁡x=log⁡∣x∣\log x=\log|x|logx=log∣x∣ for x<0x<0x<0. In particular, when r=0r=0r=0, the defined matrix is zero.

QAlgorithms.Papers.Independent.Support50.P03.standardS

For arbitrary real numbers a,b,ca,b,ca,b,c, let

r=(a+b)2−4c2,p=a+b+r2r,m={0,c=0,a+b−r2r,c>0,−a+b−r2r,c<0.r=\sqrt{(a+b)^2-4c^2},\qquad p=\sqrt{\frac{a+b+r}{2r}},\qquad m= \begin{cases} 0,&c=0,\\ \displaystyle\sqrt{\frac{a+b-r}{2r}},&c>0,\\[4pt] \displaystyle-\sqrt{\frac{a+b-r}{2r}},&c<0. \end{cases}r=(a+b)2−4c2​,p=2ra+b+r​​,m=⎩⎨⎧​0,2ra+b−r​​,−2ra+b−r​​,​c=0,c>0,c<0.​

This defines a real matrix indexed by two disjoint copies of {0,1}\{0,1\}{0,1}. Ordering the first copy before the second, and each copy as 0,10,10,1, its value is

S(a,b,c)=(pm00mp0000p−m00−mp).S(a,b,c)= \begin{pmatrix} p&m&0&0\\ m&p&0&0\\ 0&0&p&-m\\ 0&0&-m&p \end{pmatrix}.S(a,b,c)=​pm00​mp00​00p−m​00−mp​​.

Real square roots of negative arguments and divisions by zero have value zero; in particular, when r=0r=0r=0, this matrix is zero.

QAlgorithms.Papers.Independent.Support50.P03.standardS0

For arbitrary real numbers a,b,ca,b,ca,b,c, let

r=(a+b)2−4c2,p=a+b+r2r,m={0,c=0,a+b−r2r,c>0,−a+b−r2r,c<0.r=\sqrt{(a+b)^2-4c^2},\qquad p=\sqrt{\frac{a+b+r}{2r}},\qquad m= \begin{cases} 0,&c=0,\\ \displaystyle\sqrt{\frac{a+b-r}{2r}},&c>0,\\[4pt] \displaystyle-\sqrt{\frac{a+b-r}{2r}},&c<0. \end{cases}r=(a+b)2−4c2​,p=2ra+b+r​​,m=⎩⎨⎧​0,2ra+b−r​​,−2ra+b−r​​,​c=0,c>0,c<0.​

This defines the real 2×22\times22×2 matrix, with rows and columns ordered 0,10,10,1,

S0(a,b,c)=(pmmp).S_0(a,b,c)=\begin{pmatrix}p&m\\m&p\end{pmatrix}.S0​(a,b,c)=(pm​mp​).

Real square roots of negative arguments and divisions by zero have value zero, so the definition includes all real a,b,ca,b,ca,b,c; when r=0r=0r=0, the matrix is zero.

QAlgorithms.Papers.Independent.Support50.P03.standardSpectrum

For arbitrary real numbers a,b,ca,b,ca,b,c, this defines a function ν:{0,1}→R\nu:\{0,1\}\to\mathbb Rν:{0,1}→R by

ν(0)=(a+b)2−4c2−(b−a)2,ν(1)=(a+b)2−4c2+(b−a)2.\nu(0)=\frac{\sqrt{(a+b)^2-4c^2}-(b-a)}2, \qquad \nu(1)=\frac{\sqrt{(a+b)^2-4c^2}+(b-a)}2.ν(0)=2(a+b)2−4c2​−(b−a)​,ν(1)=2(a+b)2−4c2​+(b−a)​.

The real square root is taken to be zero for negative arguments, so these values are defined for all a,b,ca,b,ca,b,c; no positivity or ordering condition is imposed on them.

QAlgorithms.Papers.Independent.Support50.P03.standardV0

For arbitrary real numbers a,b,ca,b,ca,b,c, this defines the real 2×22\times22×2 matrix, with rows and columns ordered 0,10,10,1,

V0(a,b,c)=(accb).V_0(a,b,c)= \begin{pmatrix} a&c\\ c&b \end{pmatrix}.V0​(a,b,c)=(ac​cb​).

QAlgorithms.Papers.Independent.Support50.P03.standardY

For arbitrary real numbers a,b,ca,b,ca,b,c, this defines the real number

Y(a,b,c)=(a+b)2−4c2,Y(a,b,c)=(a+b)^2-4c^2,Y(a,b,c)=(a+b)2−4c2,

with no assumption on its sign.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 23, 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