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.
Local systems correspond to group-ring modules
Statement
Assume AC. Let be a nonempty connected CW complex, choose , and let be a commutative unital ring. Evaluation at , with left action is an equivalence from the category of left -module local systems on to the category of left -modules. A family of paths from constructs a quasi-inverse. The equivalence is canonical up to natural isomorphism, not a literal equality independent of those paths.
Facts & Assumptions
Given: as in the statement and the Axiom of Choice.
Local systems and pullback defines transports, coefficient morphisms, and the displayed left monodromy convention.
Vertex groups recover the fundamental group identifies the published loop group with the categorical vertex group by reversal.
For a commutative ring , -linear -actions are exactly the compatible left -module structures identifies -linear left actions of a group with left modules over its group ring, including equivariant maps.
The Axiom of Choice permits a simultaneous selection from the nonempty sets of paths from to the other points of .
CW complex with closure finiteness and weak topology supplies characteristic disks whose images are the closed cells and the weak-topology test against every closed cell.
Proof
A connected CW complex is path connected. The image of each characteristic disk is path connected, so it lies in one path component. Hence every path component intersects each closed cell either in the whole cell or not at all. Both and its complement therefore have closed intersection with every closed cell, and the weak-topology test in [F5] makes both sets closed. Thus is also open; connectedness leaves only one path component. Consequently the set of paths is nonempty for every . Use [F4] once to choose such a path , taking .
For a local system , give the action in the statement. If are loop classes, covariance gives and hence ; therefore . Constants act identically and reversals act inversely. The operators are -linear, so [F3] extends this action uniquely to an -module. Naturality makes the component of every coefficient morphism equivariant. This defines the evaluation functor .
Conversely let be a left -module. Define a local system with every fiber equal to the underlying -module . For a path , put and . Endpoint-fixed homotopies do not change . Constants give the identity. If and , cancellation of gives , so . Thus is a covariant functor. A module map, used on every fiber, is a natural transformation by equivariance; hence is a functor.
Since is constant, for a loop at the action obtained by evaluating is . Hence is literally the identity on modules and their maps. For a local system , define by . The action on and the definition of give . Therefore , so is a natural isomorphism . It is natural in because coefficient morphisms commute with every .
Steps 1.2–3.1 exhibit the required equivalence. A second chosen path family produces another and the component acting on gives the natural isomorphism ; the same cancellation as in step 2.1 proves naturality. Thus path choices affect the displayed model but not its natural-isomorphism class. The only AC use was the point-indexed family in step 1.1; for a one-point space only the constant path is needed, while the empty case is excluded by the chosen basepoint.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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
- Davis and Kirk, Lecture Notes in Algebraic Topology, Chapter 5 §§1,3, pp.95–97, 103–107 (standard reference, not scraped)