Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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 F has basis (ex)x∈X, a lift of a map F→M through a surjection E→M is obtained by choosing one preimage of each basis value. For finite X, finite choice suffices and no form of AC is needed; for X=∅, the lift is the unique map from 0.

Facts & Assumptions

Given: A free module F=R(X), a surjection q:E→M, and a homomorphism f:F→M.

[F1]

Projectivity is the existence of a lift through every surjective homomorphism (Projective modules and the lifting property).

[L1]

A function from the basis set X to a module extends uniquely to a homomorphism from R(X) (Universal property of the free module on a set).

[F2]

AC supplies a choice function for every family of nonempty sets (The Axiom of Choice).

[L2]

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

technique · constructive
1.1

For each x∈X, the fiber q−1(f(ex)) is nonempty because q is surjective.

given
2.1

Under AC, [F2] chooses yx∈q−1(f(ex)) for every x∈X. If X is finite with a given finite enumeration, [L2] makes this choice in ZF; if X=∅, there are no choices.

step 1.1F2L2choose
3.1

By [L1], the assignment ex↦yx extends uniquely to a homomorphism f~:F→E.

step 2.1L1construct
4.1

Both q∘f~ and f send each ex to f(ex), so uniqueness in [L1] gives q∘f~=f.

step 3.1L1
5.1

Thus F satisfies the lifting property [F1] and is projective. The construction records exactly where arbitrary or finite choice enters.

step 1.1step 2.1step 3.1step 4.1F1discharge-construct∎

Depends on

Used by

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