Equality-pattern orbits of projective triples Created 2026-10-06 Updated 2026-10-14
The general linear group over a finite field acting diagonally on projective triples has five orbits of a group action: all equal, three different positions for the repeated coordinate when exactly two are equal, and all distinct. The corresponding representative stabilizer subgroups are upper triangular, diagonal, and scalar matrices. Their orders are , , and , respectively; the orbit sizes are , , and . Transitivity follows from the action being sharply three-transitive on a projective line.
For a paraxial Gaussian beam, choose the complex beam parameter withHere is the wavefront radius and the intensity radius. The ABCD law isFor a real, lossless round-trip ray transfer matrix in free space, . A reproducing cavity mode requires , henceExcept for a scalar identity matrix, a finite physical solution requires a complex-conjugate root pair, one with positive imaginary part. The generic strict stability condition is thereforeEquivalently, the ray eigenvalues are distinct unit-modulus numbers , so repeated round trips do not cause unbounded ray excursions. Adequate mirror apertures and longitudinal resonance are also needed for a low-loss resonant mode.
The strict inequality has a degenerate exception relevant to this paper. If , then for every physical even though . A symmetric confocal resonator has exactly this matrix and supports Gaussian modes; it is not excluded as a physical cavity. Thus the printed strict condition should be understood as the generic, nondegenerate stability criterion, not a universal necessary condition covering the confocal case in c.
Past exam of the mathematics course of the University of Cambridge 2005 ia Paper 3 6D Solution Created 2026-09-24 Updated 2026-10-14
Represent the Riemann sphere by the complex projective line, with finite represented by and infinity by . An invertible matrix acts by , giving the stated fractional map on finite points. Applying and then is exactly matrix multiplication , including at poles and infinity. Thereforeso is a group homomorphism from the special linear group to the Möbius group.
Every Möbius transformation has an invertible complex matrix representative . Choose with . Such a nonzero square root exists in , and has determinant one while representing the same projective map. This proves surjectivity. If the map is the identity, fixing zero and infinity forces , and fixing one forces . The determinant-one condition gives . Conversely both scalar matrices and act trivially. HenceFor the normal forms, use the fact that a complex matrix has a Jordan normal form: either it is diagonalizable or it has one nontrivial Jordan block. For a determinant-one representative, distinct eigenvalues are . Diagonalizing gives , whose projective action is . Distinctness means , so is neither zero nor one.
If the eigenvalue is repeated, the determinant condition gives . A diagonalizable representative would be and would give the identity, excluded here. A nontrivial Jordan block is similar to , giving . Any invertible conjugating matrix gives a Möbius transformation; rescaling it to determinant one does not change that map. Thus these matrix similarities are genuine conjugacies in the Möbius group, proving the requested Möbius conjugacy normal forms.
Conjugacy preserves fixed points bijectively. A nonidentity scaling has exactly the two fixed points zero and infinity, while either translation has exactly one, infinity. The identity fixes every point. This proves all three possibilities and excludes any further finite number of fixed points.
Finally, suppose , with and . Then for every finite in the topology of the Riemann sphere; infinity remains infinity. Since is continuous on that sphere,This is iteration of a one-fixed-point Möbius transformation. The limiting statement includes the unique fixed point itself and uses spherical convergence, which also handles intermediate iterates equal to infinity.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 19 2 Solution Created 2026-10-03 Updated 2026-10-14
There are two necessary qualifications to the literal formulation. The whole group is itself a closed normal subgroup, so the claim about containment in the centre must concern proper closed normal subgroups. Also, the homomorphism conclusion needs a nontrivial target : for example, has surjective differential onto the zero Lie algebra, but its group kernel is all of and no quotient by a finite subgroup is a one-point group. We prove the precise assertions, including these exceptional cases.
Write . The centre is invariant under the Adjoint representation, so irreducibility makes it either zero or all of . In the latter case is Abelian. For connected , the adjoint action is then trivial: the group is generated by exponentials, and . A nonzero trivial representation is irreducible only in dimension one. A connected compact one-dimensional Lie group is a circle, so .
For every other , the Lie algebra of its centre is zero. The centre is a closed compact Lie subgroup; a zero-dimensional compact Lie group is finite. Let be a closed normal subgroup. The closed-subgroup theorem identifies as an adjoint-invariant subspace of , hence or . If the latter holds, contains an identity neighbourhood and is open, so connectedness forces . If is proper, it therefore has zero Lie algebra and is finite. For any , the continuous map takes connected into the finite set , so it is constant and equal to . ThusProper closed subgroups of the circle are finite as well, and of course central.
Now let be surjective. The submersion theorem makes contain an identity neighbourhood in , so it is an open subgroup. Since is connected, . Its group kernel is closed and normal. If is nontrivial, is proper and the preceding argument gives a finite central group kernel; this also holds for , whose proper closed subgroups are finite. The Lie-group first isomorphism theorem givesIf is trivial, the correct statement is instead .
For the Spin groups, use the real Clifford algebra with . The group consists of products of an even number of unit vectors inside its invertible even part. Conjugation on the embedded defines the standard double covering with group kernel . The Clifford relations show that a unit-vector reflection, with the usual twisted conjugation, is a hyperplane reflection; the even products give orientation-preserving transformations. The Cartan–Dieudonné theorem states that every orthogonal transformation is a product of reflections, proving surjectivity. For this connected covering group is simply connected; is a circle.
Here is an explicit exterior-square construction of the requested six-dimensional map. Put with its standard Hermitian form and volume . On , write and define an antilinear map byIt satisfies . Intrinsically, if and the Hermitian inner product is linear in its first variable, then . Because preserves both and , it commutes with . This is the real structure of the SU4 exterior square.
The fixed space has the following real orthonormal basis, with all vectors divided by :Thus is six-dimensional over , its complexification is , and the exterior-square action restricts to an orthogonal representation on . Its determinant is one because is connected. We obtain .
To compute the group kernel, diagonalize with eigenvalues . If , its complexified exterior-square action is the identity, hence for every . Comparing pairs shows that all are equal, and their common value has square one. A unitary matrix with that single eigenvalue is scalar, so . Conversely, those two scalar matrices plainly act trivially on the exterior square.
The differential of is injective because its group kernel is finite. Both Lie algebras have dimension , so the differential is an isomorphism. Its image is consequently open in connected , hence all of . ThereforeThis also realizes as , since is simply connected, by uniqueness of the connected simply connected covering group.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 68 2 b Solution Created 2026-10-03 Updated 2026-10-14
Use a spatial discrete Fourier mode . Its recurrence and amplification polynomial of a multilevel finite difference scheme areThe polynomial roots are . For both have modulus one and are separated. Since , a fixed bounds their separation below by . The two-level companion matrix is therefore diagonalizable with uniformly bounded eigenvector matrix and inverse. To see the uniform bound explicitly, write . Its determinant is ; all its entries have modulus one, and those of are bounded by the reciprocal of the root separation. The companion matrix powers are , bounded independently of frequency and step number. Parseval's identity converts this into a mesh-independent discrete bound for arbitrary perturbations at the two initial levels.
If , choose . Then , and one polynomial root has modulus . On periodic meshes with the number of points divisible by four, this is an actual grid mode, producing exponential linear instability.
At the same phases give . The companion matrix is not a scalar matrix, so the double polynomial root has a nontrivial Jordan block. The solution has bounded starting amplitudes but grows like . On a fixed physical time interval is of order , so no mesh-independent stability bound exists. Consequentlyis the stability interval under the standard two-level definition. Testing only polynomial root moduli would misleadingly include the endpoint. A special startup selecting the non-growing branch at that endpoint restricts the perturbations and does not establish stability of the full recurrence. This is the two-dimensional leapfrog stability threshold.
Past exam of the mathematics course of the University of Cambridge 2014 ia Paper 3 7D i Solution Created 2026-09-24 Updated 2026-10-06
Identify the projective line with one-dimensional subspaces of : use for finite , and . This convention turns the matrix action into the stipulated Möbius transformation.
Since and are distinct projective points, are a basis. Write . Both and are nonzero, because is different from . The matrix with columns and is invertible and sends the lines of to those of , respectively. This constructs the requested map without separate exceptional formulas at infinity.
A matrix fixing and is diagonal, say with . To fix it must also satisfy , so the stabilizer subgroup of is precisely . Any two solutions differ on the right by one of these matrices. ThusEquivalently, after dividing out scalar matrices the projective general linear group action on the projective line is sharply three-transitive on a projective line.
Matrix similarity transports commuting operators: with ,By ii, all such matrices are thereforeFor completeness, matrix multiplication givesThe parameterization is injective, since matrix multiplication by and recovers the parameter diagonal matrix. Thus there are infinitely many choices. Already the distinct scalar matrices , , give an infinite family.
Polynomial reduction of matrix powers 2026-10-18
By polynomial division, write with . Because is a monic polynomial, this division works even over a commutative ring. Evaluating at makes the multiple of vanish, leaving . This explains the reduction in two-coefficient reduction of matrix powers without multiplying out every intermediate matrix.
Over a field, the minimal polynomial divides and gives the strongest such universal reduction: use the polynomial remainder modulo instead. For the scalar matrix , the characteristic polynomial is , while the minimal polynomial is only . Every matrix power is then a scalar multiple of .
Scalar matrix Created 2026-10-06 Updated 2026-10-25
A scalar matrix is a scalar multiple of the identity matrix, equivalently a diagonal matrix with all diagonal entries equal. It commutes with every square matrix of the same size. In , the nonzero scalar matrices form the central subgroup removed to define the projective linear group.