completely-increasing-bijection
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.completely_increasing_bijectionFor a complete lattice , write for . Bounded completely increasing functions on correspond bijectively to abstract observable functions on under the explicit inverse maps
Here complete increase means preservation of suprema of every nonempty family of nonzero elements. The topology and intersection condition defining abstract observables are the membership topology and nonempty-family condition. This is a complete-lattice result; orthomodularity is not required.
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
/-- completely-increasing-bijection; de Groote, Observables I, PDF p./pp. 11, 12.
-/
theorem completely_increasing_bijection {L : Type u} [CompleteLattice L] :
(∀ r : {a : L // a ≠ ⊥} → ℝ,
BddAbove (Set.range r) → BddBelow (Set.range r) → IsCompletelyIncreasing r →
IsAbstractObservable (extendIncreasing r) ∧ restrictObservable (extendIncreasing r) = r) ∧
(∀ f : DualIdeal L → ℝ, IsAbstractObservable f →
BddAbove (Set.range (restrictObservable f)) ∧ BddBelow (Set.range (restrictObservable f)) ∧
IsCompletelyIncreasing (restrictObservable f) ∧ extendIncreasing (restrictObservable f) = f) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every complete lattice , put , and let consist of the nonempty subsets that exclude , are upward closed, and are closed under binary meets. Equip with the topology generated by , for . Call a real-valued function on an abstract observable when it is upper semicontinuous and, for every nonempty family and every proper dual ideal , it satisfies . Call completely increasing when, for every nonempty set and every that is the least upper bound in of the underlying elements of , . Define
The infima and suprema here are the total real operations: the infimum is for an empty set or a set unbounded below, and the supremum is for an empty set or a set unbounded above. The theorem asserts both that every completely increasing whose range is bounded above and bounded below has an abstract observable with , and that every abstract observable has bounded above and bounded below, has completely increasing, and satisfies . No orthocomplementation or nontriviality assumption on is required; when has only one element, both and are empty, and the assertions concern the corresponding empty-domain functions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.