Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 monodromy groupoid of a foliation

Definition

Assume Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let F be a regular foliation of a smooth manifold M with leaf-wise structure as in Leaves of a regular foliation, and let leafwise paths and leafwise homotopy relative to endpoints be as in Leafwise paths and leafwise homotopy relative to endpoints.

The monodromy groupoid Mon⁡(F) is the groupoid with object set M whose arrows from x to y are the leafwise homotopy classes relative to endpoints of leafwise paths from x to y; there is no arrow from x to y when x and y lie in different leaves. Composition is induced by concatenation of leafwise paths: if a is a leafwise path from x to y and b a leafwise path from y to z, the composite [b]∘[a] is the class of the concatenation of b after a. The identity at x is the class of the constant leafwise path at x, and the inverse of the class of a is the class of the reversed path a−1.

The groupoid laws have the following endpoint-fixed witnesses. If A,B are homotopies of composable paths, their concatenation is A(s,2t) for t≤1/2 and B(s,2t−1) for t≥1/2; the clauses agree at the common endpoint, so finite closed pasting makes this a leafwise homotopy. For any endpoint-fixing reparametrization ϕ:I→I, a((1−s)t+sϕ(t)) is an endpoint-fixed leafwise homotopy from a to a∘ϕ. This gives associativity and the two constant-path identities using the explicit reparametrizations in Loop classes form the group π1(X,x0) under concatenation, proof steps 2.1–2.2; those formulas work also when the path endpoints differ. For a:x→y, the path a((1−s)min⁡(2t,2−2t)) contracts a∗a−1 to the constant path at x; the same formula with a−1 contracts a−1∗a at y. All these maps stay in the single leaf of their paths, and the formulas and finite pasting establish continuity in M. Thus the displayed operations are well defined and satisfy all groupoid laws.

The groupoid is set-theoretic: no topology is imposed on the arrow set and no smooth structure on it is asserted here.

Depends on

Used by

Dependency tree · two levels

35 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