Cslib.Logic.CLL.PhaseSpace.orthogonal_def
theoremverifiedformalizationimported Lean
Cslib.Logic.CLL.PhaseSpace.orthogonal_def
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace in universe u v in open scoped Pointwise in open Set in attribute [local grind _=_] Set.le_iff_subset in variable {P : Type*} [PhaseSpace P] {p q : P} in @[grind =, simp] lemma Cslib.Logic.CLL.PhaseSpace.orthogonal_def (X : Set P) : X⫠ = {m | ∀ x ∈ X, m * x ∈ bot}
- Formalizes
- CSLib, `Cslib.Logic.CLL.PhaseSpace.orthogonal_def`
- Lean proof
- By Tanner Duve, Bhavik Mehta, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Tanner Duve. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Logic.CLL.PhaseSpace.orthogonal_def← Cslib.Logic.CLL.PhaseSpace.orthogonal_def (Cslib/Logics/LinearLogic/CLL/PhaseSemantics/Basic.lean:94): adapted
What was changed in
Cslib.Logic.CLL.PhaseSpace.orthogonal_def--- Cslib/Logics/LinearLogic/CLL/PhaseSemantics/Basic.lean:94 (Cslib.Logic.CLL.PhaseSpace.orthogonal_def) +++ as compiled here @@ -1 +1,9 @@ -@[scoped grind =, simp] lemma orthogonal_def (X : Set P) : X⫠ = {m | ∀ x ∈ X, m * x ∈ bot} := rfl +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace in +universe u v in +open scoped Pointwise in +open Set in +attribute [local grind _=_] Set.le_iff_subset in +variable {P : Type*} [PhaseSpace P] {p q : P} in +@[grind =, simp] lemma Cslib.Logic.CLL.PhaseSpace.orthogonal_def (X : Set P) : X⫠ = {m | ∀ x ∈ X, m * x ∈ bot} := rfl - Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- Cslib.Logic.CLL.PhaseSpaceA phase space is a commutative monoid M equipped with a distinguished subset ⊥. This forms the algebraic foundation for interpreting…
- Cslib.Logic.CLL.PhaseSpace.orthogonalThe orthogonal
X⫠of a set X: the set of elements that map X into ⊥ under multiplication. - Cslib.Logic.CLL.Proposition.dualPropositional duality.
- Used by 13
- Cslib.Logic.CLL.PhaseSpace.orth_iUnionGiven a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that (⋃ᵢ Gᵢ)⫠ = ⋂ᵢ Gᵢ⫠.
- Cslib.Logic.CLL.PhaseSpace.biorthogonalClosureThe biorthogonal closure operator on sets in a phase space.
- Cslib.Logic.CLL.PhaseSpace.FactThe type of facts in a phase space.
- Cslib.Logic.CLL.PhaseSpace.instPartialOrderFactCslib.Logic.CLL.PhaseSpace.instPartialOrderFact
- Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orthGiven a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that ∩ᵢ Gᵢ⫠⫠ = (∪ᵢ Gᵢ⫠)⫠.
- Cslib.Logic.CLL.PhaseSpace.instHasSubsetFactCslib.Logic.CLL.PhaseSpace.instHasSubsetFact
- Cslib.Logic.CLL.PhaseSpace.triple_orthThe triple orthogonal equals the orthogonal: X⫠⫠⫠ = X⫠.
- Cslib.Logic.CLL.PhaseSpace.isFactA fact is a subset of a phase space that equals its biorthogonal closure.
- Cslib.Logic.CLL.PhaseSpace.subset_dual_dualCslib.Logic.CLL.PhaseSpace.subset_dual_dual
- Cslib.Logic.CLL.PhaseSpace.instSetLikeFactCslib.Logic.CLL.PhaseSpace.instSetLikeFact
- Cslib.Logic.CLL.PhaseSpace.triple_dualCslib.Logic.CLL.PhaseSpace.triple_dual
- Cslib.Logic.CLL.PhaseSpace.orth_antitoneThe orthogonal operation is antitone: if X ⊆ Y then Y⫠ ⊆ X⫠.
- Cslib.Logic.CLL.PhaseSpace.orth_extensiveThe biorthogonal operation is extensive: X ⊆ X⫠⫠ for any set X.
Lean source view module on GitHub
set_option quotPrecheck false open Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace @[inherit_doc] local postfix:max "⫠" => orthogonal open Cslib Cslib.Logic Cslib.Logic.CLL @[inherit_doc] local postfix:max "⫠" => Proposition.dual set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace in universe u v in open scoped Pointwise in open Set in attribute [local grind _=_] Set.le_iff_subset in variable {P : Type*} [PhaseSpace P] {p q : P} in @[grind =, simp] lemma Cslib.Logic.CLL.PhaseSpace.orthogonal_def (X : Set P) : X⫠ = {m | ∀ x ∈ X, m * x ∈ bot} := rfl