Compact monotone families in closed partial orders have right limits
ProvedWeilDefect.MarkerStability.exists_compact_monotone_right_limitconnes-weilgreennorm-limitpicard
Let be a topological partial order with closed order relation. Suppose is increasing and takes values in a fixed compact set . Then there is such that
The infimum denotes the greatest lower bound and is proved to exist here. No lattice structure or linear ordering on is assumed. This supplies the compactness argument for finite selected Green markers.
Preamble
import Mathlib.Topology.Order.Monotone import Mathlib.Topology.Compactness.Compact import Mathlib.Analysis.Normed.Module.FiniteDimension open Filter Set open scoped Topology
Formal statement
theorem WeilDefect.MarkerStability.exists_compact_monotone_right_limit{E : Type*} [TopologicalSpace E]
[PartialOrder E] [OrderClosedTopology E] (f : ℝ → E) (C : Set E)
(hC : IsCompact C) (hmem : ∀ ε : ℝ, 0 < ε → f ε ∈ C)
(hmono : MonotoneOn f (Ioi (0 : ℝ))) :
∃ G₀ : E, G₀ ∈ C ∧ IsGLB (f '' Ioi (0 : ℝ)) G₀ ∧
Tendsto f (nhdsWithin 0 (Ioi (0 : ℝ))) (nhds G₀) := by sorry
Source
monocap-tech/weil at native base b019d40205680f9761a4b0a80cbcad56ee1b606b; new Screening/MarkerLimit.lean and Connes/CanonicalGreenMarkerLimit.lean. Exact certified sources in Connes_Weil_Original_Picard_Limit.zip. The inner norm limit is proved; critical support location, outer endpoint transfer and unconditional RH are not 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/MarkerLimit.lean, SHA256 7b092878929fd6db78207fedbf9a710351d2a8bc1803ddec7e887548fb093f8a. Public availability of these historical pins has not been checked; this addendum verifies local source bytes and preserves the original source ancestry.