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.
Monodromy acts by fibre bijections, and its orbits are the intersections of path components with the fibre
Statement
Monodromy acts on each covering fibre by bijections. Its orbit through is exactly the intersection of the path component of with that fibre.
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
Fix a covering , a basepoint , and . For , define as the endpoint of the unique lift of beginning at (thm-path-lifting-for-covering-maps). Endpoint homotopy invariance makes this well defined (cor-lifted-path-endpoints-depend-only-on-path-homotopy). With the library's traversal-order product this is a right action; the corresponding left action is (def-group-action). (The monodromy right action on a covering fibre and its equivalent left-action convention).
For every pointed topological space , the product is well defined and makes a group. Its identity is the class of the constant loop , and . (Loop classes form the group under concatenation).
Throughout, (def-interval) carries the subspace topology inherited from with its usual topology (def-subspace-topology-top, lem-real-line-is-a-metric-space, def-metric-topology, def-metrizable-space). It is called the unit interval. A path in from to is a continuous map with and , where carries the subspace topology inherited from ; is path-connected when any two of its points are joined by such a path. (Paths, path-connected spaces and path components).
Proof
Path reversal gives the inverse endpoint permutation and concatenation gives the right-action law under the library's convention that traverses first.
A lifted loop is a path upstairs joining its starting and endpoint fibre points.
Conversely, project any path upstairs between fibre points to a loop downstairs.
Thus transitivity is equivalent to path-connectedness of the relevant covering component.
The preceding construction and implications establish the assertion.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 87 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Allen Hatcher, Algebraic Topology, §1.3 (standard reference, not scraped)
- J. Peter May, A Concise Course in Algebraic Topology, Ch. 3 (standard reference, not scraped)
- Marco Gualtieri, MAT1300 Week 4 Term 2, §1.6 (standard reference, not scraped)