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.
Example
Adjoining a single commutator relator to the free group on two generators presents the direct product of two copies of the additive integers:
where and correspond to and .
Facts & Assumptions
Given: The presentation .
A map of generators that sends every relator to the identity extends uniquely to a homomorphism from the presented group (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
is a commutative ring (The integers form a commutative ring).
Integer powers satisfy ; powers of commuting elements satisfy (Exponent laws in a group: and for all , and when and commute).
Verification
Sending to and to kills the commutator in the abelian direct product, so [L1] constructs a homomorphism .
The relator gives , so group algebra and [L3] move all powers of before all powers of and write every element of as for integers .
The map sends to by [L2], so it is surjective and step 1.2 shows that its kernel is trivial: an element mapping to has the form .
Therefore is the claimed isomorphism .
Depends on
- Group presentation by generators and relations
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
- The integers form a commutative ring
- $G\times H$ is a group with identity $(e_G,e_H)$, coordinatewise inverses, and homomorphic coordinate projections
- Exponent laws in a group: $g^{m+n} = g^{m}g^{n}$ and $(g^{m})^{n} = g^{mn}$ for all $m, n \in \mathbb{Z}$, and $(gh)^{n} = g^{n}h^{n}$ **when $g$ and $h$ commute**
- The principle of mathematical induction
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: 74 results over 22 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
- Nicholas Touikan, An Introduction to Combinatorial and Geometric Group Theory, Exercises §1.6 (standard reference, not scraped)
- John McKernan, Presentations and Groups of Small Order, Lecture 12 (standard reference, not scraped)