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.
Free modules are projective, with the exact choice boundary
Statement
Assume the Axiom of Choice. Every free module is projective. More precisely, if has basis , a lift of a map through a surjection is obtained by choosing one preimage of each basis value. For finite , finite choice suffices and no form of AC is needed; for , the lift is the unique map from .
Facts & Assumptions
Given: A free module , a surjection , and a homomorphism .
Projectivity is the existence of a lift through every surjective homomorphism (Projective modules and the lifting property).
A function from the basis set to a module extends uniquely to a homomorphism from (Universal property of the free module on a set).
AC supplies a choice function for every family of nonempty sets (The Axiom of Choice).
A natural-number-indexed finite family of nonempty sets has a choice function in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
Proof
For each , the fiber is nonempty because is surjective.
Under AC, [F2] chooses for every . If is finite with a given finite enumeration, [L2] makes this choice in ZF; if , there are no choices.
By [L1], the assignment extends uniquely to a homomorphism .
Both and send each to , so uniqueness in [L1] gives .
Thus satisfies the lifting property [F1] and is projective. The construction records exactly where arbitrary or finite choice enters.
Depends on
Used by
- Field Kunneth isomorphism for homology of products Corollary
- Under the Axiom of Choice, every module admits a projective resolution Corollary
- Under the stated choice boundary, free modules are projective and hence flat Corollary
- A projective resolution of a cyclic abelian group Example
- An Ext dimension shift Example
- Homology of a product of spheres by Kunneth Example
- The idempotent completion of the matrix category gives the finitely generated projective modules Example
- Tor term in the homology of a product of real projective spaces Example
- Weak and global dimension for a field and the integers Example
- ℤ/2ℤ is projective but not free over ℤ/6ℤ Example
- Every projective module is free False statement
- FALSE: objectwise projective-resolution choices uniquely determine a resolution functor False statement
- FALSE: the Yoneda product is graded commutative for every abelian category False statement
- Vanishing Tor one does not require a projective factor False statement
- A free PID complex decomposes into two-term cycle-boundary pieces Lemma
- Ext one of Z modulo n by Z is Z modulo n Lemma
- Relative cohomological Kunneth under finite free homology hypotheses Lemma
- Singular UCT extension from cycle projections Lemma
- The cohomological universal-coefficient extension map Lemma
- The cycle-boundary tensor sequence has the Kunneth kernel and cokernel Lemma
- The Kunneth Tor map Lemma
- The iterated free-module resolution is canonical in ZF Proposition
- Cohomological Kunneth isomorphism under finite free hypotheses Theorem
- Direct sums of projectives are projective, and module categories have enough projectives Theorem
- Equivalent characterizations of projective modules Theorem
- Higher Tor over the integers vanishes Theorem
- The cohomology universal-coefficient sequence splits nonnaturally Theorem
- The integers have global dimension one Theorem
- The Kunneth sequence splits nonnaturally Theorem
- The universal coefficient theorem for cohomology over a PID Theorem
Dependency tree · two levels
12 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
- A. Kleshchev, Lectures on Abstract Algebra for Graduate Students, sections 3.6, 3.14, and 3.15 (standard reference, not scraped)
- The Stacks Project, Algebra (standard reference, not scraped)
- P. Hekmati, Homological Algebra, section 3.1 (standard reference, not scraped)