bipartite_universally_locally_encodable_one_one
Universal local encodability holds for 1 × 1 bipartite quantum systems: bipartite_universally_locally_encodable 1 1.
Statement
theorem bipartite_universally_locally_encodable_one_one :
bipartite_universally_locally_encodable 1 1- Formalizes
- arXiv:2611.16921 Sec. II.1
- Verified
- 14 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- bipartite_universally_locally_encodableA bipartite quantum system of dimension dA × dB is universally locally encodable if every state ψ in EuclideanSpace ℂ (Fin dA × Fin dB)…
- is_bipartite_locally_encodableA bipartite quantum state ψ in EuclideanSpace ℂ (m × n) is locally encodable if there exists an orthonormal basis B of EuclideanSpace ℂ (m…
Read back from the Lean
For local dimensions $d_A = 1$ and $d_B = 1$, the bipartite system is universally locally encodable: for every unit vector $\psi \in \mathrm{EuclideanSpace}\,\mathbb{C}\,(\mathrm{Fin}\,1 \times \mathrm{Fin}\,1)$ (satisfying $\|\psi\| = 1$), $\psi$ is bipartite locally encodable.
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 1 × 1 bipartite quantum state space is one-dimensional, and its index set Fin 1 × Fin 1 is a singleton. For any normalized state ψ, the vector ψ itself spans the space and forms an orthonormal basis. Since the basis consists of ψ alone, each basis element is trivially reached from ψ by acting with the identity operator on both subsystems.
The index set Fin 1 × Fin 1 is a singleton.
Because `Fin 1` has a unique element, every pair `(a, b)` in `Fin 1 × Fin 1` must equal `(default, default)`, since `a = default` and `b = default` by `Unique.eq_default`.
uses
Unique.eq_defaulthave : Unique (Fin 1 × Fin 1) := ⟨⟨(default, default)⟩, by intro ⟨a, b⟩; simp [Unique.eq_default a, Unique.eq_default b]⟩
Let ψ be any normalized state; it suffices to show that ψ is bipartite locally encodable.
We fix an arbitrary state ψ with ‖ψ‖ = 1 and unfold the definition of `is_bipartite_locally_encodable`, which requires constructing an orthonormal basis B whose elements are each obtainable from ψ via local unitaries uA and uB.
intro ψ hψ unfold is_bipartite_locally_encodable
The state vector ψ itself forms an orthonormal basis for the state space.
The Euclidean space over `Fin 1 × Fin 1` has dimension 1 (verified by `simp`). Applying `FiniteDimensional.orthonormalBasisSingleton` to ψ and the hypothesis ‖ψ‖ = 1 gives an orthonormal basis indexed by `Fin 1 × Fin 1`.
uses
FiniteDimensional.orthonormalBasisSingletonrefine ⟨FiniteDimensional.orthonormalBasisSingleton (Fin 1 × Fin 1) ℂ (by simp) ψ hψ, ?_⟩
Every basis vector is obtainable from ψ via local unitaries.
For the unique basis index j, we choose both local unitaries to be the identity matrix 1. The tactic `simp` then verifies that (1 ⊗ 1) ψ = ψ, which matches the unique basis element at index j.
intro j refine ⟨1, 1, ?_⟩ simp
Unique.eq_default- In a singleton type, every element equals the default element.
FiniteDimensional.orthonormalBasisSingleton- In an inner product space of dimension 1, any vector of norm 1 constitutes an orthonormal basis indexed by a singleton type.
- The dimension equality `Module.finrank ℂ (EuclideanSpace ℂ (Fin 1 × Fin 1)) = 1` needed by `FiniteDimensional.orthonormalBasisSingleton` on line 7 is discharged inline by `simp`.
- The final equality on line 10, showing that the Kronecker product of identity operators acting on ψ yields the basis vector ψ, is closed by `simp`.
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.
/-- The 1 × 1 bipartite quantum system is universally locally encodable. -/theorem bipartite_universally_locally_encodable_one_one : bipartite_universally_locally_encodable 1 1 := by have : Unique (Fin 1 × Fin 1) := ⟨⟨(default, default)⟩, by intro ⟨a, b⟩; simp [Unique.eq_default a, Unique.eq_default b]⟩ intro ψ hψ unfold is_bipartite_locally_encodable refine ⟨FiniteDimensional.orthonormalBasisSingleton (Fin 1 × Fin 1) ℂ (by simp) ψ hψ, ?_⟩ intro j refine ⟨1, 1, ?_⟩ simp