R5 L-C — the Theorem-6 finish: StableSet from the uniform semi-attractor
Seal
Rung R5 · Status interfaced — all eight theorems axiom-clean (
#print axiomsverbatim in 6. The machine seal), nosorryAx. The core theorem was sealed with three named interfaces (hUSA,hFirstExit,hContDep); the two flow-side interfaces were discharged in-module the same evening by parallel tightening lanes, so the public assemblystableSet_of_uniformSemiAttractor_of_forwardInvariantrests onhUSAalone. This module discharges ledger rowshStable,hFirstExit,hContDep: the L4a hypothesishStable : StableSet ϕ Γ₁is now a proved conclusion whose entire remaining trust boundary is EHM-2009 Lemma 2.5.
Links: module index · interface ledger · consumes L-A) and Reduction (L4a) · recon (/Code/notes/ctrllib_r5_mathlib_recon.md) · R6 recon (/Code/notes/ctrllib_r6_lemma25_recon.md) · sources elhawwary2013reduction + EHM-2009 (arXiv:0907.0686, corpus filing in flight)
What this seals, in one paragraph
EHM-2013 Theorem 6 (compact branch) proves set stability of by contradiction: if were unstable, Lemma 22 extracts an escape sequence whose base points converge to some , and a µ-tube compactness argument around forces the escaping orbits back into the tube they were supposed to leave — contradiction. The proof text (corpus elhawwary2013reduction.md:1317-1461) invokes, at :1347, “Lemma 2.5 in El-Hawwary and Maggiore (2009)” to convert relative attractivity into the uniform semi-attractor property (A.1). That external bridge is taken here as the named hypothesis hUSA; two flow-regularity steps of the finish are likewise named (hFirstExit, hContDep); everything else is sealed: the uniform-basin extraction (A.2)+(A.3), the ball-nesting claim, the segment-approaches- step, and the final contradiction glue. The module is (~/Code/vault/lean/ReductionStabilityFinish.lean), build copy ~/lean/ctrllib/Ctrllib/ReductionStabilityFinish.lean.
No SymPy pin: pure metric topology, no numeric content (sympy_pin: ""), same deliberate omission as reduction_stability.
1. The mathematical objects
Same conventions as L4a and reduction_stability: real normed space , Metric.infDist x Γ for the point-to-set distance, EHM’s = the predicate , flow application = ϕ t x. The one new definition transcribes EHM-2009 Def 2.1(iv) in its relative form — the property the 2013 finish labels (A.1):
The R6 recon verified this is a quantifier-for-quantifier transcription of the 2009 paper’s eq. (18) (p. 21) — the exact formula Lemma 2.5 produces — so no adapter theorem will be needed when hUSA is discharged.
2. The graded interfaces — what is assumed, and why each is honest
Per the charter’s honest-boundary discipline, an interface hypothesis must be a true, later-derivable fact with a named seal route — never a restatement of the conclusion.
| hypothesis | content (paper site) | fate |
|---|---|---|
hUSA | Lemma 2.5’s output: is a uniform semi-attractor relative to (:1347-1351) | OPEN — the module’s only interface. Discharge = formalize EHM-2009 Appendix A — the R6 rung; go/no-go GO per (~/Code/notes/ctrllib_r6_lemma25_recon.md), 2 theorems + 1 rewire, route decided by the user: compact-branch direct. EHM condition (i) hAttr and -side hypotheses are consumed there, which is why they do not appear in this module’s statement. |
hFirstExit | Lemma 22 in first-exit form: ONE base sequence , and per level an exit-time sequence with , orbit inside the -tube on , and (:1318-1322, :1421) | DISCHARGED same evening by firstExit_of_not_stableSet: Brick 1 exists_firstExitTime = hitting-time infimum (sInf of the closed hitting set + left-limit, IsClosed.csInf_mem); Brick 3 exists_uniform_tube_radius = the tube lemma on [0,B] ×ˢ Γ₁ inside the open sublevel set of the jointly-continuous tube function (generalized_tube_lemma + IsCompact.exists_thickening_subset_open) — no subsequence extraction, no finite dimension; Brick 2 = assembly over L-A’s base sequence. Positive invariance hfi is consumed exactly here (:1303, :1421). |
hContDep | continuous dependence at the fixed time on a ball (:1447) | DISCHARGED same evening by contDep_of_flow: Heine–Cantor (IsCompact.uniformContinuousOn_of_continuous) on the compact closedBall p (r+1) from Flow.continuous_toFun, with a min δ 1 cap keeping both points in the collar. |
The level-family quantifier in hFirstExit is load-bearing. The paper’s footnote 3 (:1396-1398) shrinks below after is extracted — sound only because depends on alone, and the same base sequence admits first-exit times at every smaller level (an orbit that reaches distance crosses every level below it). A single-level interface would have made the Lean statement circular ( needs , needs the sequence, the sequence would need ).
3. Theorem 1 — ball-nesting brick (infDist_subCollar_of_mem_inter, sealed)
The paper’s claim at :1382-1408: with . Sealed unchanged from the previous session. (The R6 recon found the 2009 paper’s Appendix D, pp. 21–22, contains a clean twin of this claim — a useful un-scrambled cross-check on the 2013 OCR.)
Why we need it. The uniform basin radius of Theorem 2 is only valid at centers inside the compact set — but the point the main proof produces is merely close to , which may be unbounded. This brick converts “close to and close to ” into “close to the compact collar,” which is where the basin machinery lives.
Proof. Let be a point with and . We must exhibit a point of within distance of . There are two cases, split on whether .
Case . Since and is nonempty, there is a witness with . We claim this same lies in the collar. Indeed, by the triangle inequality through ,
so , and the distance from to the collar is at most , as desired.
Case . Here the collar’s own center does the job: belongs to by hypothesis and to trivially (its radius is positive), and . Hence the distance from to the collar is below in this case too.
The moral. Nothing about flows here — the brick is a statement about metric geometry alone, which is why it sealed axiom-clean in a single sitting. The paper’s two cases are exactly the two branches of the Lean by_cases.
4. Theorem 2 — uniform basin over a compact set (uniform_basin_of_uniformSemiAttractor, sealed)
The paper’s (A.2)+(A.3) (:1352-1381): from the per-point radii of hUSA, compactness of yields a single , and then per tube level a single :
Scratch work — why the paper’s own sentence needs repair. The paper says “the infimum of , in (A.1), for all exists and is greater than zero” (:1352-1360). As stated this is not a theorem: an infimum of positive numbers over an infinite set can perfectly well be zero, and the function handed to us by hUSA carries no continuity whatsoever (it comes from the axiom of choice). What is true is that compactness lets us replace the infinite family by a finite one — and a finite minimum of positive numbers is positive. The standard device is to cover with half-radius balls, so that a point covered by the ball at still has half of to spare for its own neighbourhood.
Proof. For each , the hypothesis hUSA provides a basin radius such that for every tube level there is a time with
(the property (A.1); in Lean the two choose! calls make and honest functions). Now cover the compact set by the open balls as ranges over — each is a neighbourhood of its center since . By compactness (IsCompact.elim_nhds_subcover) finitely many centers suffice, and the finite set is nonempty because is. Define
Both are positive, being a finite minimum (respectively maximum) of positive numbers.
We verify the claim. Let , let be any point with and , and let . The point lies in some covering ball, say . Then by the triangle inequality through ,
where the middle step used that is the minimum of the half-radii. Hence lies in the per-point basin , and since , property (A.1) at gives , as desired.
The moral. Compactness converts a pointwise promise into a uniform one — but only through a finite intermediary. The half-radius trick is what makes the paper’s infimum sentence rigorous without ever taking an infimum over an infinite set.
Mathlib lemmas used (paths relative to ~/lean/ctrllib/.lake/packages/mathlib/Mathlib/):
| lemma | file |
|---|---|
IsCompact.elim_nhds_subcover | Topology/Compactness/Compact.lean:226 |
Metric.ball_mem_nhds | Topology/MetricSpace/Pseudo/Defs |
Finset.lt_inf'_iff (to_dual of sup'_lt_iff), Finset.inf'_le, Finset.le_sup' | Data/Finset/Lattice/Fold.lean — requires an explicit import Mathlib.Data.Finset.Lattice.Fold, not in the module’s transitive closure (same import-scope gotcha class as le_or_lt last session) |
choose! (total-function choice through ∀ x ∈ Γ₁ binders) | core tactic |
5. Theorem 3 — the finish (stableSet_of_uniformSemiAttractor, interfaced)
Statement. [FiniteDimensional ℝ E], compact nonempty, , hLUB (local uniform boundedness, EHM Def 5), hLSN ( locally stable near , EHM Def 3 = assumption (ii)), plus the three interfaces ⟹ StableSet ϕ Γ₁.
Proof spine, matched to the paper (:1317-1461):
by_contra;hFirstExityields , the base sequence , and the level family.- L-B (reduction_stability) extracts a subsequence (compactness of gives closed + bounded).
hLUBat : radii with (:1323-1324).- Theorem 2 on the widened collar : the uniform (depends only on — this is why footnote 3 is non-circular).
- Working level (footnote 3,
:1396-1398); exit times at level ; uniform time at tube level ;hContDepradius at ; working radius . - Segment-approaches-, sealed inline (
:1325-1343):hLSNat gives ; for large, and , sohLUBkeeps the whole segment in andhLSNpushes it within of . Correction vs. the handoff: the source derives this from local stability (ii) + local uniform boundedness —hLSN+hLUB, nothLSN+hAttr— and it needs no flow regularity, so it is sealed here rather than interfaced. - One eventual index : is pre-exit (so ), inside , and within of ; take the witness , (
:1417-1441). - is in the -tube ( by construction) and in ( absorbs the witness slack — see §7); Theorem 1 nests it into , giving a collar center with .
- Theorem 2 at : .
hContDep: . Flow law (Flow.map_add,:1424-1426). - , contradicting the first-exit equality (
:1442-1461).
The proof, in full
Technique. Contradiction — the natural choice, since instability is a “there exists an escape” statement and our tools (the uniform basin, local uniform boundedness) are all confinement statements. We assume an escape exists and confine it to death.
Proof idea in one breath. If were unstable, some orbits would start arbitrarily close to it yet reach a fixed distance . Follow one such orbit and photograph it a fixed time before its first exit. That photograph lands close to (by local stability of ), so a genuine -point sits next to it — and is inside the uniform basin of the collar around the limit point . The basin machinery then drags ‘s orbit into a thin tube () within time , and continuous dependence says the photographed orbit — whose time- image is exactly the exit point — cannot be more than away. So the exit point is inside the -tube. But the exit point sits at distance exactly . Contradiction.
Proof. Suppose, by way of contradiction, that is not stable. The hypothesis hFirstExit (discharged below in §5b) then provides a level and a single base sequence with , together with — for every level — a sequence of first-exit times. We deliberately do not fix the level yet; the freedom to shrink it is footnote 3’s whole point, and we will spend it in step 4.
Step 1 (the limit point). Since is compact, it is closed and bounded, so L-B (reduction_stability) applies to the base sequence: there is a subsequence with .
Step 2 (local uniform boundedness). The hypothesis hLUB at the point provides radii and such that every orbit starting in remains in for all forward time (:1323-1324).
Step 3 (the uniform basin). Form the widened collar — compact, as the intersection of the compact with a closed ball, and nonempty since it contains . Theorem 2 applied to yields a single radius , and for each tube level a single time. Note the dependency order: depends only on and , not on any escape level — this is what makes the next step legitimate.
Step 4 (fixing the level — footnote 3). Set , so that and . Take from hFirstExit the exit-time sequence for this level: eventually in , the orbit of satisfies for all and , with . Had we fixed before , this step would be circular; the paper’s footnote 3 (:1396-1398) is precisely the observation that the same base sequence exits at every smaller level, so the level may be chosen after the basin radius.
Step 5 (the remaining constants). From Theorem 2 take for the tube level . From hContDep (discharged in §5b) at time , center , ball radius , and output tolerance , take . Set — positive since forces . Finally, from hLSN at the point with confinement radius and output tolerance , take (:1325-1330).
Step 6 (one sufficiently late index). Along the subsequence, four things happen eventually, so they happen simultaneously at some index: writing for that index, we have (convergence to ), (the base sequence approaches ), (exit times tend to infinity), and the first-exit properties at level hold at .
Step 7 (the photograph and its three addresses). Define — the orbit of photographed exactly before its first exit. Since , the photograph is pre-exit, so . Since , local uniform boundedness places the whole segment — hence — inside . And since while the segment up to time stays in , the hypothesis hLSN pushes the whole segment within of ; in particular . This last step is the paper’s :1325-1343, and note what it consumed: local stability of and local uniform boundedness — no flow regularity, which is why it needed no interface.
Step 8 (the -witness enters the basin). Since is nonempty, the bound produces a genuine point with . Two containments follow. First, since the point-to-set distance is -Lipschitz,
Second, by the triangle inequality and ,
(This is where the widened collar earns its keep: the paper takes the witness inside directly at :1431, which its own bounds do not quite deliver; widening by one unit and capping repairs the constant without touching the argument.) Now Theorem 1 — the ball-nesting brick, applied with radius — converts “within of and within of ” into “within of the compact collar ”: there is a center with .
Step 9 (confinement and transport). The point lies in with , so Theorem 2 confines its orbit from time onward: . Meanwhile hContDep — with and — transports along the time- map: .
Step 10 (the contradiction). By the flow law, . Therefore, using the Lipschitz property of the point-to-set distance once more,
But the first-exit property says exactly. A number cannot be both equal to and strictly below it, so the assumed instability is absurd, and is stable.
The moral. Every quantifier in the theorem earns its place in one specific step: compactness of buys the limit point (step 1) and the collar (step 3); hLUB buys the bounded stage on which everything happens (steps 2, 7); hLSN buys the bridge from “near ” to “near ” (step 7); hUSA buys the only genuinely dynamical confinement (step 9); and the first-exit structure buys the exact equality that the confinement contradicts (step 10). The proof is long but has no idea in it beyond “photograph the escape early, and show the camera never lies by more than .“
5b. The tightening seals, in full
The three flow-side facts the core theorem consumes were themselves proved the same evening. Their proofs are short enough to give completely.
contDep_of_flow (continuous dependence at a fixed time). We must produce, for a time , a center , a ball radius and a tolerance , a such that any in and any within of satisfy . Since is finite-dimensional it is a proper metric space, so the closed ball is compact. The time- map is continuous, and a continuous map on a compact set is uniformly continuous there (Heine–Cantor); extract for the tolerance and set . If and , then both and lie in — the second because — so uniform continuity applies. The widening and the cap are the same trick as step 8 above: pay one unit of radius to make a boundary case disappear.
exists_firstExitTime (the hitting time). Fix one trajectory: suppose at time zero and at some time . Write — a continuous function of , being the composition of the continuous orbit map with the -Lipschitz point-to-set distance. Consider the hitting set . It is closed (an intersection of a closed interval with a sublevel-complement of a continuous function), nonempty (it contains ), and bounded below by ; hence its infimum exists and belongs to , giving . For any minimality forbids , so — the orbit is strictly inside the tube before . The case is impossible since by hypothesis. Finally, approaching from the left through values and using continuity, ; combined with this forces the exact equality . This is the intermediate value theorem in its “first crossing” form, done by hand because we need the minimality, not just existence.
exists_uniform_tube_radius (bounded times cannot escape). Fix a time horizon and a tolerance . The set is open in , by joint continuity of the flow. It contains the product : for and , forward invariance keeps , where the distance is zero. The product of the compact interval with the compact is compact, so the tube lemma provides open sets and with still inside the open set; and a compact set inside an open set admits a -thickening still inside it. That is the claim: any within of lies in , so for every the pair is in , whence . No subsequences, no finite dimension — the tube lemma replaces the planned Heine–Cantor-on-a-product route outright.
firstExit_of_not_stableSet (the assembly). Assume is not stable. L-A (reduction_stability) yields , a base sequence with , and times with . Fix any level . Eventually , and on that tail the hitting-time theorem applies to each index (the orbit starts inside the -tube and reaches at ), producing first-exit times with the equality and pre-exit properties. It remains to show . Suppose not: then some bound is exceeded by no along a subsequence. Apply the tube-radius theorem with horizon and tolerance to get ; eventually , and at an index where all three conditions meet, the exit point — a point of the orbit at a time from a start within of — satisfies , contradicting the exit equality . Hence the exit times are unbounded, and since they are produced along the whole tail, they tend to infinity. Positive invariance of enters the whole L-C chain exactly once — inside the tube-radius theorem above — which is why the core theorem could drop it as a hypothesis.
6. The machine seal
#print axioms, verbatim from the per-file build (lake build Ctrllib.ReductionStabilityFinish, 2026-07-09 evening, post-integration; full project lake build green at 2658/2659 jobs, Built Ctrllib):
info: Ctrllib/ReductionStabilityFinish.lean:476:0: 'Ctrllib.infDist_subCollar_of_mem_inter' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:477:0: 'Ctrllib.uniform_basin_of_uniformSemiAttractor' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:478:0: 'Ctrllib.stableSet_of_uniformSemiAttractor' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:479:0: 'Ctrllib.contDep_of_flow' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:480:0: 'Ctrllib.exists_firstExitTime' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:481:0: 'Ctrllib.exists_uniform_tube_radius' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:482:0: 'Ctrllib.firstExit_of_not_stableSet' depends on axioms: [propext, Classical.choice, Quot.sound]
info: Ctrllib/ReductionStabilityFinish.lean:483:0: 'Ctrllib.stableSet_of_uniformSemiAttractor_of_forwardInvariant' depends on axioms: [propext, Classical.choice, Quot.sound]Nothing beyond {propext, Classical.choice, Quot.sound} on any of the eight; no sorryAx; zero sorry in the module. (Tightening-lane gotchas recorded for future modules: Ioo_mem_nhdsWithin_Iio-family names are now *_mem_nhdsLT; push_neg is deprecated in this toolchain — use push Not; omit [...] in must precede the doc comment; two whnf deterministic timeouts were avoided by building joint continuity from continuous_fst/continuous_snd and by naming the product-membership pair before exact.)
7. Scope, honestly (ponytail)
- Interfaced, not fully standalone: the public assembly’s conclusion
StableSet ϕ Γ₁rests onhUSA— one named, seal-routed external fact (EHM-2009 Lemma 2.5). The evening’s arc: boundaryhStable(theorem-sized) → three named facts (the core seal) →hUSAalone (the tightening lanes, same evening). The interfaces ledger rows record each step. - Statement deviation from the paper, on purpose: EHM’s Theorem 6 lists (i) relative asymptotic stability, (ii)
hLSN, (iii) LUB, plus positive invariance and closedness. This module’s statement omitshAttr,hpi₁, and -closedness because tonight’s proof never touches them — each is consumed inside a named interface’s future seal (recorded in §2). The paper-shaped assembly is the final rewire, after F3. - One quantitative widening vs. the paper: at
:1431the paper takes the -witness directly, but the witness only satisfies . We widen the collar to and cap — same argument, airtight constants. ThehcontDepball is widened to accordingly. - Sealed inline rather than interfaced (stronger than the handoff plan): the segment-approaches- step — the planned third flow interface
hSegΓ₂— turned out to be pure logic fromhLSN+hLUB(source:1325-1343); its tightening ticket closes with this module. - The other two tightening tickets also closed same-evening (parallel lanes, integrated serially):
hContDepby Heine–Cantor;hFirstExitby hitting-time infimum + the tube lemma — the latter replacing the planned Heine–Cantor-on-a-product route with a cleaner one needing no finite dimension. The core theorem is kept with its named hypotheses on purpose: it documents the paper’s proof structure and lets a future reader see exactly which flow facts the finish consumes. - Identifier gotchas for future modules: the micro sign
µ(U+00B5) is not a valid Lean identifier character — use Greekμ(U+03BC);Finsetinf'/sup'comparison lemmas need the explicitMathlib.Data.Finset.Lattice.Foldimport;Finset.lt_inf'_ifftakes the nonemptiness proof as an explicit argument.