claimroutine
Alignment reduces to column-span membership
Alignment on forces into the column span of
reduces alignment to a linear-algebra condition
Statement (paper)
Let be a set of more than distinct nonzero inputs, and take an injective parametrization . If some binary linear map satisfies the alignment condition on all of , then the vector lies in the -column span of the -column matrix , , , . Conversely, membership of in this column span supplies the basis values of such a , so this column-membership condition accounts for all possible maps .
In plain English
For a set of more than distinct nonzero inputs, if some binary linear map satisfies the alignment condition on all of , then the vector lies in the -column span of the -column matrix . Conversely, membership of in that span yields the basis values of such a , so this condition covers every possible .
Why it's here
This turns the question of whether any aligned linear map exists into a single linear-algebra condition on the , namely whether lies in the column span of . That condition can then be handled by treating the as indeterminates, as the next claim does with non-membership over the function field, to show a random subspace is generic with high probability.}</br>
Classified routine:
This step rewrites the alignment condition, linear in the unknown basis values of g, as a column-span membership statement for an explicit matrix. It is a direct linear-algebra reformulation inside the genericity proof and uses no new idea.
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §3.2 Generic spaces of characters
- Page
- —
- Label
—- Line
sections/02-latent.tex:277
Leannot aligned
Phase 2 aligns this node to a Lean declaration.