Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Quantum Illumination

Definition
QAlgorithms_Papers_Independent_Intakenext100_P96

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

prove2quantum

The objects the formalized statements of Quantum Illumination (arXiv:0803.2022) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • SignalIndex: PDF pp.2--3: a vacuum outcome and d orthogonal single-photon modes.
  • ModelParameters: PDF pp.2--3: parameters for the exact retained finite model. The physical approximation db << 1 is not a claim of full-channel exactness.
  • background: PDF p.3, (1.0): the retained thermal background, including the vacuum.
  • signalState: PDF p.3: embed the normalized single-photon input with zero vacuum amplitude.
  • signalTest: PDF p.3: the yes projector of the unentangled test.
  • signalPresent: PDF p.3, (1.1): returned state when the object is present.
  • pairState: PDF pp.5--6: Phi_d = d^(-1/2) sum_k |k>_S |k>_A; no vacuum component.
  • pairTest: PDF pp.6--7: the ideal joint yes projector onto Phi_d.
  • ancillaMixed: PDF p.6: the perfectly retained ancilla's completely mixed marginal I_A/d.
  • pairAbsent: PDF p.6, retained body of (8.0): rho_SA0 = rho_0 tensor I_A/d.
  • pairPresent: PDF p.6, retained body of (8.1): only the signal traverses the noisy path.
  • ebits: PDF p.9, (14): logarithmic mode count, identified with marginal entropy in the theorem.
  • binaryError: PDF pp.3--4: equal-prior error of the binary effect whose yes answer means present.
  • iidEqualPriorError: PDF p.4: optimal equal-prior error over all joint n-copy binary POVMs. Reuse the accepted tensor copies and total effect-error infimum, dividing by two for equal priors. On density inputs that extended infimum is finite and in [0,1], so toReal never uses its infinity default.
  • countMass: PDF pp.4--5: probability of k yes outcomes in n independent Bernoulli trials.
  • countingError: PDF pp.4--5,8: minimum error after counting yes outcomes and optimally deciding from the entire count. This includes both hypotheses with prior probability 1/2.
  • errorFactor: PDF p.4, (3): exponential error factor, indexed using n+1 copies so that all root exponents have a strictly positive denominator.
  • illuminationChernoffFactor: PDF p.4, (3), p.7, (11): the one-copy scalar Chernoff factor. Reuse the accepted Petz overlap with the arguments reversed: cyclicity of trace identifies Tr(rho1^s rho0^(1-s)) with the source Tr(rho0^(1-s) rho1^s). Using 0<s<1 includes one-sided endpoint limits without kernel 0^0 conventions. For density inputs this is a nonempty, bounded-below real infimum. It differs from the accepted oscillator N-copy quantumChernoff bound.
  • binaryChernoff: PDF pp.4--5,8: Chernoff factor for the two Bernoulli yes probabilities.
  • entangledFactor: PDF p.7, first line of (11), with its printed parentheses and denominator.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Information
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_FiniteRegisters
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P15
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P60

/-!
# Quantum Illumination, arXiv:0803.2022v2

All states below belong to the retained vacuum/single-photon model, (1.0), (1.1),
(8.0), (8.1). No equality with the full optical thermal channel is asserted.
Page numbers are PDF page numbers. The ancillary photon is retained perfectly.
All new definitions are local to this paper. Compilation is pending batch handoff.
-/

noncomputable section

open Filter
open scoped BigOperators Topology ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Intakenext100.P96

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.2--3: a vacuum outcome and d orthogonal single-photon modes. -/
abbrev SignalIndex (d : ℕ) := Option (Fin d)

/-- PDF pp.2--3: parameters for the exact retained finite model.
The physical approximation db << 1 is not a claim of full-channel exactness. -/
structure ModelParameters where
  d : ℕ
  d_pos : 0 < d
  b : ℝ
  b_nonneg : 0 ≤ b
  db_le_one : (d : ℝ) * b ≤ 1
  eta : ℝ
  eta_nonneg : 0 ≤ eta
  eta_le_one : eta ≤ 1

/-- PDF p.3, (1.0): the retained thermal background, including the vacuum. -/
def background (d : ℕ) (b : ℝ) : Matrix (SignalIndex d) (SignalIndex d) ℂ :=
  Matrix.diagonal fun i => match i with
    | none => ((1 - (d : ℝ) * b : ℝ) : ℂ)
    | some _ => (b : ℂ)

/-- PDF p.3: embed the normalized single-photon input with zero vacuum amplitude. -/
def signalState {d : ℕ} (psi : EuclideanSpace ℂ (Fin d)) :
    EuclideanSpace ℂ (SignalIndex d) :=
  WithLp.toLp 2 (fun i => match i with | none => 0 | some k => psi k)

/-- PDF p.3: the yes projector of the unentangled test. -/
def signalTest {d : ℕ} (psi : EuclideanSpace ℂ (Fin d)) :
    Matrix (SignalIndex d) (SignalIndex d) ℂ :=
  pureDensity (signalState psi)

/-- PDF p.3, (1.1): returned state when the object is present. -/
def signalPresent {d : ℕ} (b eta : ℝ) (psi : EuclideanSpace ℂ (Fin d)) :
    Matrix (SignalIndex d) (SignalIndex d) ℂ :=
  ((1 - eta : ℝ) : ℂ) • background d b + (eta : ℂ) • signalTest psi

/-- PDF pp.5--6: Phi_d = d^(-1/2) sum_k |k>_S |k>_A; no vacuum component. -/
def pairState (d : ℕ) : EuclideanSpace ℂ (SignalIndex d × Fin d) :=
  if hd : 0 < d then
    letI : Nonempty (Fin d) := ⟨⟨0, hd⟩⟩
    WithLp.toLp 2 (fun i => match i.1 with
      | none => 0
      | some k => finiteMaxEntangled (Fin d) (k, i.2))
  else 0

/-- PDF pp.6--7: the ideal joint yes projector onto Phi_d. -/
def pairTest (d : ℕ) : Matrix (SignalIndex d × Fin d) (SignalIndex d × Fin d) ℂ :=
  pureDensity (pairState d)

/-- PDF p.6: the perfectly retained ancilla's completely mixed marginal I_A/d. -/
def ancillaMixed (d : ℕ) : Matrix (Fin d) (Fin d) ℂ :=
  (((d : ℝ)⁻¹ : ℝ) : ℂ) • 1

/-- PDF p.6, retained body of (8.0): rho_SA0 = rho_0 tensor I_A/d. -/
def pairAbsent (d : ℕ) (b : ℝ) :
    Matrix (SignalIndex d × Fin d) (SignalIndex d × Fin d) ℂ :=
  Matrix.kronecker (background d b) (ancillaMixed d)

/-- PDF p.6, retained body of (8.1): only the signal traverses the noisy path. -/
def pairPresent (d : ℕ) (b eta : ℝ) :
    Matrix (SignalIndex d × Fin d) (SignalIndex d × Fin d) ℂ :=
  ((1 - eta : ℝ) : ℂ) • pairAbsent d b + (eta : ℂ) • pairTest d

/-- PDF p.9, (14): logarithmic mode count, identified with marginal entropy in the theorem. -/
def ebits (d : ℕ) : ℝ := Real.log (d : ℝ) / Real.log 2

/-- PDF pp.3--4: equal-prior error of the binary effect whose yes answer means present. -/
def binaryError {I : Type*} [Fintype I] [DecidableEq I]
    (rho0 rho1 M : Matrix I I ℂ) : ℝ :=
  (effectProb M rho0 + effectProb (1 - M) rho1) / 2

/-- PDF p.4: optimal equal-prior error over all joint n-copy binary POVMs.
Reuse the accepted tensor copies and total effect-error infimum, dividing by two
for equal priors. On density inputs that extended infimum is finite and in [0,1],
so toReal never uses its infinity default. -/
def iidEqualPriorError {I : Type*} [Fintype I] [DecidableEq I]
    (rho0 rho1 : Matrix I I ℂ) (n : ℕ) : ℝ :=
  (QAlgorithms.Papers.Independent.Claimed50.P15.optimalError true
    (QAlgorithms.Papers.Independent.Information100.P60.copies n rho0)
    (QAlgorithms.Papers.Independent.Information100.P60.copies n rho1)).toReal / 2

/-- PDF pp.4--5: probability of k yes outcomes in n independent Bernoulli trials. -/
def countMass (p : ℝ) (n k : ℕ) : ℝ :=
  (n.choose k : ℝ) * p ^ k * (1 - p) ^ (n - k)

/-- PDF pp.4--5,8: minimum error after counting yes outcomes and optimally deciding
from the entire count. This includes both hypotheses with prior probability 1/2. -/
def countingError (p0 p1 : ℝ) (n : ℕ) : ℝ :=
  (∑ k : Fin (n + 1), min (countMass p0 n k.val) (countMass p1 n k.val)) / 2

/-- PDF p.4, (3): exponential error factor, indexed using n+1 copies so that
all root exponents have a strictly positive denominator. -/
def errorFactor (err : ℕ → ℝ) (n : ℕ) : ℝ :=
  (2 * err (n + 1)) ^ (((n + 1 : ℕ) : ℝ)⁻¹)

/-- PDF p.4, (3), p.7, (11): the one-copy scalar Chernoff factor.
Reuse the accepted Petz overlap with the arguments reversed: cyclicity of trace
identifies Tr(rho1^s rho0^(1-s)) with the source Tr(rho0^(1-s) rho1^s).
Using 0<s<1 includes one-sided endpoint limits without kernel 0^0 conventions.
For density inputs this is a nonempty, bounded-below real infimum. It differs
from the accepted oscillator N-copy quantumChernoff bound. -/
def illuminationChernoffFactor {I : Type*} [Fintype I] [DecidableEq I]
    (rho0 rho1 : Matrix I I ℂ) : ℝ :=
  sInf ((fun s : ℝ =>
    QAlgorithms.Papers.Independent.Claimed50.P15.petzOverlap rho1 rho0 s) '' Set.Ioo 0 1)

/-- PDF pp.4--5,8: Chernoff factor for the two Bernoulli yes probabilities. -/
def binaryChernoff (p0 p1 : ℝ) : ℝ :=
  sInf ((fun s : ℝ => (1 - p0) ^ (1 - s) * (1 - p1) ^ s +
    p0 ^ (1 - s) * p1 ^ s) '' Set.Ioo 0 1)

/-- PDF p.7, first line of (11), with its printed parentheses and denominator. -/
def entangledFactor (d : ℕ) (b eta s : ℝ) : ℝ :=
  (1 - eta) ^ s * (1 + b / (d : ℝ) *
    (-1 + (1 + eta * (d : ℝ) / ((1 - eta) * b)) ^ s))

/-! Small definition-level sanity checks; theorem proofs are intentionally omitted. -/

example : background 1 (1 / 4) none none = (3 / 4 : ℂ) := by
  norm_num [background]

example {d : ℕ} (psi : EuclideanSpace ℂ (Fin d)) : signalState psi none = 0 := rfl

example {d : ℕ} (b : ℝ) (psi : EuclideanSpace ℂ (Fin d)) :
    signalPresent b 0 psi = background d b := by
  simp [signalPresent]

example : pairState 1 (some (0 : Fin 1), (0 : Fin 1)) = 1 := by
  norm_num [pairState, finiteMaxEntangled]

example (d : ℕ) (b : ℝ) : pairPresent d b 0 = pairAbsent d b := by
  simp [pairPresent]

example {I : Type*} (rho : Matrix I I ℂ) (x y : Fin 0 → I) :
    QAlgorithms.Papers.Independent.Information100.P60.copies 0 rho x y = 1 := by
  simp [QAlgorithms.Papers.Independent.Information100.P60.copies]

example (p0 p1 : ℝ) : countingError p0 p1 0 = 1 / 2 := by
  simp [countingError, countMass]

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

example (err : ℕ → ℝ) : errorFactor err 0 = 2 * err 1 := by
  simp [errorFactor]

end QAlgorithms.Papers.Independent.Intakenext100.P96
Source
Quantum Illumination, arXiv:0803.2022v2, https://arxiv.org/abs/0803.2022v2
Read-back

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

QAlgorithms.Papers.Independent.Intakenext100.P96.ModelParameters

A model parameter record consists of a natural number ddd, real numbers bbb and η\etaη, and the requirements

0<d,0≤b,db≤1,0≤η≤1.0<d,\qquad 0\le b,\qquad db\le1,\qquad 0\le\eta\le1.0<d,0≤b,db≤1,0≤η≤1.

Thus d=0d=0d=0 is excluded, while equality is permitted in each of the non-strict inequalities.

QAlgorithms.Papers.Independent.Intakenext100.P96.SignalIndex

For every natural number ddd, the index set is the disjoint union of a distinguished element, denoted ⋆\star⋆, and the indices {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}. It has d+1d+1d+1 elements; when d=0d=0d=0, it consists only of ⋆\star⋆.

QAlgorithms.Papers.Independent.Intakenext100.P96.ancillaMixed

For every natural number ddd, this defines the complex matrix d−1Id^{-1}Id−1I indexed by {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}: its diagonal entries are the real number d−1d^{-1}d−1 regarded as complex, and its off-diagonal entries are zero. The inverse is total, with 0−1=00^{-1}=00−1=0; when d=0d=0d=0, the matrix has an empty index set.

QAlgorithms.Papers.Independent.Intakenext100.P96.background

For every natural number ddd and every real number bbb, this defines a complex diagonal matrix indexed by {⋆}⊔{0,…,d−1}\{\star\}\sqcup\{0,\ldots,d-1\}{⋆}⊔{0,…,d−1}. Its diagonal entry at ⋆\star⋆ is 1−db1-db1−db, its diagonal entry at every ordinary index is bbb, and all off-diagonal entries are zero. No sign or size restriction on bbb is imposed. When d=0d=0d=0, the matrix is the one-by-one matrix with entry 111.

QAlgorithms.Papers.Independent.Intakenext100.P96.binaryChernoff

For arbitrary real numbers p0,p1p_0,p_1p0​,p1​, this defines

binaryChernoff⁡(p0,p1)=inf⁡0<s<1[(1−p0)1−s(1−p1)s+p01−sp1s].\operatorname{binaryChernoff}(p_0,p_1) =\inf_{0<s<1} \left[ (1-p_0)^{1-s}(1-p_1)^s+ p_0^{1-s}p_1^s \right].binaryChernoff(p0​,p1​)=0<s<1inf​[(1−p0​)1−s(1−p1​)s+p01−s​p1s​].

All powers use the total real-power operation, and neither parameter is required to lie in [0,1][0,1][0,1]. The endpoints s=0,1s=0,1s=0,1 are excluded; throughout the indexing interval both exponents are positive, so a zero base contributes zero. This is a real infimum, which is defined to be zero if the displayed set is unbounded below.

QAlgorithms.Papers.Independent.Intakenext100.P96.binaryError

For any finite index type III equipped with decidable equality, and any three complex matrices ρ0,ρ1,M\rho_0,\rho_1,Mρ0​,ρ1​,M indexed by I×II\times II×I, this defines the real number

binaryError⁡(ρ0,ρ1,M)=Re⁡tr⁡(Mρ0)+Re⁡tr⁡((1−M)ρ1)2.\operatorname{binaryError}(\rho_0,\rho_1,M) =\frac{\operatorname{Re}\operatorname{tr}(M\rho_0)+ \operatorname{Re}\operatorname{tr}((\mathbf1-M)\rho_1)}{2}.binaryError(ρ0​,ρ1​,M)=2Retr(Mρ0​)+Retr((1−M)ρ1​)​.

There is no assumption that either ρi\rho_iρi​ is a density matrix or that MMM is an effect, so the definition does not require this number to be a probability. The index type may be empty, in which case the traces and the defined value are zero.

QAlgorithms.Papers.Independent.Intakenext100.P96.countMass

For every real number ppp and natural numbers n,kn,kn,k, this defines

countMass⁡(p,n,k)=(nk) pk(1−p) n−˙k,\operatorname{countMass}(p,n,k) =\binom nk\,p^k(1-p)^{\,n\mathbin{\dot-}k},countMass(p,n,k)=(kn​)pk(1−p)n−˙​k,

where n−˙k=max⁡(n−k,0)n\mathbin{\dot-}k=\max(n-k,0)n−˙​k=max(n−k,0) is subtraction in the natural numbers. There is no restriction 0≤p≤10\le p\le10≤p≤1, so these values need not be nonnegative. If k>nk>nk>n, the binomial coefficient is zero and the defined value is zero; powers with exponent zero, including 000^000, equal 111. In particular, the value for n=k=0n=k=0n=k=0 is 111.

QAlgorithms.Papers.Independent.Intakenext100.P96.countingError

For arbitrary real numbers p0,p1p_0,p_1p0​,p1​ and any natural number nnn, this defines

countingError⁡(p0,p1,n)=12∑k=0nmin⁡ ⁣{(nk)p0k(1−p0)n−k,(nk)p1k(1−p1)n−k}.\operatorname{countingError}(p_0,p_1,n) =\frac12\sum_{k=0}^{n} \min\!\left\{ \binom nk p_0^k(1-p_0)^{n-k}, \binom nk p_1^k(1-p_1)^{n-k} \right\}.countingError(p0​,p1​,n)=21​k=0∑n​min{(kn​)p0k​(1−p0​)n−k,(kn​)p1k​(1−p1​)n−k}.

Both parameters are unrestricted real numbers; no probability assumptions are imposed. The sum includes both endpoints k=0,nk=0,nk=0,n, with every zeroth power interpreted as 111, including 000^000. For n=0n=0n=0, the value is 1/21/21/2.

QAlgorithms.Papers.Independent.Intakenext100.P96.ebits

For every natural number ddd, this defines the real number log⁡(d)/log⁡(2)\log(d)/\log(2)log(d)/log(2), where log⁡\loglog is the real natural logarithm. The definition includes d=0d=0d=0 and uses the total-function convention log⁡(0)=0\log(0)=0log(0)=0, so its value is 000 both at d=0d=0d=0 and at d=1d=1d=1.

QAlgorithms.Papers.Independent.Intakenext100.P96.entangledFactor

For any natural number ddd and arbitrary real numbers b,η,sb,\eta,sb,η,s, this defines

entangledFactor⁡(d,b,η,s)=(1−η)s[1+bd(−1+(1+ηd(1−η)b)s)].\operatorname{entangledFactor}(d,b,\eta,s) =(1-\eta)^s \left[ 1+\frac bd \left( -1+ \left(1+\frac{\eta d}{(1-\eta)b}\right)^s \right) \right].entangledFactor(d,b,η,s)=(1−η)s[1+db​(−1+(1+(1−η)bηd​)s)].

Here ddd is cast to a real number, every power uses the total real-power operation, and division by zero is defined to be zero. No assumptions exclude d=0d=0d=0, b=0b=0b=0, η=1\eta=1η=1, negative bases, or arbitrary exponents. In particular, if d=0d=0d=0 or b=0b=0b=0, the expression reduces to (1−η)s(1-\eta)^s(1−η)s.

QAlgorithms.Papers.Independent.Intakenext100.P96.errorFactor

For any function err:N→R\mathrm{err}:\mathbb N\to\mathbb Rerr:N→R and any natural number nnn, this defines

errorFactor⁡(err,n)=(2 err(n+1))1/(n+1),\operatorname{errorFactor}(\mathrm{err},n) =\bigl(2\,\mathrm{err}(n+1)\bigr)^{1/(n+1)},errorFactor(err,n)=(2err(n+1))1/(n+1),

using the total real-power operation. No nonnegativity or other condition is imposed on err\mathrm{err}err, so the base may be negative. The denominator n+1n+1n+1 is always positive, the value err(0)\mathrm{err}(0)err(0) is never used, and at n=0n=0n=0 the result is 2 err(1)2\,\mathrm{err}(1)2err(1).

QAlgorithms.Papers.Independent.Intakenext100.P96.iidEqualPriorError

For any finite index type III equipped with decidable equality, any complex matrices ρ0,ρ1\rho_0,\rho_1ρ0​,ρ1​ indexed by I×II\times II×I, and any natural number nnn, define matrices Ci(n)C_i^{(n)}Ci(n)​, indexed by functions x,y:{0,…,n−1}→Ix,y:\{0,\ldots,n-1\}\to Ix,y:{0,…,n−1}→I, by Ci(n)(x,y)=∏j=0n−1ρi(x(j),y(j))C_i^{(n)}(x,y)=\prod_{j=0}^{n-1}\rho_i(x(j),y(j))Ci(n)​(x,y)=∏j=0n−1​ρi​(x(j),y(j)). This declaration defines

iidEqualPriorError⁡(ρ0,ρ1,n)=12 toReal⁡ ⁣(inf⁡T⪰01−T⪰0[Re⁡tr⁡(C0(n)T)+Re⁡tr⁡(C1(n)(1−T))]),\operatorname{iidEqualPriorError}(\rho_0,\rho_1,n) =\frac12\,\operatorname{toReal}\!\left( \inf_{\substack{T\succeq0\\ \mathbf1-T\succeq0}} \left[ \operatorname{Re}\operatorname{tr}(C_0^{(n)}T) +\operatorname{Re}\operatorname{tr}(C_1^{(n)}(\mathbf1-T)) \right]\right),iidEqualPriorError(ρ0​,ρ1​,n)=21​toReal​T⪰01−T⪰0​inf​[Retr(C0(n)​T)+Retr(C1(n)​(1−T))]​,

where the infimum is taken in the extended real numbers and toReal⁡\operatorname{toReal}toReal preserves finite real values but sends both infinities to zero. No positivity or normalization is assumed for the input matrices, and III may be empty. When n=0n=0n=0, the indexing set consists of the unique empty function, both matrices have their sole entry equal to the empty product 111, and the defined error is 1/21/21/2.

QAlgorithms.Papers.Independent.Intakenext100.P96.illuminationChernoffFactor

For any finite index type III equipped with decidable equality and any complex matrices ρ0,ρ1\rho_0,\rho_1ρ0​,ρ1​ indexed by I×II\times II×I, this defines

illuminationChernoffFactor⁡(ρ0,ρ1)=inf⁡0<s<1Re⁡tr⁡ ⁣(Cx↦xs(ρ1) Cx↦x1−s(ρ0)),\operatorname{illuminationChernoffFactor}(\rho_0,\rho_1) =\inf_{0<s<1} \operatorname{Re}\operatorname{tr}\!\left( \mathcal C_{x\mapsto x^s}(\rho_1)\, \mathcal C_{x\mapsto x^{1-s}}(\rho_0) \right),illuminationChernoffFactor(ρ0​,ρ1​)=0<s<1inf​Retr(Cx↦xs​(ρ1​)Cx↦x1−s​(ρ0​)),

where Cf(A)\mathcal C_f(A)Cf​(A) denotes the continuous functional calculus applied to AAA with the indicated real function fff. No Hermitian, positivity, or trace-normalization assumptions are imposed, so the total functional-calculus operation is used even outside those assumptions. The endpoints s=0,1s=0,1s=0,1 are excluded, and the infimum is a real infimum, with value zero if the displayed set is unbounded below. The index type may be empty, in which case the value is zero.

QAlgorithms.Papers.Independent.Intakenext100.P96.pairAbsent

For every natural number ddd and real number bbb, let β⋆=1−db\beta_\star=1-dbβ⋆​=1−db and βk=b\beta_k=bβk​=b for 0≤k<d0\le k<d0≤k<d. This defines the complex matrix indexed by ({⋆}⊔{0,…,d−1})×{0,…,d−1}(\{\star\}\sqcup\{0,\ldots,d-1\})\times\{0,\ldots,d-1\}({⋆}⊔{0,…,d−1})×{0,…,d−1} with entries

R(i,j),(i′,j′)=βid−1δii′δjj′,R_{(i,j),(i',j')}=\beta_i d^{-1}\delta_{ii'}\delta_{jj'},R(i,j),(i′,j′)​=βi​d−1δii′​δjj′​,

where each δ\deltaδ equals 111 for equal indices and 000 otherwise. No restriction on bbb is assumed. The convention is 0−1=00^{-1}=00−1=0, and when d=0d=0d=0 the matrix has an empty index set.

QAlgorithms.Papers.Independent.Intakenext100.P96.pairPresent

For every natural number ddd and real numbers b,ηb,\etab,η, this defines a complex matrix indexed by ({⋆}⊔{0,…,d−1})×{0,…,d−1}(\{\star\}\sqcup\{0,\ldots,d-1\})\times\{0,\ldots,d-1\}({⋆}⊔{0,…,d−1})×{0,…,d−1}. For d>0d>0d>0, put β⋆=1−db\beta_\star=1-dbβ⋆​=1−db, βk=b\beta_k=bβk​=b, and let v(i,j)=1/dv_{(i,j)}=1/\sqrt dv(i,j)​=1/d​ when iii is the ordinary index jjj, and zero otherwise. Its entries are

R(i,j),(i′,j′)=(1−η)βid−1δii′δjj′+ηv(i,j)v(i′,j′)‾,R_{(i,j),(i',j')}=(1-\eta)\beta_i d^{-1}\delta_{ii'}\delta_{jj'} +\eta v_{(i,j)}\overline{v_{(i',j')}},R(i,j),(i′,j′)​=(1−η)βi​d−1δii′​δjj′​+ηv(i,j)​v(i′,j′)​​,

where the δ\deltaδ factors indicate equality of their indices. No bounds on bbb or η\etaη are assumed. When d=0d=0d=0, the matrix has an empty index set.

QAlgorithms.Papers.Independent.Intakenext100.P96.pairState

For every natural number ddd, this defines a complex vector indexed by ({⋆}⊔{0,…,d−1})×{0,…,d−1}(\{\star\}\sqcup\{0,\ldots,d-1\})\times\{0,\ldots,d-1\}({⋆}⊔{0,…,d−1})×{0,…,d−1}. When d>0d>0d>0, its coordinates are

v(i,j)={1/d,i is the ordinary index j,0,otherwise.v_{(i,j)}= \begin{cases} 1/\sqrt d,&i\text{ is the ordinary index }j,\\ 0,&\text{otherwise}. \end{cases}v(i,j)​={1/d​,0,​i is the ordinary index j,otherwise.​

In particular, every coordinate with first index ⋆\star⋆ is zero. When d=0d=0d=0, the definition returns the zero vector on the empty index set.

QAlgorithms.Papers.Independent.Intakenext100.P96.pairTest

For every natural number ddd, this defines a complex matrix indexed by pairs (i,j)(i,j)(i,j) with i∈{⋆}⊔{0,…,d−1}i\in\{\star\}\sqcup\{0,\ldots,d-1\}i∈{⋆}⊔{0,…,d−1} and 0≤j<d0\le j<d0≤j<d. When d>0d>0d>0, its entries are

T(i,j),(i′,j′)={1/d,i is the ordinary index j and i′ is the ordinary index j′,0,otherwise.T_{(i,j),(i',j')}= \begin{cases} 1/d,&i\text{ is the ordinary index }j \text{ and }i'\text{ is the ordinary index }j',\\ 0,&\text{otherwise}. \end{cases}T(i,j),(i′,j′)​={1/d,0,​i is the ordinary index j and i′ is the ordinary index j′,otherwise.​

These entries are the products v(i,j)v(i′,j′)‾v_{(i,j)}\overline{v_{(i',j')}}v(i,j)​v(i′,j′)​​, where v(i,j)=1/dv_{(i,j)}=1/\sqrt dv(i,j)​=1/d​ on the indicated matching indices and is zero elsewhere. When d=0d=0d=0, the matrix has an empty index set.

QAlgorithms.Papers.Independent.Intakenext100.P96.signalPresent

For every natural number ddd, real numbers b,ηb,\etab,η, and vector ψ∈Cd\psi\in\mathbb C^dψ∈Cd, define u⋆=0u_\star=0u⋆​=0, uk=ψku_k=\psi_kuk​=ψk​ for ordinary indices, and define β⋆=1−db\beta_\star=1-dbβ⋆​=1−db, βk=b\beta_k=bβk​=b. The resulting complex matrix, indexed by {⋆}⊔{0,…,d−1}\{\star\}\sqcup\{0,\ldots,d-1\}{⋆}⊔{0,…,d−1}, has entries

Rij=(1−η)βiδij+ηuiuj‾,R_{ij}=(1-\eta)\beta_i\delta_{ij}+\eta u_i\overline{u_j},Rij​=(1−η)βi​δij​+ηui​uj​​,

where δij\delta_{ij}δij​ is 111 when i=ji=ji=j and 000 otherwise. No bounds on bbb or η\etaη, and no normalization of ψ\psiψ, are assumed. When d=0d=0d=0, this is the one-by-one matrix with entry 1−η1-\eta1−η.

QAlgorithms.Papers.Independent.Intakenext100.P96.signalState

For every natural number ddd and every vector ψ∈Cd\psi\in\mathbb C^dψ∈Cd, this defines the vector uuu indexed by {⋆}⊔{0,…,d−1}\{\star\}\sqcup\{0,\ldots,d-1\}{⋆}⊔{0,…,d−1} through

u⋆=0,uk=ψk(0≤k<d).u_\star=0,\qquad u_k=\psi_k\quad(0\le k<d).u⋆​=0,uk​=ψk​(0≤k<d).

There is no normalization assumption on ψ\psiψ. When d=0d=0d=0, the resulting vector has its sole coordinate equal to zero.

QAlgorithms.Papers.Independent.Intakenext100.P96.signalTest

For every natural number ddd and every vector ψ∈Cd\psi\in\mathbb C^dψ∈Cd, this defines a complex matrix indexed by {⋆}⊔{0,…,d−1}\{\star\}\sqcup\{0,\ldots,d-1\}{⋆}⊔{0,…,d−1} whose entries at ordinary indices are

Tkℓ=ψkψℓ‾,T_{k\ell}=\psi_k\overline{\psi_\ell},Tkℓ​=ψk​ψℓ​​,

and whose entries are zero whenever either index is ⋆\star⋆. No normalization assumption on ψ\psiψ is required. When d=0d=0d=0, this is the one-by-one zero matrix.

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