diff --git a/frontiers/cap_first_exit_lean_20261002/ALIGNMENT.md b/frontiers/cap_first_exit_lean_20261002/ALIGNMENT.md index d7d7e401b..1bc95786f 100644 --- a/frontiers/cap_first_exit_lean_20261002/ALIGNMENT.md +++ b/frontiers/cap_first_exit_lean_20261002/ALIGNMENT.md @@ -4,7 +4,7 @@ | Source | Path | Role | |---|---|---| -| SP | `reviews/d1_cap_elder_partner_second_pass_claude_20260930/REVIEW.md` | the line-numbered reconstruction of CAP §§2–5. L13, L16, L17 and L19–L22 are proved here. Since v1.5, L1, L2, L5, L7 (maximum and uniqueness), L8, L11's chain rule and L18 are also proved, from SP's normalization and L4's output (`ridge_capHyp_normalized`, `ridge_capHyp_sp`, `ridge_capHyp_of_slices`). Since v1.6, L3–L4 are proved from SP's (H1) and the third-derivative bounds on the transverse Hessian (`ridge_capHyp_H1`). Since v1.7, L7's existence and implicit-function regularity of `h` are proved (`ridge_exists`, `ridge_differentiable`). Since v1.8, L3–L4 are proved on a collar of `D` and the route up to L12 (`hconv`) is composed from SP's source data there (`ridge_capHyp_source`). Since v1.9, L6 and L9–L12 are proved and `ridge_capHyp_C3` derives `hconv` from the `C³` data. Since v2.0, L2's second statement and L4's `f_xxx ≥ 7/4` are proved from (H2) (`ridge_capHyp_C4`). Since v2.1, the six derivative-bound hypotheses are derived from the block bound and `|f_xxx| ≤ m` on the pin segment (`ridge_capHyp_C5`), and the quantitative bounds are assumed on `D` only, with the continuity step to the collar proved (`ridge_capHyp_D`). Inputs that remain: the source data themselves (I3). | +| SP | `reviews/d1_cap_elder_partner_second_pass_claude_20260930/REVIEW.md` | the line-numbered reconstruction of CAP §§2–5. L13, L16, L17 and L19–L22 are proved here. Since v1.5, L1, L2, L5, L7 (maximum and uniqueness), L8, L11's chain rule and L18 are also proved, from SP's normalization and L4's output (`ridge_capHyp_normalized`, `ridge_capHyp_sp`, `ridge_capHyp_of_slices`). Since v1.6, L3–L4 are proved from SP's (H1) and the third-derivative bounds on the transverse Hessian (`ridge_capHyp_H1`). Since v1.7, L7's existence and implicit-function regularity of `h` are proved (`ridge_exists`, `ridge_differentiable`). Since v1.8, L3–L4 are proved on a collar of `D` and the route up to L12 (`hconv`) is composed from SP's source data there (`ridge_capHyp_source`). Since v1.9, L6 and L9–L12 are proved and `ridge_capHyp_C3` derives `hconv` from the `C³` data. Since v2.0, L2's second statement and L4's `f_xxx ≥ 7/4` are proved from (H2) (`ridge_capHyp_C4`). Since v2.1, the six derivative-bound hypotheses are derived from the block bound and `|f_xxx| ≤ m` on the pin segment (`ridge_capHyp_C5`), and the quantitative bounds are assumed on `D` only, with the continuity step to the collar proved (`ridge_capHyp_D`). Since v2.2, the collar data, the collar and its bound `K` are derived from `f ∈ C⁴` on an open neighbourhood of `D` (`ridge_capHyp_E`). Inputs that remain: the source data themselves, that is SP's §2 setting on `D` (I3). | | CAP | `imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md` | the deterministic theorem that SP reconstructs | The source setting (SP §2) is as follows: @@ -98,6 +98,9 @@ The source setting (SP §2) is as follows: | `block_nonneg`, `block_bound_collar` | `K ≥ 0`, `0 ≤ ε ≤ ε₀`; the block bound `m` on `D = [−2r, 2r] × B̄(0, 2r)`; on the collar of width `ε₀`, `T4 p a b c` the derivative of `t ↦ T3(t, p₂) a b c` at `p₁`, with the block bound `K` ⇒ the block bound `m + Kε` on the collar of width `ε` | I3's continuity step (SP bounds `M₃` on `D`; `f ∈ C⁴` near `D`) | Each collar point `(x, y)` is within `ε` of a point `(x₀, y) ∈ D`. The mean value inequality along `x` on the convex interval of width `ε₀` adds at most `Kε` times the block weight. | | `ridge_capHyp_C5` | `ridge_capHyp_C4`'s hypotheses without `hHxb`, `hHrb`, `hG0cv`, `hG0cc`, `hwcv`, `hwcc`, and with `|T3(x, 0)[(1, 0), (1, 0), (1, 0)]| ≤ m` on the pin segment ⇒ the same conclusion | SP §2, L1–L20 | The six hypotheses are derived: `hHxb`, `hHrb` by the first two rows; `hwcv`, `hwcc` from the block bound by `axis_convexConcave`; `hG0cv`, `hG0cc` from the pin-segment bound. | | `ridge_capHyp_D` | `0 < ε₀`, `K ≥ 0`; on the collar of width `ε₀`: `Df`, `D2f`, `T3`, `T4` (as above) with the block bound `K`, `DG` (strict), `H`, `Hx`, `Hr`; on `D`: the block bound `m`, `Φ4` with its two blocks `≤ n`; `|f_xxx| ≤ m` on the pin segment; (H1) `8rm² < λ`, (H2) `rn ≤ 1/20`; critical pins; gap `r³/6` ⇒ `∃ ε ∈ (0, ε₀]` with `ridge_capHyp_C4`'s conclusion on `(−2r − ε, 2r + ε)` | SP §2 (H1), (H2), `M₃`, `M₄` on `D`, `f ∈ C⁴` near `D`; L1–L20 | Since (H1) is strict, `ε` is chosen with `8r(m + Kε)² < λ`, `ε ≤ ε₀` and `ε ≤ r/2`, and `ridge_capHyp_C5` is applied with `m + Kε`. `K` is any finite bound, which SP's `C⁴` gives on a compact collar. | +| `block_of_norm` | `B` a trilinear form on `ℝ × E` (a `ContinuousMultilinearMap` on `Fin 3`) with `‖B‖ ≤ K` ⇒ `|B[a, b, c] − s₁s₂s₃ B[e, e, e]| ≤ K((|s₁| + ‖y₁‖)(|s₂| + ‖y₂‖)(|s₃| + ‖y₃‖) − |s₁||s₂||s₃|)` for `a = (s₁, y₁)`, `b = (s₂, y₂)`, `c = (s₃, y₃)`, `e = (1, 0)` | I3's "some `K`": a norm bound gives the block form | Three-term telescoping (`a → s₁e`, then `b → s₂e`, then `c → s₃e`). Each term has one transverse argument `(0, yᵢ)` and is bounded with `‖(s, y)‖ ≤ |s| + ‖y‖`. The three bounds sum to the right side exactly. | +| `collar_subset_open` | `E` proper, `0 < r`, `U` open, `D ⊆ U` ⇒ `∃ ε₀ > 0` with `[−2r − ε₀, 2r + ε₀] × B̄(0, 2r) ⊆ U` | SP's "near `D`" | `D` is compact, so some closed thickening of `D` lies in `U`. In the max metric each collar point is within `ε₀` of a point of `D`. | +| `ridge_capHyp_E` | `U` open with `D ⊆ U`, and `f` `C⁴` on `U`. On `D`: the block bound `m` on `D³f`; `|D⁴f[e, e, e, e]| ≤ n` and `|D⁴f[(0, v), e, e, e]| ≤ n‖v‖`. On the pin segment, `|D³f(x, 0)[e, e, e]| ≤ m`. Also `D²f(M)[(0, v), (0, v)] ≤ −λ‖v‖²`, (H1) `8rm² < λ`, (H2) `rn ≤ 1/20`, `Df(M) = Df(S) = 0` and the gap `r³/6` ⇒ `∃ ε > 0` with `ridge_capHyp_C4`'s conclusion on `(−2r − ε, 2r + ε)` | SP §2 (`f ∈ C⁴` near `D`; (H1), (H2), `M₃`, `M₄` on `D`); L1–L20 | `D^k f = iteratedFDeriv ℝ k f` and `e = (1, 0)`. `ridge_capHyp_D` is applied with `Df = fderiv f`, `D2f = fderiv (fderiv f)`, `T3 p a b c = D³f(p)[c, a, b]`, `T4 p a b c = D⁴f(p)[e, c, a, b]` and `Φ4 p w = D⁴f(p)[w, e, e, e]`; `DG`, `H`, `Hx` and `Hr` are built from `D2f` and its derivative. `ε₀` comes from `collar_subset_open`, and `K = max C 0`, where `‖D⁴f‖ ≤ C` on the compact collar. The block bound is invariant under a common permutation of the three slots, so the slot order in `T3` and `T4` does not matter. Nothing is assumed off `D` except `C⁴` on `U`. | | `sp_curved_side_constants` | `r > 0`, `m ≥ 2`, `δ > r m (8m - 5)`, `0 ≤ ω ≤ 2 m r²` ⇒ `ω ≤ 2rδ` and `2δ · r³/6 < (2rδ - ω)²` | SP L2 (`m ≥ 2`), L4 (`δ > rmk`, `k = 8m - 5`), L5 (`‖w‖ ≤ (15/8) m r² < 2 m r²`), L18 (`4400r³/121 > r³/6`) | So SP's own constants meet `hωr` and `hcurv` at SP's gap `b - s = r³/6`. | | `CapHyp.congr` | from `g = f` on `closure C` and along one ridge `γ₀`, `CapHyp g C M z b s` | the audit's exterior-invariance corollary (Math-#193 deliverable 2) | `closure C ⊇ C ∪ frontier C`. In SP, `C` is closed. | @@ -130,7 +133,7 @@ Each necessity theorem is one conjunction, so it certifies its own premises, not The ridge toy has `δ = 2`, below SP's `δ > rm(8m − 5) = 22`. So `spToyF (x, y) = x³/3 − x/4 − 12y²` is added: there `m = 2` (`f_xxx = 2`), `δ = 24`, `w = 0` and the gap is exactly `r³/6`. `spToy_capHyp` shows that every hypothesis of `ridge_capHyp_sp` holds there, so SP's normalized hypotheses are jointly satisfiable. `spToy_normalized` does the same for `ridge_capHyp_normalized`, with `G0 = x² − 1/4`, `|G0''| = 2 = m` and gap exactly `1/6`. -`spToyF` has `λ = 24 < 8rm² = 32`, so it does not meet (H1). `h1ToyF (x, y) = x³/3 − x/4 − 20y²` (v1.6) has a constant transverse Hessian `−40`, so `λ = 40 > 32`, its Hessian increments vanish and the gap is exactly `1/6`. `h1Toy_capHyp` shows that every hypothesis of `ridge_capHyp_H1` holds there. `h1Toy_ridge_differentiable` (v1.7) states every hypothesis of `ridge_differentiable` at `h1ToyF`, with `h = 0`, transverse gradient `−40y`, its derivative `−40 · snd`, `δ = 40` and `U = (−3, 3)`, as conjuncts of its proposition, and derives that theorem's conclusion from them. `h1Toy_source` (v1.8) meets every hypothesis of `ridge_capHyp_source` on the collar `ε = 1/2`, with joint derivative `(x² − 1/4, −40y)`, transverse derivative `−40 · snd` and `H = −40`, and the theorem then yields its ridge and, for `h = 0` (`F = x² − 1/4` meets L12), its cap at `M = (−1/2, 0)`. `h1Toy_C3` (v1.9) meets every hypothesis of `ridge_capHyp_C3`, with `D²f = diag(2x, −40)` and third derivatives `T a b = 2a₁b₁ · fst` (only `f_xxx = 2 ≥ 7/4` is nonzero), and the theorem yields its ridge and cap with no `hconv` supplied. `h1Toy_C4` (v2.0) meets every hypothesis of `ridge_capHyp_C4`, with `f_xxx = 2` constant, so `Φ4 = 0`, both blocks vanish and (H2) holds with `n = 0`. `h1Toy_D` (v2.1) meets every hypothesis of `ridge_capHyp_D` with `ε₀ = 1/2`: `T3` is constant, so `T4 = 0` and `K = 0`, and `|f_xxx| = 2 = m` on the pin segment. The theorem chooses `ε` itself and yields a ridge on `(−2 − ε, 2 + ε)` and the cap. +`spToyF` has `λ = 24 < 8rm² = 32`, so it does not meet (H1). `h1ToyF (x, y) = x³/3 − x/4 − 20y²` (v1.6) has a constant transverse Hessian `−40`, so `λ = 40 > 32`, its Hessian increments vanish and the gap is exactly `1/6`. `h1Toy_capHyp` shows that every hypothesis of `ridge_capHyp_H1` holds there. `h1Toy_ridge_differentiable` (v1.7) states every hypothesis of `ridge_differentiable` at `h1ToyF`, with `h = 0`, transverse gradient `−40y`, its derivative `−40 · snd`, `δ = 40` and `U = (−3, 3)`, as conjuncts of its proposition, and derives that theorem's conclusion from them. `h1Toy_source` (v1.8) meets every hypothesis of `ridge_capHyp_source` on the collar `ε = 1/2`, with joint derivative `(x² − 1/4, −40y)`, transverse derivative `−40 · snd` and `H = −40`, and the theorem then yields its ridge and, for `h = 0` (`F = x² − 1/4` meets L12), its cap at `M = (−1/2, 0)`. `h1Toy_C3` (v1.9) meets every hypothesis of `ridge_capHyp_C3`, with `D²f = diag(2x, −40)` and third derivatives `T a b = 2a₁b₁ · fst` (only `f_xxx = 2 ≥ 7/4` is nonzero), and the theorem yields its ridge and cap with no `hconv` supplied. `h1Toy_C4` (v2.0) meets every hypothesis of `ridge_capHyp_C4`, with `f_xxx = 2` constant, so `Φ4 = 0`, both blocks vanish and (H2) holds with `n = 0`. `h1Toy_D` (v2.1) meets every hypothesis of `ridge_capHyp_D` with `ε₀ = 1/2`: `T3` is constant, so `T4 = 0` and `K = 0`, and `|f_xxx| = 2 = m` on the pin segment. The theorem chooses `ε` itself and yields a ridge on `(−2 − ε, 2 + ε)` and the cap. `h1Toy_E` (v2.2) meets every hypothesis of `ridge_capHyp_E` with `U = ℝ²`. `h1ToyF` is a polynomial, `D³f[a, b, c] = 2a₁b₁c₁`, `D⁴f = 0` and `D²f[(0, v), (0, v)] = −40v²`, so `m = 2`, `n = 0` and `λ = 40`; Lean computes these iterated derivatives from the Fréchet derivatives. The theorem yields a ridge on `(−2 − ε, 2 + ε)` for some `ε > 0`, and the cap. The toy lives on `ℝ`, which is not compact. So the older-peak theorems (`older_peak`, `elder_death_level_peak`) have no concrete instance exhibited in Lean. Their extra hypotheses (compact, locally connected, continuous `f`) hold on the @@ -145,7 +148,7 @@ illustrates the hypotheses; it is not a model of the planar cap. |---|---|---|---| | I1 | Coordinates: SP's cap is `[-2r, r/2] × B̄(0, 2r)` in a frame `φ` of the periodic lift, and SP's "boundary" is the topological frontier. The transport to the torus (`CapHyp.toTorus`) and the face list (`frontier_cylinder`) are proved; the transport needs no embedding radius | SP §2 | Only the identification of SP's objects with these Lean objects remains. | | I2 | Persistence bookkeeping: in H0 superlevel persistence with distinct critical values, the class born at a local maximum `M` dies at the largest level at which its component contains a strictly higher local maximum (the elder rule) | SP L22, P §8 | This is the definition of the elder pairing. On a compact, locally connected space, Lean proves that this level is `s` (`elder_death_level_peak`). Only the identification of the persistence module's pairing with that definition is informal. | -| I3 | The analytic steps that produce the inputs of `ridge_capHyp_H1` from `G_r`: (H1) `λ > 8rm²`; the slice derivatives and Hessians on the cap, with the third-derivative blocks `∂_x D_y² f` (along `y = 0`) and `D_y³ f` (along rays) bounded by `m`. These bounds are L3's input; L3's increment step itself is proved (`hessian_increment`); `m` as a bound on the third derivatives, which gives the convexity pairs for `G0 = ∂_x f(·, 0)` (L1's input `|g_0'''| ≤ m`) and for `w` (L5's input `‖w''‖ ≤ m`); since v2.1 these pairs and L3's bounds on `∂_x D_y² f` and `D_y³ f` are derived from the block bound and `|f_xxx| ≤ m` on the pin segment (`ridge_capHyp_C5`); the critical pins `G0(∓r/2) = 0` and `h(∓r/2) = 0`; L6 (the `w'` bound; proved since v1.9); for L7, the strict differentiability of the transverse gradient along the ridge (from `f ∈ C²` near `D`), the identification of `G` with the slice gradient on a neighbourhood of each ridge point `(x, h x)`, `x ∈ [−2r, 2r]` (`hG`); the negative definiteness `(DG x ∘ inr) v v ≤ −δ‖v‖²` along the ridge for `x ∈ [−2r, 2r]` (`hneg`), whereas `transverse_hessian_le` gives `H ≤ −(λ − 5rm)` only on the cap (`x ∈ [−2r, r/2]`) and only for the slice Hessians `H`, which no declaration identifies with `DG x ∘ inr` (since v1.8, `ridge_capHyp_source` derives `hG` from the joint derivative on an open neighbourhood, and `hneg` from `transverse_hessian_le_D` on the collar with `DG ∘ inr = H` along the ridge; `hGs` stays a source-data hypothesis on the collar); with existence and regularity of `h` themselves proved since v1.7; the source data of `ridge_capHyp_source` on the collar `[−2r − ε, 2r + ε] × B̄(0, 2r)`: the derivatives `Df`, `DG`, `H` and the bounds `m` there. SP has `f ∈ C⁴` near `D` and bounds the third derivatives on `D`. Since v2.1 Lean proves the continuity step (`block_bound_collar`, `ridge_capHyp_D`). With the block bound `m` on `D`, and some bound `K` on the `x`-derivative of the third derivatives on a collar of width `ε₀`, the bound `m + Kε` holds on the collar of width `ε`, and (H1) stays strict for small `ε`. What stays informal is that `f ∈ C⁴` near `D` supplies the derivative data and some `K`, by compactness of a closed collar. No analytic step of L1–L20 is assumed: of SP's steps L1–L12, the last input, L4's `f_xxx ≥ 7/4` on `D`, is proved since v2.0 (`ridge_capHyp_C4`, from L2's second statement and (H2)). The source data listed in this row stay hypotheses. Since v2.1 (`ridge_capHyp_D`) the quantitative ones are needed on `D` only: the block bound `m`; `|f_xxx| ≤ m` on the pin segment, which the block bound `hT` excludes; SP's block bound `n` on the derivative of `f_xxx`; (H1) and (H2); and, as exact conditions at points of `D`, the critical pins and the gap `r³/6`. On a collar of width `ε₀`, only qualitative data are assumed: `Df`, `D2f`, `T3` and its `x`-derivative with some bound `K`, `DG` (strict), `H`, `Hx` and `Hr`. | SP §2 (H1), L6, L7, L9–L12; CAP §§2–5 | These are checked with exact constants by SP's script. Since v2.1, Lean derives the six derivative bounds from the block bound and `|f_xxx| ≤ m` on the pin segment, and proves the continuity step from `D` to the collar (`ridge_capHyp_C5`, `ridge_capHyp_D`). Since v2.0, Lean also proves L2's second statement and L4's `f_xxx ≥ 7/4` from (H2) (`ridge_capHyp_C4`). Since v1.9, Lean proves L6, L9 and L12 with SP's constants and derives `hconv` (`ridge_capHyp_C3`). Since v1.8 the extension of L4 to the collar and the composition of the L7 lemmas with the cap are proved. Since v1.8, Lean composes L1–L5, L7, L8 and L11 with the cap from the source data on a collar (`ridge_capHyp_source`). Since v1.7, Lean proves L7's existence and regularity of `h`. Since v1.6, Lean proves L3–L4 (from (H1) and the increment bound). Since v1.5, Lean proves L1, L2, L5, L7's maximum and uniqueness, L8, L11's chain rule and L18 from those outputs, and checks SP's constants in the curvature step. L13, L16, L17, L19 and L20 were already proved in v1.4. | +| I3 | The analytic steps that produce the inputs of `ridge_capHyp_H1` from `G_r`: (H1) `λ > 8rm²`; the slice derivatives and Hessians on the cap, with the third-derivative blocks `∂_x D_y² f` (along `y = 0`) and `D_y³ f` (along rays) bounded by `m`. These bounds are L3's input; L3's increment step itself is proved (`hessian_increment`); `m` as a bound on the third derivatives, which gives the convexity pairs for `G0 = ∂_x f(·, 0)` (L1's input `|g_0'''| ≤ m`) and for `w` (L5's input `‖w''‖ ≤ m`); since v2.1 these pairs and L3's bounds on `∂_x D_y² f` and `D_y³ f` are derived from the block bound and `|f_xxx| ≤ m` on the pin segment (`ridge_capHyp_C5`); the critical pins `G0(∓r/2) = 0` and `h(∓r/2) = 0`; L6 (the `w'` bound; proved since v1.9); for L7, the strict differentiability of the transverse gradient along the ridge (from `f ∈ C²` near `D`), the identification of `G` with the slice gradient on a neighbourhood of each ridge point `(x, h x)`, `x ∈ [−2r, 2r]` (`hG`); the negative definiteness `(DG x ∘ inr) v v ≤ −δ‖v‖²` along the ridge for `x ∈ [−2r, 2r]` (`hneg`), whereas `transverse_hessian_le` gives `H ≤ −(λ − 5rm)` only on the cap (`x ∈ [−2r, r/2]`) and only for the slice Hessians `H`, which no declaration identifies with `DG x ∘ inr` (since v1.8, `ridge_capHyp_source` derives `hG` from the joint derivative on an open neighbourhood, and `hneg` from `transverse_hessian_le_D` on the collar with `DG ∘ inr = H` along the ridge; `hGs` stays a source-data hypothesis on the collar); with existence and regularity of `h` themselves proved since v1.7; the source data of `ridge_capHyp_source` on the collar `[−2r − ε, 2r + ε] × B̄(0, 2r)`: the derivatives `Df`, `DG`, `H` and the bounds `m` there. SP has `f ∈ C⁴` near `D` and bounds the third derivatives on `D`. Since v2.1 Lean proves the continuity step (`block_bound_collar`, `ridge_capHyp_D`). With the block bound `m` on `D`, and some bound `K` on the `x`-derivative of the third derivatives on a collar of width `ε₀`, the bound `m + Kε` holds on the collar of width `ε`, and (H1) stays strict for small `ε`. Since v2.2 the remaining qualitative step is proved too (`ridge_capHyp_E`). `f ∈ C⁴` on an open `U ⊇ D` supplies every derivative datum, a collar inside `U` (`collar_subset_open`) and the bound `K` on `‖D⁴f‖` over the compact collar (`block_of_norm`). No analytic step of L1–L20 is assumed: of SP's steps L1–L12, the last input, L4's `f_xxx ≥ 7/4` on `D`, is proved since v2.0 (`ridge_capHyp_C4`, from L2's second statement and (H2)). The source data listed in this row stay hypotheses. Since v2.1 (`ridge_capHyp_D`) the quantitative ones are needed on `D` only: the block bound `m`; `|f_xxx| ≤ m` on the pin segment, which the block bound `hT` excludes; SP's block bound `n` on the derivative of `f_xxx`; (H1) and (H2); and, as exact conditions at points of `D`, the critical pins and the gap `r³/6`. On a collar of width `ε₀`, `ridge_capHyp_D` assumes only qualitative data: `Df`, `D2f`, `T3` and its `x`-derivative with some bound `K`, `DG` (strict), `H`, `Hx` and `Hr`. Since v2.2 (`ridge_capHyp_E`) these are derived, and the only assumption off `D` is `f ∈ C⁴` on an open neighbourhood of `D`. | SP §2 (H1), L6, L7, L9–L12; CAP §§2–5 | These are checked with exact constants by SP's script. Since v2.2, Lean derives the collar data, the collar and `K` from `f ∈ C⁴` near `D` (`ridge_capHyp_E`). Since v2.1, Lean derives the six derivative bounds from the block bound and `|f_xxx| ≤ m` on the pin segment, and proves the continuity step from `D` to the collar (`ridge_capHyp_C5`, `ridge_capHyp_D`). Since v2.0, Lean also proves L2's second statement and L4's `f_xxx ≥ 7/4` from (H2) (`ridge_capHyp_C4`). Since v1.9, Lean proves L6, L9 and L12 with SP's constants and derives `hconv` (`ridge_capHyp_C3`). Since v1.8 the extension of L4 to the collar and the composition of the L7 lemmas with the cap are proved. Since v1.8, Lean composes L1–L5, L7, L8 and L11 with the cap from the source data on a collar (`ridge_capHyp_source`). Since v1.7, Lean proves L7's existence and regularity of `h`. Since v1.6, Lean proves L3–L4 (from (H1) and the increment bound). Since v1.5, Lean proves L1, L2, L5, L7's maximum and uniqueness, L8, L11's chain rule and L18 from those outputs, and checks SP's constants in the curvature step. L13, L16, L17, L19 and L20 were already proved in v1.4. | | I4 | Theorem A, measurability, `Q^W(G_r^c) ≤ C r³` | P §§7–8, C1, G1 | probability | ## 5. Review contract @@ -162,5 +165,5 @@ row of §4, it says whether the interface is stated correctly. A changed Lean source, toolchain or pin makes an earlier review stale. -v1.5 is additive: it inserts the sections `Slice` and the slice-route toy, and updates the file's header comment. The 53 v1.4 declarations and their statements are unchanged, as the diff against v1.4 shows. The v1.4 alignment review ([5396110365](https://github.com/d6g8k5htny-coder/Math-/pull/246#pullrequestreview-5396110365), `ALIGNED_SCOPED`) therefore still covers the v1.4 rows once a reviewer confirms by diff that they are unchanged. A delta review assesses the new rows: the fourteen slice rows of §2, the v1.5 toy paragraphs of §3 and the revised I3. v1.6 adds five further §2 rows (`strongConcaveOn_of_hessian` to `ridge_capHyp_H1`), the `h1ToyF` paragraph of §3 and a further revision of I3; its 74 v1.5 declarations are unchanged. v1.7 adds six §2 rows (`slice_critical_unique` to `ridge_exists`), the `h1Toy_ridge_differentiable` sentence of §3 and a further revision of I3; its 81 v1.6 declarations are unchanged. v1.8 adds four §2 rows (`hessian_increment_D` to `ridge_capHyp_source`), the `h1Toy_source` sentence of §3 and a further revision of I3; its 88 v1.7 declarations are unchanged. v1.9 adds nine §2 rows (`convex_deriv_sign` to `ridge_capHyp_C3`, fourteen theorems), the `h1Toy_C3` sentence of §3 and a further revision of the SP row and I3; its 93 v1.8 declarations are unchanged. v2.0 adds four §2 rows (`hermite_gap_le_concave` to `ridge_capHyp_C4`), the `h1Toy_C4` sentence of §3 and a further revision of the SP row and I3; its 108 v1.9 declarations are unchanged. v2.1 adds six §2 rows (`hessian_x_bound` to `ridge_capHyp_D`, seven theorems), the `h1Toy_D` sentence of §3 and a further revision of the SP row and I3; its 113 v2.0 declarations are unchanged. A same-provider read, including any Claude +v1.5 is additive: it inserts the sections `Slice` and the slice-route toy, and updates the file's header comment. The 53 v1.4 declarations and their statements are unchanged, as the diff against v1.4 shows. The v1.4 alignment review ([5396110365](https://github.com/d6g8k5htny-coder/Math-/pull/246#pullrequestreview-5396110365), `ALIGNED_SCOPED`) therefore still covers the v1.4 rows once a reviewer confirms by diff that they are unchanged. A delta review assesses the new rows: the fourteen slice rows of §2, the v1.5 toy paragraphs of §3 and the revised I3. v1.6 adds five further §2 rows (`strongConcaveOn_of_hessian` to `ridge_capHyp_H1`), the `h1ToyF` paragraph of §3 and a further revision of I3; its 74 v1.5 declarations are unchanged. v1.7 adds six §2 rows (`slice_critical_unique` to `ridge_exists`), the `h1Toy_ridge_differentiable` sentence of §3 and a further revision of I3; its 81 v1.6 declarations are unchanged. v1.8 adds four §2 rows (`hessian_increment_D` to `ridge_capHyp_source`), the `h1Toy_source` sentence of §3 and a further revision of I3; its 88 v1.7 declarations are unchanged. v1.9 adds nine §2 rows (`convex_deriv_sign` to `ridge_capHyp_C3`, fourteen theorems), the `h1Toy_C3` sentence of §3 and a further revision of the SP row and I3; its 93 v1.8 declarations are unchanged. v2.0 adds four §2 rows (`hermite_gap_le_concave` to `ridge_capHyp_C4`), the `h1Toy_C4` sentence of §3 and a further revision of the SP row and I3; its 108 v1.9 declarations are unchanged. v2.1 adds six §2 rows (`hessian_x_bound` to `ridge_capHyp_D`, seven theorems), the `h1Toy_D` sentence of §3 and a further revision of the SP row and I3; its 113 v2.0 declarations are unchanged. v2.2 adds three §2 rows (`block_of_norm` to `ridge_capHyp_E`), the `h1Toy_E` sentence of §3 and a further revision of the SP row and I3. The statements of its 121 v2.1 declarations are unchanged. The only edits to v2.1 lines are in the header comment and in the docstrings of `ridge_differentiable` and `fxxx_lower`, which take up the wording residuals of the K1, K4 and K5 reads. A same-provider read, including any Claude read, gives zero independence credit. A build or merge is not an alignment review. diff --git a/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean b/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean index 9ffef7878..6a7865076 100644 --- a/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean +++ b/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean @@ -24,8 +24,11 @@ (the source data themselves are hypotheses). Since v1.9, L6 and L9–L12 are proved too, and `ridge_capHyp_C3` derives `hconv`; since v2.0 `ridge_capHyp_C4` also derives SP's `f_xxx ≥ 7/4` (L4, from L2's second statement and (H2)). Since v2.1 `ridge_capHyp_C5` derives - the six derivative bounds from the block bound, and `ridge_capHyp_D` assumes SP's quantitative - bounds on `D` only (the continuity step to the collar is proved). + the six derivative bounds from the block bound and `|f_xxx| ≤ m` on the pin segment, and + `ridge_capHyp_D` assumes SP's quantitative bounds on `D` only (the continuity step to the collar + is proved). Since v2.2 `ridge_capHyp_E` assumes only `f ∈ C⁴` on an open neighbourhood of `D` + and SP's quantitative bounds on `D`: it builds every derivative datum from `f`, and the collar + and its bound `K` come from compactness. Also not formalized: the identification of the H0 persistence pairing with the elder rule (L22, P §8); the unstable-branch analysis (L23); and every probabilistic statement. @@ -1382,7 +1385,7 @@ theorem ridge_hasStrictFDerivAt [CompleteSpace E] {f : ℝ × E → ℝ} {G : critical point in `B̄(0, 2r)` for `x` in an open set `U ⊇ [-2r, 2r]` (SP: `f ∈ C⁴` near `D`), `h x` in the open ball on `[-2r, 2r]`, and the transverse gradient strictly differentiable along the ridge with negative definite transverse part, `h` is strictly differentiable at every -`x ∈ [-2r, 2r]`. This supplies `hh'` of `ridge_inputs_of_joint`. -/ +`x ∈ [-2r, 2r]`. Composed with `ridge_inputs_of_joint`, this would supply its `hh'`. -/ theorem ridge_differentiable [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ} {DG : ℝ → ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {U : Set ℝ} {r δ : ℝ} (hδ : 0 < δ) (hU : IsOpen U) (hIU : Icc (-2 * r) (2 * r) ⊆ U) @@ -2488,7 +2491,8 @@ theorem third_deriv_exists_two {g G G' φ : ℝ → ℝ} {r : ℝ} (hr : 0 < r) /-- **L4 (`f_xxx ≥ 7/4`).** Let `ψ = f_xxx` have derivative `Dψ` on SP's domain `D = [-2r, 2r] × B̄(0, 2r)`, with the two fourth-order blocks bounded by `n = M_4` there: `|∂_x ψ| = |Dψ (1, 0)| ≤ n` and `‖D_y ψ‖ = ‖Dψ ∘ inr‖ ≤ n`. If `ψ(x₀, 0) ≥ 2` at a point of the pin -interval and (H2) `rn ≤ 1/20`, then `ψ ≥ 2 - 9rn/2 ≥ 7/4` on `D`. As in SP's L3, move first in `x` +interval and (H2) `rn ≤ 1/20`, then `ψ ≥ 7/4` on `D` (the proof bounds `ψ ≥ 2 - 9rn/2`; the +statement exports `7/4`). As in SP's L3, move first in `x` along `y = 0` (`|Δx| ≤ 5r/2`), then along the ray to `y` (`‖Δy‖ ≤ 2r`); SP rounds `9r/2` up to `5r`. -/ theorem fxxx_lower {ψ : ℝ × E → ℝ} {Dψ : ℝ × E → ℝ × E →L[ℝ] ℝ} {r n x₀ : ℝ} (hr : 0 < r) (hψ : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt ψ (Dψ p) p) @@ -3009,6 +3013,291 @@ theorem ridge_capHyp_D [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} hD4 hn4x hn4y hH2 (fun p hp => hGs p (hsub p hp)) (fun p hp => hH p (hsub p hp)) (fun x hx => hHx x (hsubI x hx)) (fun p hp => hHr p (hsub p hp)) hlam hH1' hM hS hnorm⟩ + +/-! ### SP's `f ∈ C⁴` near `D` supplies the collar data (v2.2) + +`block_of_norm` turns a bound on the norm of a trilinear form into the block bound, and +`collar_subset_open` finds a closed collar inside an open neighbourhood of `D`. `ridge_capHyp_E` +takes `f ∈ C⁴` on an open `U ⊇ D` and SP's quantitative bounds on `D`, written with the iterated +derivatives `iteratedFDeriv ℝ k f`. It builds every derivative datum of `ridge_capHyp_D` from `f`, +and it takes the collar width from `collar_subset_open` and `K` from the continuity of `D⁴f` on the +compact collar. -/ + +/-- **The block bound from the norm.** A trilinear form `B` on `ℝ × E` with `‖B‖ ≤ K` satisfies +the block bound with constant `K`. For `a = (s₁, y₁)`, `b = (s₂, y₂)`, `c = (s₃, y₃)` and +`e = (1, 0)`: +`|B(a, b, c) - s₁s₂s₃ B(e, e, e)| ≤ K((|s₁| + ‖y₁‖)(|s₂| + ‖y₂‖)(|s₃| + ‖y₃‖) - |s₁||s₂||s₃|)`. +Replacing one slot at a time by `sᵢ e` leaves three terms, and each has a transverse argument +`(0, yᵢ)`. -/ +theorem block_of_norm {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ} {K : ℝ} + (hB : ‖B‖ ≤ K) (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E) : + |B ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - s₁ * s₂ * s₃ * B ![(1, 0), (1, 0), (1, 0)]| ≤ + K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|) := by + have hK : 0 ≤ K := (norm_nonneg _).trans hB + have hb : ∀ a b c : ℝ × E, |B ![a, b, c]| ≤ K * ‖a‖ * ‖b‖ * ‖c‖ := by + intro a b c + have h := B.le_opNorm ![a, b, c] + simp only [Fin.prod_univ_three, Matrix.cons_val_zero, Matrix.cons_val_one, + Matrix.cons_val_two, Matrix.tail_cons, Matrix.head_cons] at h + rw [← Real.norm_eq_abs] + calc ‖B ![a, b, c]‖ ≤ ‖B‖ * (‖a‖ * ‖b‖ * ‖c‖) := h + _ ≤ K * (‖a‖ * ‖b‖ * ‖c‖) := by gcongr + _ = K * ‖a‖ * ‖b‖ * ‖c‖ := by ring + have h1 : ∀ x x' b c : ℝ × E, B ![x, b, c] - B ![x', b, c] = B ![x - x', b, c] := by + intro x x' b c + have hu : ∀ z, Function.update ![x, b, c] 0 z = ![z, b, c] := fun z => by + funext i; fin_cases i <;> simp + have := B.map_update_sub ![x, b, c] 0 x x' + rw [hu, hu, hu] at this + exact this.symm + have h2 : ∀ a x x' c : ℝ × E, B ![a, x, c] - B ![a, x', c] = B ![a, x - x', c] := by + intro a x x' c + have hu : ∀ z, Function.update ![a, x, c] 1 z = ![a, z, c] := fun z => by + funext i; fin_cases i <;> simp + have := B.map_update_sub ![a, x, c] 1 x x' + rw [hu, hu, hu] at this + exact this.symm + have h3 : ∀ a b x x' : ℝ × E, B ![a, b, x] - B ![a, b, x'] = B ![a, b, x - x'] := by + intro a b x x' + have hu : ∀ z, Function.update ![a, b, x] 2 z = ![a, b, z] := fun z => by + funext i; fin_cases i <;> simp + have := B.map_update_sub ![a, b, x] 2 x x' + rw [hu, hu, hu] at this + exact this.symm + set e : ℝ × E := ((1 : ℝ), (0 : E)) with he_def + have hsm : B ![s₁ • e, s₂ • e, s₃ • e] = s₁ * s₂ * s₃ * B ![e, e, e] := by + have := B.map_smul_univ ![s₁, s₂, s₃] ![e, e, e] + have hv : (fun i => (![s₁, s₂, s₃] : Fin 3 → ℝ) i • (![e, e, e] : Fin 3 → ℝ × E) i) = + ![s₁ • e, s₂ • e, s₃ • e] := by + funext i; fin_cases i <;> simp + rw [hv, Fin.prod_univ_three] at this + simpa [smul_eq_mul, mul_assoc] using this + have hd : ∀ (s : ℝ) (y : E), ((s, y) : ℝ × E) - s • e = ((0 : ℝ), y) := by + intro s y; ext <;> simp [he_def] + have hn : ∀ (s : ℝ) (y : E), ‖((s, y) : ℝ × E)‖ ≤ |s| + ‖y‖ := by + intro s y + rw [Prod.norm_def, Real.norm_eq_abs] + exact max_le_add_of_nonneg (abs_nonneg _) (norm_nonneg _) + have hn0 : ∀ y : E, ‖((0 : ℝ), y)‖ = ‖y‖ := by intro y; simp [Prod.norm_def] + have hne : ∀ s : ℝ, ‖s • e‖ = |s| := by + intro s; rw [norm_smul, Real.norm_eq_abs]; simp [he_def, Prod.norm_def] + have tel : B ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - s₁ * s₂ * s₃ * B ![e, e, e] = + B ![((0 : ℝ), y₁), (s₂, y₂), (s₃, y₃)] + B ![s₁ • e, ((0 : ℝ), y₂), (s₃, y₃)] + + B ![s₁ • e, s₂ • e, ((0 : ℝ), y₃)] := by + rw [← hsm, ← hd s₁ y₁, ← hd s₂ y₂, ← hd s₃ y₃, ← h1, ← h2, ← h3] + ring + rw [tel] + have k1 : |B ![((0 : ℝ), y₁), (s₂, y₂), (s₃, y₃)]| ≤ + K * ‖y₁‖ * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) := by + refine (hb _ _ _).trans ?_ + rw [hn0] + gcongr + · exact hn _ _ + · exact hn _ _ + have k2 : |B ![s₁ • e, ((0 : ℝ), y₂), (s₃, y₃)]| ≤ K * |s₁| * ‖y₂‖ * (|s₃| + ‖y₃‖) := by + refine (hb _ _ _).trans ?_ + rw [hn0, hne] + gcongr + exact hn _ _ + have k3 : |B ![s₁ • e, s₂ • e, ((0 : ℝ), y₃)]| ≤ K * |s₁| * |s₂| * ‖y₃‖ := by + refine (hb _ _ _).trans ?_ + rw [hn0, hne, hne] + calc _ ≤ _ := abs_add_three _ _ _ + _ ≤ K * ‖y₁‖ * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) + K * |s₁| * ‖y₂‖ * (|s₃| + ‖y₃‖) + + K * |s₁| * |s₂| * ‖y₃‖ := by gcongr + _ = _ := by ring + +omit [NormedSpace ℝ E] in +/-- **A collar inside a neighbourhood of `D`.** If an open `U` contains +`D = [-2r, 2r] × B̄(0, 2r)` and `E` is proper, then some closed collar +`[-2r - ε₀, 2r + ε₀] × B̄(0, 2r)` with `ε₀ > 0` lies in `U`: `D` is compact, so a closed +thickening of `D` lies in `U`. -/ +theorem collar_subset_open [ProperSpace E] {U : Set (ℝ × E)} {r : ℝ} (hr : 0 < r) (hU : IsOpen U) + (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U) : + ∃ ε₀ > 0, Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U := by + obtain ⟨δ, hδ, hsub⟩ := + (isCompact_Icc.prod (isCompact_closedBall (0 : E) (2 * r))).exists_cthickening_subset_open hU hDU + refine ⟨δ, hδ, ?_⟩ + rintro ⟨x, y⟩ ⟨hx, hy⟩ + apply hsub + obtain ⟨x₀, hx₀, hxx₀⟩ : ∃ x₀ ∈ Icc (-2 * r) (2 * r), |x - x₀| ≤ δ := by + by_cases h1 : x ≤ -2 * r + · refine ⟨-2 * r, ⟨le_rfl, ?_⟩, ?_⟩ + · linarith [hx.1] + · rw [abs_le]; constructor <;> linarith [hx.1] + · by_cases h2 : 2 * r ≤ x + · refine ⟨2 * r, ⟨?_, le_rfl⟩, ?_⟩ + · linarith + · rw [abs_le]; constructor <;> linarith [hx.2] + · exact ⟨x, ⟨by linarith, by linarith⟩, by simp [hδ.le]⟩ + refine Metric.mem_cthickening_of_dist_le (x, y) (x₀, y) δ _ ⟨hx₀, hy⟩ ?_ + rw [Prod.dist_eq, dist_self, Real.dist_eq] + exact max_le hxx₀ hδ.le + +/-- **The cap from `f ∈ C⁴` near `D` and SP's bounds on `D` (I3's qualitative part).** Assume +that `f` is `C⁴` on an open `U ⊇ D` (SP: `f ∈ C⁴` near `D`). Assume also SP's quantitative +hypotheses on `D`, written with `D^k f(p)[v₁, …, v_k] = iteratedFDeriv ℝ k f p ![v₁, …, v_k]` and +`e = (1, 0)`: +- the block bound `m` on `D³f`, and `|f_xxx| ≤ m` on the pin segment; +- SP's `M₄` blocks `n`: `|D⁴f[e, e, e, e]| ≤ n` and `|D⁴f[(0, v), e, e, e]| ≤ n‖v‖`; +- (H1): `D²f(M)[(0, v), (0, v)] ≤ -λ‖v‖²` with `8rm² < λ`; and (H2); +- `M = (-r/2, 0)` and `S = (r/2, 0)` are critical, and `f(M) - f(S) = r³/6`. + +Then `ridge_capHyp_D` applies. Its collar width comes from `collar_subset_open`, and its derivative +data are the Fréchet derivatives of `f` (`T3`, `T4` and `Φ4` are slices of `D³f` and `D⁴f`). Its +`K` bounds `‖D⁴f‖` on the compact collar. No derivative datum and no bound off `D` is assumed. -/ +theorem ridge_capHyp_E [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)} + {r m n lam : ℝ} (hr : 0 < r) (hU : IsOpen U) + (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U) + (hf : ContDiffOn ℝ 4 f U) + (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), + ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E), + |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] - + s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤ + m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|)) + (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m) + (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), + |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n) + (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E, + |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖) + (hH2 : r * n ≤ 1 / 20) + (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2) + (hH1 : 8 * r * m ^ 2 < lam) + (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0) + (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) : + ∃ ε, 0 < ε ∧ + (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧ + HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧ + ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), + h x ∈ Metric.closedBall (0 : E) (2 * r) ∧ + HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) → + h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧ + CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0) + (2 * r, h (2 * r)) (f (-r / 2, 0)) (f (r / 2, 0)) ∧ + ∀ x ∈ frontier (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)), + x ≠ (r / 2, 0) → f x < f (r / 2, 0) := by + obtain ⟨ε₀, hε₀, hcU⟩ := collar_subset_open hr hU hDU + have hcpt : IsCompact (Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r)) := + isCompact_Icc.prod (isCompact_closedBall _ _) + -- regularity of the derivatives on `U` + have hf1 : ContDiffOn ℝ 3 (fderiv ℝ f) U := hf.fderiv_of_isOpen hU (by norm_num) + have hf2 : ContDiffOn ℝ 2 (fderiv ℝ (fderiv ℝ f)) U := hf1.fderiv_of_isOpen hU (by norm_num) + have dDf : ∀ p ∈ U, HasFDerivAt f (fderiv ℝ f p) p := fun p hp => + ((hf.differentiableOn (by norm_num)).differentiableAt (hU.mem_nhds hp)).hasFDerivAt + have dD2 : ∀ p ∈ U, HasFDerivAt (fderiv ℝ f) (fderiv ℝ (fderiv ℝ f) p) p := fun p hp => + ((hf1.differentiableOn (by norm_num)).differentiableAt (hU.mem_nhds hp)).hasFDerivAt + have dD3 : ∀ p ∈ U, HasFDerivAt (fderiv ℝ (fderiv ℝ f)) (fderiv ℝ (fderiv ℝ (fderiv ℝ f)) p) p := + fun p hp => ((hf2.differentiableOn (by norm_num)).differentiableAt (hU.mem_nhds hp)).hasFDerivAt + have sD2 : ∀ p ∈ U, HasStrictFDerivAt (fderiv ℝ f) (fderiv ℝ (fderiv ℝ f) p) p := fun p hp => + (hf1.contDiffAt (hU.mem_nhds hp)).hasStrictFDerivAt (by norm_num) + have dI2 : ∀ p ∈ U, HasFDerivAt (iteratedFDeriv ℝ 2 f) (fderiv ℝ (iteratedFDeriv ℝ 2 f) p) p := + fun p hp => ((hf.contDiffAt (hU.mem_nhds hp)).differentiableAt_iteratedFDeriv + (by norm_num)).hasFDerivAt + have dI3 : ∀ p ∈ U, HasFDerivAt (iteratedFDeriv ℝ 3 f) (fderiv ℝ (iteratedFDeriv ℝ 3 f) p) p := + fun p hp => ((hf.contDiffAt (hU.mem_nhds hp)).differentiableAt_iteratedFDeriv + (by norm_num)).hasFDerivAt + have hc4 : ContinuousOn (iteratedFDeriv ℝ 4 f) U := + (hf.continuousOn_iteratedFDerivWithin le_rfl hU.uniqueDiffOn).congr + (fun x hx => (iteratedFDerivWithin_of_isOpen 4 hU hx).symm) + -- the bound `K` on `D⁴f` over the compact collar + obtain ⟨C, hC⟩ := hcpt.exists_bound_of_continuousOn (hc4.mono hcU) + have hD2 : ∀ (p : ℝ × E) (a b : ℝ × E), + fderiv ℝ (fderiv ℝ f) p a b = iteratedFDeriv ℝ 2 f p ![a, b] := by + intro p a b; rw [iteratedFDeriv_two_apply]; rfl + have he : ‖((1 : ℝ), (0 : E))‖ = 1 := by simp [Prod.norm_def] + have hpath : ∀ (x : ℝ) (y : E), HasDerivAt (fun t : ℝ => ((t, y) : ℝ × E)) ((1 : ℝ), (0 : E)) x := + fun x y => (hasDerivAt_id x).prodMk (hasDerivAt_const x y) + set Ψ : ((ℝ × E) →L[ℝ] ℝ) →L[ℝ] (E →L[ℝ] ℝ) := + ContinuousLinearMap.precomp ℝ (ContinuousLinearMap.inr ℝ ℝ E) with hΨ + set Ξ : ((ℝ × E) →L[ℝ] (ℝ × E) →L[ℝ] ℝ) →L[ℝ] (E →L[ℝ] E →L[ℝ] ℝ) := + (ContinuousLinearMap.postcomp E Ψ).comp + (ContinuousLinearMap.precomp ((ℝ × E) →L[ℝ] ℝ) (ContinuousLinearMap.inr ℝ ℝ E)) with hΞ + have hn0 : 0 ≤ n := (abs_nonneg _).trans (hn4x (0, 0) ⟨⟨by linarith, by linarith⟩, by + simp only [Metric.mem_closedBall, dist_self]; linarith⟩) + have key := ridge_capHyp_D (E := E) (f := f) (Df := fderiv ℝ f) (D2f := fderiv ℝ (fderiv ℝ f)) + (T3 := fun p a b => (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => ℝ × E) ℝ ![a, b]).comp + (fderiv ℝ (iteratedFDeriv ℝ 2 f) p)) + (T4 := fun p a b c => iteratedFDeriv ℝ 4 f p ![(1, 0), c, a, b]) + (Φ4 := fun p => (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 3 => ℝ × E) ℝ + ![(1, 0), (1, 0), (1, 0)]).comp (fderiv ℝ (iteratedFDeriv ℝ 3 f) p)) (n := n) + (DG := fun p => Ψ.comp (fderiv ℝ (fderiv ℝ f) p)) + (H := fun p => Ξ (fderiv ℝ (fderiv ℝ f) p)) + (Hx := fun x => Ξ (fderiv ℝ (fderiv ℝ (fderiv ℝ f)) (x, 0) (1, 0))) + (Hr := fun p s => Ξ (fderiv ℝ (fderiv ℝ (fderiv ℝ f)) (p.1, s • p.2) (0, p.2))) + (r := r) (m := m) (K := max C 0) (lam := lam) (ε₀ := ε₀) hr hε₀ (le_max_right _ _) + (fun p hp => dDf p (hcU hp)) (fun p hp => dD2 p (hcU hp)) + (fun p hp a b => by + have h := (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => ℝ × E) ℝ ![a, b]).hasFDerivAt.comp + p (dI2 p (hcU hp)) + have hfun : (fun q => fderiv ℝ (fderiv ℝ f) q a b) = + (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 2 => ℝ × E) ℝ ![a, b]) ∘ + iteratedFDeriv ℝ 2 f := funext fun q => hD2 q a b + rw [hfun]; exact h) + (fun p hp a b c => by + have h := (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 3 => ℝ × E) ℝ ![c, a, b]).hasFDerivAt.comp_hasDerivAt + p.1 ((dI3 (p.1, p.2) (hcU hp)).comp_hasDerivAt p.1 (hpath p.1 p.2)) + exact h) + (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => by + have hB : ‖(iteratedFDeriv ℝ 4 f p).curryLeft ((1 : ℝ), (0 : E))‖ ≤ max C 0 := by + refine ((iteratedFDeriv ℝ 4 f p).curryLeft.le_opNorm _).trans ?_ + rw [ContinuousMultilinearMap.curryLeft_norm, he, mul_one] + exact (hC p hp).trans (le_max_left _ _) + have h := block_of_norm hB s₃ s₁ s₂ y₃ y₁ y₂ + show |iteratedFDeriv ℝ 4 f p ![(1, 0), (s₃, y₃), (s₁, y₁), (s₂, y₂)] - + s₁ * s₂ * s₃ * iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ _ + rw [show s₁ * s₂ * s₃ = s₃ * s₁ * s₂ by ring] + refine h.trans (le_of_eq ?_) + ring) + (fun p hp s₁ s₂ s₃ y₁ y₂ y₃ => by + have h := hT p hp s₃ s₁ s₂ y₃ y₁ y₂ + show |iteratedFDeriv ℝ 3 f p ![(s₃, y₃), (s₁, y₁), (s₂, y₂)] - + s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤ _ + rw [show s₁ * s₂ * s₃ = s₃ * s₁ * s₂ by ring] + refine h.trans (le_of_eq ?_) + ring) + (fun x hx => hTe x hx) + (fun p hp => (ContinuousMultilinearMap.apply ℝ (fun _ : Fin 3 => ℝ × E) ℝ + ![(1, 0), (1, 0), (1, 0)]).hasFDerivAt.comp p (dI3 p (hDU hp))) + (fun p hp => hn4x p hp) + (fun p hp => ContinuousLinearMap.opNorm_le_bound _ hn0 fun v => by + rw [Real.norm_eq_abs]; exact hn4y p hp v) + hH2 + (fun p hp => Ψ.hasStrictFDerivAt.comp p (sD2 p (hcU hp))) + (fun p hp => Ψ.hasFDerivAt.comp p.2 ((dD2 (p.1, p.2) (hcU hp)).comp p.2 + (hasFDerivAt_prodMk_right p.1 p.2))) + (fun x hx => by + have hx' : ((x, 0) : ℝ × E) ∈ U := hcU ⟨hx, by + simp only [Metric.mem_closedBall, dist_self]; linarith⟩ + have hΞ : HasFDerivAt Ξ Ξ (fderiv ℝ (fderiv ℝ f) (x, 0)) := + ContinuousLinearMap.hasFDerivAt (E := (ℝ × E) →L[ℝ] (ℝ × E) →L[ℝ] ℝ) + (F := E →L[ℝ] E →L[ℝ] ℝ) _ + exact HasFDerivAt.comp_hasDerivAt (l := Ξ) + (f := fun t => fderiv ℝ (fderiv ℝ f) (t, 0)) x hΞ (HasFDerivAt.comp_hasDerivAt + (l := fderiv ℝ (fderiv ℝ f)) (f := fun t : ℝ => ((t, (0 : E)) : ℝ × E)) x (dD3 (x, 0) hx') + (hpath x 0))) + (fun p hp s hs => by + have hmem : ((p.1, s • p.2) : ℝ × E) ∈ U := hcU ⟨hp.1, by + have := hp.2 + rw [Metric.mem_closedBall, dist_zero_right] at this ⊢ + rw [norm_smul, Real.norm_eq_abs, abs_of_nonneg hs.1] + nlinarith [hs.2, norm_nonneg p.2]⟩ + have hp' : HasDerivAt (fun s : ℝ => ((p.1, s • p.2) : ℝ × E)) ((0 : ℝ), p.2) s := by + have := (hasDerivAt_const s p.1).prodMk ((hasDerivAt_id s).smul_const p.2) + simpa using this + have hΞ : HasFDerivAt Ξ Ξ (fderiv ℝ (fderiv ℝ f) (p.1, s • p.2)) := + ContinuousLinearMap.hasFDerivAt (E := (ℝ × E) →L[ℝ] (ℝ × E) →L[ℝ] ℝ) + (F := E →L[ℝ] E →L[ℝ] ℝ) _ + exact HasFDerivAt.comp_hasDerivAt (l := Ξ) + (f := fun s => fderiv ℝ (fderiv ℝ f) (p.1, s • p.2)) s hΞ (HasFDerivAt.comp_hasDerivAt + (l := fderiv ℝ (fderiv ℝ f)) (f := fun s : ℝ => ((p.1, s • p.2) : ℝ × E)) s (dD3 _ hmem) hp')) + (fun v => by + have h := hlam v + rw [← hD2] at h + exact h) + hH1 hM hS hnorm + obtain ⟨ε, hε, -, hrest⟩ := key + exact ⟨ε, hε, hrest⟩ + end Slice /-! ### A concrete instance and the necessity of each hypothesis @@ -4096,4 +4385,107 @@ theorem h1Toy_D : obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩) exact ⟨⟨ε, hε, hex⟩, hC⟩ + +/-- **`ridge_capHyp_E` is not vacuous.** `h1ToyF` is a polynomial, so it is `C⁴` on `U = ℝ²`. +Its third derivative is `D³f[a, b, c] = 2 a.1 b.1 c.1` and its fourth derivative vanishes, so +`m = 2` and `n = 0`; `D²f[(0, v), (0, v)] = -40 v²` gives `λ = 40`. From these hypotheses on `D` +alone, the theorem gives the ridge on `(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with +`M = (-1/2, 0)`. -/ +theorem h1Toy_E : + (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2 * 1 + ε), h x ∈ Metric.ball (0 : ℝ) (2 * 1) ∧ + HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) (h x)) ∧ + CapHyp h1ToyF (Icc (-2 * 1) (1 / 2) ×ˢ Metric.closedBall (0 : ℝ) (2 * 1)) (-1 / 2, 0) + (2 * 1, 0) (h1ToyF (-1 / 2, 0)) (h1ToyF (1 / 2, 0)) := by + have hf : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.1) (ContinuousLinearMap.fst ℝ ℝ ℝ) p := + fun p => hasFDerivAt_fst + have hs : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => q.2) (ContinuousLinearMap.snd ℝ ℝ ℝ) p := + fun p => hasFDerivAt_snd + have hDf : ∀ p : ℝ × ℝ, HasFDerivAt h1ToyF ((p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ + + (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := by + intro p + have h1 := HasFDerivAt.sub (HasFDerivAt.sub + (HasFDerivAt.const_mul (HasFDerivAt.pow (hf p) 3) (1 / 3)) + (HasFDerivAt.const_mul (hf p) (1 / 4))) + (HasFDerivAt.const_mul (HasFDerivAt.pow (hs p) 2) 20) + convert h1 using 1 + · funext q + simp only [h1ToyF, Pi.sub_apply] + ring + · ext <;> simp; ring + have hD2 : ∀ p : ℝ × ℝ, HasFDerivAt (fun q : ℝ × ℝ => (q.1 ^ 2 - 1 / 4) • + ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * q.2) • ContinuousLinearMap.snd ℝ ℝ ℝ) + (((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ).smulRight (ContinuousLinearMap.fst ℝ ℝ ℝ) + + ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ).smulRight (ContinuousLinearMap.snd ℝ ℝ ℝ)) p := by + intro p + have h1 : HasFDerivAt (fun q : ℝ × ℝ => q.1 ^ 2 - 1 / 4) ((2 * p.1) • ContinuousLinearMap.fst ℝ ℝ ℝ) + p := by + have := (HasFDerivAt.pow (hf p) 2).sub_const (1 / 4) + convert this using 1 + ext <;> simp + have h2 : HasFDerivAt (fun q : ℝ × ℝ => -40 * q.2) ((-40 : ℝ) • ContinuousLinearMap.snd ℝ ℝ ℝ) p := + HasFDerivAt.const_mul (hs p) (-40) + exact (h1.smul_const (ContinuousLinearMap.fst ℝ ℝ ℝ)).add + (h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ)) + have hcd : ContDiff ℝ 4 h1ToyF := by unfold h1ToyF; fun_prop + have hfd : fderiv ℝ h1ToyF = fun p => (p.1 ^ 2 - 1 / 4) • ContinuousLinearMap.fst ℝ ℝ ℝ + + (-40 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ := funext fun p => (hDf p).fderiv + have h2 : ∀ (y : ℝ × ℝ) (m : Fin 2 → ℝ × ℝ), + iteratedFDeriv ℝ 2 h1ToyF y m = 2 * y.1 * (m 0).1 * (m 1).1 - 40 * (m 0).2 * (m 1).2 := by + intro y m + rw [iteratedFDeriv_two_apply, hfd, (hD2 y).fderiv] + simp + ring + have h3 : ∀ (x : ℝ × ℝ) (m : Fin 3 → ℝ × ℝ), + iteratedFDeriv ℝ 3 h1ToyF x m = 2 * (m 0).1 * (m 1).1 * (m 2).1 := by + intro x m + rw [DifferentiableAt.iteratedFDeriv_succ_apply_left' + (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))] + have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 2 h1ToyF y (Fin.tail m)) + ((2 * (m 1).1 * (m 2).1) • ContinuousLinearMap.fst ℝ ℝ ℝ) x := by + have := ((hf x).const_mul (2 * (m 1).1 * (m 2).1)).sub_const (40 * (m 1).2 * (m 2).2) + convert this using 1 + funext y; rw [h2]; simp [Fin.tail]; ring + rw [hg.fderiv] + simp + ring + have h4 : ∀ (x : ℝ × ℝ) (m : Fin 4 → ℝ × ℝ), iteratedFDeriv ℝ 4 h1ToyF x m = 0 := by + intro x m + rw [DifferentiableAt.iteratedFDeriv_succ_apply_left' + (hcd.contDiffAt.differentiableAt_iteratedFDeriv (by norm_num))] + have hg : (fun y => iteratedFDeriv ℝ 3 h1ToyF y (Fin.tail m)) = + fun _ => 2 * (m 1).1 * (m 2).1 * (m 3).1 := by + funext y; rw [h3]; simp [Fin.tail] + rw [hg] + simp + have hsrc := ridge_capHyp_E (E := ℝ) (f := h1ToyF) (U := univ) (r := 1) (m := 2) (n := 0) + (lam := 40) one_pos isOpen_univ (subset_univ _) hcd.contDiffOn + (fun p _ s₁ s₂ s₃ y₁ y₂ y₃ => by + rw [h3, h3] + simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two, Matrix.tail_cons, + Matrix.head_cons] + have h0 : 2 * s₁ * s₂ * s₃ - s₁ * s₂ * s₃ * (2 * 1 * 1 * 1) = 0 := by ring + rw [h0, abs_zero] + exact mul_nonneg (by norm_num) (block_nonneg s₁ s₂ s₃ y₁ y₂ y₃)) + (fun x _ => by rw [h3]; simp) + (fun p _ => by rw [h4]; simp) + (fun p _ v => by rw [h4]; simp) + (by norm_num) + (fun v => by + rw [h2] + simp only [Matrix.cons_val_zero, Matrix.cons_val_one, Real.norm_eq_abs, sq_abs] + nlinarith [sq_nonneg v]) + (by norm_num) + (by rw [(hDf _).fderiv]; ext <;> norm_num) + (by rw [(hDf _).fderiv]; ext <;> norm_num) + (by simp only [h1ToyF]; norm_num) + obtain ⟨ε, hε, hex, hcap⟩ := hsrc + have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by + intro x + have := slice_hasFDerivAt (hDf (x, 0)) + convert this using 1 + ext + simp + obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩) + exact ⟨⟨ε, hε, hex⟩, hC⟩ + end CapFirstExit diff --git a/frontiers/cap_first_exit_lean_20261002/MANIFEST.json b/frontiers/cap_first_exit_lean_20261002/MANIFEST.json index e64d1763e..21e9adaff 100644 --- a/frontiers/cap_first_exit_lean_20261002/MANIFEST.json +++ b/frontiers/cap_first_exit_lean_20261002/MANIFEST.json @@ -126,6 +126,9 @@ "CapFirstExit.block_bound_collar", "CapFirstExit.ridge_capHyp_C5", "CapFirstExit.ridge_capHyp_D", + "CapFirstExit.block_of_norm", + "CapFirstExit.collar_subset_open", + "CapFirstExit.ridge_capHyp_E", "CapFirstExit.toyF", "CapFirstExit.toyRidge", "CapFirstExit.toy_ridge_ge", @@ -153,7 +156,8 @@ "CapFirstExit.h1Toy_source", "CapFirstExit.h1Toy_C3", "CapFirstExit.h1Toy_C4", - "CapFirstExit.h1Toy_D" + "CapFirstExit.h1Toy_D", + "CapFirstExit.h1Toy_E" ], "expected_axioms": { "CapFirstExit.path_meets_frontier": [ @@ -621,6 +625,21 @@ "Quot.sound", "propext" ], + "CapFirstExit.block_of_norm": [ + "Classical.choice", + "Quot.sound", + "propext" + ], + "CapFirstExit.collar_subset_open": [ + "Classical.choice", + "Quot.sound", + "propext" + ], + "CapFirstExit.ridge_capHyp_E": [ + "Classical.choice", + "Quot.sound", + "propext" + ], "CapFirstExit.toyF": [ "Classical.choice", "Quot.sound", @@ -760,6 +779,11 @@ "Classical.choice", "Quot.sound", "propext" + ], + "CapFirstExit.h1Toy_E": [ + "Classical.choice", + "Quot.sound", + "propext" ] }, "files": [ @@ -770,18 +794,18 @@ }, { "path": "ALIGNMENT.md", - "bytes": 43249, - "sha256": "b5c6149055a5065cfd68974eb63e5efe22bc1f8ba245529178097399eedce4a9" + "bytes": 46611, + "sha256": "31a13063fcbd53d12c4b3487a468de68bdad25fa5b8615697349e505374b104a" }, { "path": "CapFirstExit.lean", - "bytes": 243630, - "sha256": "734fb06e60344306d45bc7a4d58569014f3edd1c12d35e7abb64fb0d9c3dc26f" + "bytes": 267172, + "sha256": "c30c125004047eeaefc43a5e183319360a0d1a23d27051366ae5619171f1dce5" }, { "path": "README.md", - "bytes": 23706, - "sha256": "c03b290cab94245f1c61aaa057f385eca333934c9b1ef090409d7a7d123860ad" + "bytes": 25154, + "sha256": "bd5dc3cdd87cd8c96b7aaac4b7a0521d56830dd2b7c7bfafd4b583b44bb9f7f5" }, { "path": "gate.py", @@ -806,7 +830,7 @@ { "path": "test_gate.py", "bytes": 6275, - "sha256": "f08f5dafe37645d68ea582034b32106c1771c467afb48b9ac355ee1512570daf" + "sha256": "cb3b08cc5b99f087b6ca2153fd028b2825a7a69cff5a42b2ac5e8d031d6f4039" } ] } diff --git a/frontiers/cap_first_exit_lean_20261002/README.md b/frontiers/cap_first_exit_lean_20261002/README.md index 38f547b1e..9eadc29db 100644 --- a/frontiers/cap_first_exit_lean_20261002/README.md +++ b/frontiers/cap_first_exit_lean_20261002/README.md @@ -57,6 +57,11 @@ Since v2.1, the quantitative bounds enter on `D` only: - The continuity step `block_bound_collar` gives the block bound `m + Kε` on the collar of width `ε`. - Because (H1) is strict, some `ε > 0` keeps `8r(m + Kε)² < λ`. +Since v2.2, `ridge_capHyp_E` assumes only that `f` is `C⁴` on an open `U ⊇ D`, together with SP's quantitative bounds on `D` written with the iterated derivatives `D^k f = iteratedFDeriv ℝ k f`: +- every derivative datum of `ridge_capHyp_D` is a Fréchet derivative of `f`, and `T3`, `T4` and `Φ4` are slices of `D³f` and `D⁴f`; +- the collar width `ε₀` comes from `collar_subset_open`: `D` is compact, so a closed thickening of it lies in `U`; +- `K` bounds `‖D⁴f‖` on the compact collar, and `block_of_norm` turns that norm bound into the block bound. + In the topological theorems, `X` is any topological space, and nothing is assumed about `f` outside `C` except along the single ridge path. - The core theorems use only (C1)–(C3): no metric, smoothness, Morse, compactness or probability hypothesis. Their @@ -119,6 +124,10 @@ single ridge path. | `ridge_capHyp_C5` | `ridge_capHyp_C4` with `hHxb`, `hHrb`, `hwcv`, `hwcc`, `hG0cv` and `hG0cc` derived from the block bound and `|f_xxx| ≤ m` on the pin segment (v2.1) | | `ridge_capHyp_D` | the cap from SP's bounds on `D` (v2.1). The bounds `m`, `n`, (H1) and (H2) are assumed on `D`, with qualitative derivative data and some `K ≥ 0` on a collar of width `ε₀`. It concludes the ridge on `(−2r − ε, 2r + ε)`, `h(∓r/2) = 0`, the cap and (C2⁺), for some `ε ∈ (0, ε₀]` | | `h1Toy_D` | `h1ToyF` meets every hypothesis of `ridge_capHyp_D` (`T4 = 0`, `K = 0`, `ε₀ = 1/2`). The theorem gives a ridge on `(−2 − ε, 2 + ε)` for some `ε > 0`, and the cap | +| `block_of_norm` | the block bound from the norm (v2.2). A trilinear form `B` on `ℝ × E` with `‖B‖ ≤ K` satisfies the block bound with constant `K`. Replacing one slot at a time by `sᵢ(1, 0)` leaves three terms, each with a transverse argument `(0, yᵢ)` | +| `collar_subset_open` | a closed collar `[−2r − ε₀, 2r + ε₀] × B̄(0, 2r)` with `ε₀ > 0` inside any open `U ⊇ D` (v2.2) | +| `ridge_capHyp_E` | the cap from `f ∈ C⁴` on an open `U ⊇ D` and SP's quantitative bounds on `D` (v2.2). It concludes the ridge on `(−2r − ε, 2r + ε)` for some `ε > 0`, `h(∓r/2) = 0`, the cap and (C2⁺). No derivative datum and no bound off `D` is assumed | +| `h1Toy_E` | `h1ToyF` meets every hypothesis of `ridge_capHyp_E` with `U = ℝ²`: `D³f[a, b, c] = 2a₁b₁c₁` and `D⁴f = 0`, so `m = 2` and `n = 0`. The theorem gives a ridge on `(−2 − ε, 2 + ε)` for some `ε > 0`, and the cap | | `sp_curved_side_constants` | SP's constants (`m ≥ 2`, `δ > rm(8m − 5)`, `ω ≤ 2mr²`, gap `r³/6`) satisfy `ω ≤ 2rδ` and the curvature condition | | `ridgeToy_joint`, `ridgeToy_slices` | the ridge toy (`δ = 2`, `ω = 0`) meets every input of the slice route, which re-derives (C1)–(C3) and (C2⁺) | | `ridgeToy_capHyp`, `ridgeToy_saddle_strict` | SP's normalization at `r = 1` (`f = x³/3 − x/4 − y²`, gap exactly `r³/6`) satisfies every ridge hypothesis, so they are jointly satisfiable | @@ -143,15 +152,16 @@ This packet does not formalize: - the source data themselves. Since v2.0 every analytic step of L1–L20 that `ridge_capHyp_C4` uses is proved: L1–L13 and L16–L20, with L7's existence, uniqueness and regularity of `h`. L14 (the critical-point count in `D`) and L15 - (Morse indices) are not formalized and are not used by the cap theorem. Since v2.1 `ridge_capHyp_D` takes, as - hypotheses: - - the quantitative bounds on SP's `D` only: the third-derivative block bound `m`, `|f_xxx| ≤ m` on the pin segment, - the block bound `n` on the derivative of `f_xxx`, (H1) and (H2); - - qualitative data on some collar `[−2r − ε₀, 2r + ε₀] × B̄(0, 2r)`: the derivatives `Df`, `DG`, `H`, `D2f`, the - third derivatives and their `x`-derivatives, with some bound `K` on the latter. - - The continuity step from `D` to the collar is proved (`block_bound_collar`). What stays informal is that SP's - `f ∈ C⁴` near `D` supplies these data and some `K`, by compactness of a closed collar; + (Morse indices) are not formalized and are not used by the cap theorem. Since v2.2 `ridge_capHyp_E` takes, as + hypotheses, only SP's §2 setting: + - `f ∈ C⁴` on an open neighbourhood `U` of `D` (SP: `f ∈ C⁴` near `D`); + - the quantitative bounds on SP's `D`: the third-derivative block bound `m`, `|f_xxx| ≤ m` on the pin segment, + the two fourth-order blocks `n`, (H1) and (H2); + - the critical pins and the gap `r³/6`. + + The derivative data, a collar inside `U` and the bound `K` on it are derived (`collar_subset_open`, + `block_of_norm`, `block_bound_collar`). That the local field on `G_r` satisfies SP's §2 setting is SP's input and + is not formalized; - the match between the source's coordinates and the Lean objects: that SP's cap is `[-2r, r/2] × B̄(0, 2r)` in a frame `φ` and that SP analyses the periodic lift. The transport to the torus and the face list are themselves proved (`CapHyp.toTorus`, `frontier_cylinder`); @@ -190,7 +200,7 @@ The source gate checks: bound); - rebuilds the package fresh; - replays the module with `leanchecker`; -- prints the axioms of all 121 declarations, requiring exactly the manifest's report: each uses only `propext`, +- prints the axioms of all 125 declarations, requiring exactly the manifest's report: each uses only `propext`, `Classical.choice`, `Quot.sound`; - runs three negative controls (an injected `sorry`, a custom axiom, and `native_decide`). The audit must reject each. diff --git a/frontiers/cap_first_exit_lean_20261002/test_gate.py b/frontiers/cap_first_exit_lean_20261002/test_gate.py index afdfb1a54..3976f6b3d 100644 --- a/frontiers/cap_first_exit_lean_20261002/test_gate.py +++ b/frontiers/cap_first_exit_lean_20261002/test_gate.py @@ -16,7 +16,7 @@ class SourceGate(unittest.TestCase): def test_tree_passes(self): m = gate.source_check() - self.assertEqual(len(m["targets"]), 121) + self.assertEqual(len(m["targets"]), 125) self.assertEqual(m['scientific_effect'], 'NONE') def copy(self):