LonelinessSubspaceExtension.lean combines the dimension calculation with the previously proved rounding construction. It supplies the subspace part of the density lemma used in the norm reduction.
Let , and let be any real linear map that vanishes on . Suppose the vectors are linearly independent. The theorem Loneliness.SubspaceDensity.extension_finrank proves
Independence of the images implies independence of the original vectors. It also makes their span disjoint from , and therefore from . The dimension formula for the sum of two subspaces then gives the result. The map need not be an orthogonal projection; any map with the stated properties is sufficient.
The theorem rational_integer_extension starts with a rational subspace , its real span , and integer vectors . It constructs
It proves all of the following in one statement:
- The real span of equals .
- Its rational dimension is .
- No coordinate vanishes identically on the extension if this holds for .
For arbitrary , its actual loneliness value satisfies
The last inequality is the existing coefficient-rounding theorem, applied to the explicitly constructed space. With chosen as the component of in , the errors are the projected vectors used by the lattice argument.
The module compiles with the pinned toolchain and passed independent leanchecker replay. Both headline declarations have only propext, Classical.choice, and Quot.sound as transitive axioms.
This theorem accepts the independent images as input. It does not establish the successive-minima product inequality, the covolume identity, or a cube-section volume bound. Those inputs are still required to obtain the specific short projected vectors used by the full norm reduction.