Crystallographic orbit 2026-11-05
A crystallographic orbit is the set of points generated from one point by all operations of a specified space group :
Because the space group includes lattice translations, the full orbit is infinite. The familiar finite list of equivalent fractional positions lists representatives within one conventional unit cell.[ref]
For an original example in , take . Inversion gives , represented in the same cell as . Lattice translations repeat both sites throughout space. At the origin, inversion produces no additional site, so there is only one representative per primitive cell. The smaller crystallographic site multiplicity comes from the larger site-symmetry group.
If , their site-symmetry groups obey
Indeed, an operation fixing becomes an operation fixing after conjugation. This connects spatial equivalence to conjugate subgroups.
Several distinct crystallographic orbits can belong to the same Wyckoff position. For example, replacing the generic coordinates above by usually produces a different pair, while both pairs have trivial site-symmetry groups. A Wyckoff position classifies the conjugacy type; an orbit supplies one particular symmetry-generated set of positions.[ref]
Fano plane duality group Created 2026-10-14 Updated 2026-11-05
The Fano plane duality group includes both incidence-preserving permutations of points and projective lines and the dualities that exchange those two types. Its type-preserving subgroup is , of order . A polarity supplies the inverse-transpose automorphism , giving the semidirect product
There are unordered incident point-line pairs and unordered nonincident point-line pairs. The two transitive actions therefore have stabilizers of orders and , respectively. These are dihedral groups. The normalizer of a Sylow subgroup of order seven has order42 and is .
Every maximal proper subgroup is a conjugate subgroup of one of these three types or of the index-two collineation subgroup. The extension is also isomorphic to , identifying the geometric stabilizers with the standard finite-group classification.[ref]
A group action is a map from to satisfying and . Define the orbit of a group action and the stabilizer subgroup . The latter is a subgroup: the identity fixes , products of elements fixing fix , and inverses do too.
For finite , the orbit-stabilizer theorem states
To prove it, send a left coset to . If , then and . Conversely, equality of the two images implies , hence equality of the cosets. Every point of the orbit of a group action has such a preimage. This is therefore a bijection, and each coset has elements, proving the formula.
For the action on subgroups, conjugation maps a subgroup to a subgroup because it preserves products and inverses. Furthermore and
Thus this is the conjugation action. The stabilizer subgroup of is its normalizer , and since each conjugates onto itself. Hence the number of distinct conjugate subgroups is
Now suppose is proper. Put and list the distinct conjugate subgroups as . Each has elements and all contain the same identity. Counting the identity just once, even if other elements overlap, gives
Thus some element of lies in no conjugate of . This proves conjugates of a proper subgroup do not cover a finite group by an explicit count; it does not require the conjugates to intersect only at the identity.
Write the cardinality of the finite group as , where is prime and . The Sylow theorems say that a Sylow subgroup of order exists; every p-group is contained in a Sylow subgroup; and all Sylow subgroups are conjugate subgroups. If is their number, then
Equivalently, for a Sylow subgroup , conjugation and the orbit-stabilizer theorem give , where is the normalizer. The containment statement is often included in the conjugacy form: every p-group lies in a conjugate of any fixed Sylow subgroup.
Every finite cyclic subgroup of order has exactly generators, where is the Euler totient function: if has order , then generates precisely when . Each element generates exactly one cyclic subgroup. Thus counting cyclic subgroups by their generators amounts to counting elements by order of a group element and dividing by .
Use the cycle decomposition of a permutation in . A permutation with cycles of length occurs times: order the five letters, then divide by the cyclic choices of starting point and the orderings of equal-length cycles. Its order is the least common multiple of the cycle lengths. The resulting count is
The two subgroups and are both isomorphic to by a group isomorphism. They are not conjugate subgroups: conjugating their unique nonidentity elements would have to preserve cycle type, whereas a transposition and a product of two disjoint transpositions have different cycle types.
The Sylow theorems state that if a finite group has order with prime and , it has a subgroup of order , called a Sylow subgroup. Every p-group subgroup is contained in a Sylow subgroup, and all Sylow subgroups for the same prime are conjugate subgroups. Their number satisfies
More precisely for a Sylow subgroup , where is its normalizer.
The Mackey's theorem, or Mackey restriction formula, says that if , is a complex -representation, and is a set of representatives for the double cosets , then
Here is the representation of the conjugate subgroup defined by
For the proof, use the group-algebra model
The partition of into double cosets gives the direct-sum decomposition of -bimodules
Put . For each , define
If , then
so is well defined. It is visibly -equivariant and surjective, and choosing representatives for shows that both sides have dimension ; hence it is an isomorphism. Summing the proves the formula.
The Frobenius reciprocity theorem states that for an -representation and a -representation ,
For the corresponding character of a representation, this is
Any nonzero vector in extends to a basis. Sending one such basis to another gives an element of the general linear group, so its group action on the seven nonzero vectors is a transitive group action. Counting successive independent columns gives
By the orbit-stabilizer theorem, the stabilizer of a chosen nonzero vector has order .
There are three two-dimensional linear subspaces containing , corresponding to the three one-dimensional linear subspaces of . The stabilizer acts transitively on them: extend a basis of either plane beginning with to a basis of the whole vector space. Thus the stabilizer of a flag has order .
If has order eight, each orbit of a group action of on the seven nonzero vectors has size a power of two. Since seven is odd, at least one orbit of a group action has size one. Thus fixes a nonzero vector . Its group action on the three planes containing likewise has a fixed plane . Therefore is contained in, and by order equals, the stabilizer of that flag. The group action of is transitive on these flags, so all such subgroups are conjugate subgroups.
Distinct flags give distinct stabilizers. In a basis adapted to a flag, its order-eight stabilizer consists of
Its only common fixed nonzero vector is . Its only invariant plane is : an invariant plane is the kernel of a linear map of a nonzero linear functional, and over that linear functional must be fixed; the displayed matrices have only the fixed nonzero linear functional . Hence each subgroup specifies its flag uniquely. There are seven choices of and three choices of , giving
A group action on a nonempty set is simply transitive when exactly one group element sends any chosen point to any other:
Equivalently it is both a transitive group action and a free group action; this is also a regular group action. Transitivity supplies a transport, and freeness makes it unique. Conversely, putting in the uniqueness condition shows that every stabilizer subgroup is , since the identity element already fixes . In a transitive group action, checking that just one stabilizer subgroup is trivial suffices: all the others are conjugate subgroups.
The cyclic group in the diagram under transitive group action is simply transitive. More generally, the left regular action of any group on itself is simply transitive: the equation has the unique solution , using the inverse element of . This shows why the property is useful: every position has a unique label relative to a chosen starting position.
Choose a point . Its orbit map
is a bijection and an equivariant map from the left regular action: . This identifies with a copy of , but does not come with a preferred identity element. If , then : changing the chosen point composes this identification with right multiplication by . An old label therefore becomes the new label , which also specifies the side of multiplication for a noncommutative group.
The transport from to remains independent of the chosen point. Writing and , it is . With , the new labels are and , and
For a finite group, simple transitivity implies . Conversely, a transitive group action with is simply transitive by the orbit-stabilizer theorem. Equality of cardinalities alone is insufficient without transitivity: the cyclic group can fix both points of a two-point set, giving two group orbits and two possible self-transports at each point.
Transitive group action Created 2026-10-03 Updated 2026-10-25
A group action on a nonempty set is transitive when every two points lie in the same orbit of a group action, equivalently when for all there is a group element with . There is exactly one group orbit: every position is reachable from every other. Requiring avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.[ref]
Here a left group action of a group means a function , written , satisfying
where is the identity element. Products move the point by first, then by . Transitivity says that an orbit map , , is surjective for every ; it suffices to check one chosen point.[ref][ref]
For example, the symmetric group acts on by . This is a transitive group action, but it is not a free group action: the stabilizer subgroup of is . Both the transposition and the cyclic permutation send to . In contrast, the cyclic group acts on itself by , using modular arithmetic. The group element sending to is uniquely . These two group actions reach the same number of points, but only the second has unique transport between them.
Figure 1.
Transitive group actions with and without unique transport
. The symmetric group on three labels has a stabilizer subgroup of group order two at each point, hence two group elements sending any chosen point to any other. The cyclic group acting on itself has trivial stabilizer subgroups and one transport per pair. Red arrows show a generating cyclic permutation; blue arrows show the extra transposition in . Gray loops show the identity element in both group actions. Details.
The stabilizer subgroup measures the ambiguity of transport. If , then
The first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, exactly when . Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives , and there are exactly transports for each pair of points. The example counts are for and for . This separates the number of reachable positions from the number of ways to reach each one.[ref]
Wyckoff position 2026-11-05
A Wyckoff position of a space group consists of all points whose site-symmetry groups are conjugate subgroups of that space group. It classifies sites by their symmetry relationship within the whole group. A Wyckoff letter labels each such class in the conventional tables; the label is accompanied by its crystallographic site multiplicity.[ref]
A Wyckoff position need not specify one particular atom or one fixed coordinate triplet. A general position usually has free fractional parameters. Choosing those parameters produces a crystallographic orbit, the collection of equivalent sites generated from that choice by the space group. Different parameter choices can give distinct orbits belonging to the same Wyckoff position.
An original comparison uses , with operations , where is a lattice vector. Generic positions form pairs modulo lattice translations and have trivial site-symmetry groups. Many different pairs therefore belong to the same general Wyckoff position.
The origin and the half-cell point instead each have an inversion-containing site-symmetry group of order2. Their groups are isomorphic but not conjugate within this space group: a group operation sends the origin to an integer lattice point, never to that half-cell point. They occupy different special Wyckoff positions. Group order or multiplicity alone therefore does not uniquely identify a Wyckoff position.
This classification helps constrain independent atomic coordinates in a crystal structure; it describes allowed symmetry, not which chemical species occupies a site or its fractional occupation.