not_has_subspace_compatible_incompatible_family_one
For any dimension d, no single binary measurement can be incompatible on C^d, so has_subspace_compatible_incompatible_family d 1 does not hold.
Statement
theorem not_has_subspace_compatible_incompatible_family_one (d : ℕ) : ¬ has_subspace_compatible_incompatible_family d 1- Source
- arXiv:2610.37347 (Measurement incompatibility and noiseless quantum codes), after Corollary 1
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- has_subspace_compatible_incompatible_familyThere exists a family of k binary measurements on C^d that is incompatible on C^d but whose compression to every proper subspace is…
Read back from the Lean
For every natural number $d$, there does not exist a subspace-compatible incompatible family of size $k = 1$ on $\mathbb{C}^d$; that is, has_subspace_compatible_incompatible_family d 1 is false.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem shows that no single binary measurement on C^d can form a subspace-compatible yet globally incompatible family. Assuming such a family exists, it must be globally incompatible, but any valid binary measurement M_0 (satisfying 0 ≤ M_0 ≤ 1) is trivially jointly measurable with itself via the joint POVM assigning M_0 to true and 1 - M_0 to false. Exhibiting this explicit joint POVM satisfies positivity, sums to the identity, and matches the marginal M_0, contradicting the incompatibility assumption.
The sum of any function f : (Fin 1 → Bool) → M over all assignments equals f(fun _ => true) + f(fun _ => false).
We re-index the sum over functions s : Fin 1 → Bool by the equivalence (Fin 1 → Bool) ≃ Bool (Equiv.sum_comp, Equiv.funUnique, Equiv.funUnique_symm_apply). Since Bool = {true, false} (Fintype.univ_bool), the sum over Bool is the sum of the values at true and false (Finset.sum_pair). Identifying uniqueElim true and uniqueElim false with the constant true and false functions closes the goal (congr 2).
uses
Equiv.sum_comp,Equiv.funUnique,Equiv.funUnique_symm_apply,Fintype.univ_bool,Finset.sum_pairrw [← Equiv.sum_comp (Equiv.funUnique (Fin 1) Bool).symm f] simp only [Equiv.funUnique_symm_apply] rw [Fintype.univ_bool, Finset.sum_pair (by decide)] congr 2
To contradict the assumed incompatibility of the measurement family, it suffices to construct a joint POVM G.
Assuming for contradiction that such a family exists, we unpack the single measurement M 0, the assumption hM that M 0 and 1 - M 0 are positive semidefinite, and the global incompatibility hypothesis hinc. Applying hinc reduces the goal to constructing a valid joint POVM G. We propose the witness G(s) that evaluates to M 0 when s(0) = true and 1 - M 0 when s(0) = false, leaving three subgoals: positivity, normalization to the identity, and reproducing the marginal.
rintro ⟨M, hM, hinc, -⟩ apply hinc refine ⟨fun s => if s 0 = true then M 0 else 1 - M 0, ?_, ?_, ?_⟩
Each operator G(s) is positive semidefinite.
For any assignment s : Fin 1 → Bool, we split into cases on whether s(0) = true. If s(0) = true, G(s) simplifies to M 0 (using if_true), which is positive semidefinite by the first part of hM 0. If s(0) = false, G(s) simplifies to 1 - M 0, which is positive semidefinite by the second part of hM 0.
uses
if_true· intro s by_cases h : s 0 = true · simp only [h, if_true]; exact (hM 0).1 · simp only [h]; exact (hM 0).2
The operators G(s) sum to the identity matrix.
Applying the helper lemma not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool reduces the sum over all s to G(fun _ => true) + G(fun _ => false). Evaluating G on these constant functions yields M 0 + (1 - M 0), which simp reduces to the identity matrix 1.
uses
not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool· rw [not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool] simp
The marginal of G for the unique measurement index 0 recovers M 0.
Since the index j ranges over Fin 1, case exhaustion (fin_cases) leaves only j = 0. Expanding the sum using not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool yields a sum with M 0 from the true assignment and 0 from the false assignment, which simp simplifies to M 0.
uses
not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool· intro j fin_cases j rw [not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool] simp
Equiv.sum_comp- Summing a function over a domain re-indexed by an equivalence yields the same result as summing over the original index set.
Equiv.funUnique- Functions from a unique (singleton) domain α to β are canonically equivalent to elements of β, via evaluation.
Equiv.funUnique_symm_apply- The inverse of the singleton function equivalence sends an element b to the constant function returning b.
Fintype.univ_bool- The finset of all booleans is the set {true, false}.
Finset.sum_pair- The sum of a function over a two-element set {a, b} with a ≠ b equals f(a) + f(b).
if_true- An if-then-else expression whose condition is True evaluates to the first (then) branch.
not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool- For any function f on Fin 1 → Bool into an additive commutative monoid, the sum over all inputs equals f applied to the constant true function plus f applied to the constant false function.
- The subspace-compatibility condition in the definition of has_subspace_compatible_incompatible_family is completely unused and discarded at line 11, because global incompatibility is already impossible for a single measurement.
- The helper lemma not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool (lines 1–7) is a technical simplification that evaluates sums indexed by Fin 1 → Bool as sums of two terms.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
private lemma not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool {M : Type*} [AddCommMonoid M] (f : (Fin 1 → Bool) → M) : (∑ s : Fin 1 → Bool, f s) = f (fun _ => true) + f (fun _ => false) := by rw [← Equiv.sum_comp (Equiv.funUnique (Fin 1) Bool).symm f] simp only [Equiv.funUnique_symm_apply] rw [Fintype.univ_bool, Finset.sum_pair (by decide)] congr 2/-- A single binary measurement is always jointly measurable, so no 1-measurement family can be incompatible globally. -/theorem not_has_subspace_compatible_incompatible_family_one (d : ℕ) : ¬ has_subspace_compatible_incompatible_family d 1 := by rintro ⟨M, hM, hinc, -⟩ apply hinc refine ⟨fun s => if s 0 = true then M 0 else 1 - M 0, ?_, ?_, ?_⟩ · intro s by_cases h : s 0 = true · simp only [h, if_true]; exact (hM 0).1 · simp only [h]; exact (hM 0).2 · rw [not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool] simp · intro j fin_cases j rw [not_has_subspace_compatible_incompatible_family_one_sum_fin_one_bool] simp