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.
Normal-cover local homology detects mixed-derived kernels without choice
Statement
Let be a connected Hausdorff space with a supplied basis of contractible open neighborhoods, , , and . Put and let be any commutative unital ring. Use first-loop-first concatenation in . There is a canonical based normal path-class cover with , whose right deck action is Let be the free -module on , with its induced right action and transport along lifted paths. Each fiber is free of rank one as a right -module. Its base fiber is identified with by the constant-path lift. Thus transport around a based loop is left multiplication by its quotient image .
For this specified right local system, the actual singular chain complex is naturally isomorphic to as a complex of right -modules, and there is a natural isomorphism The right action on the last group is for . A based loop with coefficient corresponds to . In particular it represents zero in exactly when it lies in the kernel of . More explicitly, for a finite list of commutative unital rings , define and where each map sends to . These subgroups are characteristic by induction, since the recursion is natural under automorphisms. Taking and makes the displayed zero criterion exactly the next mixed-series kernel . For a based continuous map between connected Hausdorff spaces each with a supplied basis of contractible open neighborhoods, if , these identifications commute with the induced homology maps and quotient-group coefficient maps. This includes every connected Hausdorff manifold, with boundary allowed, and every connected finite polyhedron. No finite CW structure, compactness, finite generation of , or choice principle is assumed.
Facts & Assumptions
Given: The based Hausdorff space, its basis of contractible open neighborhoods, the normal subgroup and coefficient ring. A singular chain is a finite linear combination of singular simplices. Its first-vertex local boundary transports the coefficient along the first edge on the face omitting the first vertex; the other faces retain that coefficient. Tensor products over are generated by pairs subject to the additive and balancing relations.
Proof
The supplied contractible basis consists of path-connected open sets, so connectedness implies path-connectedness: path components are open and their complements are open. Form the set of paths , identifying two with the same endpoint when the loop belongs to . The subgroup laws make this an equivalence relation. For a member of the supplied contractible basis and a path ending in , let consist of for paths lying in and starting at that endpoint. The projection to is bijective because any two such paths with the same endpoint are homotopic rel endpoints in . If two such sets over meet they coincide; for two different basis neighborhoods, a smaller basis neighborhood of a common endpoint shows their intersections contain a basic set of this same form. They therefore define a topology for which is a disjoint union of open sets each homeomorphic to . Surjectivity uses a path to each individual endpoint, rather than selecting all such paths. Thus this is an actual covering space constructed without a representative section.
For completeness the degree-one constant-coefficient calculation needs no universal-coefficient theorem. For any path-connected based space , concatenate paths by the first-loop-first rule. A constant edge is the boundary of a constant triangle; a path homotopy gives the boundary of its two-triangle prism up to constant endpoint edges; and is homologous to by mapping a triangle to the concatenated path with vertex parameters . A reversed path is homologous to the negative path, since its concatenation with the original contracts by retracing. These finite relations show that is a well-defined additive balanced map . For a fixed finite cycle , choose paths from the basepoint to the finitely many endpoint images and put Finite choice follows by finite induction in ZF, so these paths exist without an axiom of choice.
A path lifts from the constant-path point by , with the restricted path reparametrized and held stationary after its endpoint. This is continuous on the basic sets of step 1.1, and reaches , so is path-connected. For any fixed starting lift, path lifting exists uniquely by finite subdivision into evenly covered basis neighborhoods. A homotopy lifts uniquely by the same finite-grid construction on its compact square: choose a finite fine grid subordinate to the inverse-image cover and extend sheet by sheet, with uniqueness on overlaps. The square is compact metric, so this finite construction uses no choice principle. Hence is injective on fundamental groups, and its image consists exactly of based loops whose lifted endpoint is the constant-path point, that is, exactly . This identifies with by the actual projection. The same lifting statement for a singular simplex follows directly by sending a point to the lift obtained along the straight segment from its first vertex; segments joined by a triangle are homotopic inside the simplex, so this gives the unique continuous lift with prescribed first vertex.
Another finite path family changes each loop term by in the abelianization. After tensoring, its total coefficient at a vertex is that of the cycle boundary, hence zero. Thus has one uniquely defined value , independent of paths or enlargement of the finite endpoint list. On a singular triangle the loops for edges satisfy because the triangle fills their concatenation, so kills its signed boundary. For any finite two-chain use the finite union of its vertex images to get the same conclusion termwise, with its coefficients. Thus descends to homology. The relations in step 1.2 say is homologous to ; in the weighted sum the extra path terms cancel by the cycle condition. Hence . On a based loop use the constant connector at its endpoint, giving on every generator . This proves the natural isomorphism . Naturality follows by mapping a finite connector family forward; independence then removes that family from the map. No paths to all points of and no basis of an infinite vector space were chosen.
For and any representative loop , define the right action by . Replacing by another representative gives the same path class, since is normal; replacing by an equivalent path also does. The action law follows from , and its maps carry the basic sets in step 1.1 to basic sets. On each fiber it is free and transitive: for paths to the same endpoint take the quotient class of , which sends to . The formula specifies the action uniquely without choosing representatives for all quotient elements. Free -linearization of each fiber gives ; path transport commutes with this right action because it appends a path at the end, while deck action prepends . Thus it is a right- local system, each fiber individually having a torsor point as a free basis. At the basepoint the constant-path point is a specified basis, and transport along sends it to , giving exactly the stated inverse convention and a right-linear map.
A basis generator in the local chain group consists of a base singular simplex together with one point of the covering fiber over its first vertex and a scalar in . Send it to the unique lift of with that first vertex, given in step 2.1, with the same scalar. Pairs of this kind are in bijection with covering singular simplices: projection gives the inverse map. Both directions are uniquely specified on generators, hence define inverse maps on all finite chains without selecting a lift for each base simplex. For the face omitting the first vertex, the first point of the lifted face is the transport of the old first point along that edge, exactly the local coefficient boundary rule. The other faces keep the first point. Thus the bijection commutes with all signed boundary terms. It commutes with the right deck action on generators too, so gives the claimed actual chain isomorphism of right -module complexes.
Apply steps 1.2 and 2.2 to and combine with steps 2.1 and 4.1. A based loop lifts to the based loop whose projection is , so its coefficient-one class maps precisely to . For the right action, move the constant-path base lift by . The lift of joins the old base lift to that new one. Rebase the translated lift of by this path and its inverse; its projection is . Connector contributions cancel in first homology by step 1.2, so this gives the stated conjugation action on . Different representatives of change it by an inner automorphism of , trivial on . The zero criterion is now exactly the displayed isomorphism and its coefficient-one formula; for in the finite mixed series defined in the Statement, it is the next kernel . For a based continuous map between spaces with the stated connected, Hausdorff and contractible-neighborhood hypotheses, if , the covering map is explicitly ; the equivalence relation makes it well-defined. It commutes with endpoint projection, the induced quotient-group action and simplex lifting, so step 4.1 is natural for its coefficient maps. Steps 1.2 and 2.2 already prove naturality of the constant-coefficient identification, yielding the stated commutative homology comparison. All covering, chain and homology maps were explicit quotient maps or uniquely defined finite-lift maps, so the full coefficient and choice scope in the Statement is proved.
Used by
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Hatcher, Algebraic Topology (standard reference, not scraped)
- Cha, Amenable L2-theoretic methods and knot concordance (standard reference, not scraped)