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

False: tensoring preserves injections

Statement

False claim: tensoring an injective module homomorphism with a fixed module always gives an injective homomorphism.

The injection Z→⋅2Z becomes the zero map after tensoring with Z/2 over Z.

Facts & Assumptions

Given: The regular Z-module and the quotient module Z/2.

[L1]

Z is a commutative ring (The integers form a commutative ring), and multiplication by a nonzero integer can be cancelled (The integers have no zero divisors; multiplicative cancellation).

[L3]

The tensor-unit isomorphism Z⊗ZN≅N sends a⊗n to an (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[L4]

Tensor products preserve right-exact sequences, but this statement does not assert preservation of injections (Tensoring is right exact).

Refutation

technique · direct
1.1givenL1

The map u:Z→Z, u(a)=2a, is injective: if 2a=2b, cancellation in [L1] gives a=b.

1.2givenL2L3

Under the unit identifications [L3], the map u⊗1Z/2 is multiplication by 2 on Z/2, hence is zero by [L2].

2.1step 1.1step 1.2L2L4∎

The zero map on Z/2 is not injective because 1‾≠0‾ by [L2]. Thus step 1.1 is an injection whose tensor map is not injective, refuting the claim. This is consistent with [L4], which guarantees right exactness only.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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