The Trivial-Multiplicity Obstruction: Sparsity and Invertibility as a Two-Argument Separation

A self-contained note deriving VP ≠ VNP from two elementary structural properties - sparsity of the canonical SAT polynomial f𝒰(n) and invertibility of GLn² - uniformly for all n ≥ 3. The argument requires no Rigidity Theorem, no Castelnuovo–Mumford regularity, and no case-by-case computation: an explicit unipotent transformation gives k(d) ≥ 1 for the SAT orbit closure, while a torus-weight observation gives k(d) = 0 for the determinant. The canonical object f𝒰(n) and seven-step proof structure follow TMO_OIGNPC_v6 (same author); all other ingredients are independent.