Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Detecting injectivity by rationalization

PDF p. 14: Rationalization square for epsilon3

Statement

For an abelian group G, the kernel of the natural homomorphism G→G⊗ZQ, g↦g⊗1, is its torsion subgroup: the elements killed by some nonzero integer. Rationalization preserves short exact sequences of abelian groups. Consequently, if G is torsion-free and f⊗ZQ:G⊗ZQ→H⊗ZQ is injective, then a homomorphism f:G→H is injective. If f is also surjective, it is an isomorphism. No divisibility assumption on G is made.

Facts & Assumptions

Given: Abelian groups, regarded as Z-modules, and the homomorphisms in the statement.

Goal: Prove the kernel formula and exactness of rationalization, and deduce the injectivity and isomorphism assertions.

[F1]

The tensor product is generated by elementary tensors subject to additivity in each variable and the balancing relation (ng)⊗q=g⊗(nq); every tensor is a finite sum of elementary tensors (The tensor product M⊗_R N from the additive group underlying the free ℤ-module on M× N, elementary tensors, and finite tensor sums).

[F2]

Torsion means annihilation by a nonzero integer, and a group is torsion-free when only zero is torsion (Annihilators, torsion elements and the torsion subset of a module). A short exact sequence 0→A→iB→pC→0 has i injective, p surjective and im⁡i=ker⁡p (Exact sequences and short exact sequences of modules).

Proof

1.1F1constructalgebra

For an abelian group M, form fractions m/n with m∈M and positive integer n, declaring m/n=m′/n′ exactly when some positive integer k kills n′m−nm′. This is an equivalence relation: transitivity follows by multiplying the two annihilating equations by the other denominator and combining them. Addition (m/n)+(m′/n′)=(n′m+nm′)/(nn′) is independent of representatives by the same cross-multiplication, and gives an abelian group L(M). For q=a/b∈Q, with b>0, the assignment (m,q)↦am/b is well-defined and balanced: equality of rational representatives gives an equal cross-product, and the fraction addition formula proves additivity. Thus [F1] gives a homomorphism M⊗Q→L(M). Conversely send m/n to m⊗(1/n). If k(n′m−nm′)=0, then balancing gives m⊗(1/n)−m′⊗(1/n′)=k(n′m−nm′)⊗(1/(knn′))=0, so this map is well-defined and additive. The two maps are inverse on fractions and elementary tensors, hence are inverse isomorphisms. Under this identification the natural map sends m to m/1.

2.1F2step 1.1

By the fraction equivalence, m/1=0/1 exactly when some positive integer kills m. This is equivalent to being killed by a nonzero integer, so the kernel is precisely the torsion subgroup.

2.2F2step 1.1algebra

Let 0→A→iB→pC→0 be short exact. The fraction maps induced by i and p are well-defined by the defining equivalence. If i(a)/n=0, then i(ka)=0 for some positive k, so ka=0 by injectivity of i and a/n=0. Thus L(i) is injective. Every c/n has a preimage b/n because p is surjective. If p(b)/n=0, then p(kb)=0 for some positive k; exactness gives a∈A with i(a)=kb, and b/n=i(a)/(kn) lies in the image of L(i). The reverse inclusion follows from pi=0. Hence the fraction sequence is short exact. The isomorphisms of step 1.1 commute with the induced homomorphisms, so tensoring the original sequence with Q is short exact.

3.1F1F2step 2.1∎

If (f⊗Q) is injective and f(g)=0, naturality gives (f⊗Q)(g⊗1)=0, so g⊗1=0. If G is torsion-free, steps 2.1 and [F2] give g=0; therefore f is injective. If it is also surjective, its set-theoretic inverse is a homomorphism, since the preimages of sums are sums of preimages, and f is an isomorphism.

Depends on

Used by · 2

Dependency tree · 3 levels

Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.