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 first essential loop in a transverse family is a vanishing cycle

Statement

Assume Countable Choice ACω. Let Ht:S1→M, 0≤t≤1, be a jointly C2 family whose loops lie in leaves and whose point tracks are transverse to a C2 cooriented codimension-one foliation. If H0 is null-homotopic in its leaf and H1 is nontrivial in its leaf, there is a parameter t∗∈(0,1] such that Ht is null-homotopic for every t<t∗ and Ht∗ is nontrivial. After reparametrization, (Ht)0≤t≤t∗ is a vanishing cycle and its endpoint determines a nonzero class in the limitwise-nullhomotopy subgroup on the approached side.

Facts & Assumptions

Given: A jointly C2 family Ht:S1→M, 0≤t≤1, whose loops lie in leaves of a C2 cooriented codimension-one foliation and whose point tracks are transverse, with H0 null-homotopic in its leaf and H1 nontrivial in its leaf.

[F1]

A vanishing cycle supported on a leaf L1 is a jointly C2 family of loops lying in leaves with [σ1] nonzero, earlier loops null-homotopic in their leaves, and transverse point tracks, and it determines a nonzero class in the appropriate limitwise-nullhomotopy subgroup. (Vanishing cycles of a codimension-one foliation).

Proof

technique · direct
1.1given

Let S be the set of parameters s such that every loop Ht with 0≤t≤s is null-homotopic in its leaf; the loop H0 has a compact null-homotopy, and the persistence result for compact transverse deformations (lem-nullhomotopy-persists-under-a-compact-transverse-deformation) transports it to nearby loops of the family, so S contains a positive interval.

2.1step 1.1

Let t∗=sup⁡S, which lies in (0,1]; for every t<t∗ the definition of supremum gives s∈S with s>t, hence Ht is null-homotopic in its leaf.

3.1step 2.1

If t∗<1 and Ht∗ were null-homotopic, the compact-disk persistence lemma would make the loops null-homotopic on a right-hand interval of t∗, contradicting the supremum; if t∗=1 then nontriviality of H1 is the hypothesis, so in either case Ht∗ is nontrivial in its leaf.

4.1F1step 3.1∎

After reparametrizing the restricted family (Ht)0≤t≤t∗ one obtains a vanishing cycle in the sense of [F1], and the bridge result that a vanishing cycle determines a nontrivial limitwise-nullhomotopy class (A vanishing cycle determines a nonzero limitwise-nullhomotopy class) gives the nonzero class in Π1j on the approached side; only the standing countable choice is used.

Depends on

Used by

Dependency tree · two levels

26 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