Lagrange's theorem says that, for a finite group and subgroup ,
Here is the number of left cosets. Every lies in . If and meet, write ; then , so . Hence the left cosets partition . The bijection makes each coset have elements. Adding their cardinalities proves Lagrange's theorem.
False. Any supposed kernel of a group homomorphism of order two would have a nonidentity central element by the introductory proof. Every element of order two in is a transposition, and none is central: conjugating by a suitable three-cycle gives a different transposition. Thus the center of a group for is trivial, and such a kernel is impossible. This argument does not assume that an arbitrary order-two subgroup is normal.
True. Use the odd-dimensional orthogonal determinant splitting:
Scalar matrices commute with every matrix, so . Its output is orthogonal and
Every satisfies , proving surjectivity. The equation forces , whence
In odd dimension has determinant , which is the sign needed in this construction.
True. The sign of a permutation is a group homomorphism , as follows, for example, from the multiplicative determinant of permutation matrices. Its kernel of a group homomorphism is the alternating group
A transposition maps to , so this homomorphism is onto.
True. The determinant gives a group homomorphism
For an orthogonal matrix, implies , and a reflection has determinant , so the target has order two and the map is onto. Its kernel of a group homomorphism is exactly
This is the defining special orthogonal group inside the orthogonal group.
Applying a permutation to the elements of an -element subset preserves its cardinality. The identity fixes each subset and
so this is the symmetric group action on subsets. For two -element subsets , choose a bijection and a bijection between their complements; together they define a permutation of the full -element set. Hence the action is transitive.
A member of the stabiliser subgroup must permute internally and its complement internally, with independent choices. Thus
This also agrees with the orbit-stabilizer theorem; handles .
The identity permutation fixes every multivariate polynomial. With permutation composition , substitution gives
Thus this is a left variable-permutation action on polynomials. The substitution acts on variable names; using the displayed definition avoids reversing the composition order.
For the given multivariate polynomial, the group orbit corresponds to the three partitions of four indices into two unordered pairs:
These three polynomials are distinct, and every pairing occurs under a permutation. The orbit-stabilizer theorem gives
The eight elements of the stabiliser subgroup independently interchange the members of each pair, and may also interchange the two pairs.
This plane curve is an Archimedean spiral. Put and , so and . Then
Therefore the curvature of a plane curve is
The parametrization is regular even at , where the curvature of a plane curve is .
Differentiate the unit tangent vector with and . This gives
The curvature of a space curve is . Squaring the displayed expression and simplifying gives
The last equality is the cross product norm identity. Equivalently, the hinted vector triple product rewrites .
For a regular curve parametrized by , put and orient arc length in the direction of increasing . Since , the unit tangent vector is
Regularity is the condition that permits division by .
Use the Einstein summation convention, with divergence and curl , where is the Levi-Civita symbol. For the first vector field,
The derivative matrix is symmetric, so its contraction with the Levi-Civita symbol vanishes. For the second vector field,
For the third vector field, . Its divergence is zero because the Levi-Civita symbol contracts with symmetric products. For its curl, either contract two Levi-Civita symbols or use the vector triple product:
Thus
All formulas hold on , the domain where the radial unit vector is defined.
For the positive Euclidean norm , the chain rule gives
Repeated indices use the Einstein summation convention. The origin is excluded because the Euclidean norm is not differentiable there. Another derivative, useful below, is , with the Kronecker delta.
Let be a normal subgroup and let be the quotient group homomorphism. By the first part, for involutions , so the quotient group is generated by , whose squares are the identity. If both images are nonidentity, they are involutions and the second part applies. If only one image is nonidentity, it generates ; choose it twice. Both images cannot be trivial because the quotient group is nontrivial. Hence every nontrivial quotient is dihedral in the stated extended convention. This is the nontrivial-quotient closure of two-involution groups.
Let be the generating involutions. If , set and . Then , so its order of a group element is at least two or infinite, and
Therefore generate the group and satisfy the required dihedral inversion relation. If , the group is and gives its permitted degenerate description. This proves the two-involution characterization of a dihedral group without excluding either or the infinite dihedral group.
The two-involution characterization of a dihedral group uses the extended convention that includes and the infinite dihedral group; the two generators need not be distinct. Put and . The inversion relation gives
If , both are involutions and generate the original group. If , then and the group is ; choose the same nonidentity element twice. Thus two elements of order two generate the group, including the degenerate case allowed here. The distinction between square equal to the identity and order of a group element exactly two is essential.

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