Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 p4 and p4m square-lattice symmetry groups

Definition

Let ρ=(0−110) be the quarter-turn matrix and σ=(100−1) a reflection matrix. Let C4={ρj:j=0,1,2,3} and D4={ρj,ρjσ:j=0,1,2,3}, with matrix multiplication. For A=C4 or D4, define PA=Z2×A with multiplication

(t,M)(s,N)=(t+Ms,MN).

Each pair (t,M) acts on lattice sites by x↦Mx+t. The p4 lattice-symmetry group is PC4, generated by integer translations and quarter-turns. The p4m lattice-symmetry group is PD4, generated by integer translations, quarter-turns, and reflections. The point groups C4 and D4 have four and eight elements, respectively, but both full groups are infinite because they contain every integer translation.

Facts & Assumptions

Given: The matrices ρ,σ, the sets C4,D4, and the pair multiplication displayed in the Definition. Prove that these are groups acting on Z2, and that the full groups are infinite.

[F1]

Group and abelian group: A group operation is associative, has an identity, and every element has a two-sided inverse.

[F2]

Left group actions, transitive actions, and faithful actions: A left action satisfies e⋅x=x and (gh)⋅x=g⋅(h⋅x) for every g,h∈G and x in the acted-on set.

Proof

1.1givenF1algebra

The matrices satisfy ρ4=I, σ2=I, and σρσ=ρ−1. The rotation matrices are I,ρ,−I,−ρ, hence distinct; their products add exponents modulo 4, and (ρj)−1=ρ−j. The four matrices σ,ρσ,−σ,−ρσ are distinct, have determinant −1, and differ from the rotations, which have determinant 1. Thus C4 has four elements and D4 has eight. Writing elements of D4 as ρjσϵ with ϵ∈{0,1}, the relation σρj=ρ−jσ shows products stay in D4, and (ρjσϵ)−1=ρ−(−1)ϵjσϵ also lies in D4. Both matrix groups preserve Z2 because ρ and σ are signed permutation matrices.

2.1givenF1step 1.1algebra

For either matrix group A, the pair multiplication is closed on Z2×A. It is associative because both parenthesizations of three factors (t,M),(s,N),(r,Q) equal (t+Ms+MNr,MNQ). Its identity is (0,I). For every pair (t,M), the pair (−M−1t,M−1) belongs to the same set by 1.1, and (t,M)(−M−1t,M−1)=(0,I)=(−M−1t,M−1)(t,M). Thus PC4 and PD4 satisfy the group axioms in [F1].

3.1givenF2step 2.1algebra∎

The identity pair acts identically because (0,I)⋅x=x. The affine maps respect pair multiplication because M(Nx+s)+t=MNx+Ms+t, so ((t,M)(s,N))⋅x=(t,M)⋅((s,N)⋅x) and [F2] holds. The translations (t,I) are distinct as t ranges over Z2, so each full group is infinite.

Depends on

Used by

Dependency tree · two levels

13 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