Lemma 3.2
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.finite_type_iff_directed_meet_lawA complete orthomodular lattice is of finite type exactly when meet with any fixed element preserves suprema of nonempty directed subsets:
Here ranges over the directed ranges of arbitrary nonempty increasing nets. Finite type uses the closure of the corresponding union of Stone basic sets.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P20
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P20
open Set TopologicalSpace
open QAlgorithms.Papers.Independent.Next46.P33 (Projection)
open scoped Topology
universe u v
/-- Lemma 3.2; de Groote, Observables I, PDF p./pp. 46.
-/
theorem finite_type_iff_directed_meet_law {L : Type u} [CompleteLattice L] (perp : L → L) (horth : IsOrthomodular perp) :
IsFiniteType L ↔ HasDirectedMeetLaw L := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complete lattice and let be a function satisfying, for all , , , , , and , and additionally satisfying whenever and . Define a quasipoint of to be an inclusion-maximal nonempty subset that excludes and such that any two members have a common lower bound belonging to . Let be the set of quasipoints, equipped with the topology generated by . Then the following are equivalent: for every nonempty upward-directed subset , ; and for every and every nonempty upward-directed subset , . Here upward-directed means that any two members of have a common upper bound in ; neither condition imposes a requirement on the empty subset.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.