Definitions for Distributed Compression and Multiparty Squashed Entanglement
DefinitionQAlgorithms_Papers_Independent_Support50_P09The objects the formalized statements of Distributed Compression and Multiparty Squashed Entanglement (arXiv:0707.2792) are stated in. Each was checked against the paper by a blind read-back and a moderator.
SenderBlock: PDF pp.2–3: sender blocks, with arbitrary finite local dimensions.blockInput: PDF p.3, (1): n independent copies, ordered as reference then sender blocks.independentEncoders: PDF pp.2–3: tensor product of independent local encoders, on matrix units. Each encoder acts on its sender's entire n-copy block; no shared ancilla is supplied.MultipartyCompressionCode: Definition II.1, PDF p.3: one compression code, with the reference untouched. log2(c_i) <= n Q_i expresses an available dimension budget; smaller outputs can be padded. Integer dimensions avoid the printed idealization 2^(n Q_i).multipartyAchievable: Definition II.1, PDF p.3: all sufficiently large positive blocklengths, with no rate slack inside this set; success is squared pure-state fidelity.multipartyCompressionRegion: Definition II.1, PDF p.3: the closed operational rate region.entropyThreshold: PDF p.7, (7): C_K, with the factor 1/2 on the entire entropy expression.SelectedDims: PDF pp.6,15: local dimensions of the actual selected marginal, in increasing order.selectedState: PDF p.6, (6): trace out the reference and all senders outside K, then reindex. No independently chosen extension or entropy property is assumed.subsetSquashed: PDF p.6, (6), and Definition V.1, pp.15–16: the half-infimum over ALL finite extension dimensions of the actual A_K marginal. The empty-party measure is zero; nonempty one-party inputs use the entropy definition itself.entropyPolyhedron: PDF p.9, (15): the entropy halfspace polyhedron P_H.outerPolyhedron: PDF p.6, (6): the outer family; E_sq is outside the factor 1/2.senderSuffix: PDF pp.7–9: last l senders of one fixed permutation, including l=0.compressionCorner: Definition III.1, PDF p.7: the rate at pi(j) is half its mutual information with R and the STRICTLY LATER senders.compressionCorners: Definition III.1, PDF p.7: set of corner rates; coincidences are allowed.positiveCone: PDF p.9, (13): the resource-wasting cone.vertexPolyhedron: PDF p.9, (14): convex combinations of corners plus arbitrary resource wasting.rateRecession: PDF p.13, Step 3: recession directions, at every feasible point and all t>=0.IsMaximalChain: PDF p.12, (28): m strict inclusions from empty to the full sender set.chainEquations: PDF p.12, (27): the m NONEMPTY chain equations.localMarginal: PDF pp.13–14: single-party partial trace in the original local basis.productOfMarginals: PDF p.14: product of rho's OWN marginals, not a freely chosen product state.stateMixture: PDF p.17, (53): the specified convex mixture.continuityModulus: PDF p.19, (67): the printed modulus, using FULL trace norm (p.2,(66)). The theorem restricts 2 sqrt(eps)<=1; no extension dimension appears.
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P33
/-! Avis, Hayden and Savov, arXiv:0707.2792v2.
All systems are finite and nonzero, and entropies are in bits.
The imported halfExtensionSquashed .total is exactly Definition V.1.
Compilation is pending the separately scheduled mechanical compilation stage. -/
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P09
open QAlgorithms.Papers.Independent.Claimed50.P33
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.2–3: sender blocks, with arbitrary finite local dimensions. -/
abbrev SenderBlock {m : ℕ} (D : Fin m → Type) (n : ℕ) :=
(i : Fin m) → Fin n → D i
/-- PDF p.3, (1): n independent copies, ordered as reference then sender blocks. -/
def blockInput {m : ℕ} {D : Fin m → Type} {R : Type}
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) (n : ℕ) :
Matrix ((Fin n → R) × SenderBlock D n) ((Fin n → R) × SenderBlock D n) ℂ :=
fun a b => ∏ t, rho ((fun i => a.2 i t),a.1 t) ((fun i => b.2 i t),b.1 t)
/-- PDF pp.2–3: tensor product of independent local encoders, on matrix units.
Each encoder acts on its sender's entire n-copy block; no shared ancilla is supplied. -/
def independentEncoders {m n : ℕ} {D C : Fin m → Type} [∀ i, Fintype (D i)]
(enc : (i : Fin m) → Superop (Fin n → D i) (C i)) :
Superop (SenderBlock D n) (RegisterBasis C) :=
fun M a b => ∑ x : SenderBlock D n, ∑ y : SenderBlock D n,
M x y * ∏ i, enc i (Matrix.single (x i) (y i) 1) (a i) (b i)
/-- Definition II.1, PDF p.3: one compression code, with the reference untouched.
log2(c_i) <= n Q_i expresses an available dimension budget; smaller outputs can
be padded. Integer dimensions avoid the printed idealization 2^(n Q_i). -/
def MultipartyCompressionCode {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(n : ℕ) (Q : Fin m → ℝ) (eps : ℝ) : Prop :=
∃ c : Fin m → ℕ, (∀ i, 0 < c i) ∧
(∀ i, Real.logb 2 (c i) ≤ (n : ℝ) * Q i) ∧
∃ enc : (i : Fin m) → Superop (Fin n → D i) (Fin (c i)),
(∀ i, IsChannel (enc i)) ∧
∃ dec : Superop (RegisterBasis (fun i => Fin (c i))) (SenderBlock D n),
IsChannel dec ∧
1 - eps ≤ ((blockInput rho n) *
idTensorSuperop (dec ∘ independentEncoders enc) (blockInput rho n)).trace.re
/-- Definition II.1, PDF p.3: all sufficiently large positive blocklengths,
with no rate slack inside this set; success is squared pure-state fidelity. -/
def multipartyAchievable {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) : Set (Fin m → ℝ) :=
{Q | (∀ i, 0 ≤ Q i) ∧ ∀ eps : ℝ, 0 < eps → ∃ N : ℕ,
∀ n : ℕ, N ≤ n → 0 < n → MultipartyCompressionCode rho n Q eps}
/-- Definition II.1, PDF p.3: the closed operational rate region. -/
def multipartyCompressionRegion {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) : Set (Fin m → ℝ) :=
closure (multipartyAchievable rho)
/-- PDF p.7, (7): C_K, with the factor 1/2 on the entire entropy expression. -/
def entropyThreshold {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(K : Finset (Fin m)) : ℝ :=
((∑ i ∈ K, entropyAt (trivialExtension (forgetEnvironment rho)) {i}) +
vnEntropy (traceLeft rho) - entropyAt rho K) / 2
/-- PDF pp.6,15: local dimensions of the actual selected marginal, in increasing order. -/
abbrev SelectedDims {m : ℕ} (D : Fin m → Type) (K : Finset (Fin m)) :=
fun j : Fin K.card => D ((K.orderIsoOfFin rfl) j).val
/-- PDF p.6, (6): trace out the reference and all senders outside K, then reindex.
No independently chosen extension or entropy property is assumed. -/
def selectedState {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(K : Finset (Fin m)) :
Matrix (RegisterBasis (SelectedDims D K)) (RegisterBasis (SelectedDims D K)) ℂ :=
fun a b => forgetEnvironment (registerMarginal rho K)
(fun i => cast (congrArg (fun j : {j : Fin m // j ∈ K} => D j.val)
((K.orderIsoOfFin rfl).apply_symm_apply i)) (a ((K.orderIsoOfFin rfl).symm i)))
(fun i => cast (congrArg (fun j : {j : Fin m // j ∈ K} => D j.val)
((K.orderIsoOfFin rfl).apply_symm_apply i)) (b ((K.orderIsoOfFin rfl).symm i)))
/-- PDF p.6, (6), and Definition V.1, pp.15–16: the half-infimum over ALL
finite extension dimensions of the actual A_K marginal. The empty-party
measure is zero; nonempty one-party inputs use the entropy definition itself. -/
def subsetSquashed {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(K : Finset (Fin m)) : ℝ :=
if K = ∅ then 0 else halfExtensionSquashed .total (selectedState rho K)
/-- PDF p.9, (15): the entropy halfspace polyhedron P_H. -/
def entropyPolyhedron {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) : Set (Fin m → ℝ) :=
{Q | ∀ K : Finset (Fin m), entropyThreshold rho K ≤ ∑ i ∈ K, Q i}
/-- PDF p.6, (6): the outer family; E_sq is outside the factor 1/2. -/
def outerPolyhedron {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) : Set (Fin m → ℝ) :=
{Q | ∀ K : Finset (Fin m),
entropyThreshold rho K - subsetSquashed rho K ≤ ∑ i ∈ K, Q i}
/-- PDF pp.7–9: last l senders of one fixed permutation, including l=0. -/
def senderSuffix {m : ℕ} (pi : Equiv.Perm (Fin m)) (l : ℕ) : Finset (Fin m) :=
(Finset.univ.filter fun j : Fin m => m ≤ j.val + l).image pi
/-- Definition III.1, PDF p.7: the rate at pi(j) is half its mutual information
with R and the STRICTLY LATER senders. -/
def compressionCorner {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(pi : Equiv.Perm (Fin m)) : Fin m → ℝ :=
fun i =>
let later := (Finset.univ.filter fun j : Fin m => (pi.symm i).val < j.val).image pi
(entropyAt (trivialExtension (forgetEnvironment rho)) {i} +
entropyAt rho later - entropyAt rho (insert i later)) / 2
/-- Definition III.1, PDF p.7: set of corner rates; coincidences are allowed. -/
def compressionCorners {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) : Set (Fin m → ℝ) :=
Set.range (compressionCorner rho)
/-- PDF p.9, (13): the resource-wasting cone. -/
def positiveCone (m : ℕ) : Set (Fin m → ℝ) := {v | ∀ i, 0 ≤ v i}
/-- PDF p.9, (14): convex combinations of corners plus arbitrary resource wasting. -/
def vertexPolyhedron {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) : Set (Fin m → ℝ) :=
{Q | ∃ x ∈ convexHull ℝ (compressionCorners rho), ∃ v ∈ positiveCone m, Q = x + v}
/-- PDF p.13, Step 3: recession directions, at every feasible point and all t>=0. -/
def rateRecession {m : ℕ} (P : Set (Fin m → ℝ)) : Set (Fin m → ℝ) :=
{v | ∀ x ∈ P, ∀ t : ℝ, 0 ≤ t → x + t • v ∈ P}
/-- PDF p.12, (28): m strict inclusions from empty to the full sender set. -/
def IsMaximalChain {m : ℕ} (K : Fin (m+1) → Finset (Fin m)) : Prop :=
K 0 = ∅ ∧ K ⟨m,Nat.lt_succ_self m⟩ = Finset.univ ∧
∀ j : Fin m, K j.castSucc ⊂ K j.succ
/-- PDF p.12, (27): the m NONEMPTY chain equations. -/
def chainEquations {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
{R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(K : Fin (m+1) → Finset (Fin m)) (Q : Fin m → ℝ) : Prop :=
∀ j : Fin m, (∑ i ∈ K j.succ, Q i) = entropyThreshold rho (K j.succ)
/-- PDF pp.13–14: single-party partial trace in the original local basis. -/
def localMarginal {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (i : Fin m) :
Matrix (D i) (D i) ℂ :=
fun a b => ∑ x : RegisterBasis D, ∑ y : RegisterBasis D,
if x i = a ∧ y i = b ∧ (∀ j, j ≠ i → x j = y j) then rho x y else 0
/-- PDF p.14: product of rho's OWN marginals, not a freely chosen product state. -/
def productOfMarginals {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) :
Matrix (RegisterBasis D) (RegisterBasis D) ℂ :=
fun a b => ∏ i, localMarginal rho i (a i) (b i)
/-- PDF p.17, (53): the specified convex mixture. -/
def stateMixture {I : Type} (lambda : ℝ) (rho sigma : Matrix I I ℂ) : Matrix I I ℂ :=
(lambda : ℂ) • rho + ((1-lambda : ℝ) : ℂ) • sigma
/-- PDF p.19, (67): the printed modulus, using FULL trace norm (p.2,(66)).
The theorem restricts 2 sqrt(eps)<=1; no extension dimension appears. -/
def continuityModulus {m : ℕ} (D : Fin m → Type) [∀ i, Fintype (D i)] (eps : ℝ) : ℝ :=
16 * Real.sqrt eps * Real.logb 2 (∏ i, (Fintype.card (D i) : ℝ)) +
((m : ℝ)+1) * 2 * binEntropy2 (2 * Real.sqrt eps)
/-! Small sanity examples for the new constructions; no target theorem is proved. -/
example {m : ℕ} {D : Fin m → Type} {R : Type}
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ)
(a b : (Fin 0 → R) × SenderBlock D 0) : blockInput rho 0 a b = 1 := by
simp [blockInput]
example {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)] {R : Type} [Fintype R]
(rho : Matrix (RegisterBasis D × R) (RegisterBasis D × R) ℂ) :
subsetSquashed rho ∅ = 0 := by simp [subsetSquashed]
example {m : ℕ} (pi : Equiv.Perm (Fin m)) : senderSuffix pi 0 = ∅ := by
apply Finset.eq_empty_iff_forall_notMem.mpr
intro i hi
obtain ⟨j,hj,_⟩ := Finset.mem_image.mp hi
have h := (Finset.mem_filter.mp hj).2
exact (Nat.not_le.mpr j.isLt) (by simpa using h)
example {I : Type} (rho sigma : Matrix I I ℂ) : stateMixture 0 rho sigma = sigma := by
simp [stateMixture]
example {m : ℕ} {Q : Fin m → ℝ} : Q ∈ positiveCone m ↔ ∀ i, 0 ≤ Q i := Iff.rfl
example {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (a b : RegisterBasis D) :
productOfMarginals rho a b = ∏ i, localMarginal rho i (a i) (b i) := rfl
section Compression
variable {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)] [hD : ∀ i, Nonempty (D i)]
variable {R : Type} [Fintype R] [hR : Nonempty R]
variable (phi : EuclideanSpace ℂ (RegisterBasis D × R)) (hphi : ‖phi‖ = 1)
include hphi hD hR
end Compression
end QAlgorithms.Papers.Independent.Support50.P09
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P09.IsMaximalChain
For every natural number and sequence of subsets of , this predicate means
Each inclusion is strict. When , there are no inclusion conditions, and the predicate requires the sole set to be empty.
QAlgorithms.Papers.Independent.Support50.P09.MultipartyCompressionCode
For any natural number , finite types indexed by , finite type , arbitrary complex matrix indexed by , natural number , real vector , and real number , this predicate asserts that there are positive integers satisfying , channels , and a channel , such that
Here a channel from a finite basis to a finite basis means a matrix function of the form for some natural number , with ; , where and is the matrix unit; and
For any matrix function , the displayed extension acts by . No density-matrix assumption on , restriction on , or positivity assumption on is included. The finite bases may be empty, and and are included; for , is the one-entry matrix .
QAlgorithms.Papers.Independent.Support50.P09.SelectedDims
For any natural number , family of types indexed by , and subset , let be the increasing enumeration of , where . The selected family is the family of types indexed by whose -th type is . No finiteness or nonemptiness assumptions are imposed on the types . If , this is a family with no indices.
QAlgorithms.Papers.Independent.Support50.P09.SenderBlock
For any natural numbers and any family of types , indexed by , the sender block is the type
Thus an element assigns a value in to every sender and every position . The types need not be finite or nonempty. If or , this type has exactly one element.
QAlgorithms.Papers.Independent.Support50.P09.blockInput
For any natural number , family of types indexed by , type , complex matrix indexed by , and natural number , define a complex matrix indexed by as follows: writing its row and column indices as and , respectively,
No finiteness, nonemptiness, positivity, or normalization assumptions are imposed on these types or on . When , the indexing type is a singleton and the sole matrix entry is the empty product .
QAlgorithms.Papers.Independent.Support50.P09.chainEquations
For every natural number , family of finite types , finite type , arbitrary complex matrix indexed by , sequence of subsets of the indices, and real vector , this predicate requires, for every ,
Here , with ranging over assignments to coordinates outside ; ; and . The functional is , where is applied through real continuous functional calculus. There is no requirement that be a density matrix, that the finite types be nonempty, that be nonnegative, or that be a maximal chain. The value is unused, and when the predicate is vacuously true.
QAlgorithms.Papers.Independent.Support50.P09.compressionCorner
For every natural number , family of finite types , finite type , arbitrary complex matrix indexed by , and permutation of , this defines a real vector with coordinate
Here retains the coordinates in and the register : its entry at is
where combines the assignments on and its complement; . The functional means , with applied through the real continuous functional calculus; adjoining a one-element register to leaves the displayed indexing interpretation unchanged. No positivity, Hermiticity, or trace-one assumption on , and no nonemptiness assumption on the finite types, is imposed. Empty sums are zero; for , the result is the unique vector with no coordinates.
QAlgorithms.Papers.Independent.Support50.P09.compressionCorners
For every natural number , family of finite types , finite type , and arbitrary complex matrix indexed by , this defines the set of real vectors
For a subset , the matrix has entries , where , , and ranges over assignments to the complementary coordinates; . Here , using real continuous functional calculus with . The set contains the vectors obtained from all permutations, without requiring distinct permutations to give distinct vectors. The matrix need not be a density matrix, and the finite types may be empty. When , this is the singleton containing the unique vector with no coordinates.
QAlgorithms.Papers.Independent.Support50.P09.continuityModulus
For every natural number , family of finite types , and arbitrary real number , this defines
Here , using the total real logarithm, with and for negative . No positivity of or nonemptiness of the finite types is assumed, and need not lie in . The real square root is zero for , giving value zero in that case. An empty factor type makes the product zero and hence the logarithmic term zero; when , the empty product is and the value is .
QAlgorithms.Papers.Independent.Support50.P09.entropyPolyhedron
For any natural number , finite types indexed by , finite type , and arbitrary complex matrix indexed by , this is the set of real vectors satisfying, for every subset ,
Here is obtained by summing over equal reference indices and equal indices of all sender factors except ; sums over equal indices of all sender factors; and sums over equal indices of sender factors outside , retaining the reference. Explicitly, its entry at sums over , , and . The entropy is . No density-matrix, nonemptiness, or separate coordinatewise nonnegativity assumptions are imposed. The empty-subset inequality is , and is allowed.
QAlgorithms.Papers.Independent.Support50.P09.entropyThreshold
For any natural number , finite types indexed by , finite type , complex matrix indexed by , and subset , define
Here ; is the sum of over all with , , and for every ; and is the sum of over restricting to on and agreeing outside . The entropy used here is the total matrix expression , with denoting the continuous functional calculus. No positivity, normalization, or nonemptiness assumptions are imposed. The empty subset is included and gives .
QAlgorithms.Papers.Independent.Support50.P09.independentEncoders
For any natural numbers , finite types and arbitrary types indexed by , and functions from complex matrices indexed by to complex matrices indexed by , define a function from complex matrices indexed by to complex matrices indexed by by
where is the matrix with entry at and elsewhere. The supplied functions are not assumed to be linear or channels. The finite types may be empty, and may be zero; all sums and products use their usual empty-index conventions.
QAlgorithms.Papers.Independent.Support50.P09.localMarginal
For every natural number , family of finite types , arbitrary complex matrix indexed by , and index , this defines the complex matrix on whose entry at is
No density-matrix assumption is imposed, and the finite types may be empty; empty sums contribute zero. An index cannot be supplied when .
QAlgorithms.Papers.Independent.Support50.P09.multipartyAchievable
For any natural number , finite types indexed by , finite type , and arbitrary complex matrix indexed by , this is the set of real vectors with for every such that, for every real , there is a natural number for which every natural number with admits positive integers , channels , and a channel , satisfying
Here , and , with the matrix unit. The extension applies separately to each matrix block with fixed reference row and column. Each channel is required to have a finite Kraus representation with . The choices may depend on and ; no density-matrix or nonemptiness assumptions are imposed on or its bases, is allowed, and block length is excluded from the eventual requirement.
QAlgorithms.Papers.Independent.Support50.P09.multipartyCompressionRegion
For any natural number , finite types indexed by , finite type , and arbitrary complex matrix indexed by , this region is the closure in of the following set : a vector lies in exactly when every and, for every , all sufficiently large positive integers admit positive integers , channels , and a channel , for which
The matrix has entries , and , where is the matrix unit. The reference extension applies the indicated matrix function to each block with fixed reference indices. A channel is a function with finitely many Kraus matrices and . Equivalently, every neighborhood of a vector in this region meets . No density-matrix or nonemptiness assumptions are imposed, and is included.
QAlgorithms.Papers.Independent.Support50.P09.outerPolyhedron
For any natural number , finite types indexed by , finite type , and arbitrary complex matrix indexed by , this is the set of real vectors satisfying, for every subset ,
The matrices are obtained by summing over equal row and column indices of the discarded factors, retaining respectively sender , the reference , and the senders in together with . Set ; for nonempty , set
where , with its sender factors ordered increasingly, and is indexed by . Its marginals retain the indicated factors, and its extensions need not be classical. Throughout, ; an infimum over no admissible extensions is . No density-matrix or nonemptiness assumptions on the original input, or separate coordinatewise nonnegativity condition on , are imposed. The empty-subset inequality is , and is included.
QAlgorithms.Papers.Independent.Support50.P09.positiveCone
For every natural number , this defines the set
Zero coordinates are permitted. When , the condition is vacuous, so the set contains the unique vector with no coordinates.
QAlgorithms.Papers.Independent.Support50.P09.productOfMarginals
For every natural number , family of finite types , and arbitrary complex matrix indexed by , this defines the matrix whose entry at assignments is
Thus each factor is obtained by summing entries with all coordinates other than equal. No positivity or trace normalization is assumed, and the finite types need not be nonempty. When , the assignment type has one element and the empty product is , so the resulting one-by-one matrix has entry , independently of .
QAlgorithms.Papers.Independent.Support50.P09.rateRecession
For every natural number and arbitrary set , this defines
No convexity, closedness, or nonemptiness of is required. In particular, if , every vector satisfies the condition vacuously. When , the resulting set contains the unique vector with no coordinates, regardless of .
QAlgorithms.Papers.Independent.Support50.P09.selectedState
For any natural number , finite types indexed by , finite type , arbitrary complex matrix indexed by , and subset , enumerate increasingly as . The selected matrix , indexed by , is defined by
Thus it sums over the reference index and matching indices outside , and orders the retained indices increasingly. No positivity or normalization of , or nonemptiness of the finite types, is assumed. For , the resulting matrix has a singleton indexing type and its sole entry is .
QAlgorithms.Papers.Independent.Support50.P09.senderSuffix
For every natural number , permutation of , and natural number , this defines the finite set
Thus gives the empty set, selects the images of the last indices, and gives all indices. When , the set is empty for every .
QAlgorithms.Papers.Independent.Support50.P09.stateMixture
For every type , real number , and pair of complex matrices indexed by , this defines the matrix
with the real coefficients regarded as complex scalars; its entry is . The type need not be finite or nonempty, the matrices need not be density matrices, and is not required to lie in .
QAlgorithms.Papers.Independent.Support50.P09.subsetSquashed
For any natural number , finite types indexed by , finite type , arbitrary complex matrix indexed by , and subset , this quantity is if ; otherwise, writing , it is
where , is indexed by , and is the sum of over and with , , and outside . Each marginal in the infimum sums over equal row and column indices of the discarded factors, retaining . The entropy is . The extensions are not required to be classical. No density-matrix or nonemptiness assumptions are imposed on the original input; if there are no admissible extensions, the real infimum used by the definition is .
QAlgorithms.Papers.Independent.Support50.P09.vertexPolyhedron
For every natural number , family of finite types , finite type , and arbitrary complex matrix indexed by , this defines the set of vectors admitting a representation
where each is a permutation of the indices and
For every subset , , summing over assignments to coordinates outside , and . The notation denotes for , evaluated by real continuous functional calculus. Thus the definition uses finite convex combinations of the permutation-indexed vectors and adds an arbitrary coordinatewise nonnegative vector; it does not take an additional closure. No density-matrix or nonemptiness assumptions are imposed. For , the set contains the unique vector with no coordinates.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.