Manuscript XVI-O1-ST@5 · XVI-O1-ST-v5.tex · proposition · dd45e0d1
Proposition: Modular original minors
Genuine modular rank and permanent verification rules · lines 1754–1768 · proof included or linked
XVI-O1-ST@5#prop:modular
For rational , with all denominators invertible modulo a prime , a nonzero reduced original minor proves . Finite-field rank alone does not upper-bound rational rank. Taking is not computing .
Proof. A zero rational determinant reduces to zero wherever reduction is defined. The matrix has rational rank one and finite-field rank zero, while .