An EPR marginal factors from the third system
OpenQAlgorithms.Papers.Independent.Intakethird100.P06.pureEprMarginal_productLet Alice and Bob be qubits, let be any Hilbert space, and let be a positive trace-class density operator of trace one. Put for . If , then the computed marginal is a density operator and
There is no dimension bound on , and neither nor is required to be pure.
This is the decoupling fact used in the EPR non-shareability and secrecy arguments. Formalization Note: arbitrary orthonormal coordinates represent ; nuclearity, positivity and normalization are explicit. The source's ket notation for Joe in equation (2) is read as density-operator shorthand, consistent with the stated purity of the AB marginal alone.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P06
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P06
open scoped BigOperators
open QAlgorithms.Papers.Independent.Dependency50.P33 (NuclearExpansion)
open QAlgorithms.Papers.Independent.Frontier18.P09 (partialTraceRightCoeff)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Section II, arXiv:quant-ph/0307120v1, PDF p.5, factorization preceding
(2): an exact EPR marginal forces product with the computed third marginal.
Printed: Joe is written as a ket in (2). Changed: a possibly mixed density.
Why: only the AB marginal is assumed pure; a mixed Joe is allowed by the prose.
The normalization is the 1/sqrt(2) displayed in both (1) and the rendered (2).
This source correction requires independent moderation. -/
theorem pureEprMarginal_product {E : Type}
(omega : Matrix ((Opinion × Opinion) × E) ((Opinion × Opinion) × E) ℂ)
(hstate : IsCoordinateDensity omega) (hepr : partialTraceRightCoeff omega = eprDensity) :
IsCoordinateDensity (traceLeft omega) ∧
omega = Matrix.kronecker eprDensity (traceLeft omega) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P06
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be the two-element set of one-bit strings, let be any type, and let be a complex matrix indexed by . Write when and , and zero otherwise. Assume that admits an expansion with and summable , that every finite quadratic form is real and nonnegative for every finite and every complex function , and that the real diagonal of is summable with sum . Assume also that for every , where denotes the total infinite sum, assigned zero if the family is not summable. Define . Then admits an expansion with and summable , all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum ; furthermore, for every choice of indices. No finiteness or countability assumption is imposed on ; if is empty, the assumed diagonal sum of cannot equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.