Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Unconstrained distillation capacities of a pure-loss bosonic broadcast channel

Definition
QAlgorithms_Papers_Independent_Support50_P48

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

prove2quantum

The objects the formalized statements of Unconstrained distillation capacities of a pure-loss bosonic broadcast channel (arXiv:1601.05563) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • portWeight: PDF pp.2,6: none is the environment; some i is receiver i. The nonnegative subtraction agrees with real subtraction by total_le_one.
  • vacuumAmplitude: PDF pp.2,6: the vacuum splitting isometry on the entire number basis. This is the normalized multinomial expansion of the input creation operator; there is no global photon cutoff. All output signal phases are positive.
  • tmsvWeight: PDF p.3, (7): geometric Schmidt probabilities, with finite mean N.
  • ResourceMode: Full mode labels: none is Alice, some none is the environment, and some (some i) is receiver i; PDF pp.3,6, (11),(29).
  • resourceAmplitude: PDF pp.3,6, (7),(11),(29): the actual purified TMSV channel-output amplitude, obtained by applying the vacuum splitting isometry to the input half.
  • purifiedResource: PDF pp.3,6, (11),(29): rank-one purified resource coefficients, before tracing the environment. Normalization is a conclusion of the entropy theorem.
  • subsystem: PDF pp.3,6: actual partial trace over the complementary modes. On all resource states used here the diagonal trace series is convergent.
  • receiverModes: The selected receiver modes in the purified resource, PDF p.6.
  • aliceWith: Alice together with selected receivers; PDF pp.3,6.
  • environmentWith: Environment together with selected receivers; PDF pp.3,6.
  • resourceEntropyBits: PDF pp.3,6: spectral von Neumann entropy of an actual reduced resource, converted from the accepted extended entropy in nats to bits.
  • reverseCutYield: PDF pp.3,6: negative conditional entropy, computed from actual marginals. The entropy theorem supplies finiteness before either toReal is interpreted.
  • extendedCutBound: PDF pp.2,6, (4)-(6),(27): extended endpoint interpretation of the cut bound, inferred from the finite-energy entropy limit. A zero selected signal has bound zero even when the environmental weight is zero.
  • cutOccupation: PDF pp.3,6: reconstruct the full occupation at the T : A complement(T) cut, including the environment that will be traced out.
  • resourceCut: PDF pp.4,6: the actual resource after tracing E, grouped across the selected receiver cut. The right factor includes Alice and all other receivers.
  • relativeEntanglementBits: PDF p.3, (14): infimum of actual extended relative entropy over all normal separable states, using trace-norm closed separability; measured in bits. Arbitrary shields are not bounded and the infimum is extended, not real.
  • residualIntensity: PDF p.6, (30): remaining input intensity before zero-based stage j. The ordering permutes all m+1 ports, including the environment.
  • emittedPhotons: Number of photons already emitted before stage j, PDF p.6, Fig.3.
  • sequentialAmplitude: PDF p.6, Fig.3,(30): the full vacuum network amplitude, with m actual splitters. Each factor is the normalized binomial vacuum splitting amplitude; the final remaining port is fixed by total photon conservation.
  • referencedVacuumOutput: PDF pp.2,6: the full referenced output of a photon-conserving vacuum isometry. Input number indices are fixed by total output photon numbers, so no formal infinite matrix product is used.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P30
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P07

/-!
# Pure-loss bosonic broadcast channels (arXiv:1601.05563v3)

The unrestricted operational capacity and merging/simulation interfaces are
explicitly deferred in HARD.md. The three statements here concern actual
number-basis resource states, their entropies/REE, and vacuum network equality.
No capacity is defined to equal a scalar bound. Compilation is pending.

All signal amplitudes use a positive output phase convention. Fixed local phase
rotations recover the minus signs of (1)-(3); these do not change any entropy or
bipartite REE. Occupations run over all natural numbers, without truncation.
-/

noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P48

open Filter
open scoped BigOperators ENNReal NNReal Topology
open QAlgorithms.Papers.Independent.Dependency50.P30
  (PureLossBroadcastParameters thermalEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsSeparable)
open QAlgorithms.Papers.Independent.Frontier18.P07
  (extendedEntropyNats extendedRelativeEntropyNats)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.2,6: `none` is the environment; `some i` is receiver i.
The nonnegative subtraction agrees with real subtraction by total_le_one. -/
def portWeight {m : ℕ} (p : PureLossBroadcastParameters m) : Option (Fin m) → ℝ≥0
  | none => 1 - ∑ i, p.transmissivity i
  | some i => p.transmissivity i

/-- PDF pp.2,6: the vacuum splitting isometry on the entire number basis.
This is the normalized multinomial expansion of the input creation operator;
there is no global photon cutoff. All output signal phases are positive. -/
def vacuumAmplitude {J : Type} [Fintype J] (eta : J → ℝ≥0)
    (out : J → ℕ) (n : ℕ) : ℝ :=
  if (∑ i, out i) = n then
    Real.sqrt ((Nat.factorial n : ℝ) / ∏ i, (Nat.factorial (out i) : ℝ)) *
      ∏ i, Real.sqrt (eta i : ℝ) ^ out i
  else 0

/-- PDF p.3, (7): geometric Schmidt probabilities, with finite mean N. -/
def tmsvWeight (N : ℝ≥0) (n : ℕ) : ℝ :=
  (N : ℝ) ^ n / ((N : ℝ) + 1) ^ (n + 1)

/-- Full mode labels: `none` is Alice, `some none` is the environment,
and `some (some i)` is receiver i; PDF pp.3,6, (11),(29). -/
abbrev ResourceMode (m : ℕ) := Option (Option (Fin m))

/-- PDF pp.3,6, (7),(11),(29): the actual purified TMSV channel-output
amplitude, obtained by applying the vacuum splitting isometry to the input half. -/
def resourceAmplitude {m : ℕ} (p : PureLossBroadcastParameters m) (N : ℝ≥0)
    (out : ResourceMode m → ℕ) : ℝ :=
  Real.sqrt (tmsvWeight N (out none)) *
    vacuumAmplitude (portWeight p) (fun j => out (some j)) (out none)

/-- PDF pp.3,6, (11),(29): rank-one purified resource coefficients, before
tracing the environment. Normalization is a conclusion of the entropy theorem. -/
def purifiedResource {m : ℕ} (p : PureLossBroadcastParameters m) (N : ℝ≥0) :
    Matrix (ResourceMode m → ℕ) (ResourceMode m → ℕ) ℂ :=
  fun a b => (resourceAmplitude p N a : ℂ) * (resourceAmplitude p N b : ℂ)

/-- PDF pp.3,6: actual partial trace over the complementary modes. On all
resource states used here the diagonal trace series is convergent. -/
def subsystem {J : Type} (S : Finset J) (X : Matrix (J → ℕ) (J → ℕ) ℂ) :
    Matrix (S → ℕ) (S → ℕ) ℂ :=
  fun a b => ∑' e : {i : J // i ∉ S} → ℕ,
    X (fun i => if h : i ∈ S then a ⟨i, h⟩ else e ⟨i, h⟩)
      (fun i => if h : i ∈ S then b ⟨i, h⟩ else e ⟨i, h⟩)

/-- The selected receiver modes in the purified resource, PDF p.6. -/
def receiverModes {m : ℕ} (T : Finset (Fin m)) : Finset (ResourceMode m) :=
  T.image (fun i => some (some i))

/-- Alice together with selected receivers; PDF pp.3,6. -/
def aliceWith {m : ℕ} (T : Finset (Fin m)) : Finset (ResourceMode m) :=
  insert none (receiverModes T)

/-- Environment together with selected receivers; PDF pp.3,6. -/
def environmentWith {m : ℕ} (T : Finset (Fin m)) : Finset (ResourceMode m) :=
  insert (some none) (receiverModes T)

/-- PDF pp.3,6: spectral von Neumann entropy of an actual reduced resource,
converted from the accepted extended entropy in nats to bits. -/
def resourceEntropyBits {m : ℕ} (p : PureLossBroadcastParameters m) (N : ℝ≥0)
    (S : Finset (ResourceMode m)) : ℝ≥0∞ :=
  extendedEntropyNats (subsystem S (purifiedResource p N)) /
    ENNReal.ofReal (Real.log 2)

/-- PDF pp.3,6: negative conditional entropy, computed from actual marginals.
The entropy theorem supplies finiteness before either toReal is interpreted. -/
def reverseCutYield {m : ℕ} (p : PureLossBroadcastParameters m) (N : ℝ≥0)
    (T : Finset (Fin m)) : ℝ :=
  (resourceEntropyBits p N (aliceWith (Finset.univ \ T))).toReal -
    (resourceEntropyBits p N (aliceWith Finset.univ)).toReal

/-- PDF pp.2,6, (4)-(6),(27): extended endpoint interpretation of the cut
bound, inferred from the finite-energy entropy limit. A zero selected signal
has bound zero even when the environmental weight is zero. -/
def extendedCutBound {m : ℕ} (p : PureLossBroadcastParameters m)
    (T : Finset (Fin m)) : ℝ≥0∞ :=
  let selected : ℝ≥0 := ∑ i ∈ T, p.transmissivity i
  let loss := portWeight p none
  if selected = 0 then 0 else if loss = 0 then ⊤ else
    ENNReal.ofReal (Real.logb 2 (((loss : ℝ) + (selected : ℝ)) / (loss : ℝ)))

/-- PDF pp.3,6: reconstruct the full occupation at the T : A complement(T)
cut, including the environment that will be traced out. -/
def cutOccupation {m : ℕ} (T : Finset (Fin m)) (a : T → ℕ)
    (b : ℕ × ({i : Fin m // i ∉ T} → ℕ)) (e : ℕ) : ResourceMode m → ℕ
  | none => b.1
  | some none => e
  | some (some i) => if h : i ∈ T then a ⟨i, h⟩ else b.2 ⟨i, h⟩

/-- PDF pp.4,6: the actual resource after tracing E, grouped across the
selected receiver cut. The right factor includes Alice and all other receivers. -/
def resourceCut {m : ℕ} (p : PureLossBroadcastParameters m) (N : ℝ≥0)
    (T : Finset (Fin m)) :
    Matrix ((T → ℕ) × (ℕ × ({i : Fin m // i ∉ T} → ℕ)))
      ((T → ℕ) × (ℕ × ({i : Fin m // i ∉ T} → ℕ))) ℂ :=
  fun a b => ∑' e : ℕ, purifiedResource p N
    (cutOccupation T a.1 a.2 e) (cutOccupation T b.1 b.2 e)

/-- PDF p.3, (14): infimum of actual extended relative entropy over all
normal separable states, using trace-norm closed separability; measured in bits.
Arbitrary shields are not bounded and the infimum is extended, not real. -/
def relativeEntanglementBits {I J : Type} (X : Matrix (I × J) (I × J) ℂ) : ℝ≥0∞ :=
  (⨅ sigma : {rho : State (I × J) // IsSeparable rho.coefficients},
    extendedRelativeEntropyNats X sigma.val.coefficients) / ENNReal.ofReal (Real.log 2)

/-- PDF p.6, (30): remaining input intensity before zero-based stage j.
The ordering permutes all m+1 ports, including the environment. -/
def residualIntensity {m : ℕ} (eta : Fin (m + 1) → ℝ≥0)
    (order : Equiv.Perm (Fin (m + 1))) (j : ℕ) : ℝ :=
  1 - ∑ k ∈ Finset.univ.filter (fun k : Fin (m + 1) => k.val < j), (eta (order k) : ℝ)

/-- Number of photons already emitted before stage j, PDF p.6, Fig.3. -/
def emittedPhotons {m : ℕ} (order : Equiv.Perm (Fin (m + 1)))
    (out : Fin (m + 1) → ℕ) (j : ℕ) : ℕ :=
  ∑ k ∈ Finset.univ.filter (fun k : Fin (m + 1) => k.val < j), out (order k)

/-- PDF p.6, Fig.3,(30): the full vacuum network amplitude, with m actual
splitters. Each factor is the normalized binomial vacuum splitting amplitude;
the final remaining port is fixed by total photon conservation. -/
def sequentialAmplitude {m : ℕ} (t : Fin m → ℝ)
    (order : Equiv.Perm (Fin (m + 1))) (out : Fin (m + 1) → ℕ) (n : ℕ) : ℝ :=
  if (∑ i, out i) = n then
    ∏ j : Fin m,
      Real.sqrt (Nat.choose (n - emittedPhotons order out j.val)
        (out (order j.castSucc)) : ℝ) *
      Real.sqrt (1 - t j) ^ out (order j.castSucc) *
      Real.sqrt (t j) ^ (n - emittedPhotons order out j.val - out (order j.castSucc))
  else 0

/-- PDF pp.2,6: the full referenced output of a photon-conserving vacuum
isometry. Input number indices are fixed by total output photon numbers, so
no formal infinite matrix product is used. -/
def referencedVacuumOutput {J R : Type} [Fintype J]
    (amplitude : (J → ℕ) → ℕ → ℝ) (X : Matrix (R × ℕ) (R × ℕ) ℂ) :
    Matrix (R × (J → ℕ)) (R × (J → ℕ)) ℂ :=
  fun a b => (amplitude a.2 (∑ i, a.2 i) : ℂ) *
    X (a.1, ∑ i, a.2 i) (b.1, ∑ i, b.2 i) *
    (amplitude b.2 (∑ i, b.2 i) : ℂ)

/-- The vacuum sector has amplitude one, even if some port weights vanish. -/
example {J : Type} [Fintype J] (eta : J → ℝ≥0) :
    vacuumAmplitude eta (fun _ => 0) 0 = 1 := by
  simp [vacuumAmplitude]

/-- The TMSV zero-photon probability is 1/(N+1), including N=0. -/
example (N : ℝ≥0) : tmsvWeight N 0 = 1 / ((N : ℝ) + 1) := by
  simp [tmsvWeight]

/-- The empty cut never becomes infinite at the lossless endpoint. -/
example {m : ℕ} (p : PureLossBroadcastParameters m) : extendedCutBound p ∅ = 0 := by
  simp [extendedCutBound]

/-- The environment coordinate is retained explicitly in the cut reconstruction. -/
example {m : ℕ} (T : Finset (Fin m)) (a : T → ℕ)
    (b : ℕ × ({i : Fin m // i ∉ T} → ℕ)) (e : ℕ) :
    cutOccupation T a b e (some none) = e := by rfl

/-- With no photons, every physical splitter acts trivially on the vacuum. -/
example {m : ℕ} (t : Fin m → ℝ) (order : Equiv.Perm (Fin (m + 1))) :
    sequentialAmplitude t order (fun _ => 0) 0 = 1 := by
  simp [sequentialAmplitude, emittedPhotons]

end QAlgorithms.Papers.Independent.Support50.P48
Source
Unconstrained distillation capacities of a pure-loss bosonic broadcast channel, arXiv:1601.05563v3, https://arxiv.org/abs/1601.05563v3
Read-back

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

QAlgorithms.Papers.Independent.Support50.P48.ResourceMode

For each natural number mmm, this abbreviates the type of labels consisting of one outer absent value A\mathsf AA, one outer present value containing an inner absent value E\mathsf EE, and one outer present value containing an inner present index Ri\mathsf R_iRi​ for each i<mi<mi<m. These are distinct labels, so the type has m+2m+2m+2 elements. In particular, when m=0m=0m=0 it still has the two labels A\mathsf AA and E\mathsf EE.

QAlgorithms.Papers.Independent.Support50.P48.aliceWith

For every m∈Nm\in\mathbb Nm∈N and every finite subset T⊆{0,…,m−1}T\subseteq\{0,\ldots,m-1\}T⊆{0,…,m−1}, this defines the finite set

{A}∪{Ri:i∈T}\{\mathsf A\}\cup\{\mathsf R_i:i\in T\}{A}∪{Ri​:i∈T}

in the label type whose elements are A\mathsf AA (outer absent), E\mathsf EE (outer present with inner absent), and Ri\mathsf R_iRi​ (outer present with inner present index iii). The set contains A\mathsf AA and exactly the doubly present labels indexed by TTT; it does not contain E\mathsf EE. For T=∅T=\varnothingT=∅, including when m=0m=0m=0, it is the singleton {A}\{\mathsf A\}{A}.

QAlgorithms.Papers.Independent.Support50.P48.cutOccupation

For every natural number mmm, let the mode labels consist of a distinguished label AAA, a distinguished label EEE, and receiver labels RiR_iRi​ for i∈{0,…,m−1}i\in\{0,\ldots,m-1\}i∈{0,…,m−1}; these correspond respectively to none, some none, and some (some i). For any subset TTT of the receiver indices, any function a:T→Na:T\to\mathbb Na:T→N, any pair b=(bA,bout)b=(b_A,b_{\mathrm{out}})b=(bA​,bout​) with bA∈Nb_A\in\mathbb NbA​∈N and bout:{i:i∉T}→Nb_{\mathrm{out}}:\{i:i\notin T\}\to\mathbb Nbout​:{i:i∈/T}→N, and any e∈Ne\in\mathbb Ne∈N, the definition produces the occupation function

cT,a,b,e(A)=bA,cT,a,b,e(E)=e,cT,a,b,e(Ri)={a(i),i∈T,bout(i),i∉T.c_{T,a,b,e}(A)=b_A,\qquad c_{T,a,b,e}(E)=e,\qquad c_{T,a,b,e}(R_i)= \begin{cases} a(i),&i\in T,\\ b_{\mathrm{out}}(i),&i\notin T. \end{cases}cT,a,b,e​(A)=bA​,cT,a,b,e​(E)=e,cT,a,b,e​(Ri​)={a(i),bout​(i),​i∈T,i∈/T.​

There is no restriction on these occupations or their sum. Empty TTT, empty complement, and m=0m=0m=0 are all allowed; a function on an empty index set is the unique empty function.

QAlgorithms.Papers.Independent.Support50.P48.emittedPhotons

For every natural number mmm, every permutation π\piπ of {0,…,m}\{0,\ldots,m\}{0,…,m}, every occupation function o:{0,…,m}→No:\{0,\ldots,m\}\to\mathbb No:{0,…,m}→N, and every natural number jjj, the definition gives

Ej=∑0≤k≤mk<joπ(k)∈N.E_j=\sum_{\substack{0\le k\le m\\k<j}}o_{\pi(k)}\in\mathbb N.Ej​=0≤k≤mk<j​∑​oπ(k)​∈N.

No total occupation is prescribed. This includes m=0m=0m=0; E0=0E_0=0E0​=0, and for every j≥m+1j\ge m+1j≥m+1, Ej=∑i=0moiE_j=\sum_{i=0}^{m}o_iEj​=∑i=0m​oi​.

QAlgorithms.Papers.Independent.Support50.P48.environmentWith

For every m∈Nm\in\mathbb Nm∈N and every finite subset T⊆{0,…,m−1}T\subseteq\{0,\ldots,m-1\}T⊆{0,…,m−1}, this defines the finite set

{E}∪{Ri:i∈T}\{\mathsf E\}\cup\{\mathsf R_i:i\in T\}{E}∪{Ri​:i∈T}

in the label type whose elements are A\mathsf AA (outer absent), E\mathsf EE (outer present with inner absent), and Ri\mathsf R_iRi​ (outer present with inner present index iii). The set contains E\mathsf EE and exactly the doubly present labels indexed by TTT; it does not contain A\mathsf AA. For T=∅T=\varnothingT=∅, including when m=0m=0m=0, it is the singleton {E}\{\mathsf E\}{E}.

QAlgorithms.Papers.Independent.Support50.P48.extendedCutBound

For every natural number mmm, including m=0m=0m=0, let ppp specify nonnegative real numbers ηi\eta_iηi​ for i∈{0,…,m−1}i\in\{0,\ldots,m-1\}i∈{0,…,m−1} with ∑iηi≤1\sum_i\eta_i\le 1∑i​ηi​≤1, and let TTT be any subset of these indices, including the empty subset. Put s=∑i∈Tηis=\sum_{i\in T}\eta_is=∑i∈T​ηi​ and ℓ=1−∑iηi\ell=1-\sum_i\eta_iℓ=1−∑i​ηi​. The definition gives the following value in [0,∞][0,\infty][0,∞]:

B(p,T)={0,s=0,∞,s≠0 and ℓ=0,max⁡ ⁣{0,log⁡2 ⁣(ℓ+sℓ)},s≠0 and ℓ≠0.B(p,T)= \begin{cases} 0,&s=0,\\ \infty,&s\ne0\ \text{and}\ \ell=0,\\ \max\!\left\{0,\log_2\!\left(\dfrac{\ell+s}{\ell}\right)\right\}, &s\ne0\ \text{and}\ \ell\ne0. \end{cases}B(p,T)=⎩⎨⎧​0,∞,max{0,log2​(ℓℓ+s​)},​s=0,s=0 and ℓ=0,s=0 and ℓ=0.​

The subtraction defining ℓ\ellℓ is originally nonnegative-real subtraction, which agrees here with ordinary subtraction because ∑iηi≤1\sum_i\eta_i\le1∑i​ηi​≤1. The first branch takes precedence when both sss and ℓ\ellℓ vanish. In particular, T=∅T=\varnothingT=∅, and necessarily m=0m=0m=0, give value zero.

QAlgorithms.Papers.Independent.Support50.P48.portWeight

For every natural number mmm and every family of nonnegative real numbers (ηi)i<m(\eta_i)_{i<m}(ηi​)i<m​ satisfying ∑i<mηi≤1\sum_{i<m}\eta_i\leq 1∑i<m​ηi​≤1, supplied as the transmissivities of ppp, this defines a nonnegative real weight on the labels consisting of an additional label ⊥\bot⊥ and the indices i<mi<mi<m: the weight of ⊥\bot⊥ is 1−∑i<mηi1-\sum_{i<m}\eta_i1−∑i<m​ηi​, and the weight of iii is ηi\eta_iηi​. Subtraction takes place in the nonnegative reals, where it is truncated at zero; the assumed bound on the sum makes this the ordinary nonnegative difference. The case m=0m=0m=0 is included: there is only the label ⊥\bot⊥, whose weight is 111.

QAlgorithms.Papers.Independent.Support50.P48.purifiedResource

For every m∈Nm\in\mathbb Nm∈N, every parameter family ppp with nonnegative transmissivities ηi\eta_iηi​ satisfying ∑i<mηi≤1\sum_{i<m}\eta_i\leq1∑i<m​ηi​≤1, and every nonnegative real NNN, this defines a complex matrix indexed in both directions by all occupation functions on the distinct labels A,E,Ri\mathsf A,\mathsf E,\mathsf R_iA,E,Ri​ for i<mi<mi<m, corresponding respectively to the outer absent, outer present and inner absent, and doubly present labels. Put L=1−∑i<mηiL=1-\sum_{i<m}\eta_iL=1−∑i<m​ηi​, and for each occupation function zzz define

q(z)={NzA(N+1)zA+1 zA!zE!∏i<mzRi! (L)zE∏i<m(ηi)zRi,zE+∑i<mzRi=zA,0,otherwise.q(z)= \begin{cases} \displaystyle \sqrt{\frac{N^{z_{\mathsf A}}}{(N+1)^{z_{\mathsf A}+1}}}\, \sqrt{\frac{z_{\mathsf A}!}{z_{\mathsf E}!\prod_{i<m}z_{\mathsf R_i}!}}\, (\sqrt L)^{z_{\mathsf E}} \prod_{i<m}(\sqrt{\eta_i})^{z_{\mathsf R_i}}, &\displaystyle z_{\mathsf E}+\sum_{i<m}z_{\mathsf R_i}=z_{\mathsf A},\\[7pt] 0,&\text{otherwise}. \end{cases}q(z)=⎩⎨⎧​(N+1)zA​+1NzA​​​zE​!∏i<m​zRi​​!zA​!​​(L​)zE​i<m∏​(ηi​​)zRi​​,0,​zE​+i<m∑​zRi​​=zA​,otherwise.​

The matrix entry at occupation functions a,ba,ba,b is q(a)q(b)q(a)q(b)q(a)q(b), with both real factors embedded into C\mathbb CC. The definition multiplies these factors directly. Empty products are 111, empty sums are 000, and 00=10^0=100=1, so m=0m=0m=0 and vanishing transmissivities are included. At N=0N=0N=0, its only nonzero entry is 111 at the pair of everywhere-zero occupation functions.

QAlgorithms.Papers.Independent.Support50.P48.receiverModes

For every m∈Nm\in\mathbb Nm∈N and every finite subset T⊆{0,…,m−1}T\subseteq\{0,\ldots,m-1\}T⊆{0,…,m−1}, this defines the finite subset

{Ri:i∈T}\{\mathsf R_i:i\in T\}{Ri​:i∈T}

of the label type consisting of A\mathsf AA (the outer absent label), E\mathsf EE (outer present with inner absent), and Ri\mathsf R_iRi​ (outer present with inner present index iii). Thus it contains exactly the doubly present labels whose indices belong to TTT. It is empty when TTT is empty, including necessarily when m=0m=0m=0.

QAlgorithms.Papers.Independent.Support50.P48.referencedVacuumOutput

For every finite type JJJ, every type RRR, every arbitrary real-valued function a:(J→N)×N→Ra:(J\to\mathbb N)\times\mathbb N\to\mathbb Ra:(J→N)×N→R, and every complex matrix XXX indexed by R×NR\times\mathbb NR×N, define ∣o∣=∑i∈Joi|o|=\sum_{i\in J}o_i∣o∣=∑i∈J​oi​ for an occupation function o:J→No:J\to\mathbb No:J→N. The definition produces the complex matrix indexed by R×(J→N)R\times(J\to\mathbb N)R×(J→N) with entries

Y(r,o),(s,o′)=a(o,∣o∣) X(r,∣o∣),(s,∣o′∣) a(o′,∣o′∣),Y_{(r,o),(s,o')} =a(o,|o|)\,X_{(r,|o|),(s,|o'|)}\,a(o',|o'|),Y(r,o),(s,o′)​=a(o,∣o∣)X(r,∣o∣),(s,∣o′∣)​a(o′,∣o′∣),

where both real amplitude factors are embedded in C\mathbb CC. There are no normalization, positivity, or density assumptions on aaa or XXX. Empty JJJ and empty RRR are allowed; if JJJ is empty, its unique occupation function has total occupation zero.

QAlgorithms.Papers.Independent.Support50.P48.relativeEntanglementBits

For any types I,JI,JI,J, with no countability or nonemptiness assumptions, and any complex matrix XXX indexed by K=I×JK=I\times JK=I×J, the definition assigns a value in [0,∞][0,\infty][0,∞]. To describe it, call a matrix DDD on an index set LLL a density matrix precisely when it admits sequences un,vn∈ℓ2(L;C)u_n,v_n\in\ell^2(L;\mathbb C)un​,vn​∈ℓ2(L;C) with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞ and Dij=∑nun(i)vn(j)‾D_{ij}=\sum_nu_n(i)\overline{v_n(j)}Dij​=∑n​un​(i)vn​(j)​, every finite quadratic form ∑i,j∈szi‾Dijzj\sum_{i,j\in s}\overline{z_i}D_{ij}z_j∑i,j∈s​zi​​Dij​zj​ is real and nonnegative, and the real diagonal entries are summable with ∑iRe⁡Dii=1\sum_i\operatorname{Re}D_{ii}=1∑i​ReDii​=1. For any matrix ZZZ on LLL, put

τ(Z)=inf⁡un,vn∈ℓ2(L;C)∑n∥un∥∥vn∥<∞Zij=∑nun(i)vn(j)‾max⁡ ⁣{0,∑n∥un∥∥vn∥},\tau(Z)=\inf_{\substack{u_n,v_n\in\ell^2(L;\mathbb C)\\ \sum_n\|u_n\|\|v_n\|<\infty\\ Z_{ij}=\sum_nu_n(i)\overline{v_n(j)}}} \max\!\left\{0,\sum_n\|u_n\|\|v_n\|\right\},τ(Z)=un​,vn​∈ℓ2(L;C)∑n​∥un​∥∥vn​∥<∞Zij​=∑n​un​(i)vn​(j)​​inf​max{0,n∑​∥un​∥∥vn​∥},

where the infimum of an empty family in [0,∞][0,\infty][0,∞] is ∞\infty∞. A density matrix DDD on KKK is eligible for the infimum below precisely when, for every ε>0\varepsilon>0ε>0, there is a finite real convex combination YYY of matrices with entries Pii′Qjj′P_{ii'}Q_{jj'}Pii′​Qjj′​, where PPP and QQQ are density matrices on III and JJJ, such that τ(D−Y)<ε\tau(D-Y)<\varepsilonτ(D−Y)<ε. For finite s⊆Ks\subseteq Ks⊆K, write As,BsA_s,B_sAs​,Bs​ for the corresponding principal submatrices and define

d(As,Bs)={max⁡ ⁣{0,Re⁡tr⁡(Aslog⁡(As)−Aslog⁡(Bs)+Bs−As)},ker⁡Bs⊆ker⁡As,∞,otherwise,Dext(A,B)=sup⁡s⊆Ks finited(As,Bs).d(A_s,B_s)= \begin{cases} \max\!\left\{0,\operatorname{Re}\operatorname{tr} \bigl(A_s\log(A_s)-A_s\log(B_s)+B_s-A_s\bigr)\right\}, &\ker B_s\subseteq\ker A_s,\\ \infty,&\text{otherwise}, \end{cases} \qquad D_{\mathrm{ext}}(A,B)=\sup_{\substack{s\subseteq K\\s\text{ finite}}}d(A_s,B_s).d(As​,Bs​)={max{0,Retr(As​log(As​)−As​log(Bs​)+Bs​−As​)},∞,​kerBs​⊆kerAs​,otherwise,​Dext​(A,B)=s⊆Ks finite​sup​d(As​,Bs​).

Here matrix logarithms denote the continuous functional calculus of the real logarithm used in the definition, including its total-function conventions; the scalar real logarithm has log⁡0=0\log0=0log0=0. The requested value is

E(X)=inf⁡D eligibleDext(X,D)log⁡2.E(X)=\frac{\inf_{D\ \text{eligible}}D_{\mathrm{ext}}(X,D)}{\log2}.E(X)=log2infD eligible​Dext​(X,D)​.

No density, positivity, or summability assumption is imposed on XXX. The supremum includes the empty principal submatrix, and if there are no eligible density matrices, the result is ∞\infty∞; in particular, this occurs when I×JI\times JI×J is empty.

QAlgorithms.Papers.Independent.Support50.P48.residualIntensity

For every natural number mmm, every function η:{0,…,m}→[0,∞)\eta:\{0,\ldots,m\}\to[0,\infty)η:{0,…,m}→[0,∞), every permutation π\piπ of {0,…,m}\{0,\ldots,m\}{0,…,m}, and every natural number jjj, the definition gives the real number

Rj=1−∑0≤k≤mk<jηπ(k).R_j=1-\sum_{\substack{0\le k\le m\\k<j}}\eta_{\pi(k)}.Rj​=1−0≤k≤mk<j​∑​ηπ(k)​.

There is no assumption that the weights sum to one or at most one, so RjR_jRj​ may be negative. The definition includes m=0m=0m=0 and all jjj: R0=1R_0=1R0​=1, and for j≥m+1j\ge m+1j≥m+1 it equals 1−∑i=0mηi1-\sum_{i=0}^{m}\eta_i1−∑i=0m​ηi​.

QAlgorithms.Papers.Independent.Support50.P48.resourceAmplitude

For every m∈Nm\in\mathbb Nm∈N, every parameter family ppp with nonnegative transmissivities ηi\eta_iηi​ for i<mi<mi<m and ∑i<mηi≤1\sum_{i<m}\eta_i\leq1∑i<m​ηi​≤1, every nonnegative real NNN, and every occupation function ooo on the m+2m+2m+2 labels A,E,Ri\mathsf A,\mathsf E,\mathsf R_iA,E,Ri​—respectively the outer absent label, the outer present and inner absent label, and the doubly present label indexed by iii—put L=1−∑i<mηiL=1-\sum_{i<m}\eta_iL=1−∑i<m​ηi​ and n=oAn=o_{\mathsf A}n=oA​. This defines the real number

{Nn(N+1)n+1 n!oE!∏i<moRi! (L)oE∏i<m(ηi)oRi,oE+∑i<moRi=n,0,oE+∑i<moRi≠n.\begin{cases} \displaystyle \sqrt{\frac{N^n}{(N+1)^{n+1}}}\, \sqrt{\frac{n!}{o_{\mathsf E}!\prod_{i<m}o_{\mathsf R_i}!}}\, (\sqrt L)^{o_{\mathsf E}} \prod_{i<m}(\sqrt{\eta_i})^{o_{\mathsf R_i}}, &\displaystyle o_{\mathsf E}+\sum_{i<m}o_{\mathsf R_i}=n,\\[7pt] 0,&\displaystyle o_{\mathsf E}+\sum_{i<m}o_{\mathsf R_i}\ne n. \end{cases}⎩⎨⎧​(N+1)n+1Nn​​oE​!∏i<m​oRi​​!n!​​(L​)oE​i<m∏​(ηi​​)oRi​​,0,​oE​+i<m∑​oRi​​=n,oE​+i<m∑​oRi​​=n.​

All square roots are real square roots, and powers include 00=10^0=100=1. The case m=0m=0m=0 uses empty products and sums, leaving the condition oE=oAo_{\mathsf E}=o_{\mathsf A}oE​=oA​. When N=0N=0N=0, the value is 111 on the occupation function that is zero everywhere and 000 on every other occupation function.

QAlgorithms.Papers.Independent.Support50.P48.resourceCut

For every natural number mmm, let ηi≥0\eta_i\ge0ηi​≥0 for 0≤i<m0\le i<m0≤i<m satisfy ∑iηi≤1\sum_i\eta_i\le1∑i​ηi​≤1, let N≥0N\ge0N≥0, and let T⊆{0,…,m−1}T\subseteq\{0,\ldots,m-1\}T⊆{0,…,m−1}. Set ℓ=1−∑iηi\ell=1-\sum_i\eta_iℓ=1−∑i​ηi​, and use mode labels A,E,R0,…,Rm−1A,E,R_0,\ldots,R_{m-1}A,E,R0​,…,Rm−1​. For an occupation function xxx on these labels, define the real number

rp,N(x)={Nx(A)(N+1)x(A)+1 x(A)!x(E)!∏i=0m−1x(Ri)! (ℓ)x(E)∏i=0m−1(ηi)x(Ri),x(E)+∑ix(Ri)=x(A),0,otherwise.r_{p,N}(x)= \begin{cases} \displaystyle \sqrt{\frac{N^{x(A)}}{(N+1)^{x(A)+1}}}\, \sqrt{\frac{x(A)!}{x(E)!\prod_{i=0}^{m-1}x(R_i)!}}\, (\sqrt{\ell})^{x(E)} \prod_{i=0}^{m-1}(\sqrt{\eta_i})^{x(R_i)}, &x(E)+\sum_i x(R_i)=x(A),\\ 0,&\text{otherwise}. \end{cases}rp,N​(x)=⎩⎨⎧​(N+1)x(A)+1Nx(A)​​x(E)!∏i=0m−1​x(Ri​)!x(A)!​​(ℓ​)x(E)i=0∏m−1​(ηi​​)x(Ri​),0,​x(E)+∑i​x(Ri​)=x(A),otherwise.​

For a:T→Na:T\to\mathbb Na:T→N, b=(bA,bout)∈N×({i:i∉T}→N)b=(b_A,b_{\mathrm{out}})\in\mathbb N\times(\{i:i\notin T\}\to\mathbb N)b=(bA​,bout​)∈N×({i:i∈/T}→N), and e∈Ne\in\mathbb Ne∈N, let cT,a,b,ec_{T,a,b,e}cT,a,b,e​ assign bAb_AbA​ to AAA, eee to EEE, a(i)a(i)a(i) to RiR_iRi​ in TTT, and bout(i)b_{\mathrm{out}}(i)bout​(i) to the other receiver labels. The definition produces the complex matrix indexed by such pairs (a,b)(a,b)(a,b) whose entries are

Cp,N,T((a,b),(a′,b′))=∑e=0∞rp,N(cT,a,b,e) rp,N(cT,a′,b′,e),C_{p,N,T}\bigl((a,b),(a',b')\bigr) =\sum_{e=0}^{\infty} r_{p,N}(c_{T,a,b,e})\,r_{p,N}(c_{T,a',b',e}),Cp,N,T​((a,b),(a′,b′))=e=0∑∞​rp,N​(cT,a,b,e​)rp,N​(cT,a′,b′,e​),

with the real factors embedded in C\mathbb CC. This is a definition for all the stated inputs, without a summability hypothesis; the formal infinite sum is zero if its summands are not summable. It includes N=0N=0N=0, m=0m=0m=0, and empty TTT or complement, using empty products equal to one and zeroth powers, including 000^000, equal to one.

QAlgorithms.Papers.Independent.Support50.P48.resourceEntropyBits

For every m∈Nm\in\mathbb Nm∈N, every parameter family ppp with nonnegative transmissivities ηi\eta_iηi​ satisfying ∑i<mηi≤1\sum_{i<m}\eta_i\leq1∑i<m​ηi​≤1, every nonnegative real NNN, and every finite subset SSS of the labels M={A,E}∪{Ri:i<m}M=\{\mathsf A,\mathsf E\}\cup\{\mathsf R_i:i<m\}M={A,E}∪{Ri​:i<m}, where these labels are respectively outer absent, outer present with inner absent, and doubly present with index iii, this defines an extended nonnegative real number as follows. Put L=1−∑i<mηiL=1-\sum_{i<m}\eta_iL=1−∑i<m​ηi​ and, for each z:M→Nz:M\to\mathbb Nz:M→N, set

q(z)={NzA(N+1)zA+1 zA!zE!∏i<mzRi! (L)zE∏i<m(ηi)zRi,zE+∑i<mzRi=zA,0,otherwise.q(z)= \begin{cases} \displaystyle \sqrt{\frac{N^{z_{\mathsf A}}}{(N+1)^{z_{\mathsf A}+1}}}\, \sqrt{\frac{z_{\mathsf A}!}{z_{\mathsf E}!\prod_{i<m}z_{\mathsf R_i}!}}\, (\sqrt L)^{z_{\mathsf E}} \prod_{i<m}(\sqrt{\eta_i})^{z_{\mathsf R_i}}, &\displaystyle z_{\mathsf E}+\sum_{i<m}z_{\mathsf R_i}=z_{\mathsf A},\\[7pt] 0,&\text{otherwise}. \end{cases}q(z)=⎩⎨⎧​(N+1)zA​+1NzA​​​zE​!∏i<m​zRi​​!zA​!​​(L​)zE​i<m∏​(ηi​​)zRi​​,0,​zE​+i<m∑​zRi​​=zA​,otherwise.​

For occupations a,b:S→Na,b:S\to\mathbb Na,b:S→N, define the complex matrix

BS(a,b)=∑e:M∖S→Nq(a⊔e) q(b⊔e),B_S(a,b)=\sum_{e:M\setminus S\to\mathbb N}q(a\sqcup e)\,q(b\sqcup e),BS​(a,b)=e:M∖S→N∑​q(a⊔e)q(b⊔e),

where ⊔\sqcup⊔ joins the occupations on the two disjoint sets, the real products are embedded into C\mathbb CC, and the infinite sum is totalized, with value 000 for a nonsummable family. For each finite set KKK of occupations S→NS\to\mathbb NS→N, let CK=(BS(a,b))a,b∈KC_K=(B_S(a,b))_{a,b\in K}CK​=(BS​(a,b))a,b∈K​. The defined value is

1log⁡2 sup⁡K⊆(S→N)K finite[Re⁡(tr⁡CK) log⁡ ⁣(Re⁡(tr⁡CK))−Re⁡ ⁣(tr⁡(CK cfc⁡(log⁡,CK)))]+,\frac{1}{\log 2}\, \sup_{\substack{K\subseteq(S\to\mathbb N)\\K\text{ finite}}} \left[ \operatorname{Re}(\operatorname{tr}C_K)\, \log\!\bigl(\operatorname{Re}(\operatorname{tr}C_K)\bigr) - \operatorname{Re}\!\left(\operatorname{tr}\bigl(C_K\,\operatorname{cfc}(\log,C_K)\bigr)\right) \right]_+,log21​K⊆(S→N)K finite​sup​[Re(trCK​)log(Re(trCK​))−Re(tr(CK​cfc(log,CK​)))]+​,

where [x]+=max⁡{x,0}[x]_+=\max\{x,0\}[x]+​=max{x,0} is regarded as an extended nonnegative real, cfc⁡(log⁡,CK)\operatorname{cfc}(\log,C_K)cfc(log,CK​) is the continuous functional calculus expression for the real natural logarithm, and the supremum and division are in the extended nonnegative reals. The real logarithm is totalized, in particular log⁡0=0\log0=0log0=0. The supremum includes the empty KKK, and its value may be +∞+\infty+∞. The definition includes m=0m=0m=0, S=∅S=\varnothingS=∅, N=0N=0N=0, and zero transmissivities, using empty products equal to 111, empty sums equal to 000, and 00=10^0=100=1.

QAlgorithms.Papers.Independent.Support50.P48.reverseCutYield

For every m∈Nm\in\mathbb Nm∈N, every parameter family ppp with nonnegative transmissivities ηi\eta_iηi​ satisfying ∑i<mηi≤1\sum_{i<m}\eta_i\leq1∑i<m​ηi​≤1, every nonnegative real NNN, and every finite subset T⊆{0,…,m−1}T\subseteq\{0,\ldots,m-1\}T⊆{0,…,m−1}, this defines a real number using the distinct labels M={A,E}∪{Ri:i<m}M=\{\mathsf A,\mathsf E\}\cup\{\mathsf R_i:i<m\}M={A,E}∪{Ri​:i<m}, corresponding respectively to the outer absent, outer present and inner absent, and doubly present labels. Put L=1−∑i<mηiL=1-\sum_{i<m}\eta_iL=1−∑i<m​ηi​, and for z:M→Nz:M\to\mathbb Nz:M→N put

q(z)={NzA(N+1)zA+1 zA!zE!∏i<mzRi! (L)zE∏i<m(ηi)zRi,zE+∑i<mzRi=zA,0,otherwise.q(z)= \begin{cases} \displaystyle \sqrt{\frac{N^{z_{\mathsf A}}}{(N+1)^{z_{\mathsf A}+1}}}\, \sqrt{\frac{z_{\mathsf A}!}{z_{\mathsf E}!\prod_{i<m}z_{\mathsf R_i}!}}\, (\sqrt L)^{z_{\mathsf E}} \prod_{i<m}(\sqrt{\eta_i})^{z_{\mathsf R_i}}, &\displaystyle z_{\mathsf E}+\sum_{i<m}z_{\mathsf R_i}=z_{\mathsf A},\\[7pt] 0,&\text{otherwise}. \end{cases}q(z)=⎩⎨⎧​(N+1)zA​+1NzA​​​zE​!∏i<m​zRi​​!zA​!​​(L​)zE​i<m∏​(ηi​​)zRi​​,0,​zE​+i<m∑​zRi​​=zA​,otherwise.​

For each subset U⊆MU\subseteq MU⊆M, define BU(a,b)=∑e:M∖U→Nq(a⊔e)q(b⊔e)B_U(a,b)=\sum_{e:M\setminus U\to\mathbb N}q(a\sqcup e)q(b\sqcup e)BU​(a,b)=∑e:M∖U→N​q(a⊔e)q(b⊔e) for occupations a,b:U→Na,b:U\to\mathbb Na,b:U→N, where ⊔\sqcup⊔ combines occupations on disjoint sets and the sum is the totalized complex infinite sum, equal to 000 if its family is not summable. For a finite set KKK of occupations on UUU, write CU,K=(BU(a,b))a,b∈KC_{U,K}=(B_U(a,b))_{a,b\in K}CU,K​=(BU​(a,b))a,b∈K​, and define

H(U)=1log⁡2sup⁡K⊆(U→N)K finite[Re⁡(tr⁡CU,K) log⁡ ⁣(Re⁡(tr⁡CU,K))−Re⁡ ⁣(tr⁡(CU,Kcfc⁡(log⁡,CU,K)))]+.H(U)=\frac{1}{\log2} \sup_{\substack{K\subseteq(U\to\mathbb N)\\K\text{ finite}}} \left[ \operatorname{Re}(\operatorname{tr}C_{U,K})\, \log\!\bigl(\operatorname{Re}(\operatorname{tr}C_{U,K})\bigr) - \operatorname{Re}\!\left( \operatorname{tr}\bigl(C_{U,K}\operatorname{cfc}(\log,C_{U,K})\bigr) \right) \right]_+.H(U)=log21​K⊆(U→N)K finite​sup​[Re(trCU,K​)log(Re(trCU,K​))−Re(tr(CU,K​cfc(log,CU,K​)))]+​.

Here [x]+=max⁡{x,0}[x]_+=\max\{x,0\}[x]+​=max{x,0} is embedded into the extended nonnegative reals, cfc⁡\operatorname{cfc}cfc denotes continuous functional calculus for the real natural logarithm, and the supremum and division defining HHH take place in the extended nonnegative reals. The real number defined by the declaration is

r ⁣(H({A}∪{Ri:i<m, i∉T}))−r ⁣(H({A}∪{Ri:i<m})),r\!\left(H\bigl(\{\mathsf A\}\cup\{\mathsf R_i:i<m,\ i\notin T\}\bigr)\right) - r\!\left(H\bigl(\{\mathsf A\}\cup\{\mathsf R_i:i<m\}\bigr)\right),r(H({A}∪{Ri​:i<m, i∈/T}))−r(H({A}∪{Ri​:i<m})),

where rrr sends a finite extended nonnegative real to its real value and sends +∞+\infty+∞ to 000. Thus the subtraction uses these real conversions even when an entropy is infinite. All finite subsets KKK, including the empty set, enter the suprema; empty products and sums are 111 and 000, 00=10^0=100=1, and log⁡0=0\log0=0log0=0. The cases m=0m=0m=0, N=0N=0N=0, and zero transmissivities are included. For T=∅T=\varnothingT=∅, including necessarily when m=0m=0m=0, the two converted quantities coincide and the defined value is 000.

QAlgorithms.Papers.Independent.Support50.P48.sequentialAmplitude

For every natural number mmm, every real-valued function ttt on {0,…,m−1}\{0,\ldots,m-1\}{0,…,m−1}, every permutation π\piπ of {0,…,m}\{0,\ldots,m\}{0,…,m}, every occupation function o:{0,…,m}→No:\{0,\ldots,m\}\to\mathbb No:{0,…,m}→N, and every n∈Nn\in\mathbb Nn∈N, put Ej=∑0≤k<joπ(k)E_j=\sum_{0\le k<j}o_{\pi(k)}Ej​=∑0≤k<j​oπ(k)​ for 0≤j<m0\le j<m0≤j<m. The definition gives the real amplitude

At,π(o,n)={∏j=0m−1( n−˙Ej oπ(j)) (1−tj)oπ(j) (tj)(n−˙Ej)−˙oπ(j),∑i=0moi=n,0,otherwise,A_{t,\pi}(o,n)= \begin{cases} \displaystyle \prod_{j=0}^{m-1} \sqrt{\binom{\,n\mathbin{\dot-}E_j\,}{o_{\pi(j)}}}\, \bigl(\sqrt{1-t_j}\bigr)^{o_{\pi(j)}}\, \bigl(\sqrt{t_j}\bigr)^{ (n\mathbin{\dot-}E_j)\mathbin{\dot-}o_{\pi(j)}}, &\sum_{i=0}^{m}o_i=n,\\ 0,&\text{otherwise}, \end{cases}At,π​(o,n)=⎩⎨⎧​j=0∏m−1​(oπ(j)​n−˙​Ej​​)​(1−tj​​)oπ(j)​(tj​​)(n−˙​Ej​)−˙​oπ(j)​,0,​∑i=0m​oi​=n,otherwise,​

where a−˙b=max⁡(a−b,0)a\mathbin{\dot-}b=\max(a-b,0)a−˙​b=max(a−b,0) is subtraction in N\mathbb NN, and a binomial coefficient is zero when its lower argument exceeds its upper argument. No assumption 0≤tj≤10\le t_j\le10≤tj​≤1 is imposed: the real square root is zero on negative inputs. Zeroth powers are one, including 000^000. When m=0m=0m=0, the product is empty, so the amplitude is one if o0=no_0=no0​=n and zero otherwise.

QAlgorithms.Papers.Independent.Support50.P48.subsystem

For any type JJJ, any finite subset S⊆JS\subseteq JS⊆J, and any complex matrix XXX indexed by all functions J→NJ\to\mathbb NJ→N, this defines a complex matrix indexed by functions S→NS\to\mathbb NS→N. For a,b:S→Na,b:S\to\mathbb Na,b:S→N and e:J∖S→Ne:J\setminus S\to\mathbb Ne:J∖S→N, let a⊔ea\sqcup ea⊔e be the function on JJJ equal to aaa on SSS and to eee outside SSS, and define b⊔eb\sqcup eb⊔e similarly. The entry at a,ba,ba,b is

∑e:J∖S→NXa⊔e,  b⊔e,\sum_{e:J\setminus S\to\mathbb N}X_{a\sqcup e,\;b\sqcup e},e:J∖S→N∑​Xa⊔e,b⊔e​,

where this is the totalized infinite sum over all such functions eee. There are no finiteness or countability assumptions on JJJ, and no summability, positivity, or normalization assumptions on XXX; for a nonsummable family of complex entries, the totalized sum is 000. If SSS is empty, the resulting matrix has one entry, namely the totalized sum of all diagonal entries of XXX. If SSS contains every element of JJJ, the complement has a unique occupation function, and the formula recovers XXX under the natural identification of indices.

QAlgorithms.Papers.Independent.Support50.P48.tmsvWeight

For every nonnegative real number NNN and natural number nnn, this defines the real number

Nn(N+1)n+1.\frac{N^n}{(N+1)^{n+1}}.(N+1)n+1Nn​.

The denominator is strictly positive. The value at n=0n=0n=0 is 1/(N+1)1/(N+1)1/(N+1); when N=0N=0N=0, the value is 111 at n=0n=0n=0 and 000 at every positive nnn, using 00=10^0=100=1.

QAlgorithms.Papers.Independent.Support50.P48.vacuumAmplitude

For any type JJJ equipped with a finite enumeration, any nonnegative real weights (ηi)i∈J(\eta_i)_{i\in J}(ηi​)i∈J​, any occupation function o:J→No:J\to\mathbb No:J→N, and any n∈Nn\in\mathbb Nn∈N, this defines the real number

{n!∏i∈Joi! ∏i∈J(ηi)oi,∑i∈Joi=n,0,∑i∈Joi≠n.\begin{cases} \displaystyle \sqrt{\frac{n!}{\prod_{i\in J}o_i!}}\, \prod_{i\in J}\bigl(\sqrt{\eta_i}\bigr)^{o_i}, & \displaystyle\sum_{i\in J}o_i=n,\\[6pt] 0,&\displaystyle\sum_{i\in J}o_i\ne n. \end{cases}⎩⎨⎧​∏i∈J​oi​!n!​​i∈J∏​(ηi​​)oi​,0,​i∈J∑​oi​=n,i∈J∑​oi​=n.​

There is no assumption that the weights sum to one or are individually at most one. Empty sums and products are respectively 000 and 111, so when JJJ is empty the value is 111 for n=0n=0n=0 and 000 otherwise. Powers use the convention 00=10^0=100=1; in particular, when every occupation and nnn are zero, the value is 111 even if some weights vanish. The factorial denominator is always positive.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

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

  • Endorsed by Gohan · Oct 29, 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