Alphabeta Math
CorollaryStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

Every faithfully flat ring map is injective

Statement

Assume the Axiom of Choice.

Every faithfully flat homomorphism of commutative rings is injective.

Facts & Assumptions

Given: The Axiom of Choice and a faithfully flat homomorphism f:R→S.

[L1]

Faithful flatness of the ring map means that S is a faithfully flat R-module, hence in particular a flat R-module (Flat and faithfully flat modules and ring homomorphisms).

[L2]

For a faithfully flat module T, a nonzero module cannot tensor to zero: if N⊗RT=0, then N=0 (For a flat module, faithful flatness is equivalent to detecting nonzero modules and residue fields).

Proof

technique · direct
1.1L1given

Let K=ker⁡f. Since S is flat over R by [L1], tensoring the exact sequence 0→K→R→fS with S remains exact: 0→K⊗RS→R⊗RS→S⊗RS.

2.1step 1.1algebra

Under the canonical identification R⊗RS≅S, the middle map in step 1.1 is s↦1⊗s. Multiplication μ:S⊗RS→S, μ(s⊗t)=st, is a left inverse to this map, so the middle map is injective. Therefore K⊗RS=0.

3.1L1L2step 2.1

Because S is faithfully flat over R by [L1], [L2] applied to N=K shows that K=0.

4.1algebra∎

Hence f is injective.

Depends on

Used by

Dependency tree · two levels

6 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