Submodule.inf_ne_bot_of_rank_lt
theoremverifiedformalizationimported Lean
Submodule.inf_ne_bot_of_rank_lt
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] in open Submodule in open Metric in open InnerProductSpace in open Complex in open ComplexConjugate in open Set in open Pointwise in lemma Submodule.inf_ne_bot_of_rank_lt {E F : Submodule ℂ H} [E.HasOrthogonalProjection] (h_rank : Module.rank ℂ E < Module.rank ℂ F) : Eᗮ ⊓ F ≠ ⊥
- Formalizes
- Physlib, `Submodule.inf_ne_bot_of_rank_lt`
- Lean proof
- By Gregory J. Loges, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Gregory J. Loges. 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.Submodule.inf_ne_bot_of_rank_lt← Submodule.inf_ne_bot_of_rank_lt (Physlib/QuantumMechanics/Operators/SpectralTheory/Basic.lean:340): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- LinearOrder.toTotalPreorderEvery
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.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] inopen Submodule inopen Metric inopen InnerProductSpace inopen Complex inopen ComplexConjugate inopen Set inopen Pointwise inlemma Submodule.inf_ne_bot_of_rank_lt {E F : Submodule ℂ H} [E.HasOrthogonalProjection] (h_rank : Module.rank ℂ E < Module.rank ℂ F) : Eᗮ ⊓ F ≠ ⊥ := by let Φ : F →L[ℂ] E := E.orthogonalProjectionOnto ∘L F.subtypeL have hΦ : ¬(⇑Φ).Injective := fun h' ↦ not_le_of_gt h_rank (Φ.rank_le_of_injective h') obtain ⟨x₁, x₂, h, hx⟩ := Function.not_injective_iff.mp hΦ let y : H := x₁ - x₂ have hy : y ≠ 0 := fun h' ↦ hx (SetLike.coe_eq_coe.mp <| sub_eq_zero.mp h') have hF : y ∈ F := sub_mem (coe_mem x₁) (coe_mem x₂) have hE : y ∈ Eᗮ := orthogonalProjectionOnto_eq_zero_iff.mp (_root_.map_sub Φ _ _ ▸ sub_eq_zero.mpr h) exact fun hEF ↦ hy ((mem_bot ℂ).mp <| hEF ▸ ⟨hE, hF⟩)