Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compact antitone families have right limits characterized by least upper bounds

Proved
WeilDefect.MarkerStability.exists_compact_antitone_right_limit

by waitingintime · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

connes-weilgreennorm-limitsupport-window

Let EEE be a topological partial order with closed order relation, c∈Rc\in\mathbb Rc∈R, and f:(c,∞)→Ef:(c,\infty)\to Ef:(c,∞)→E a decreasing family contained in a compact set CCC. There is G+∈CG_+\in CG+​∈C with

G+=sup⁡{f(t):t>c},lim⁡t↓cf(t)=G+.G_+=\sup\{f(t):t>c\},\qquad\lim_{t\downarrow c}f(t)=G_+.G+​=sup{f(t):t>c},t↓clim​f(t)=G+​.

The supremum is the least upper bound and is proved to exist without assuming a lattice or total order on EEE. Applied to the original finite selected Picard markers, this supplies their outer support norm limit after their inner regularization norm limits.

Preamble
import Mathlib.Topology.Instances.Real.Lemmas
import Mathlib.Topology.Order.Monotone
import Mathlib.Topology.Compactness.Compact
open Filter Set
open scoped Topology
Formal statement
theorem WeilDefect.MarkerStability.exists_compact_antitone_right_limit{E : Type*} [TopologicalSpace E]
    [PartialOrder E] [OrderClosedTopology E] (f : ℝ → E) (c : ℝ) (C : Set E)
    (hC : IsCompact C) (hmem : ∀ t : ℝ, c < t → f t ∈ C)
    (hanti : AntitoneOn f (Set.Ioi c)) :
    ∃ G₀ : E, G₀ ∈ C ∧ IsLUB (f '' Set.Ioi c) G₀ ∧
      Filter.Tendsto f (nhdsWithin c (Set.Ioi c)) (nhds G₀) := by sorry
Source
monocap-tech/weil native base b019d40205680f9761a4b0a80cbcad56ee1b606b; exact new source modules Connes/CanonicalGreenWindowInclusion.lean, Screening/MarkerCompression.lean and Connes/CanonicalGreenSupportLimit.lean in Connes_Weil_Original_Support_Limit.zip. Both ordered norm limits are proved natively; prescribed critical endpoint identification, support containment, arithmetic lower bounds and RH are not assumed or asserted. Literature/source audit addendum (2026-10-11; COR-15): Exact native software custody, independently verified from retained local Git objects: monocap-tech/weil d73d0e7f1477c934a3a8f8b01012852128b977bb, WeilDefect/Screening/MarkerCompression.lean, SHA256 690f5406173739c343de426a3a99e37e4d698883eb8ebfe12f71ea3259fc9b88. Public availability of these historical pins has not been checked; this addendum verifies local source bytes and preserves the original source ancestry.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me