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.
for the dihedral group ,
Example
Let and let be the permutations and . The dihedral group is the generated subgroup
Then has exactly elements and
where corresponds to and to . Reading as the vertices of a regular -gon in cyclic order, is the rotation by one vertex and the reflection fixing . That reading motivates the name and is not used below: every step argues about permutations of . At the map is the identity, so the construction degenerates and ; the Klein four-group is treated separately.
Facts & Assumptions
Given: A natural number , the set , the permutations and , and .
The set has elements, represented uniquely by (For , every class in has one representative with , so ; while is in bijection with ).
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).
Two disjoint finite sets have union of cardinality equal to the sum of their cardinalities (The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition).
The subgroup generated by is the smallest subgroup containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Verification
Direct substitution on gives , , and because ; thus the displayed relators hold.
In , the relators give , , , and ; moving every to the right and reducing exponents therefore writes every element as with and .
The permutations are distinct by their values , and the permutations are likewise distinct; the two families are disjoint because equality would first force the same from the value at and then force in from the value at , impossible for . Step 1.1 gives the same relations among and , so the set is closed under products and inverses and contains and ; being a subgroup containing , it equals by the minimality in [F1]. Hence [L1] and [L3] give exactly elements of .
By [L2], construct a homomorphism from the displayed presentation to , sending to and to ; its image is a subgroup containing and , so [F1] makes it all of and the homomorphism surjective.
Step 1.2 gives at most the same normal forms in , and step 2.1 shows that their images under the surjection of step 2.2 are all distinct; therefore that homomorphism is bijective and hence an isomorphism.
The target is the subgroup of specified in the Example, which step 2.1 shows has order ; so the displayed isomorphism holds with the stated conventions and boundary .
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 symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
- $\operatorname{Sym}(X)$ is a group under composition, and it is non-abelian whenever $X$ has at least three distinct elements
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- The sum rule: a finite disjoint union is finite with $\lvert A \cup B\rvert = \lvert A\rvert + \lvert B\rvert$ and $\lvert\bigcup_{i \in I} A_i\rvert = \sum_{i \in I}\lvert A_i\rvert$, and a sum over a finite index set splits along a partition
- 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: 110 results over 24 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.2 (standard reference, not scraped)
- J. Aspnes, Group Theory (standard reference, not scraped)