OpenAI preprint, September 2026 ยท ยง3. Pruning two families of pairs
Lemma3.2:If
has the largest rank among real matrices supported on
,
then
whenever
,
and
Kernel products vanish where a maximum-rank matrix may be nonzero.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
Let and be finite sets and the edge set of a bipartite graph with sides and .A real matrix , with rows indexed by and columns by , is supported on if its entries off the edges are zero: (1)โฆ
Choose the entries on the edges so that has the largest rank among the real matrices supported on , and take with and with . The coordinates where is nonzero form a set of vertices on the side , those where is nonzero a set on the side . The question is whether an edge of can join the two sets, with and .
The Claim
Theorem 1. Let and be finite sets, let , and let be a real matrix supported on whose rank is at least the rank of every real matrix supported on . Then, for every ,(2)โฆ Equivalently, if and satisfy and , and , then (3)โฆ
In the paper, the result reads: for with and finite, if has maximum rank among all real matrices supported on , then for every , and .
What Is Checked
The claim is stated over the real matrices supported on a set , as in (1), and over their rank.