Alphabeta Math
False statementConstruction: Literature-sourcedVerification: 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.

Vanishing Tor one does not require a projective factor

Statement

False claim: Tor⁡1R(N,M)=0 can occur only when N or M is projective.

Under AC, a counterinstance for the usual balanced Tor is R=Z, N=Q and M=Z/2Z. Their nonprojectivity and the zero-homology calculation using the displayed finite resolution of M below are separately choice-free.

Refutation

Given: R=Z, N=Q, and M=Z/2Z; AC only for the general balanced-Tor interface.

1.1given

The module Q is nonprojective by the explicitly choice-free counterinstance in Flat modules need not have projective dimension zero. The module Z/2Z is nonprojective by the choice-free nonflatness clause of The integers have weak and global dimension one, with n=2. Neither use imports the AC dimension assertion.

1.2givenalgebra

The exact sequence 0→Z→×2Z→Z/2Z→0 is a projective resolution P∙ of M: its terms are rank-one free and hence projective without AC by the finite-basis clause of Free modules are projective, with the exact choice boundary.

2.1step 1.2algebra

By The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums, Q⊗Z≅Q via q⊗a↦aq, with inverse q↦q⊗1. Thus Q⊗P∙ is 0→Q→×2Q→0 in degrees one and zero. Its degree-one homology is the kernel of multiplication by 2, which is zero. This proves the choice-free specified left-resolution calculation of Tor from a projective resolution of the left module.

3.1step 1.1step 1.2step 2.1givenalgebra∎

Under The Axiom of Choice, Higher Tor over the integers vanishes supplies a projective resolution of Q, while step 1.2 supplies one of M. To obtain DC locally, given an entire relation E on a nonempty set X and x0∈X, AC chooses s(x)∈{y:xEy} for every x∈X; The recursion theorem then gives xn+1=s(xn) from the prescribed x0. This proves the exact DC hypothesis of The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain. Hence The balanced Tor bifunctor identifies the calculated zero group with Tor⁡1Z(Q,Z/2Z). Together with step 1.1 this refutes the proposed implication.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

45 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