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 compact leafwise nullhomotopy persists under a transverse deformation

Statement

Assume Countable Choice ACω (The countable-choice principle used in the foliation pair). Let F be a C2 codimension-one regular foliation, and let H:S1×(−δ,δ)→M be a C2 trace annulus such that each loop Hs=H(⋅,s) lies in a single leaf and every point track s↦H(θ,s) is transverse to F (Smooth maps transverse to a regular foliation). If Hs0 is null-homotopic in its leaf by a compact continuous disk map, then Hs is null-homotopic in its leaf for all s in some open interval about s0.

Facts & Assumptions

Given: A C2 codimension-one regular foliation F, a C2 trace annulus H with leafwise loops and transverse tracks, a parameter s0, and a compact continuous disk map u:D2→Ls0 with u∣∂D2=Hs0.

[F1]

A C2 foliation atlas is a C1 foliation atlas with the transition form (x′,t′)=(g(x,t),h(t)), h a C1 local diffeomorphism (C¹ codimension-one regular foliations and transverse orientation, Regular foliation atlases).

[F2]

In a flat chart the plaques are the connected components of the level sets of the transverse coordinate; a leafwise path segment contained in a flat chart lies in a single plaque, and plaque transport between local transversals inside that chart matches points with equal transverse coordinate (Flat charts for a distribution, Plaques of a flat chart, Leaves of a regular foliation).

[F3]

Holonomy germs of leafwise paths between fixed endpoint transversals are invariant under leafwise homotopies relative to endpoints (Holonomy depends only on leafwise homotopy relative to endpoints); the holonomy representation is the homomorphism on leafwise homotopy classes of The holonomy representation and the holonomy group of a leaf; in particular a leafwise loop that is null-homotopic relative to its basepoint has identity holonomy germ, and the constant loop contributes the identity.

[F5]

Every finite plaque transport between C2 local transversals of a C2 foliation atlas is a C2 local diffeomorphism germ (C² plaque transport and finite transverse fences preserve C² regularity).

[F7]

The standing hypothesis is Countable Choice ACω (The countable-choice principle used in the foliation pair).

Proof

technique · direct
1.1givenF1F2F4

Subdivide the continuous cap u into finitely many sufficiently small parameter triangles, using the pullback of nested foliation boxes and [F4]. Choose their images inside convex plaque-coordinate cores with larger boxes available. Refine near shared faces if necessary so each edge and both adjacent triangles have a common small box inside their larger boxes. All charts and positive margins are finite. Include the basepoint θ0 as a boundary vertex and use the transversal τ(t)=H(θ0,s0+t).

2.1F1F2F3F5step 1.1

Choose a spanning tree in this finite triangulation. Continue τ along the u-image of its tree paths to fixed short transversals at all vertices. Each edge, combined with the two tree paths, gives a based loop in the disk, whose u-image is nullhomotopic in the leaf. Its holonomy is the identity by [F3]. There are finitely many such relations, so choose one interval J where all transported vertex points satisfy them. Consequently vertices of each triangle lie in the same local plaque of that triangle's box. At a boundary vertex prescribe the point H(θ,s0+t): continuing along the boundary gives the same plaque label as the tree path by those relations. The equality here is of local transverse labels; nearby points in one global leaf are not automatically in one plaque. The finite-chart proof of [F3] applies verbatim to the C² atlas; it is also the homotopy argument of Holonomy of a C¹ foliation is a representation into C¹ transverse germs, with orientation irrelevant.

3.1F1F2step 1.1step 2.1construct

Give each interior edge a single chosen continuous plaque path between its transported endpoints in its small common box, for example its coordinate chord. Use the prescribed path Hs on each boundary edge. The finitely many nested boxes and a sufficiently fine original subdivision ensure these paths stay in the larger boxes of their adjacent triangles: each edge's small box has closure inside those larger boxes, and its convex plaque core contains the endpoint paths after one common shrink of J. Plaque-label compatibility in step 2.1 therefore puts the complete boundary of each triangle in one convex plaque core. Unlike independent coordinate formulas on cells, these edges are defined once and used by both incident faces.

4.1F2step 2.1step 3.1

Fill each triangle by coning its already chosen boundary path to one point of that convex plaque core, in the plaque coordinates. This is a continuous disk with exactly the chosen edge paths on its boundary. The finitely many disks agree on every shared edge, and closed pasting produces a continuous map of the original disk into one leaf, with boundary exactly Hs. Continuity is in the intrinsic plaque topology because each piece lies in a single plaque and the pasting has finitely many pieces. This is a nullhomotopy of Hs for every s∈s0+J. No differentiability of the original continuous cap has been asserted.

5.1F7step 4.1∎

The construction used only finitely many boxes, triangles, tree transports and germ relations, and one finite common interval. It proves the stated persistence under the declared ACω hypothesis, without limits of changing filling disks.

Depends on

Used by

Dependency tree · two levels

68 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