Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

completely-increasing-bijection

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.completely_increasing_bijection

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For a complete lattice LLL, write Ha={b:a≤b}H_a=\{b:a\le b\}Ha​={b:a≤b} for a≠0a\ne0a=0. Bounded completely increasing functions on L∖{0}L\setminus\{0\}L∖{0} correspond bijectively to abstract observable functions on D(L)D(L)D(L) under the explicit inverse maps

r⟼(J⟼inf⁡a∈Jr(a)),f⟼(a⟼f(Ha)).r\longmapsto \bigl(J\longmapsto\inf_{a\in J}r(a)\bigr),\qquad f\longmapsto\bigl(a\longmapsto f(H_a)\bigr).r⟼(J⟼a∈Jinf​r(a)),f⟼(a⟼f(Ha​)).

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.

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

/-- 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
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 11, completely-increasing-bijection
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every complete lattice LLL, put L∗={a∈L:a≠⊥}L_*=\{a\in L:a\ne\bot\}L∗​={a∈L:a=⊥}, and let D(L)\mathcal D(L)D(L) consist of the nonempty subsets J⊆LJ\subseteq LJ⊆L that exclude ⊥\bot⊥, are upward closed, and are closed under binary meets. Equip D(L)\mathcal D(L)D(L) with the topology generated by {J:a∈J}\{J:a\in J\}{J:a∈J}, for a∈La\in La∈L. Call a real-valued function FFF on D(L)\mathcal D(L)D(L) an abstract observable when it is upper semicontinuous and, for every nonempty family F⊆D(L)\mathcal F\subseteq\mathcal D(L)F⊆D(L) and every proper dual ideal J=⋂K∈FKJ=\bigcap_{K\in\mathcal F}KJ=⋂K∈F​K, it satisfies F(J)=sup⁡K∈FF(K)F(J)=\sup_{K\in\mathcal F}F(K)F(J)=supK∈F​F(K). Call r:L∗→Rr:L_*\to\mathbb Rr:L∗​→R completely increasing when, for every nonempty set A⊆L∗A\subseteq L_*A⊆L∗​ and every a∈L∗a\in L_*a∈L∗​ that is the least upper bound in LLL of the underlying elements of AAA, r(a)=sup⁡b∈Ar(b)r(a)=\sup_{b\in A}r(b)r(a)=supb∈A​r(b). Define

r~(J)=inf⁡{r(a):a∈L∗, a∈J},R(F)(a)=F({b∈L:a≤b}).\widetilde r(J)=\inf\{r(a):a\in L_*,\ a\in J\},\qquad R(F)(a)=F(\{b\in L:a\le b\}).r(J)=inf{r(a):a∈L∗​, a∈J},R(F)(a)=F({b∈L:a≤b}).

The infima and suprema here are the total real operations: the infimum is 000 for an empty set or a set unbounded below, and the supremum is 000 for an empty set or a set unbounded above. The theorem asserts both that every completely increasing rrr whose range is bounded above and bounded below has r~\widetilde rr an abstract observable with R(r~)=rR(\widetilde r)=rR(r)=r, and that every abstract observable FFF has R(F)R(F)R(F) bounded above and bounded below, has R(F)R(F)R(F) completely increasing, and satisfies R(F)~=F\widetilde{R(F)}=FR(F)​=F. No orthocomplementation or nontriviality assumption on LLL is required; when LLL has only one element, both L∗L_*L∗​ and D(L)\mathcal D(L)D(L) are empty, and the assertions concern the corresponding empty-domain functions.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me