Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

A vanishing cycle determines a nonzero limitwise-nullhomotopy class

Statement

Assume Countable Choice ACω. Let F be a transversely oriented codimension-one foliation and let (σt)0≤t≤1 be a vanishing cycle supported on L1. For the side j approached by the transverse trace annulus, the class [σ1] is a nonzero element of Π1j(L1,x), where x=σ1(1). In particular its one-sided holonomy germ is the identity, so this conclusion does not say that [σ1] is an ordinary limit cycle.

Facts & Assumptions

Given: A transversely oriented codimension-one foliation F, a vanishing cycle (σt)0≤t≤1 supported on L1, the side j approached by the transverse trace annulus, and the standing countable choice assumption.

[F1]

A vanishing cycle supported on L1 is a jointly C2 family of loops σt lying in leaves Lt, with [σ1] nonzero in π1(L1), each σt null-homotopic in Lt for t<1, and transverse point tracks. (Vanishing cycles of a codimension-one foliation).

Proof

technique · direct
1.1F1given

Let x=σ1(1); by [F1] the trace map is jointly C2, its point tracks are transverse, and [σ1]≠1 in π1(L1), while near t=1 the trace annulus is a one-sided transverse fence for σ1 because S1×[0,1] is compact and the tracks are transverse.

2.1step 1.1

Cover the compact annulus by finitely many foliation charts and subdivide it into rectangles contained in single charts; in each rectangle plaque coordinates identify the upper loop with the normal displacement of the lower loop up to a path inside a plaque (Flat charts for a distribution, Plaques of a flat chart), the identifications agree on shared edges, and the C² plaque transport of specified charts preserves the regularity (lem-c2-plaque-transport-and-transverse-fences-preserve-c2-regularity), so for every sufficiently small positive parameter the trace loop σt is leafwise homotopic to the corresponding normal displacement of σ1.

3.1F1step 2.1∎

For t<1 the loop σt is closed and null-homotopic on its leaf by [F1], so the leafwise homotopic displaced loop of σ1 is closed and null-homotopic as well; closedness of all sufficiently small positive displacements is exactly triviality of the one-sided holonomy germ of [σ1], and null-homotopy of those displacements is the predicate Qj, so [σ1] is a nonzero element of Π1j(L1,x) by [F1] and the class-level definition of the limitwise-nullhomotopy subgroup, with only the standing countable choice used.

Depends on

Used by

Dependency tree · two levels

23 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