An automorphism of a root system is an orthogonal transformation of mapping onto itself. The Weyl group is a subgroup of this automorphism group; additional automorphisms can act nontrivially on a Dynkin diagram while preserving a root basis.
The orthogonal transformation takes to . These are the same two decoupled Ising models expressed in rotated fields.
Every Euclidean isometry of is a product of at most operations of reflection in a hyperplane. An isometry fixing zero is orthogonal: the polarization identity preserves inner products, and its values on an orthonormal basis determine its linear action. An orthogonal transformation is a product of at most linear reflections, by reflecting the image of the first basis vector back to that vector and inducting on its orthogonal complement. For an arbitrary isometry, first reflect its image of zero back to zero, if necessary, and apply the orthogonal result. Affine reflection hyperplanes, rather than only hyperplanes through zero, are essential here.
For unit , put . Then and , so is an orthogonal matrix. The affine reflection in a hyperplane is . Hence preserves the Euclidean norm and distance, and whenever . Thus it is an Euclidean isometry fixing the hyperplane pointwise.
For , any reflection exchanging them must have normal parallel to , and its fixed hyperplane must contain their midpoint. These requirements determine the perpendicular bisector uniquely:
Changing both signs of leaves the same reflection. It belongs to the orthogonal group exactly when its translation term vanishes, that is, . Since ,
To prove the finite reflection decomposition of a Euclidean isometry, first note that a distance-preserving map fixing zero preserves inner products by the polarization identity. Its values on an orthonormal basis form an orthonormal basis, and shows . Thus is orthogonal.
Every orthogonal transformation is a product of at most linear reflections: if , reflect to using the hyperplane normal , which passes through zero. The resulting orthogonal transformation fixes , and its restriction to is handled inductively in dimension . If , no initial reflection is necessary. Reflections on the complement extend by fixing ; the induction starts in dimension zero.
For an arbitrary isometry , if , first reflect to zero across its perpendicular bisector with zero. Composing this one affine reflection with gives an orthogonal transformation. If , skip the initial reflection. Therefore
The glide reflection cannot use fewer than three: its determinant sign is negative, excluding zero or two reflections, while absence of fixed points excludes a single reflection. Three suffice by reflecting successively in , , and .
The linear least-squares problem is to minimize over , allowing an overdetermined system to have a nonzero residual. For a full QR decomposition, is orthogonal and is with an upper-triangular top block. Orthogonal transformations preserve the Euclidean norm, so
If has full column rank, the top triangular block is nonsingular; setting its residual to zero gives the unique minimizer, while the remaining residual is independent of . Without full column rank, minimizers still exist but need not be unique.
For the specified matrix, one Householder reflection already produces an upper-triangular matrix. Take , the difference between the first column and , and set
The formula gives , . Direct multiplication yields the Householder QR decomposition
All subdiagonal entries in the remaining columns are already zero, so no further reflection is needed. For the supplied right-hand side, . Back substitution gives , , , hence
The residual is orthogonal to every column of , independently confirming the normal equations .
At the Gaussian fixed point, , so all three quartic couplings have engineering dimension . Thus
Take and , as in the perturbative epsilon expansion. Define , , . The renormalization-group fixed point equations become
If , each of is independently or , giving four renormalization-group fixed points. If , subtracting the first two equations gives
The branch forces ; inserting this in the first equation yields a repeated root . Hence every nonzero- solution has . Then , and
has roots and . The complete list of six coupled Ising fixed points near four dimensions, in coordinates , is
The internal symmetries of these renormalization-group fixed points are:
The last point displays the field-rotation equivalence of decoupled Ising theories. With the orthogonal transformation ,
It is the same pair of decoupled Ising models written in fields rotated by , but remains a distinct coordinate solution of the stated renormalization-group beta functions. Here denotes the dihedral group of order eight; an alternative convention calls it . We have described linear internal transformations preserving the gradient energy; free massless sectors also have constant scalar-field shift symmetries. At , the six coordinates coalesce at the Gaussian fixed point.
A smooth surface in is a subset locally parametrized by a smooth map of two variables whose derivative has rank two and which is a homeomorphism onto its image.
Writing , the first surface equation becomes
It is the torus of major radius and minor radius , with smooth parametrization
Since , this is an embedding. The Gaussian curvature of a torus is
For the second surface, use the orthogonal transformation
Its equation becomes the same torus equation . Orthogonal transformations are Euclidean isometries and preserve Gaussian curvature. Curvature vanishes where , equivalently . In the original coordinates the zero-curvature points are therefore exactly
For an edge , put and . Since , we have .
The random normal has the isotropic Gaussian distribution . Its distribution is invariant under orthogonal transformations; if are linearly independent, its projection onto their plane has a uniformly distributed direction. The signs of its inner products with differ in two sectors of total angle , out of . Thus random hyperplane rounding gives
If , the signs differ with probability one and the same formula holds with . Zero inner products have probability zero, since each is a unit vector.
If the graph has an edge, its corresponding principal block of forces , so the division by used to obtain the Gram matrix is valid. An edgeless graph can instead be colored with one color directly.
Primitive exterior square 2026-10-05
The primitive exterior square of a symplectic vector space is the kernel of its symplectic contraction of an exterior square. In dimension four, the invariant inverse-form bivector has nonzero wedge square. Choose ; the symmetric bilinear form is nondegenerate on . The primitive subspace is , and therefore inherits a nondegenerate form of dimension five. The symplectic Lie algebra acts on it by infinitesimal orthogonal transformations.
For unit vectors and a random normal with independent standard normal distribution coordinates,
The Gaussian distribution is invariant under orthogonal transformations. Projecting onto the plane spanned by therefore gives a uniformly distributed direction. If the angle between is , the sign-disagreement directions form two sectors of total angle out of . The endpoint cases and give probabilities zero and one directly.