Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-02 (claude-opus-5)
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.

The eight vertex permutations of a square form a non-abelian subgroup of Sym⁡({1,2,3,4}) of order 8, generated by a 4-cycle and one diagonal swap

Example

Let X={1,2,3,4} and regard its four elements as the vertices of a square read in cyclic order, so that the edges are the four pairs

E  =  { {1,2}, {2,3}, {3,4}, {4,1} }

and the two remaining pairs {1,3}, {2,4} are the diagonals. Call a permutation f of X a vertex symmetry of the square when, for all x≠y in X, {x,y}∈E if and only if {f(x),f(y)}∈E.

Put r=(1 2 3 4) and s=(1 3) in Sym⁡(X) (The symmetric group Sym⁡(X): the bijections of a set X under composition) and

D  =  { id, r, r2, r3, s, rs, r2s, r3s },

where juxtaposition is composition and powers are those of Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e. Then:

  1. r4=id, s2=id and sr=r−1s;
  2. D is a subgroup of Sym⁡(X) (Subgroup) whose eight listed elements are pairwise distinct, so ∣D∣=8 (The order ∣G∣ of a finite group and the order ord⁡(g) of an element, with ord⁡(g)=∞ when no positive power of g is the identity), and D=⟨{r,s}⟩ (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups);
  3. D is not abelian: rs≠sr;
  4. D is exactly the set of vertex symmetries of the square.

Facts & Assumptions

Given: X={1,2,3,4}; r the permutation sending 1↦2↦3↦4↦1; s the permutation exchanging 1 and 3 and fixing 2 and 4; E the four edge pairs listed above (The symmetric group Sym⁡(X): the bijections of a set X under composition).

[L2]

Sym⁡(X) is a group under composition with identity id (Sym⁡(X) is a group under composition, and it is non-abelian whenever X has at least three distinct elements, Group and abelian group); two permutations are equal exactly when they agree at every point (Injection, surjection, bijection).

Verification

technique · direct
1.1

Powers of r, computed pointwise: r2 sends 1↦3, 2↦4, 3↦1, 4↦2; r3 sends 1↦4, 2↦1, 3↦2, 4↦3; and r4 sends every point back to itself, so r4=id. None of r, r2, r3 is id, each moving 1. Hence ord⁡(r)=4 and r−1=r3.

L1L2L3L6given
1.2

s2=id, since s exchanges 1 and 3 and fixes 2 and 4, so applying it twice fixes every point; hence s−1=s and s≠id.

L2L3given
2.1

sr=r3s. Both sides are computed pointwise: s∘r sends 1↦r(1)=2↦s(2)=2, 2↦3↦1, 3↦4↦4, 4↦1↦3; while r3∘s sends 1↦s(1)=3↦r3(3)=2, 2↦2↦1, 3↦1↦4, 4↦4↦3. The two agree at every point. With step 1.1 this gives sr=r−1s, which with claim 1's other two equations completes claim 1.

step 1.1L2given
2.2

s∉{id,r,r2,r3}: s fixes 2, while r, r2 and r3 send 2 to 3, 4 and 1 respectively, and s≠id by step 1.2.

step 1.1step 1.2L1L2
3.1

By induction from step 2.1, srk=r−ks for every k∈Z: the case k=0 is trivial, and srk+1=(srk)r=r−ksr=r−kr−1s=r−(k+1)s, while applying s on both sides of srk=r−ks and using s2=id gives the statement for −k.

step 1.2step 2.1L3
3.2

The eight listed elements are pairwise distinct. The four powers r0,r1,r2,r3 are pairwise distinct because ord⁡(r)=4. If ris=rjs then ri=rj by cancelling s on the right, so i=j for i,j among 0,1,2,3. And ris=rj would give s=rj−i, contradicting step 2.2.

step 1.1step 2.2L4L6
4.1

D is closed under composition. A product of two listed elements has the form (risε)(rjsδ) with ε,δ∈{0,1}. If ε=0 it equals ri+jsδ; if ε=1 then, moving s past rj by step 3.1, it equals rir−js sδ=ri−js1+δ. In either case, reducing the exponent of r using r4=id and the exponent of s using s2=id gives one of the eight listed elements.

step 1.1step 1.2step 3.1L3
4.2

D is closed under inverses: (ri)−1=r−i, again one of the four powers after reduction; and (ris)−1=s−1(ri)−1=sr−i=ris by step 3.1 and s−1=s, so each of the four elements ris is its own inverse.

step 1.1step 1.2step 3.1L3
4.3

D is not abelian: sr=r3s by step 2.1, while rs=r1s; if these were equal then r3=r by cancelling s on the right, contradicting the distinctness of the powers of r. This is claim 3.

step 1.1step 2.1step 3.2L4
5.1

D is a subgroup: it contains id, is closed under composition by step 4.1 and under inverses by step 4.2, so xy−1∈D for x,y∈D and the one-step test applies. Its eight elements are distinct by step 3.2, so the map 8→D listing them is a bijection and ∣D∣=8.

step 3.2step 4.1step 4.2L5L6
6.1

D=⟨{r,s}⟩: D is a subgroup containing r and s, so ⟨{r,s}⟩⊆D; conversely any subgroup containing r and s contains every risε, hence contains D, so D⊆⟨{r,s}⟩. This with step 5.1 is claim 2.

step 5.1L5
7.1

Every element of D is a vertex symmetry. The map r carries the four edges {1,2},{2,3},{3,4},{4,1} to {2,3},{3,4},{4,1},{1,2}, so it maps E onto E; being a bijection of X, it therefore also carries each of the two non-edges {1,3}, {2,4} to a non-edge, and the "if and only if" holds. The map s carries those four edges to {3,2},{2,1},{1,4},{4,3}, again onto E, so the same applies. The vertex symmetries form a subgroup, since the defining condition is preserved by composition and, being an equivalence, by inverses; hence it contains ⟨{r,s}⟩=D.

step 6.1L2L5given
8.1

Conversely let f be a vertex symmetry. The neighbours of a point x, meaning the y with {x,y}∈E, are exactly r(x) and r3(x), and these two are distinct because r2(x)≠x by step 1.1. There is a unique i∈{0,1,2,3} with ri(1)=f(1), since those four values are 1,2,3,4; put f1=r−if, again a vertex symmetry, with f1(1)=1.

step 1.1step 5.1step 7.1L2given
9.1

Since {1,2}∈E, the pair {f1(1),f1(2)}={1,f1(2)} is an edge, so f1(2) is a neighbour of 1, that is f1(2)∈{2,4}. Since {2,3}∈E, the point f1(3) is a neighbour of f1(2), and it differs from f1(1)=1 because f1 is injective; the neighbours of 2 are 1 and 3 and the neighbours of 4 are 3 and 1, so in both cases f1(3)=3. Then f1(4) is the one element of X not already taken.

step 8.1L2given
10.1

So either f1 is 1↦1, 2↦2, 3↦3, 4↦4, that is f1=id and f=ri; or f1 is 1↦1, 2↦4, 3↦3, 4↦2. In the second case f1=r2s, since r2∘s sends 1↦s(1)=3↦r2(3)=1, 2↦2↦4, 3↦1↦3 and 4↦4↦2; hence f=rir2s=ri+2s∈D.

step 1.1step 9.1L2L3
11.1

By steps 7.1, 9.1 and 10.1 the vertex symmetries of the square are exactly the elements of D, which is claim 4; claims 1, 2 and 3 are steps 2.1, 6.1 and 4.3.

step 2.1step 6.1step 4.3step 7.1step 9.1step 10.1∎

Remarks

  • The square is a combinatorial object here, not a geometric one. The identification of these eight permutations with the rigid motions of a square in the Euclidean plane is not available at this point in the reading order: R2 with its metric comes much later. What is used instead is the edge relation E, and claim 4 says the group is exactly the symmetry group of that relation, which is what "vertex permutations of a square" means here.

  • Every element is a rotation or a reflection, in the sense that D splits as the four powers of r and the four elements ris; step 4.2 shows each of the latter is its own inverse, matching the geometric picture in which a reflection applied twice is the identity.

  • The relation sr=r−1s of claim 1 is the whole reason D is closed: it is what lets any word in r and s be pushed into the normal form risε, which is step 4.1. Without it the eight elements would not obviously be all of ⟨{r,s}⟩.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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