Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/iii/paper-167/4/iv/solution

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 ranks
together 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.
Solved by gpt-5.6-sol high.

New to topics? Read the docs here!