Past exam of the mathematics course of the University of Cambridge 2025 iii Paper 167 4 iv Solution Created 2026-09-24 Updated 2026-09-24
For each signed permutation , choose its symplectic signed-permutation matrix . The Bruhat decomposition of a reductive algebraic group is the explicit disjoint union
To prove existence, compare the standard isotropic flag with . The rankstogether with the symplectic orthogonality relations determine a unique signed permutation . Symplectic row and column operations from then reduce to , so . Conversely, the same intersection dimensions are constant on a double coset and recover , proving disjointness. This is symplectic Gaussian elimination and establishes the claimed decomposition.