Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

Dnr,srn, s2, srs1r for the dihedral group Dn={ρ,σ}Sym(Z/n), n3

Example

Let n3 and let ρ,σSym(Z/n) be the permutations ρ(k)=k+1 and σ(k)=k. The dihedral group is the generated subgroup

Dn:={ρ,σ}Sym(Z/n).

Then Dn has exactly 2n elements and

Dnr,srn, s2, srs1r,

where r corresponds to ρ and s to σ. Reading Z/n as the vertices of a regular n-gon in cyclic order, ρ is the rotation by one vertex and σ the reflection fixing 0. That reading motivates the name and is not used below: every step argues about permutations of Z/n. At n=2 the map σ is the identity, so the construction degenerates and D2=2; the Klein four-group is treated separately.

Facts & Assumptions

Given: A natural number n3, the set Z/n, the permutations ρ(k)=k+1 and σ(k)=k, and Dn={ρ,σ}Sym(Z/n).

[L2]

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).

[F1]

The subgroup S generated by S is the smallest subgroup containing S (The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups).

Verification

technique · constructive
1.1

Direct substitution on Z/n gives ρn=id, σ2=id, and σρσ1ρ=id because σρσ(k)=k1; thus the displayed relators hold.

givenconstruct
1.2

In P, the relators give s1=s, sr=r1s, rn=e, and s2=e; moving every s to the right and reducing exponents therefore writes every element as risε with 0i<n and ε{0,1}.

given
2.1

The permutations ρi are distinct by their values ρi(0)=i, and the permutations ρiσ are likewise distinct; the two families are disjoint because equality would first force the same i from the value at 0 and then force i+1=i1 in Z/n from the value at 1, impossible for n3. Step 1.1 gives the same relations among ρ and σ, so the set {ρiσε:0i<n, ε{0,1}} is closed under products and inverses and contains ρ and σ; being a subgroup containing {ρ,σ}, it equals Dn by the minimality in [F1]. Hence [L1] and [L3] give exactly 2n elements of Dn.

F1L1L3step 1.1given
2.2

By [L2], construct a homomorphism from the displayed presentation P to Dn, sending r to ρ and s to σ; its image is a subgroup containing ρ and σ, so [F1] makes it all of Dn and the homomorphism surjective.

F1L2step 1.1construct
3.1

Step 1.2 gives at most the same 2n normal forms in P, 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.

step 1.2step 2.1step 2.2
4.1

The target is the subgroup Dn={ρ,σ} of Sym(Z/n) specified in the Example, which step 2.1 shows has order 2n; so the displayed isomorphism holds with the stated conventions and boundary n3.

step 2.1step 3.1discharge-construct

Depends on

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