Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The center-frontier selection and cancellation search has finite rank

Statement

Assume AC_ω and the exact maximal-center-frontier contract. On a separated generic characteristic disk with transverse boundary or regular essential leafwise boundary, finite inner-source-disk search either finds a C² vanishing-cycle trace or selects a null simple one-center/one-saddle frontier whose exact collar-fixed cancellation reduces the full-disk saddle count by one. Iteration terminates in a vanishing cycle; its rank is (total saddles, interior saddles of the current invariant search disk).

Facts & Assumptions

Given: A separated generic characteristic disk with transverse boundary or regular essential leafwise boundary, satisfying the exact maximal-center-frontier contract.

[F1]

A center period annulus has an orbit or polycycle frontier supplies the frontier and transverse trace of a maximal center annulus. The characteristic disk has one more center than saddle gives the full-disk count c−s=1, while A one-quadrant homoclinic disk contains a center gives the strict-interior count for a one-quadrant homoclinic disk. Characteristic-disk singular images can be separated into distinct leaves relative to the boundary collar re-separates the finite singular images relative to a collar with zero-free closure. A saddle polycycle has a smooth transverse family on either adjacent annulus supplies the prescribed adjacent-annulus polycycle rounding.

[F2]

The in-pair item A nested pinched center frontier has a strict inner-disk search supplies the strict inner-disk search: a nested two-loop frontier has a one-quadrant inner disk K containing a center, searching from a center of K stays inside K, and any further nested pair has a saddle strictly inside K with inner disk excluding it; the in-pair item A first saddle lobe admits a collar-fixed center-saddle cancellation supplies the collar-fixed cancellation removing exactly one center and one saddle, and the in-pair item The first essential loop in a transverse family is a vanishing cycle produces a vanishing cycle from a first essential loop of a transverse family.

[F3]

The in-pair item A null simple center frontier supplies the exact cancellation scalar supplies, for a null simple one-center one-saddle frontier, the first integral and Euclidean-gradient hypotheses of the conditional cancellation carrier; the outer collar is fixed by that construction.

[F4]

Generic position gives finitely many nondegenerate critical points of local C2 transverse functions (Relative generic position for characteristic disk maps). Smooth cutoffs exist by A manifold bump for a compact set inside an open set, the segment mean-value estimate by The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a) gives their Taylor error bounds, and C² inverses and scalar return roots gives C2 regular level arcs. The standing choice hypothesis is The countable-choice principle used in the foliation pair. Here the exact maximal-center-frontier contract means the complete frontier and C2 period-trace alternatives of [F1], the one-quadrant count and strict inner descent of [F2], and, at a selected null simple lobe, the fixed cap, full-neighbourhood first integral, gradient branches and exact exterior collar of [F3], together with the embedded piecewise-C2 source circuit required by the cancellation carrier. The regularity bridge below supplies that last requirement after an arbitrarily small interior modification; it is not a consequence of genericity alone.

Proof

technique · direct
1.1F1F4givenconstructalgebra

Fix a smaller closed zero-free outer collar, so the separation supplier of [F1] applies with its required zero-free collar closure. Before searching, normalize each of the finitely many critical germs in disjoint interior balls. In a foliation box write the map as (Y,u), let w=x−p, H=D2u(p) and Q=u(p)+12wTHw. For R=u−Q, continuity of D2u and the segment integral estimate give ∣R∣≤δ(ε)∣w∣2, ∣DR∣≤δ(ε)∣w∣ and ∥D2R∥≤δ(ε) on ∣w∣≤ε, with δ(ε)→0. Choose a radial cutoff χε equal to zero for ∣w∣≤ε/3 and one for ∣w∣≥2ε/3, with ∥Djχε∥≤Cjε−j for j=1,2. Replace u by Q+χεR, retaining Y. The product rule gives ∣D(χεR)∣≤Cδ(ε)∣w∣ and a C2 change tending to zero. Since ∣Hw∣≥a∣w∣ for some a>0, choosing Cδ<a/2 excludes every new zero, also during the interpolation; the value and Hessian at p are unchanged. Smallness keeps the image in its foliation box. Thus all singular images remain separated and the outer collar stays fixed. A linear change diagonalizes H; the saddle critical level now has straight rays near the saddle. Elsewhere regular level arcs are C2 by [F4], so every finite simple homoclinic circuit is genuinely piecewise C2 in the source coordinates. Start the frontier search on this modified disk.

2.1F1F2step 1.1

The period-frontier interface [F1] yields the frontier of the maximal center annulus. Distinct singular ambient leaves prevent a connected characteristic frontier from containing different saddle vertices; a one-saddle graph has at most two homoclinic edges; the basin is an increasing union of its bounded periodic disks, hence a whole bounded complementary component of that graph; a side-by-side two-loop graph has separate bounded components, so one center basin has only one lobe as its frontier; and a nested pair has a one-quadrant inner bounded disk K containing a center. Searching from a center in K regardless of the two image lobe classes, its trajectories cannot cross the invariant boundary, any further nested pair has its saddle strictly inside K with inner disk excluding that saddle and hence strictly fewer interior saddles, and a later frontier reaching ∂K is that simple circuit. This is source topology and uses no inherited essential boundary class.

3.1F1F3step 1.1step 2.1

For a selected maximal annulus, near-center loops are null in a plaque. If any regular loop is essential, the first-essential-parameter construction produces a vanishing cycle using the C² period trace. Otherwise all regular loops are null. An essential simple saddle endpoint produces a vanishing cycle by the same first-essential construction; a null simple endpoint supplies one fixed cap and the cancellation of [F3]; a null regular endpoint has trivial two-sided ambient holonomy, so a regular source neighbourhood has a closed-orbit band across the endpoint, contradicting maximality; an essential regular endpoint again gives the first-essential trace. An outer transverse boundary cannot be the limit of periodic circles in its regular transverse collar, a regular leafwise boundary is the prescribed essential endpoint, and an isolated outer center is impossible in a disk: a small punctured centre neighbourhood is foliated by circles, so joining this cap to the original centre cap with the intervening product annulus would exhibit a compact boundaryless two-dimensional submanifold of the interior of the connected source disk, which is locally open in that disk and hence, by compactness, closed, a contradiction.

4.1F1F2F4step 1.1step 3.1∎

Define the rank as the pair (S,s(K)) with the lexicographic order, where S is the total saddle count in the current full disk and s(K) the number of interior saddles of the current invariant search disk. The inner-source-disk search of step 2.1 lowers s(K) strictly; a null simple cancellation lowers S exactly by one, leaves the original outer collar fixed and removes no other zero, after which the finitely many remaining singular images are re-separated relative to a smaller closed zero-free outer collar by [F1] and the quadratic normalization of step 1.1 is repeated before a new maximal-annulus search. Neither operation creates a zero; no old separatrix or basin is assumed to survive. At S=0 there is still a center by the index count c−s=1 of [F1], and the regular or boundary alternatives of step 3.1 yield an essential endpoint. Hence the full-disk theorem follows in finitely many cancellations, the iteration terminates in a vanishing cycle, and every regular annulus extension is absorbed into the one maximal family supplied by the frontier interface rather than an artificial new family.

Depends on

Used by

Dependency tree · two levels

85 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources