Bob-to-Alice 1W-LOCC preserves unsteerability
ProvedQAlgorithms.Papers.Independent.Intakethird100.P36.lhs_invariantLet be a no-signaling assemblage of positive operators on a finite-dimensional complex Hilbert space, with positive finite input and output alphabets and common trace . Suppose admits a local-hidden-state model of total mass . Let be any Bob-to-Alice stochastic one-way LOCC: Bob applies a Kraus subinstrument, communicates its outcome to Alice, and Alice applies normalized input and output probability kernels. Source and target dimensions and alphabets may differ. Then
If , the conditional assemblage is normalized and also admits an LHS model. This identifies the free operations of the resource theory, including selective operations and the zero operation.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P36
noncomputable section
open scoped BigOperators ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P36
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
attribute [local instance] Classical.propDecidable
variable {d r s df rf sf m : ℕ}
/-- Theorem 1, PDF p.4; proof p.10. Subnormalized LHS outputs retain their assemblageMass.
Correction to Appendix B's word "normalized": only positive-success outputs
are renormalized. The zero operation produces the zero free assemblage. -/
theorem lhs_invariant (P : SteeringProtocol d r s df rf sf m) (rho : AssemblageBlocks d r s)
(hrho : HasFiniteLHSModel rho) :
HasFiniteLHSModel (protocolAction P rho) ∧
(0 < assemblageMass (protocolAction P rho) →
IsNormalized (normalizeAssemblage (protocolAction P rho)) ∧
HasFiniteLHSModel (normalizeAssemblage (protocolAction P rho))) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers and let be a protocol whose data require , matrices for satisfying , input probabilities summing to over for every , and output probabilities summing to over for every . For a matrix family with outcomes and settings, put and . Suppose has positive semidefinite blocks, setting-independent outcome sums, mass , and a finite hidden-state representation
where , and each are nonnegative probability distributions, and every is positive semidefinite with trace . Then the output family
also has positive semidefinite blocks, setting-independent outcome sums, mass in , and a representation of the same finite hidden-state form using its own mass. Moreover, if its mass is positive, then the family has mass , satisfies those assemblage conditions, and has a finite hidden-state representation. Completeness is not assumed; is allowed and gives zero output, for which the positive-mass implication is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.