Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

Tensor products are unique up to a unique isomorphism carrying elementary tensors to elementary tensors

Statement

Let T,T be abelian groups equipped with balanced maps τ:M×NT and τ:M×NT, and suppose that each pair has the universal property of Universal property of the tensor product for balanced maps into abelian groups. Then there is a unique group isomorphism u:TT such that uτ=τ. Its inverse is the unique map v:TT with vτ=τ.

Facts & Assumptions

Given: Two representing pairs (T,τ) and (T,τ) for balanced maps out of M×N.

[L1]

For any balanced map from M×N into an abelian group, a representing pair supplies a unique group homomorphism through which that map factors (Universal property of the tensor product for balanced maps into abelian groups).

Proof

technique · direct
1.1

Apply [L1] for (T,τ) to the balanced map τ and for (T,τ) to τ; this gives unique homomorphisms u:TT and v:TT with uτ=τ and vτ=τ.

givenL1
2.1

Both vu and idT compose with τ to give τ, so uniqueness in [L1] gives vu=idT; similarly uv=idT.

step 1.1L1
3.1

Thus u is an isomorphism with inverse v, and the same uniqueness clause shows that no other isomorphism carrying τ to τ exists.

step 2.1L1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 18 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources