Ket.PhaseEquiv
defimported Lean
The equivalence relation on Ket where two kets equivalent if they are equal up to a global phase, i.e. `∃ z, ‖z‖ = 1 ∧ a.vec = z • b.vec
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in open BigOperators in open ComplexConjugate in open Kronecker in open scoped Matrix ComplexOrder in variable {d : Type*} [Fintype d] in noncomputable def Ket.PhaseEquiv : Setoid (Ket d)
- Defined in
- QuantumInfo, `Ket.PhaseEquiv`
- Lean proof
- By Alex Meiburg, Rodolfo Soldati, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.Ket.PhaseEquiv← Ket.PhaseEquiv (QuantumInfo/States/Pure/Braket.lean:372): verbatim
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Built on 8
- instKetOfBrainstKetOfBra
- instFunLikeBraketA Bra can be viewed as a function from Ket's to ℂ.
- instBraOfKetinstBraOfKet
- KetA ket as a vector of unit norm. We follow the convention in
Matrixof vectors as simple functions from a Fintype. Kets are distinctly… - Ket.not_IsEntangled_prod
Ket.prodstates are not entangled states. - Braket.instFunLikeKetBraket.instFunLikeKet
- Ket.IsProd_prod
Ket.prodstates are product states. - instInhabitedThere exists a ket for every nonempty
d. Here, we use the uniform superposition
- Used by 4
- KetUpToPhase.lift_mkKetUpToPhase.lift_mk
- KetUpToPhaseThe type of
Kets up to a global phase equivalence, as given byKet.PhaseEquiv. In particular,MStates really only care about a… - KetUpToPhase.liftLift a function on
Ket dtoKetUpToPhase d, given that it respects phase equivalence. - KetUpToPhase.mkConstruct a
KetUpToPhasefrom aKet.
Lean source view module on GitHub
set_option quotPrecheck false open Braket local notation "〈" ξ:90 "‖" ψ:90 "〉" => dot (ξ : Bra _) (ψ : Ket _) set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in open BigOperators in open ComplexConjugate in open Kronecker in open scoped Matrix ComplexOrder in variable {d : Type*} [Fintype d] in /-- The equivalence relation on `Ket` where two kets equivalent if they are equal up to a global phase, i.e. `∃ z, ‖z‖ = 1 ∧ a.vec = z • b.vec -/ noncomputable def Ket.PhaseEquiv : Setoid (Ket d) where r a b := ∃ z : ℂ, ‖z‖ = 1 ∧ a.vec = z • b.vec iseqv := { refl := fun x ↦ ⟨1, by simp⟩, symm := fun ⟨z,h₁,h₂⟩ ↦ ⟨conj z, by simp [h₁], by simp [h₁, h₂, smul_smul, ← Complex.normSq_eq_conj_mul_self, Complex.normSq_eq_norm_sq]⟩, trans := fun ⟨z₁,h₁₁,h₁₂⟩ ⟨z₂,h₂₁,h₂₂⟩ ↦ ⟨z₁ * z₂, by simp [h₁₁, h₂₁], by simp [h₁₂, h₂₂, smul_smul]⟩ }