Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Under the stated choice boundary, free modules are projective and hence flat

Statement

Let R be a commutative ring and let F be a free R-module with basis indexed by X.

  1. Assuming the Axiom of Choice, F is projective and therefore flat.
  2. If X is finite, only finite choice is needed for projectivity; if X=∅, no choice is needed.
  3. Regardless of choice, F is flat, because tensoring with F is a direct sum of copies of the identity tensor functor.

Facts & Assumptions

Given: A commutative ring R and a free R-module F with basis indexed by X.

[L1]

Under AC every free module is projective; a finite basis requires only finite choice, and an empty basis requires none (Free modules are projective, with the exact choice boundary).

[L2]

Every projective module over a commutative ring is flat without choice (Every projective module over a commutative ring is flat).

[L3]

Tensor products commute with arbitrary direct sums in either variable; in particular A⊗R⨁x∈XR≅⨁x∈X(A⊗RR) (Tensor products commute with arbitrary direct sums).

Proof

technique · direct
1.1givenL1L2

Under AC, [L1] makes F projective and [L2] then makes it flat. The refined finite and empty-basis choice bounds are exactly those stated in [L1].

1.2L3L4algebra

Independently of AC, write F=⨁x∈XR. By [L3] and [L4], tensoring an exact sequence with F gives the direct sum, over X, of the original exact sequence; kernels and images are computed coordinatewise, so the result remains exact. Thus F is flat without any choice principle.

2.1step 1.1step 1.2∎

Step 1.1 establishes the projective route with its precise choice boundary, while step 1.2 establishes flatness unconditionally; the two routes are logically distinct.

Depends on

Used by

Dependency tree · two levels

17 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