Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicable
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.

Vanishing cycles of a codimension-one foliation

Definition

Assume Countable Choice ACω. Let F be a C2 transversely oriented codimension-one regular foliation. A vanishing cycle supported on a leaf L1 is a jointly C2 family of loops σt:S1→M, t∈[0,1], such that: (i) each σt lies in one leaf Lt of F; (ii) [σ1] is nonzero in π1(L1); (iii) σt is null-homotopic in Lt for every t<1; and (iv) for each θ∈S1, t↦σt(θ) is transverse to F. The nearby loops in (iii) have trivial holonomy because they are null-homotopic. Closure of this transverse family makes the supporting loop's holonomy the identity on the side approached by the family: its return map fixes every sufficiently close parameter on that side. Thus the supported loop is a nonlimit cycle on the approached side; its opposite-side holonomy may be nonidentity. The supported class instead determines a nonzero element of the distinct subgroup Π1j(L1) on the side approached by the family, as proved in A vanishing cycle determines a nonzero limitwise-nullhomotopy class. Here jointly C2 means the trace map S1×[0,1]→M is C2, with one-sided derivatives at the parameter endpoints; transversality requires its parameter derivative to have nonzero normal component. Smooth foliation data with a smooth trace are included as a special case.

Depends on

Used by

Dependency tree · two levels

34 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