Ket.exists_ne_zero
theoremverifiedformalizationimported Lean
Ket.exists_ne_zero
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 open Braket in variable {d : Type*} [Fintype d] in theorem Ket.exists_ne_zero (ψ : Ket d) : ∃ x, ψ x ≠ 0
- Formalizes
- QuantumInfo, `Ket.exists_ne_zero`
- 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.exists_ne_zero← Ket.exists_ne_zero (QuantumInfo/States/Pure/Braket.lean:136): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- instKetOfBrainstKetOfBra
- 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.normalizedKet.normalized
- Braket.instFunLikeKetBraket.instFunLikeKet
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 open Braket in variable {d : Type*} [Fintype d] in theorem Ket.exists_ne_zero (ψ : Ket d) : ∃ x, ψ x ≠ 0 := by have hzerolt : ∑ x : d, Complex.normSq (ψ x) > ∑ x : d, 0 := by rw [ψ.normalized, Finset.sum_const_zero]; exact zero_lt_one have hpos : ∃ x ∈ Finset.univ, 0 < Complex.normSq (ψ x) := Finset.exists_lt_of_sum_lt hzerolt obtain ⟨x, _, hpos⟩ := hpos rw [Complex.normSq_pos] at hpos use x