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.

Limitwise-nullhomotopy predicate descends to a normal subgroup

Statement

Assume Countable Choice ACω. For a transversely oriented codimension- one foliation, a leaf L, a base point x∈L, and a side j, the predicate Qj(f) of Limitwise-nullhomotopy predicate on based loops is independent of the chosen normal fence and is constant on based-homotopy classes of loops in Nj(L,x). The set of classes in Nj(L,x) satisfying this predicate is a well-defined normal subgroup of π1(L,x). Consequently the class-level subgroup Π1j(L,x) may be defined using any representative and any sufficiently short normal fence.

Facts & Assumptions

Given: A transversely oriented codimension-one foliation, a leaf L, a base point x∈L, a side j, and the predicate Qj on based loops in Nj(L,x) for a chosen sufficiently short normal fence.

Proof

technique · direct
1.1givenconstruct

A based leafwise homotopy of two loop representatives has compact intrinsic image. Subdivide its parameter cylinder into finitely many small rectangles inside convex plaque-coordinate boxes. Continue one positive base transversal along a finite tree of the subdivision. Face relations give identical transported labels by the finite chart homotopy argument of Holonomy of a C¹ foliation is a representation into C¹ transverse germs. The sole noncontractible circuit of the parameter cylinder is the original loop; since its class lies in Nj, its return germ is the identity on a sufficiently short interval on side j. Thus all finitely many edge relations hold on one positive interval. Assign boundary edge paths to the two displaced loops, assign interior edges once in their common plaque cores, and fill each face by coning its boundary in one convex plaque core. As in A compact leafwise nullhomotopy persists under a transverse deformation in its shared-edge and face-filling construction, this yields a leafwise homotopy between the displaced boundary loops, with a moving basepoint. Nullhomotopy is unchanged by that basepoint change. Hence the predicate is constant on based-homotopy classes.

2.1step 1.1construct

Two short fence choices are compared at the basepoint by the local plaque transport between their transversals. It is an increasing germ sending zero to zero, so it sends all sufficiently small positive parameters into, and onto, a sufficiently small positive interval. For matching parameters their displaced loops have the same local transverse labels; the finite rectangle construction of step 1.1, applied to the constant representative homotopy and these two boundary choices, gives a leafwise homotopy between them. Therefore the condition "every sufficiently small displacement is null" is unchanged by the fence.

3.1step 1.1step 2.1construct

The constant loop satisfies the predicate, using its constant plaque-wise displacement; step 2.1 makes this true for any fence. For two loops in Nj satisfying the predicate, choose one common short base transversal. Their displaced loops are closed and null at each sufficiently small parameter, so their concatenation is null. Displacement of the concatenation agrees with that concatenation up to the finite plaque homotopies in step 1.1. Reversal likewise gives the reversed null loop. Thus the class set contains the identity and is closed under products and inverses.

4.1step 1.1step 2.1step 3.1given∎

For any based loop g, its side-preserving transport germ sends a sufficiently small positive parameter ε to another positive parameter tending to zero. Displacing g∗f∗gˉ gives the g-path, the displaced null loop f at that transported parameter, and the reverse g-path. This loop is null. To check that the conjugate also lies in Nj, let ρ be the reversed-loop holonomy homomorphism on the full base transversal (The holonomy representation and the holonomy group of a leaf). Coorientation makes its germs increasing and side-preserving. Restriction to side j is a well-defined homomorphism rj into the group of local half-transversal germs: restriction commutes with composition and inversion, and agreement near the basepoint remains agreement on that side. Thus Nj=ker⁡(rj∘ρ) is normal, and the conjugate belongs to it. The kernel of ρ itself need not equal Nj. Therefore the predicate-defined subgroup is normal in π1(L,x). All compact subdivisions and germ relations were finite.

Depends on

Used by

Dependency tree · two levels

54 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