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.
Every finite group has a finite presentation from its multiplication table
Statement
Every finite group has the finite multiplication-table presentation
Facts & Assumptions
Given: A finite group and a distinct formal symbol for each .
A map that sends every relator in to the identity extends uniquely to a homomorphism (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
If and are finite, then is finite (The product rule: , and ).
A presentation is finite when both and are finite (Relators and relations; finitely generated, finitely related, and finite presentations).
A set is finite when it is in bijection with a natural number; and if is finite and is a bijection, then is finite (The cardinality of a finite set).
A subset of a finite set is finite (A subset of a finite set is finite, with , and equality holds if and only if ).
Every nonempty subset of has a least element (The well-ordering principle).
In every relator of becomes the identity (Group presentation by generators and relations).
Proof
Let and . The map is a bijection, so [F2] makes finite. By [L2], is finite, so by [F2] fix a bijection for some , and let send to , so that is the image of . Sending each to the least element of the nonempty set , which exists by [F4], is an injection of into ; it is a bijection onto its image, that image is finite by [F3], and [F2] transports finiteness back, so is finite.
The assignment sends each relator to , so [L1] gives a homomorphism .
By [F5] every relator of is the identity in , so and hence ; therefore , , is a homomorphism.
The composite fixes every ; the composite fixes every generator class , and uniqueness in [L1] makes it the identity on . Thus and are inverse isomorphisms.
Both and are finite and , so [F1] shows that has the displayed finite presentation, including when is the one-element group.
Depends on
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
- The well-ordering principle
- Group presentation by generators and relations
- Relators and relations; finitely generated, finitely related, and finite presentations
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
- The cardinality $\lvert A\rvert$ of a finite set
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
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: 75 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
- Ashot Minasyan, MATH6138 Geometric Group Theory, §2.3 (standard reference, not scraped)