AFTD Auto-Formalizing Theoretical Domains

KetUpToPhase.lift

defimported Lean

Lift a function on Ket d to KetUpToPhase d, given that it respects phase equivalence.

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 KetUpToPhase.lift {α : Sort*} (f : Ket d → α)
    (hf : ∀ ψ φ, Ket.PhaseEquiv.r ψ φ → f ψ = f φ) : KetUpToPhase d → α
Defined in
QuantumInfo, `KetUpToPhase.lift`
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.
Verified
17 Oct 2026
Axioms
none listed
Built on 10
  • 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 Matrix of vectors as simple functions from a Fintype. Kets are distinctly…
  • Ket.not_IsEntangled_prodKet.prod states are not entangled states.
  • Ket.PhaseEquivThe 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
  • KetUpToPhaseThe type of Kets up to a global phase equivalence, as given by Ket.PhaseEquiv. In particular, MStates really only care about a…
  • Braket.instFunLikeKetBraket.instFunLikeKet
  • Ket.IsProd_prodKet.prod states are product states.
  • instInhabitedThere exists a ket for every nonempty d. Here, we use the uniform superposition
Used by 1

Lean source view module on GitHub

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
/-- Lift a function on `Ket d` to `KetUpToPhase d`, given that it respects phase equivalence. -/
noncomputable def KetUpToPhase.lift {α : Sort*} (f : Ket d → α)
    (hf : ∀ ψ φ, Ket.PhaseEquiv.r ψ φ → f ψ = f φ) : KetUpToPhase d → α :=
  @Quotient.lift _ _ Ket.PhaseEquiv f hf
See it in the graphDiscuss this resultChallenge it