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.
Tor symmetry over a commutative ring
Example
Assume AC (The Axiom of Choice). Over , . The first isomorphism is the natural balanced-Tor symmetry. The fixed-resolution kernel calculations and tensor swap are choice-free; AC supplies the DC used for resolution-independent comparison.
Verification
Given: the commutative ring , modules and , and AC.
[L1] The explicit multiplication-by- and multiplication-by- resolutions and the cyclic kernel calculation are supplied by Tor one of a cyclic abelian group detects n-torsion; under AC, Tor one of two cyclic abelian groups is cyclic of gcd order identifies both balanced groups with the cyclic group of gcd order.
[L2] With supplied resolutions and DC, Tor has the natural tensor-factor symmetry (Tor is symmetric over a commutative ring, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
AC implies the DC required by [L2]: for an entire relation on a nonempty set, choose one successor at each point using AC and iterate that self-map from the prescribed start using The recursion theorem. This gives the required dependent-choice sequence. The two cyclic modules have the explicit resolutions in [L1], so no unspecified resolution-existence theorem is used.
By [L1], the first Tor group is the kernel of multiplication by on , namely , and the reversed group is the kernel of multiplication by on , namely . Each is cyclic of order two, in agreement with .
Apply [L2] under step 1.1. Its termwise tensor swap and coherent comparison give an isomorphism between the two groups in step 2.1. An isomorphism between groups of order two must send the unique nonzero element to the unique nonzero element. Thus under the explicit kernel identifications it sends to , so the concrete calculation agrees with the natural symmetry, not merely with equality of the two gcds.
Depends on
- Tor is symmetric over a commutative ring
- Tor one of two cyclic abelian groups is cyclic of gcd order
- Tor one of a cyclic abelian group detects n-torsion
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The recursion theorem
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 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
- Charles A. Weibel, An Introduction to Homological Algebra (standard reference, not scraped)