allaun 00e9eed399 fix(lean): complete projectionOrdering proof in GeometricCompressionWorkspace ... Replace the TODO(lean-port) sorry with a complete proof of the projectionOrdering theorem: for positive SourceValue pairs s1 < s2 with s2 ≤ maxExpected, projectToCoding preserves strict ordering of the Q0_64 values. The proof uses Nat-only arithmetic (no Float) and handles two cases: - a2 < d: both values fit in Q0_64 range, ordering follows from monotonicity of integer division - a2 = d: a2*s/d = s clamped to q0_64MaxRaw; a1*s/d < q0_64MaxRaw via the key inequality (d-1)*s < (s-1)*d Build: 8598 jobs, 0 errors (lake build)		2026-06-18 15:06:50 -05:00
..
OTOM	fix(lean): complete projectionOrdering proof in GeometricCompressionWorkspace	2026-06-18 15:06:50 -05:00