Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)verified 2026-09-09 (gpt-6-astra)
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.

Torsion-free abelian groups are flat

Statement

Every torsion-free abelian group is a flat Z-module.

Proof

Given: a torsion-free abelian group M.

1.1givenalgebra

First every subgroup K≤Zr is finite free, by induction on the finite integer r. The case r=0 is immediate. Project K to the last coordinate. If its image is zero, apply induction in Zr−1. Otherwise let d be the least positive integer in the image, using The well-ordering principle. Division with remainder by d, from Division with remainder in Z: for a∈Z and b>0 there are unique q,r∈Z with a=qb+r and 0≤r<b, shows that every image element is a multiple of d: its remainder also lies in the image and cannot be positive and smaller than d. Choose one u∈K with last coordinate d. Subtracting integer multiples of u gives K=Zu⊕ker⁡(π∣K), and the kernel is a subgroup of Zr−1, so induction completes the proof. These are finitely many existential choices, not a choice function on an infinite family.

1.2givenalgebra

Let f:A→B be injective and z=∑i=1tai⊗mi∈A⊗M have zero image in B⊗M. By The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums, this equality to zero has a finite witness: the formal sum ∑ie(f(ai),mi) is a finite integer linear combination of defining additivity and balancing relations in the free abelian group on B×M.

2.1givenstep 1.1algebra

For any subgroup H≤M generated by a finite list x1,…,xv, argue as follows. Choose a maximal integer-linearly-independent sublist b1,…,br; there are only finitely many sublists. For each xi, maximality supplies an equation dixi=∑jaijbj with di a positive integer: if xi is not already on the sublist, a dependence among it and the bj has nonzero coefficient at xi, since the bj are independent. For a member of the sublist use di=1. The finitely many equations give dH⊆G=∑jZbj for d=∏idi>0, with empty product 1. Multiplication by d is injective on the torsion-free H, and G≅Zr. Thus H≅dH is finite free by step 1.1. This also covers H=0 and r=0.

3.1step 2.1algebra

For one finite basis h1,…,hs of H and any abelian group T, the relations of The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums identify T⊗H with Ts: a⊗∑jnjhj↦(nja)j, with inverse (aj)↦∑jaj⊗hj. The composites are identities on elementary tensors and tuples. Therefore tensoring an injection with H is the corresponding coordinatewise injection. No simultaneous choice of bases for all finitely generated subgroups is made.

4.1step 3.1step 1.2algebra

Let H be generated by all the elements of M appearing in the original sum and in this finite witness. Every relation in the witness is then a valid relation in the tensor presentation for B⊗H. Consequently the same sum zH∈A⊗H maps to zero in B⊗H. Step 3.1 implies zH=0, so its image z in A⊗M is zero.

5.1step 4.1algebra∎

Thus −⊗M preserves injections. It is right exact by Tensoring is right exact, whose commutative-ring hypothesis holds for Z. It therefore preserves every short exact sequence and is exact, so M is flat by Left and right flat modules over an arbitrary ring. The finite-rank and finite-witness arguments require no choice axiom.

Depends on

Used by

Dependency tree · two levels

33 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