Pure tangle: Schmidt formula, local invariance and range
OpenQAlgorithms.Papers.Independent.Intakethird100.P21.pure_state_propertiesLet , , and let be a normalized bipartite pure state. Schmidt probabilities satisfy and enter its Schmidt expansion as amplitudes in orthonormal local families. With the I-concurrence roof, the pure-tangle roof, and for ,
The concurrence roof also agrees with pure concurrence on the pure projector. The pure tangle is smooth on normalized vectors and invariant under arbitrary local unitaries. It is zero exactly on normalized product states, and reaches its upper endpoint exactly on states with all Schmidt probabilities equal to . For the two endpoints coincide at zero.
This identifies the pure cost underlying the two distinct convex roofs.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P21
open scoped Matrix ComplexConjugate
open Filter
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P03
(PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.4, (2.2): Schmidt formula, smoothness, local-unitary invariance,
pure-roof agreement, range, and its product/maximally-entangled endpoints.
The min(dA,dB)=1 case is retained. -/
theorem pure_state_properties (a b : ℕ) (ha : 0 < a) (hb : 0 < b) :
ContDiffOn ℝ ⊤ (pureTangle (I := Fin a) (J := Fin b)) {psi | IsState psi} ∧
(∀ s : SchmidtData a b,
IsState (schmidtVector s) ∧
pureTangle (schmidtVector s) = schmidtCost s.probability ∧
schmidtCost s.probability =
4 * ∑ i, ∑ j, (if i < j then s.probability i * s.probability j else 0)) ∧
(∀ psi : EuclideanSpace ℂ (Fin a × Fin b), IsState psi →
tangle (pureDensity psi) = pureTangle psi ∧
concurrence (pureDensity psi) = pureConcurrence psi ∧
pureConcurrence psi ^ 2 = pureTangle psi ∧
0 ≤ pureTangle psi ∧ pureTangle psi ≤ 2 * ((min a b : ℝ) - 1) / min a b ∧
(pureTangle psi = 0 ↔ IsPureProductState psi) ∧
(pureTangle psi = 2 * ((min a b : ℝ) - 1) / min a b ↔ IsMaximallyEntangled psi) ∧
∀ U : Matrix.unitaryGroup (Fin a) ℂ, ∀ V : Matrix.unitaryGroup (Fin b) ℂ,
pureTangle (act (Matrix.kronecker (U : Matrix (Fin a) (Fin a) ℂ)
(V : Matrix (Fin b) (Fin b) ℂ)) psi) = pureTangle psi) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural numbers , write , , , and ; let and be the infima of the respective weighted pure-vector costs over finite unit-vector decompositions with nonnegative weights summing to . The function is infinitely differentiable over on the set of unit vectors, in the sense of differentiability within that set. For every collection of probabilities , , summing to , and orthonormal families , , the vector has norm and satisfies
For every unit vector ,
Moreover, if and only if for unit vectors ; equality with the upper bound holds if and only if has a decomposition of the displayed orthonormal form with every . Finally, for every unitary on and every unitary on . Dimensions equal to are included; when , the upper bound is zero and the sum over is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.