Definitions for Convex Hulls of Varieties and Entanglement Measures Based on the Roof Construction
DefinitionQAlgorithms_Papers_Independent_Support50_P35The objects the formalized statements of Convex Hulls of Varieties and Entanglement Measures Based on the Roof Construction (arXiv:quant-ph/0402055) are stated in. Each was checked against the paper by a blind read-back and a moderator.
FiniteConvexDecomposition: PDF p.4, Eqs.(2)--(3): every positive finite length, nonnegative weights, unit total weight, prescribed barycenter. No dimension-dependent truncation.roofValues: PDF p.4: the set of all feasible average costs, using actual finite sums.lowerRoof: PDF p.4, Eq.(2). On empty or unbounded-below cost sets, real sInf has its totalized default value; results below use compact continuous data.upperRoof: PDF p.4, Eq.(3). Results below have nonempty, bounded feasible cost sets.graphOn: PDF p.5, Eq.(4): no closure is taken.tangentDirections: PDF pp.6--7: tangent directions, realized as the span of velocities of curves staying in M near zero. For a C1 embedded manifold without boundary this is its ordinary tangent space in the ambient real vector space.IsEmbeddedDim: PDF pp.6--7: a C1 embedded manifold without boundary, in its subspace topology. The inclusion is an immersion in standard boundaryless real models.IsNonsingularVariety: PDF p.3: algebraic, irreducible, nonsingular embedded real variety. Irreducibility uses the prime ideal of all polynomials vanishing on V; nonsingularity requires the Zariski tangent dimension to equal the manifold dimension at every point, rather than a chosen equation list's Jacobian rank.normalMap: PDF p.7: normal functional of a hyperplane.Hyperplane: PDF p.7: a genuine affine hyperplane, with nonzero normal.Hyperplane.points: PDF p.7: the affine set of points, distinguished from its direction space.Hyperplane.direction: PDF p.7: the translated linear space parallel to H.IsMTangent: PDF p.7, Definition 2.5: contact and containment of all tangent directions.ContainsInHalfspace: PDF p.7: the oriented closed halfspace contains all of M. Contact points are supplied separately, so this also expresses membership in the source's Omega.cubicGraph: PDF pp.4,10: the graph of x^3 over the circle, in the true lifted ambient R3.circle: PDF p.4, Figure 1: the base circle and its cubic cost.cubicCost: PDF p.4: cubic-circle cost.PairIndex: PDF pp.11--12: the unordered off-diagonal labels, enumerated once with a<b.TracelessIndex: PDF pp.11--12: diagonal labels a=2,...,D (stored as a-1), and the two off-diagonal families. false is symmetric; true is antisymmetric.FullIndex: PDF p.12: none is the identity label 0; some labels are traceless.normOneGellmannGenerator: PDF pp.11--12, Eqs.(18)--(20): the literal norm-one Gellmann generators.gellmann: PDF p.12, Eq.(23): complete normalized basis, including I/sqrt(D).IsHermitianONBasis: PDF pp.12,15: a complete real Hermitian orthonormal operator basis.hermitianReconstruction: PDF p.15: unscaled reconstruction rho=sum c_alpha mu_alpha.hermitianCoordinates: PDF p.15: unscaled real coordinates tr(rho mu_alpha).symmetricConstant: PDF p.12, Eqs.(21)--(22): symmetric real structure constants.antisymmetricConstant: PDF p.12, Eq.(21): antisymmetric real structure constants.wedge: PDF p.13, Eq.(31): traceless-coordinate wedge product.starProduct: PDF p.13, Eq.(32): traceless-coordinate star product.scaledGellmannState: PDF p.13, Eq.(28): the paper's scaled traceless-coordinate reconstruction.pureQuadraticSet: PDF p.14, Eqs.(38)--(39): corrected real quadratic zero locus. The scalar D-2 is real subtraction, including at D=1.adjointAction: PDF p.13, Eq.(33): the traceless block of the adjoint representation.coordinateAngle: PDF p.14, Eq.(41): ordinary Euclidean angle of nonzero coordinate vectors.multiplicationCoefficient: PDF p.15, Eq.(42): generally complex multiplication coefficients.generalPureEquations: PDF p.15, Eqs.(43)--(45): real quadratic equations. Taking real parts AFTER symmetric contraction loses no equation: the imaginary part cancels.generalPureSet: PDF p.15: the explicitly quadratic real variety in an arbitrary basis.basisChange: PDF pp.15--16, Eq.(46): coordinates in target basis of source basis vectors. Thus target coordinates equal this matrix times source coordinates.powerPurityCost: PDF p.18, Eq.(56): literal factor 2 and real part of the power trace. Density hypotheses ensure the trace itself is real.IsMarginalCost: PDF pp.17--18, Eqs.(53)--(55): the marginal-function hypotheses.tensorGellmannBasis: PDF p.18, Eq.(57): complete norm-one tensor-product Gellmann basis.tensorMarginal: PDF p.18, Eq.(58), corrected: tr(lambda_B0)=sqrt(N), not 1.coordinateCost: PDF p.19: the pure marginal cost pulled back to operator coordinates.formationValues: PDF p.19: actual finite pure-state feasible average costs.rankRestrictedValues: PDF p.19, Eq.(61): rank-restricted feasible costs. The printed reversed bounds are corrected to r<=s<=r^2. Rank is that of rho, not its ambient dimension.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Measurement
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P03
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
/-!
# Convex Hulls of Varieties and Entanglement Measures Based on the Roof Construction
Source: arXiv:quant-ph/0402055v2 (PDF pages). Only finite-dimensional spaces and
finite decompositions occur here. Accepted paper interfaces are imported solely
for their normalized pure-state predicate and finite arbitrary-real-cost roof.
Corrections to Eqs.(15),(39),(46),(58),(59),(61) are recorded in MODERATION_NOTES.md.
No claim that tangency is sufficient for support or optimality is made.
-/
noncomputable section
open scoped Matrix ComplexConjugate Topology Manifold
namespace QAlgorithms.Papers.Independent.Support50.P35
/-- PDF p.4, Eqs.(2)--(3): every positive finite length, nonnegative weights,
unit total weight, prescribed barycenter. No dimension-dependent truncation. -/
structure FiniteConvexDecomposition {E : Type*} [AddCommMonoid E] [Module ℝ E]
(V : Set E) (r : E) where
count : ℕ
positive : 0 < count
point : Fin count → E
member : ∀ j, point j ∈ V
weight : Fin count → ℝ
nonnegative : ∀ j, 0 ≤ weight j
total : ∑ j, weight j = 1
barycenter : ∑ j, weight j • point j = r
/-- PDF p.4: the set of all feasible average costs, using actual finite sums. -/
def roofValues {E : Type*} [AddCommMonoid E] [Module ℝ E]
(V : Set E) (f : E → ℝ) (r : E) : Set ℝ :=
{a | ∃ e : FiniteConvexDecomposition V r, a = ∑ j, e.weight j * f (e.point j)}
/-- PDF p.4, Eq.(2). On empty or unbounded-below cost sets, real sInf has
its totalized default value; results below use compact continuous data. -/
def lowerRoof {E : Type*} [AddCommMonoid E] [Module ℝ E]
(V : Set E) (f : E → ℝ) (r : E) : ℝ := sInf (roofValues V f r)
/-- PDF p.4, Eq.(3). Results below have nonempty, bounded feasible cost sets. -/
def upperRoof {E : Type*} [AddCommMonoid E] [Module ℝ E]
(V : Set E) (f : E → ℝ) (r : E) : ℝ := sSup (roofValues V f r)
/-- PDF p.5, Eq.(4): no closure is taken. -/
def graphOn {E : Type*} (V : Set E) (f : E → ℝ) : Set (E × ℝ) :=
(fun x => (x, f x)) '' V
/-- PDF pp.6--7: tangent directions, realized as the span of velocities of
curves staying in M near zero. For a C1 embedded manifold without boundary
this is its ordinary tangent space in the ambient real vector space. -/
def tangentDirections {n : ℕ} (M : Set (Fin n → ℝ)) (x : Fin n → ℝ) :
Submodule ℝ (Fin n → ℝ) :=
Submodule.span ℝ {v | ∃ g : ℝ → (Fin n → ℝ),
g 0 = x ∧ HasDerivAt g v 0 ∧ ∀ᶠ t in 𝓝 (0 : ℝ), g t ∈ M}
/-- PDF pp.6--7: a C1 embedded manifold without boundary, in its subspace
topology. The inclusion is an immersion in standard boundaryless real models. -/
def IsEmbeddedDim {n : ℕ} (M : Set (Fin n → ℝ)) (d : ℕ) : Prop :=
∃ charts : ChartedSpace (EuclideanSpace ℝ (Fin d)) M,
letI := charts
IsManifold (𝓘(ℝ, EuclideanSpace ℝ (Fin d))) 1 M ∧
Manifold.IsImmersion (𝓘(ℝ, EuclideanSpace ℝ (Fin d)))
(𝓘(ℝ, Fin n → ℝ)) 1 (Subtype.val : M → (Fin n → ℝ))
/-- PDF p.3: algebraic, irreducible, nonsingular embedded real variety.
Irreducibility uses the prime ideal of all polynomials vanishing on V;
nonsingularity requires the Zariski tangent dimension to equal the manifold
dimension at every point, rather than a chosen equation list's Jacobian rank. -/
def IsNonsingularVariety {n : ℕ} (V : Set (Fin n → ℝ)) : Prop :=
V = MvPolynomial.zeroLocus ℝ (MvPolynomial.vanishingIdeal ℝ V) ∧
(MvPolynomial.vanishingIdeal ℝ V).IsPrime ∧
∃ d, IsEmbeddedDim V d ∧ ∀ x ∈ V,
Module.finrank ℝ (Submodule.span ℝ {v : Fin n → ℝ |
∀ p ∈ MvPolynomial.vanishingIdeal ℝ V,
∑ i, MvPolynomial.eval x (MvPolynomial.pderiv i p) * v i = 0}) = d
/-- PDF p.7: normal functional of a hyperplane. -/
def normalMap {n : ℕ} (a : Fin n → ℝ) : (Fin n → ℝ) →ₗ[ℝ] ℝ where
toFun x := ∑ i, a i * x i
map_add' x y := by simp [mul_add, Finset.sum_add_distrib]
map_smul' c x := by simp [Pi.smul_apply, smul_eq_mul, Finset.mul_sum, mul_left_comm, mul_assoc]
/-- PDF p.7: a genuine affine hyperplane, with nonzero normal. -/
structure Hyperplane (n : ℕ) where
normal : Fin n → ℝ
offset : ℝ
nonzero : normal ≠ 0
/-- PDF p.7: the affine set of points, distinguished from its direction space. -/
def Hyperplane.points {n : ℕ} (H : Hyperplane n) : Set (Fin n → ℝ) :=
{x | normalMap H.normal x = H.offset}
/-- PDF p.7: the translated linear space parallel to H. -/
def Hyperplane.direction {n : ℕ} (H : Hyperplane n) : Submodule ℝ (Fin n → ℝ) :=
(normalMap H.normal).ker
/-- PDF p.7, Definition 2.5: contact and containment of all tangent directions. -/
def IsMTangent {n m : ℕ} (H : Hyperplane n) (M : Set (Fin n → ℝ))
(x : Fin m → (Fin n → ℝ)) : Prop :=
(∀ j, x j ∈ M ∩ H.points) ∧ ∀ j, tangentDirections M (x j) ≤ H.direction
/-- PDF p.7: the oriented closed halfspace contains all of M. Contact points
are supplied separately, so this also expresses membership in the source's Omega. -/
def ContainsInHalfspace {n : ℕ} (H : Hyperplane n) (M : Set (Fin n → ℝ)) : Prop :=
∀ y ∈ M, normalMap H.normal y ≤ H.offset
/-- Sanity: an ordinary singleton decomposition has positive length and cost f(x). -/
example {E : Type*} [AddCommMonoid E] [Module ℝ E] (x : E) (f : E → ℝ) :
f x ∈ roofValues ({x} : Set E) f x := by
refine ⟨⟨1, by decide, fun _ => x, by simp, fun _ => 1,
by simp, by simp, by simp⟩, ?_⟩
simp
example {n : ℕ} (a : Fin n → ℝ) : normalMap a 0 = 0 := by simp [normalMap]
example {E : Type*} [AddCommMonoid E] [Module ℝ E] (V : Set E) (f : E → ℝ)
(r : E) : lowerRoof V f r = sInf (roofValues V f r) := rfl
/-- PDF pp.4,10: the graph of x^3 over the circle, in the true lifted ambient R3. -/
def cubicGraph : Set (Fin 3 → ℝ) :=
{q | q 0 ^ 2 + q 1 ^ 2 = 1 ∧ q 2 = q 0 ^ 3}
/-- PDF p.4, Figure 1: the base circle and its cubic cost. -/
def circle : Set (Fin 2 → ℝ) := {q | q 0 ^ 2 + q 1 ^ 2 = 1}
/-- PDF p.4: cubic-circle cost. -/
def cubicCost (q : Fin 2 → ℝ) : ℝ := q 0 ^ 3
/-- PDF pp.11--12: the unordered off-diagonal labels, enumerated once with a<b. -/
abbrev PairIndex (D : ℕ) := {p : Fin D × Fin D // p.1 < p.2}
/-- PDF pp.11--12: diagonal labels a=2,...,D (stored as a-1), and the two
off-diagonal families. false is symmetric; true is antisymmetric. -/
abbrev TracelessIndex (D : ℕ) := {a : Fin D // 0 < a.val} ⊕ (PairIndex D × Bool)
/-- PDF p.12: none is the identity label 0; some labels are traceless. -/
abbrev FullIndex (D : ℕ) := Option (TracelessIndex D)
/-- PDF pp.11--12, Eqs.(18)--(20): the literal norm-one Gellmann generators. -/
def normOneGellmannGenerator {D : ℕ} : TracelessIndex D → Matrix (Fin D) (Fin D) ℂ
| Sum.inl a => fun i j =>
if i = j then
((if i.val < a.val.val then 1 else if i = a.val then -(a.val.val : ℝ) else 0) /
Real.sqrt (((a.val.val : ℝ) + 1) * a.val.val) : ℝ)
else 0
| Sum.inr (p, false) => fun i j =>
(if (i = p.val.1 ∧ j = p.val.2) ∨ (i = p.val.2 ∧ j = p.val.1) then
((Real.sqrt 2)⁻¹ : ℝ) else 0 : ℂ)
| Sum.inr (p, true) => fun i j =>
if i = p.val.1 ∧ j = p.val.2 then -Complex.I / (Real.sqrt 2 : ℂ)
else if i = p.val.2 ∧ j = p.val.1 then Complex.I / (Real.sqrt 2 : ℂ) else 0
/-- PDF p.12, Eq.(23): complete normalized basis, including I/sqrt(D). -/
def gellmann (D : ℕ) : FullIndex D → Matrix (Fin D) (Fin D) ℂ
| none => (Real.sqrt (D : ℝ) : ℂ)⁻¹ • 1
| some j => normOneGellmannGenerator j
/-- PDF pp.12,15: a complete real Hermitian orthonormal operator basis. -/
def IsHermitianONBasis {I K : Type*} [Fintype I] [Fintype K] [DecidableEq K]
(mu : K → Matrix I I ℂ) : Prop :=
(∀ k, (mu k).IsHermitian) ∧
(∀ j k, (mu j * mu k).trace = if j = k then 1 else 0) ∧
(∀ A : Matrix I I ℂ, A.IsHermitian → ∃ c : K → ℝ, A = ∑ k, (c k : ℂ) • mu k)
/-- PDF p.15: unscaled reconstruction rho=sum c_alpha mu_alpha. -/
def hermitianReconstruction {I K : Type*} [Fintype K] (mu : K → Matrix I I ℂ) (c : K → ℝ) :
Matrix I I ℂ := ∑ k, (c k : ℂ) • mu k
/-- PDF p.15: unscaled real coordinates tr(rho mu_alpha). -/
def hermitianCoordinates {I K : Type*} [Fintype I] (mu : K → Matrix I I ℂ)
(rho : Matrix I I ℂ) : K → ℝ := fun k => (rho * mu k).trace.re
/-- PDF p.12, Eqs.(21)--(22): symmetric real structure constants. -/
def symmetricConstant {D : ℕ} (j k l : TracelessIndex D) : ℝ :=
(normOneGellmannGenerator j * normOneGellmannGenerator k * normOneGellmannGenerator l).trace.re
/-- PDF p.12, Eq.(21): antisymmetric real structure constants. -/
def antisymmetricConstant {D : ℕ} (j k l : TracelessIndex D) : ℝ :=
(normOneGellmannGenerator j * normOneGellmannGenerator k * normOneGellmannGenerator l).trace.im
/-- PDF p.13, Eq.(31): traceless-coordinate wedge product. -/
def wedge {D : ℕ} (a b : TracelessIndex D → ℝ) : TracelessIndex D → ℝ :=
fun l => ∑ j, ∑ k, a j * b k * antisymmetricConstant j k l
/-- PDF p.13, Eq.(32): traceless-coordinate star product. -/
def starProduct {D : ℕ} (a b : TracelessIndex D → ℝ) : TracelessIndex D → ℝ :=
fun l => ∑ j, ∑ k, a j * b k * symmetricConstant j k l
/-- PDF p.13, Eq.(28): the paper's scaled traceless-coordinate reconstruction. -/
def scaledGellmannState {D : ℕ} (c : TracelessIndex D → ℝ) : Matrix (Fin D) (Fin D) ℂ :=
(D : ℂ)⁻¹ • (1 + ∑ j, (c j : ℂ) • normOneGellmannGenerator j)
/-- PDF p.14, Eqs.(38)--(39): corrected real quadratic zero locus.
The scalar D-2 is real subtraction, including at D=1. -/
def pureQuadraticSet (D : ℕ) : Set (TracelessIndex D → ℝ) :=
{c | dotProduct c c = (D : ℝ) * ((D : ℝ) - 1) ∧
starProduct c c = ((D : ℝ) - 2) • c}
/-- PDF p.13, Eq.(33): the traceless block of the adjoint representation. -/
def adjointAction {D : ℕ} (U : Matrix (Fin D) (Fin D) ℂ)
(a : TracelessIndex D → ℝ) : TracelessIndex D → ℝ :=
fun j => ∑ k, (normOneGellmannGenerator j * U * normOneGellmannGenerator k * Uᴴ).trace.re * a k
example {I K : Type*} [Fintype K] (mu : K → Matrix I I ℂ) : hermitianReconstruction mu 0 = 0 := by
simp [hermitianReconstruction]
/-- Sanity: the antisymmetric generator's upper entry is -i/sqrt(2). -/
example : normOneGellmannGenerator (D := 2)
(Sum.inr (⟨(0, 1), by decide⟩, true)) 0 1 = -Complex.I / (Real.sqrt 2 : ℂ) := by
simp [normOneGellmannGenerator]
/-- Sanity: the zero coordinate vector reconstructs I/D in the scaled convention. -/
example (D : ℕ) : scaledGellmannState (D := D) 0 =
(D : ℂ)⁻¹ • (1 : Matrix (Fin D) (Fin D) ℂ) := by
simp [scaledGellmannState]
example : gellmann 1 none = (1 : Matrix (Fin 1) (Fin 1) ℂ) := by
simp [gellmann]
/-- PDF p.14, Eq.(41): ordinary Euclidean angle of nonzero coordinate vectors. -/
def coordinateAngle {K : Type*} [Fintype K] (r s : K → ℝ) : ℝ :=
Real.arccos (dotProduct r s / (Real.sqrt (dotProduct r r) * Real.sqrt (dotProduct s s)))
/-- PDF p.15, Eq.(42): generally complex multiplication coefficients. -/
def multiplicationCoefficient {I K : Type*} [Fintype I]
(mu : K → Matrix I I ℂ) (a b c : K) : ℂ := (mu a * mu b * mu c).trace
/-- PDF p.15, Eqs.(43)--(45): real quadratic equations. Taking real parts
AFTER symmetric contraction loses no equation: the imaginary part cancels. -/
def generalPureEquations {I K : Type*} [Fintype I] [Fintype K]
(mu : K → Matrix I I ℂ) (c : K → ℝ) : Prop :=
(∑ a, c a * (mu a).trace.re) = 1 ∧ dotProduct c c = 1 ∧
∀ g, (∑ a, ∑ b, c a * c b * (multiplicationCoefficient mu a b g).re) = c g
/-- PDF p.15: the explicitly quadratic real variety in an arbitrary basis. -/
def generalPureSet {I K : Type*} [Fintype I] [Fintype K]
(mu : K → Matrix I I ℂ) : Set (K → ℝ) := {c | generalPureEquations mu c}
/-- PDF pp.15--16, Eq.(46): coordinates in target basis of source basis vectors.
Thus target coordinates equal this matrix times source coordinates. -/
def basisChange {I K L : Type*} [Fintype I]
(target : L → Matrix I I ℂ) (source : K → Matrix I I ℂ) : Matrix L K ℝ :=
fun l k => (source k * target l).trace.re
/-- Sanity: basis-change entries are fixed by reconstruction, without a transpose guess. -/
example {I K L : Type*} [Fintype I] (mu : K → Matrix I I ℂ)
(nu : L → Matrix I I ℂ) (k : K) (l : L) :
basisChange nu mu l k = (mu k * nu l).trace.re := rfl
/-- PDF p.18, Eq.(56): literal factor 2 and real part of the power trace.
Density hypotheses ensure the trace itself is real. -/
def powerPurityCost {I : Type*} [Fintype I] [DecidableEq I]
(a : ℕ) (rho : Matrix I I ℂ) : ℝ := 2 * (1 - (rho ^ a).trace.re)
/-- PDF pp.17--18, Eqs.(53)--(55): the marginal-function hypotheses. -/
def IsMarginalCost {I : Type*} [Fintype I] [DecidableEq I]
(f : Matrix I I ℂ → ℝ) : Prop :=
ContinuousOn f {rho | IsDensityMatrix rho} ∧
(∀ rho, IsDensityMatrix rho → ∀ U : Matrix.unitaryGroup I ℂ,
f ((U : Matrix I I ℂ) * rho * (U : Matrix I I ℂ)ᴴ) = f rho) ∧
ConcaveOn ℝ {rho | IsDensityMatrix rho} f
example {I : Type*} [Fintype I] [DecidableEq I] (rho : Matrix I I ℂ) :
powerPurityCost 2 rho = 2 * (1 - (rho * rho).trace.re) := by
simp [powerPurityCost, pow_two]
/-- PDF p.18, Eq.(57): complete norm-one tensor-product Gellmann basis. -/
def tensorGellmannBasis (M N : ℕ) (k : FullIndex M × FullIndex N) :
Matrix (Fin M × Fin N) (Fin M × Fin N) ℂ :=
Matrix.kronecker (gellmann M k.1) (gellmann N k.2)
/-- PDF p.18, Eq.(58), corrected: tr(lambda_B0)=sqrt(N), not 1. -/
def tensorMarginal {M N : ℕ} (c : FullIndex M × FullIndex N → ℝ) :
Matrix (Fin M) (Fin M) ℂ :=
(Real.sqrt (N : ℝ) : ℂ) • ∑ alpha, (c (alpha, none) : ℂ) • gellmann M alpha
/-- Sanity: no spurious marginal is generated by zero operator coordinates. -/
example (M N : ℕ) : tensorMarginal (M := M) (N := N) 0 = 0 := by
simp [tensorMarginal]
/-- PDF p.19: the pure marginal cost pulled back to operator coordinates. -/
def coordinateCost {M N : ℕ} {K : Type*} [Fintype K]
(mu : K → Matrix (Fin M × Fin N) (Fin M × Fin N) ℂ)
(f : Matrix (Fin M) (Fin M) ℂ → ℝ) (c : K → ℝ) : ℝ :=
f (traceRight (hermitianReconstruction mu c))
/-- PDF p.19: actual finite pure-state feasible average costs. -/
def formationValues {M N : ℕ} (f : Matrix (Fin M) (Fin M) ℂ → ℝ)
(rho : Matrix (Fin M × Fin N) (Fin M × Fin N) ℂ) : Set ℝ :=
{z | ∃ e : QAlgorithms.Papers.Independent.Information100.P03.PureEnsemble (Fin M × Fin N),
ensembleDensity e.weight e.vector = rho ∧
z = ∑ j, e.weight j * f (traceRight (pureDensity (e.vector j)))}
/-- PDF p.19, Eq.(61): rank-restricted feasible costs. The printed reversed
bounds are corrected to r<=s<=r^2. Rank is that of rho, not its ambient dimension. -/
def rankRestrictedValues {M N : ℕ} (f : Matrix (Fin M) (Fin M) ℂ → ℝ)
(rho : Matrix (Fin M × Fin N) (Fin M × Fin N) ℂ) : Set ℝ :=
{z | ∃ e : QAlgorithms.Papers.Independent.Information100.P03.PureEnsemble (Fin M × Fin N),
rho.rank ≤ e.count ∧ e.count ≤ rho.rank ^ 2 ∧
ensembleDensity e.weight e.vector = rho ∧
z = ∑ j, e.weight j * f (traceRight (pureDensity (e.vector j)))}
end QAlgorithms.Papers.Independent.Support50.P35
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P35.ContainsInHalfspace
For every natural number , a hyperplane specified by a nonzero normal and an offset , and a set , this property means that for every . Equality is allowed, and the property holds vacuously when is empty. For , no hyperplane with the required nonzero normal exists.
QAlgorithms.Papers.Independent.Support50.P35.FiniteConvexDecomposition
For a type equipped with a commutative additive monoid structure and a real module structure, a subset , and a point , a finite convex decomposition consists of a natural number , points , and real weights , indexed by , such that and . Points may repeat, and individual weights may be zero; an empty decomposition is excluded.
QAlgorithms.Papers.Independent.Support50.P35.FullIndex
For every natural number , this denotes an index type with one distinguished “none” element and one “some” element for each member of the following disjoint union: indices satisfying , and pairs satisfying and . When or , only the distinguished “none” element exists.
QAlgorithms.Papers.Independent.Support50.P35.Hyperplane.direction
For every natural number and hyperplane record consisting of a nonzero normal vector and an offset , this defines the real linear subspace , namely the kernel of the linear functional determined by . The offset does not enter this definition; no such record exists when .
QAlgorithms.Papers.Independent.Support50.P35.Hyperplane
For every natural number , a hyperplane record consists of a vector , a real number , and the requirement . There is no normalization requirement on and no restriction on . When , no such record exists because the only vector in is zero.
QAlgorithms.Papers.Independent.Support50.P35.Hyperplane.points
For every natural number and hyperplane record consisting of a nonzero normal vector and an offset , this defines its set of points as . No such record exists when .
QAlgorithms.Papers.Independent.Support50.P35.IsEmbeddedDim
For natural numbers and a subset , this predicate means that there exists a charted-space structure on , modeled on the Euclidean space , under which is a manifold and the inclusion is a immersion. Both dimensions may be zero, and no nonemptiness assumption on is imposed.
QAlgorithms.Papers.Independent.Support50.P35.IsHermitianONBasis
For arbitrary finite types and , with decidable equality on , and any family of complex matrices with rows and columns indexed by , this predicate means that every is Hermitian, that
as an equality of complex numbers, and that every Hermitian complex matrix indexed by admits real coefficients such that . Empty index types are permitted: an empty sum is zero, and universal conditions over an empty type are vacuous; in particular, if is empty, the spanning condition requires every Hermitian to be zero.
QAlgorithms.Papers.Independent.Support50.P35.IsMTangent
For natural numbers , let be a hyperplane specified by a nonzero vector and an offset , let , and let be an indexed family of points in . This property means that every belongs to and satisfies , and that, for each , the real linear span of all vectors for which there exists a curve with , derivative , and for all sufficiently small , is contained in . The points need not be distinct. When , both requirements are vacuous; when , no such hyperplane exists because its normal must be nonzero.
QAlgorithms.Papers.Independent.Support50.P35.IsMarginalCost
For every finite index type with decidable equality and every real-valued function on complex matrices indexed by , this predicate means that is continuous on the set of positive semidefinite matrices with trace , that
for every and every unitary matrix , and that is concave on : this set is convex and, for all and ,
No sign condition or prescribed value on pure states is imposed. If is empty, there are no trace- matrices, so these conditions are vacuous.
QAlgorithms.Papers.Independent.Support50.P35.IsNonsingularVariety
For every natural number and subset , let be the ideal of real polynomials in variables that vanish at every point of . This predicate requires that equal the common zero set of all polynomials in , that be a prime ideal, and that there exist a natural number and a charted-space structure on modeled on making a manifold whose inclusion into is a immersion, such that, for every , the real linear span of the vectors satisfying all the following equations has dimension exactly :
The dimensions and may be zero; the prime-ideal requirement excludes the empty set, whose vanishing ideal is the whole polynomial ring.
QAlgorithms.Papers.Independent.Support50.P35.PairIndex
For every natural number , this denotes the type of ordered pairs of integers with , , and . It is empty when or .
QAlgorithms.Papers.Independent.Support50.P35.TracelessIndex
For every natural number , this denotes the disjoint union of the indices satisfying and the pairs satisfying and . The two parts retain distinct tags even if their representations could otherwise be confused. This index type is empty when or .
QAlgorithms.Papers.Independent.Support50.P35.adjointAction
For every natural number , every complex matrix , and every real function on the label set consisting of diagonal labels with and labels with and , this defines the real function
where is the conjugate transpose and, using matrix units , , , and . No unitarity assumption on is imposed. For or , the result is the unique real function on the empty label set.
QAlgorithms.Papers.Independent.Support50.P35.antisymmetricConstant
For every natural number and every three labels in the disjoint union of and , this defines
where, using matrix units , , , and . For or , there are no admissible labels .
QAlgorithms.Papers.Independent.Support50.P35.basisChange
For any types , with a finite enumeration of and no finiteness assumptions on , any target family , and any source family , the defined real matrix has rows indexed by , columns indexed by , and entries
Neither family is required to consist of Hermitian matrices or to be a basis. If is empty, every entry is zero.
QAlgorithms.Papers.Independent.Support50.P35.circle
This defines the subset of consisting exactly of the points satisfying .
QAlgorithms.Papers.Independent.Support50.P35.coordinateAngle
For any type equipped with a finite enumeration, including an empty type, and any functions , the defined real number is
There are no nonzero-vector or normalization hypotheses. Division uses the total real-field convention, so when either vector is zero the quotient is zero and the value is ; this also covers empty .
QAlgorithms.Papers.Independent.Support50.P35.coordinateCost
For any natural numbers , any finite index type , any family of complex matrices on , any real-valued function on complex matrices, and any real coordinates , this definition gives , where
Thus it reconstructs , takes the partial trace over the -dimensional factor, and applies . There are no basis, Hermiticity, positivity, normalization, or positivity-of-dimension assumptions. Empty sums are zero, so if is empty or .
QAlgorithms.Papers.Independent.Support50.P35.cubicCost
For every point , this defines its cost to be . The definition applies to all of , without requiring to lie on the unit circle.
QAlgorithms.Papers.Independent.Support50.P35.cubicGraph
This defines the subset of consisting exactly of the points satisfying
QAlgorithms.Papers.Independent.Support50.P35.formationValues
For any natural numbers , any real-valued function on complex matrices, and any complex matrix on , this definition is the set of real numbers for which there exist a natural number , real weights for with , and vectors with , such that
Zero weights and repeated vectors are allowed, and even vectors with zero weight must have norm . The choice cannot satisfy the weight sum. No assumption is made on or ; if no such decomposition exists, the set is empty, including when or .
QAlgorithms.Papers.Independent.Support50.P35.gellmann
For every natural number , this defines a family of complex matrices indexed by one additional label together with diagonal labels satisfying and labels satisfying and . With denoting a matrix unit, its values are
When , only exists, the reciprocal of is defined as zero, and its value is the empty matrix; when , only exists and its value is .
QAlgorithms.Papers.Independent.Support50.P35.generalPureEquations
For any types equipped with finite enumerations, any family of complex matrices , and any real coefficient function , the defined proposition is the conjunction
No basis, Hermitian, or positivity assumptions are part of this definition. Empty index types are allowed; if either or is empty, the first equality is impossible.
QAlgorithms.Papers.Independent.Support50.P35.generalPureSet
For any types equipped with finite enumerations and any family , the defined set consists exactly of the functions satisfying
All sums and the quantifier over use . No conditions on are required. Empty or empty makes this set empty because the first sum is then zero.
QAlgorithms.Papers.Independent.Support50.P35.graphOn
For any type , subset , and function , this defines the subset of . No algebraic or topological structure on is assumed, and the resulting set is empty when is empty.
QAlgorithms.Papers.Independent.Support50.P35.hermitianCoordinates
For arbitrary types and , with finite, any family of complex matrices indexed by , and any complex matrix indexed by , this defines the real-valued function on given by
There is no finiteness assumption on and no Hermitian, normalization, or basis assumption on or ; if is empty, every resulting coordinate is zero.
QAlgorithms.Papers.Independent.Support50.P35.hermitianReconstruction
For arbitrary types and , with finite, any family of complex matrices indexed by , and any real coefficient function , this defines the complex matrix
where each real coefficient is regarded as a complex scalar. No finiteness assumption on , or Hermitian or basis assumption on , is imposed; if is empty, the result is zero.
QAlgorithms.Papers.Independent.Support50.P35.lowerRoof
For any type with a commutative additive monoid structure and a real module structure, subset , function , and point , this defines the real infimum of all values obtained from a natural number , points , and real weights satisfying and . No existence or boundedness assumption is imposed: if this set of values is empty or unbounded below, the real infimum operation used here returns .
QAlgorithms.Papers.Independent.Support50.P35.multiplicationCoefficient
For any types , with equipped with a finite enumeration but with no finiteness assumption on , any family , and any , the defined complex coefficient is
No Hermitian, orthogonality, or normalization conditions are imposed on . If is empty, the trace and hence every such coefficient are zero.
QAlgorithms.Papers.Independent.Support50.P35.normOneGellmannGenerator
For every natural number , this defines a complex matrix for each label in the disjoint union of diagonal labels with and labels with and . Writing for the matrix with entry at row , column , and zero elsewhere, the definition is
For or , there are no such labels.
QAlgorithms.Papers.Independent.Support50.P35.normalMap
For every natural number and vector , this defines the real linear functional on given by . The vector may be zero, in which case the functional is zero; when , the sum is empty and the functional is also zero.
QAlgorithms.Papers.Independent.Support50.P35.powerPurityCost
For every finite index type with decidable equality, every natural number , and every complex matrix indexed by , this definition assigns the real number
There is no assumption that is Hermitian, positive semidefinite, or trace . The exponent is included: the value is then , since is the identity. If is empty, the value is for every .
QAlgorithms.Papers.Independent.Support50.P35.pureQuadraticSet
For every natural number , let be the disjoint union of diagonal labels with and labels with and . This defines the set of real functions satisfying
where and are real subtractions and, using matrix units , , , and . For or , is empty, the first equality is , the coordinate equations are vacuous, and the set contains its unique empty function.
QAlgorithms.Papers.Independent.Support50.P35.rankRestrictedValues
For any natural numbers , any real-valued function on complex matrices, and any complex matrix on , this definition is the set of real numbers for which there exist a natural number , nonnegative real weights summing to , and norm- vectors , indexed by , such that
The bounds concern the total number of listed vectors, including those with zero weight, and repeated vectors are allowed. No assumptions are imposed on or . If no such family exists, the set is empty; in particular, rank forces , which cannot satisfy the weight sum.
QAlgorithms.Papers.Independent.Support50.P35.roofValues
For any type with a commutative additive monoid structure and a real module structure, subset , function , and point , this defines the set of real numbers for which there exist a natural number , points , and nonnegative real weights satisfying , , and . Repeated points and zero weights are allowed. The set is empty if no such decomposition of exists.
QAlgorithms.Papers.Independent.Support50.P35.scaledGellmannState
For every natural number and every real function on the label set consisting of diagonal labels with and labels with and , this defines the complex matrix
where, using matrix units , , , and . The coefficient function is unrestricted, including no positivity condition on the resulting matrix. For , the reciprocal is zero and the result is the empty matrix; for , the label set is empty and the result is .
QAlgorithms.Papers.Independent.Support50.P35.starProduct
For every natural number , let be the disjoint union of diagonal labels with and labels with and . For any real functions , this defines the real function
where, writing for matrix units, for a diagonal label , , and . When or , is empty and the result is the unique real function on the empty set.
QAlgorithms.Papers.Independent.Support50.P35.symmetricConstant
For every natural number and every three labels in the disjoint union of and , this defines
where, using matrix units , , , and . For or , there are no admissible labels .
QAlgorithms.Papers.Independent.Support50.P35.tangentDirections
For every natural number , subset , and point , this defines the real linear span of all vectors for which there exists a function satisfying , differentiability at with derivative , and for every in some neighborhood of . Differentiability away from is not required. The definition includes and does not assume ; if , there are no such curves and the span is the zero subspace.
QAlgorithms.Papers.Independent.Support50.P35.tensorGellmannBasis
For any natural numbers , this definition assigns a complex matrix indexed by to each pair of labels , namely ; its entry at is . For each natural number , the labels for comprise a distinguished label , diagonal labels with , and two labels , for each . Writing for a matrix unit, these matrices are
Zero dimensions are allowed; for , only the distinguished label remains, its matrix is empty, and the reciprocal of is interpreted as .
QAlgorithms.Papers.Independent.Support50.P35.tensorMarginal
For any natural numbers and any real array indexed by the full matrix labels in dimensions , this definition returns the complex matrix
Here the labels in dimension are a distinguished label , diagonal labels , and symmetric and antisymmetric labels for ; , the diagonal matrix has entries at positions , entry at position , and zero elsewhere, while the two pair matrices are and . The coefficients with second label different from do not enter the sum. No positivity or normalization is required of . Zero dimensions are included, with ; in particular, the returned matrix is zero when .
QAlgorithms.Papers.Independent.Support50.P35.upperRoof
For any type with a commutative additive monoid structure and a real module structure, subset , function , and point , this defines the real supremum of all values obtained from a natural number , points , and real weights satisfying and . No existence or boundedness assumption is imposed: if this set of values is empty or unbounded above, the real supremum operation used here returns .
QAlgorithms.Papers.Independent.Support50.P35.wedge
For every natural number , let be the disjoint union of diagonal labels with and labels with and . For any real functions , this defines the real function
where, writing for matrix units, for a diagonal label , , and . When or , is empty and the result is the unique real function on the empty set.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.