Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck 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.

Holonomy depends only on leafwise homotopy relative to endpoints

Statement

Assume Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let F be a regular foliation of M, let a,b be leafwise paths from x to y that are leafwise homotopic relative to endpoints (Leafwise paths and leafwise homotopy relative to endpoints), and let T,T′ be local transversals at x and y (Local transversals to a regular foliation). Then ha(T′,T)=hb(T′,T) as germs. In particular the holonomy germ of a leafwise path depends only on its leafwise homotopy class relative to endpoints and on the endpoint transversals.

Facts & Assumptions

Given: A leafwise homotopy H:[0,1]2→M relative to endpoints from the leafwise path a to the leafwise path b, with a,b leafwise paths from x to y, and local transversals T at x and T′ at y.

[F1]

H is continuous, H(0,⋅)=a, H(1,⋅)=b, H(s,0)=x, H(s,1)=y, and every slice t↦H(s,t) is a leafwise path (Leafwise paths and leafwise homotopy relative to endpoints).

[F2]

The holonomy germ of a leafwise path is well defined: it is unchanged by passing to a refinement of the chart chain, by changing the subdivision points, and by changing the auxiliary intermediate transversals, so it depends only on the leafwise path and the endpoint transversals (The holonomy germ is independent of the foliation chart chain).

[F3]

[0,1]2 is a compact metric space by Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line; every open cover has a Lebesgue number, so a sufficiently fine rectangular grid has every cell [sj−1,sj]×[tk−1,tk] mapped into a member of a given open cover of [0,1]2 (Every open cover of a compact metric space has a Lebesgue number: a δ>0 such that every nonempty subset of diameter less than δ lies inside a single member of the cover).

[F4]

The germ ha(T′,T) is, by construction, the germ of the composite of the chart-wise plaque transports along a finite chart chain of a: for a subdivision 0=t0<⋯<tN=1, foliation charts U1,…,UN with a([ti−1,ti])⊆Ui and local transversals Ti at a(ti), the chart-wise transport inside Ui matches points of the transversals at a(ti−1) and a(ti) with equal transverse coordinates, and these germs compose (A leafwise path determines a germ of a transverse diffeomorphism).

[F5]

Under the assumed Countable Choice, leaves are maximal connected integral manifolds, with their intrinsic second-countable smooth structure; connected integral manifolds factor smoothly through them (Regular foliations and integrable distributions correspond, Existence and uniqueness of maximal connected integral manifolds).

[F6]

A smooth map with invertible differential is locally a diffeomorphism (The smooth inverse function theorem on manifolds); a nondegenerate real interval is uncountable (Every nondegenerate interval of R is uncountable).

Proof

technique · direct
1.1F1given

The homotopy image lies in one leaf. Since H(s,0)=x for every s and every slice t↦H(s,t) is a leafwise path, the point H(s,t) lies in the leaf L through x for every (s,t). Consequently for every curve c:[0,1]→[0,1]2 the composite H∘c is a leafwise path in L, and if c runs from (0,0) to (1,1) then H∘c runs from x to y.

2.1F1F3step 1.1construct

Staircase paths in the square. The sets H−1(U), over foliation charts of F, form an open cover of the square; by [F3] there are grids 0=s0<⋯<sm=1 and 0=t0<⋯<tn=1 such that H maps every cell Rjk=[sj−1,sj]×[tk−1,tk] into a single foliation chart. Consider the monotone lattice paths from (0,0) to (1,1) built from the unit steps E (increasing s) and N (increasing t). Starting from the path σ0=EmNn, the bottom edge followed by the right edge, bubble the N steps to the left: each of the n steps N crosses each of the m steps E once, in mn successive interchanges of an adjacent pair EN into NE, until the path σmn=NnEm, the left edge followed by the top edge, is reached. Parametrise the paths σ0,…,σmn so that σℓ and σℓ+1 coincide outside a subinterval on which they run from the common start of the interchanged steps to their common end along the two L-routes (the two two-segment side paths) of the cell spanned by those steps. Then each Pℓ:=H∘σℓ is, by step 1.1, a leafwise path from x to y, with P0 a reparametrisation of the concatenation of the constant path at x with b, and Pmn a reparametrisation of the concatenation of a with the constant path at y.

2.2F1F2F4F5F6step 1.1construct

Adding one interchange changes nothing. Fix ℓ, let R be the cell spanned by the interchanged steps, mapped by H into a foliation chart U, and let C1,C2 be the common start and the common end of the two interchanged steps, so that σℓ and σℓ+1 agree outside one parameter interval on which they run from C1 to C2 along the two L-routes of R. The image H(R) is connected and lies in U∩L by step 1.1, and it lies in one plaque as follows. By [F5], give L its intrinsic second-countable manifold structure. Each plaque of U in L is intrinsically open: its inclusion factors smoothly through L with invertible differential, since both tangent images equal TF, and [F6] applies. Distinct plaques are disjoint, so assigning the least index of a nonempty basic open set contained in each plaque injects this family into an enumerated basis. Thus the transverse values of L∩U are countable. Every transverse coordinate of the connected continuous image H(R) is constant, since two values would force a nondegenerate interval of values, contrary to [F6]. The image lies in one connected level-set component, hence one plaque. In particular p:=H(C1) and q:=H(C2) lie in a common plaque of U, and both routes have images in U. Choose local transversals Sp at p and Sq at q, a subdivision of [0,1] that contains the two parameter values belonging to C1 and C2 and has no further subdivision point between them, foliation charts equal to U on the middle interval and covering the common outer parts of the two paths, and intermediate transversals accordingly: this subdivision, these charts and these transversals satisfy the admissibility condition of [F4] for Pℓ and for Pℓ+1, because outside the middle interval the two paths coincide and inside it both routes have images in U with endpoints in a common plaque. Every chart-wise transport of [F4] is determined by its chart and its two transversals alone, so Pℓ and Pℓ+1 receive one and the same composite germ; by [F4] that germ is a germ of each of the two paths, and by [F2] it is the intrinsic holonomy germ of each. Hence hPℓ(T′,T)=hPℓ+1(T′,T).

3.1F1F2F4step 2.1step 2.2∎

Conclusion. Chaining step 2.2 over ℓ=0,…,mn−1 gives hP0(T′,T)=hPmn(T′,T). By step 2.1 the paths P0 and Pmn are reparametrisations of cx∗b and of a∗cy, where cx,cy denote the constant paths at x,y; reparametrising a chart chain changes only its subdivision points, so by [F2] it suffices to compare the germs of the two concatenations. Apply [F4] to cx∗b with a chart chain whose subdivision contains the junction, whose chart on the constant piece is a foliation chart around x, and whose intermediate transversal at the junction is T itself: the transport along the constant piece matches equal transverse coordinates at the single point x, so it is the identity germ of (T,x), while the composite along the remaining pieces is a chain composite of b and therefore equals hb(T′,T) by [F2]; hence hP0(T′,T)=hb(T′,T). The same argument applied to a∗cy with intermediate transversal T′ at y gives hPmn(T′,T)=ha(T′,T). Therefore ha(T′,T)=hb(T′,T) for leafwise homotopic paths with the same endpoints, and the holonomy germ depends only on the leafwise homotopy class relative to endpoints and on the endpoint transversals.

Depends on

Used by

Dependency tree · two levels

98 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