The equation X⊤AX=BX^\top AX=B with BB skew-symmetric: How much of a bilinear form is skew-symmetric?

preprint2022arXivOpen access

Abstract

Given a bilinear form on Cn\mathbb C^n, represented by a matrix A∈Cn×nA\in\mathbb C^{n\times n}, the problem of finding the largest dimension of a subspace of Cn\mathbb C^n such that the restriction of AA to this subspace is a non-degenerate skew-symmetric bilinear form is equivalent to finding the size of the largest invertible skew-symmetric matrix BB such that the equation X⊤AX=BX^\top AX=B is consistent (here X⊤X^\top denotes the transpose of the matrix XX). In this paper, we provide a characterization, by means of a necessary and sufficient condition, for the matrix equation X⊤AX=BX^\top AX=B to be consistent when BB is a skew-symmetric matrix. This condition is valid for most matrices A∈Cn×nA\in\mathbb C^{n\times n}. To be precise, the condition depends on the canonical form for congruence (CFC) of the matrix AA, which is a direct sum of blocks of three types. The condition is valid for all matrices AA except those whose CFC contains blocks, of one of the types, with size smaller than 33. However, we show that the condition is necessary for all matrices AA.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.