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.
Hurewicz calculation for a wedge of simply connected spheres
Example
Assume the Axiom of Choice. Let , let be a nonempty finite set, and let be the CW wedge of oriented based spheres with common vertex . Then is -connected and with basis the classes of the inclusions . Under Hurewicz, this basis is carried to the corresponding sphere orientation classes in .
Facts & Assumptions
Absolute Hurewicz theorem at the first nonzero degree supplies the first nonzero-degree isomorphism for an -connected CW complex, assuming AC when .
The first potentially nonzero homotopy group of a wedge of higher spheres has its cell basis constructs the CW wedge, its inclusions and collapsing projections , proves path connectedness and lower homotopy vanishing, and gives the finite-support integer group model. Only these structural and connectivity clauses are needed for the Hurewicz calculation below.
Integral homology of a wedge of higher spheres has its cell basis proves that form an integral homology basis, with coordinate inverse given by . Its proof derives the finite splitting from the pair sequence and the actual CW quotient comparison.
Absolute and relative Hurewicz homomorphisms gives the formula , its additivity and its naturality with the supplied orientations.
The Axiom of Choice is assumed through [F1], whose proof uses arbitrary-cell approximation and selection of compression disks for its relative model equivalence. No additional choice is made for the finite wedge or its supplied sphere orientations.
Verification
Given: The nonempty finite indexing set , integer , and based oriented spheres as above. Coefficients throughout are integers.
By [F2], has a CW structure with one vertex and one -cell for each , each attached by its constant boundary. It is path connected, and for . Thus is -connected and meets [F1]'s CW and nonemptiness hypotheses. In particular gives simple connectivity, rather than assuming it from an unstated wedge principle. By [A1] and [F1], is an isomorphism.
Formula [F4] gives Since is a homomorphism, it follows for every integer vector that The sum on the left is well defined: is an injective homomorphism into the abelian homology group, so its source is abelian (the image of each commutator is zero, hence the commutator itself is the identity). Finite sums are therefore independent of the order, and negative coefficients mean inverse classes.
For define by These integers are unique by [F3], and they form a vector in the finite direct sum because is finite. Let . The two composites are identities: step 2.1 and the coordinate inverse of [F3] give ; conversely [F3] expresses , and injectivity of gives . Both maps are homomorphisms by [F3], [F4] and finite additivity. This proves the stated isomorphism with precisely the inclusion basis, not just an abstract equality of ranks.
A singleton recovers one sphere and its identity generator. The zero vector corresponds to the constant class; negative vectors correspond to inverse classes by step 2.1. Empty is excluded in the stated example, although [F2] and [F3] consistently assign it a point and a zero positive group. The restriction is required for [F1]'s higher Hurewicz isomorphism; no free-abelian claim for a wedge of circles is being made. The AC cost of this derivation is exactly [A1]; choosing an ordering of every finite set or a family of orientation representatives was not used. The claimed connectivity and both inverse formulas are now proved.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 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
- May Hurewicz wedge lemma, Chapter 15 §1 (standard reference, not scraped)