For an integer matrix with two columns and a finite nonempty row set, the theorem uses the actual real column span and the actual line generated by a primitive signed integer parameter pair. The primitive premise is Int.gcd x y = 1 on the parameters. For any real upper bound C on every squared row norm, plane_value_le bounds the plane value by the line value plus 1/2 * sqrt(C / (x^2+y^2)).
If the actual plane value is at least 2/11 and the actual line value is strictly below 1/6, the proof gives x^2+y^2 < 1089*C. Taking the exact finite maximum of the squared row norms gives the natural-number bound x.natAbs^2 + y.natAbs^2 < 1089 * maxRowSq A. An explicit coordinate-equality theorem carries this bound to a natural six-speed vector. It does not separately require the natural speed vector to be positive, distinct or primitive, and adds no rank, integer-left-inverse, four-speed or six-speed-classification premise.
The plane gap remains an assumption. This theorem does not classify the 78 maps or complete the six-speed spectrum.
The complete 13-module hosted gate passed at 6932e0ba9c532f86fbf9e5fb23aff9e55b8e99f9 (run and job). It checked all fresh strict sources, all 295 owned declarations including 13 private declarations, all 6 required theorem endpoints, and one exact stock-kernel target per module. The permitted axioms were only propext, Classical.choice, and Quot.sound. The unchanged raw receipt has SHA-256 b4722be2222c18d959a57252b8bc797e71a489c41d6c3c0b92647fadaf663de7. A merged accepted-package source, audit and kernel pass remains a separate obligation.
The authenticated archive SHA-256 is d94cbd8b44188d6e36413aa4c996e1c492540efff9b679a65c6956198e8fd272. archive-members.json records every member, including compiled object hashes. The unchanged source, audit and kernel logs, process profiles, declaration inventory, source snapshots, passing controls, and real GitHub metadata are preserved here. Compiled objects remain in the authenticated archive and are not duplicated in Git.