Mutual independence of the quantum constrained family
ProvedQAlgorithms.Papers.Independent.Intake100.P66.quantumFamily_independentFix an integer and the ground set . The target is the standard singleton instance of , with zero constraints and . For pairwise disjoint subsets of a fixed finite ground set, empty subsets permitted, put
Here is a normalized real set function, and ; juxtaposition denotes union. The constrained inequality is under . An eligible constrained instance has every nontrivial constraint equal, as an entropy coefficient form, to one of ; an identically zero form adds no constraint. Equality of forms is understood on normalized set functions, so the empty entropy coordinate is zero. No purification transformation or closure operation is included. Let consist of every strong-subadditivity or weak-monotonicity instance on disjoint subsets of , together with every eligible instance of for , . Then there is no finite coefficient identity
This states independence in the source's finite linear-combination sense, using abstract normalized set functions; it does not assert a quantum state violating a valid entropy inequality.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P66
noncomputable section
namespace QAlgorithms.Papers.Independent.Intake100.P66
open scoped BigOperators
open QAlgorithms (IsDensityMatrix vnEntropy)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.3,6--9, Section IV: finite linear independence with matching constraints.
All basic quantum instances are allowed; the witness need not be entropic. -/
theorem quantumFamily_independent (n : ℕ) (hn : 2 ≤ n) :
¬ Derivable {L | QuantumBasic L ∨ OtherFamily n L}
(constraints n) (standardFamily n) := by sorry
end QAlgorithms.Papers.Independent.Intake100.P66
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let , with distinct labels. A form is a real-valued function on the subsets of ; define , and for nonempty define if and otherwise. Define the forms
Using party labels as singletons, put , , and
The form cannot be written as
for any natural number , nonnegative real weights , arbitrary real coefficients , and forms each satisfying one of these alternatives: or for some pairwise disjoint subsets ; or for some natural number with , pairwise disjoint , and subsets that are pairwise disjoint and each disjoint from , such that each of and is either the zero form or an element of . All equalities here are equalities of functions on subsets; all chosen subsets may be empty, and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.