Proposition 3.4
ProvedQAlgorithms.Papers.Independent.Intakethird100.P20.quasipoint_upward_and_meet_closedprove2quantum
In a bounded lattice , every quasipoint is upward closed and closed under binary meets:
These are consequences of maximality; they are not included in the filter-base definition.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P20
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P20
open Set TopologicalSpace
open QAlgorithms.Papers.Independent.Next46.P33 (Projection)
open scoped Topology
universe u v
/-- Proposition 3.4; de Groote, Observables I, PDF p./pp. 39.
-/
theorem quasipoint_upward_and_meet_closed {L : Type u} [Lattice L] [BoundedOrder L] (B : Set L) (hB : IsQuasipoint B) :
(∀ a ∈ B, ∀ b : L, a ≤ b → b ∈ B) ∧
(∀ a ∈ B, ∀ b ∈ B, a ⊓ b ∈ B) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 39, Proposition 3.4
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any bounded lattice, and let be a quasipoint: is nonempty, , for every there is with and , and every set satisfying these same three conditions and containing equals . Then is upward closed, meaning that and imply for every , and is closed under binary meets, meaning that imply .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.