Phase space Created 2026-09-24 Updated 2026-09-28
Phase space has one position coordinate and one conjugate momentum for every degree of freedom; a point specifies an instantaneous mechanical state.
Grover rotation angle Created 2026-09-24 Updated 2026-10-14
If of items are marked and , each Grover iteration rotates the state by in the marked--unmarked plane, so after iterations the marked amplitude is .
Grover diffusion operator Created 2026-09-24 Updated 2026-10-14
For , the diffusion operator is , where .
Order of an element of a finite group Created 2026-09-24 Updated 2026-11-05
The order of an element is the least positive power equal to the identity and divides the order of a finite group.
This is the order of a group element in the finite setting, one use of order (group theory).
Exponent of a finite group Created 2026-09-24 Updated 2026-11-05
The exponent of a finite group is the least common multiple of the orders of all its elements.
Every finite group is a torsion group; its exponent is a common multiple of the order of a group element for every element.
Solvable group Created 2026-09-24 Updated 2026-10-07
A solvable group has a subnormal series whose factor groups are abelian.
Semidirect product Created 2026-09-24 Updated 2026-11-05
Given groups and a group homomorphism , their semidirect product is the set with multiplication
It contains as a normal subgroup and as a complementary subgroup; the action specifies how the two factors fail to commute.
For example, the dihedral group of a regular -gon is , where the reflection acts on rotations by inversion. If is trivial, the construction is the ordinary direct product of groups. Specifying the action matters: the same two factor groups can yield different groups.
Projective linear group Created 2026-09-24 Updated 2026-11-05
The projective linear group is and acts on projective space.
Dedekind group Created 2026-09-24 Updated 2026-11-05
A Dedekind group is a group in which every subgroup is normal.
Normal subgroup Created 2026-09-24 Updated 2026-10-14
A subgroup is a normal subgroup when for every . In other words, conjugation by any group element preserves the subgroup as a set, although it may exchange its individual elements. Equivalently, for every : the left and right cosets of agree. Write .
Every subgroup of an abelian group is a normal subgroup, because conjugation fixes each element. Normality can also hold in a nonabelian group: in , the three even permutations form the alternating group , a normal subgroup as the group kernel of the sign of a permutation. Its two cosets separate the even and odd permutations.
In contrast, is a subgroup of but is not a normal subgroup. With function composition of permutations acting rightmost first, choose . Then
which are different cosets. Also , directly contradicting invariance under conjugation. Thus a subgroup alone does not suffice for quotient group multiplication.
Figure 1.
A normal subgroup gives matching left and right cosets, while a nonnormal subgroup can give different ones
. Details.
The practical value of normality is coset multiplication is well-defined exactly for normal subgroups. Each coset can act as one element of a quotient group, with results independent of representatives. Conversely every normal subgroup is the group kernel of its quotient map of groups, so normality also identifies which distinctions a group homomorphism can consistently forget.
Free abelian group Created 2026-09-24 Updated 2026-11-05
A free abelian group has a basis over and is isomorphic to a direct sum of copies of .
Torsion element Created 2026-09-24 Updated 2026-10-06
Finite group theory Created 2026-09-24 Updated 2026-11-05
Finite group theory studies groups with finitely many elements, including their subgroups, normal subgroups, group actions, and representations. Finiteness turns structural questions into arithmetic restrictions on group order.
For example, Lagrange's theorem says a subgroup order divides the group order, while the Sylow theorems locate subgroups of prime-power order and constrain their number. The symmetric groups encode permutations, and the dihedral groups encode polygon symmetries. These examples connect finite algebra to counting and geometry; finite simple groups serve as the possible factors of composition series.
Automorphism group Created 2026-09-24 Updated 2026-11-05
The automorphism group of a group is the group of all isomorphisms under composition.
Group homomorphism Created 2026-09-24 Updated 2026-10-14
A group homomorphism is a map preserving the group operation: . It also preserves the identity element and inverse elements. In an additive group, the same requirement reads . A group homomorphism preserves a way of combining inputs, even when several inputs have the same output.
Reduction modulo three from to is a group homomorphism: reducing a sum agrees with adding the reduced residues. For example, modulo six, and both sides reduce to one modulo three; the outputs and also add to one modulo three. This map is surjective but not injective, since zero and three both map to zero.
The sign of a permutation gives another example, from the symmetric group to the multiplicative group . A product of two odd permutations is even, matching . Its group kernel is , the alternating group of even permutations. This shows how a group homomorphism can retain a useful feature while forgetting other details.
Special linear group Created 2026-09-24 Updated 2026-11-05
For a field , the special linear group consists of the matrices with determinant one, under matrix multiplication. It is the kernel of the determinant homomorphism and hence a normal subgroup of the general linear group.
For instance, lies in . Over , these transformations preserve oriented volume; they need not preserve lengths or angles. A shear therefore gives a basic example that is special linear but not orthogonal.
General linear group Created 2026-09-24 Updated 2026-09-24
The general linear group is the group of invertible linear maps from a vector space to itself, with composition as its operation.
Quotient group Created 2026-09-24 Updated 2026-10-14
For a group and a normal subgroup , the quotient group is the set of cosets , with operation
Its identity element is the coset , and the inverse element of is . A quotient group treats all elements within one coset as the same input while retaining a consistent operation on the classes. The normal subgroup condition is what makes this operation independent of which representatives are chosen. [ref].
Take the additive group and . Since is an abelian group, is a normal subgroup. There are three elements in the quotient group:
Adding two copies of gives ; adding and gives . Hence the quotient group has the addition table of . It does not select one representative and discard the others: its elements are the entire cosets.
Figure 1.
Identifying residues differing by three turns a six-element cyclic group into a three-element quotient group
. Details.
This is useful whenever distinctions within a normal subgroup should be ignored. For example, the sign of a permutation retains only even or odd parity of a permutation in . Its group kernel is the alternating group , and the quotient group has two elements. The first isomorphism theorem explains why a group homomorphism's image is a quotient group of its domain.
Order of a group element Created 2026-09-24 Updated 2026-11-05
The order of a group element is the least positive integer for which is the identity. If no such integer exists, has infinite order.
Generalized dihedral group Created 2026-09-24 Updated 2026-11-05
For an abelian group , the generalized dihedral group is the semidirect product in which the nonidentity element of acts on by inversion.

There are unlisted articles, also show them or only show them.