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 be the quarter-turn matrix and a reflection matrix. Let and , with matrix multiplication. For or , define with multiplication
Each pair acts on lattice sites by . The p4 lattice-symmetry group is , generated by integer translations and quarter-turns. The p4m lattice-symmetry group is , generated by integer translations, quarter-turns, and reflections. The point groups and have four and eight elements, respectively, but both full groups are infinite because they contain every integer translation.
Definition references
Facts & Assumptions
Given: The matrices , the sets , and the pair multiplication displayed in the Definition. Prove that these are groups acting on , and that the full groups are infinite.
Group and abelian group: A group operation is associative, has an identity, and every element has a two-sided inverse.
Left group actions, transitive actions, and faithful actions: A left action satisfies and for every and in the acted-on set.
Proof
The matrices satisfy , , and . The rotation matrices are , hence distinct; their products add exponents modulo , and . The four matrices are distinct, have determinant , and differ from the rotations, which have determinant . Thus has four elements and has eight. Writing elements of as with , the relation shows products stay in , and also lies in . Both matrix groups preserve because and are signed permutation matrices.
For either matrix group , the pair multiplication is closed on . It is associative because both parenthesizations of three factors equal . Its identity is . For every pair , the pair belongs to the same set by 1.1, and . Thus and satisfy the group axioms in [F1].
The identity pair acts identically because . The affine maps respect pair multiplication because , so and [F2] holds. The translations are distinct as ranges over , 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
- Taco S. Cohen and Max Welling, Group Equivariant Convolutional Networks (standard reference, not scraped)
- Ian Goodfellow, Yoshua Bengio, and Aaron Courville, Deep Learning (standard reference, not scraped)