OpenAlex ·
Duality for matrix space questions
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.29177
- Original
- Read it at the publisher
- Topics
Abstract
We present a new proof of a classical theorem of Dieudonné: if a linear space of $n\times n$ matrices consists entirely of singular matrices, then its dimension is at most $n^2-n$. Our proof is based on a surprising ``duality'' argument: we prove this universal upper bound by exhibiting a single matrix space that serves as a lower bound for a related problem. Interestingly, this approach only works for certain fields, but we use model-theoretic arguments to obtain the same result for all fields. We hope that this approach can be generalized to provide new duality-based proofs of other classical theorems on matrix spaces, and give some preliminary results in this direction.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
More than 83.69% of the zeros of the Riemann zeta function are distinct
A New Upper Bound for the Turán Density of the Tetrahedron
Large-Scale Autonomous Discovery of Kissing Number Constructions
On the generation of multiplicative groups by small primes
A Memory-Magic Exchange Law in Streaming Clifford+T Compilation
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.