Rectangle partition asymptotics

What Lean checks

The logarithmic asymptotic is proved uniformly for every w ≥ h as h → ∞, for literal integer-sided real-position tilings counted by block multiset. The real-to-grid bridge, cumulative partition asymptotic, both packing reservations, and exact leading constant are checked.

Collection · Catalogue · Verification · Lean status

Result

Gajdzica–Zakarczemny, Remark 5.9: uniform asymptotic for log p(h,w) as h → ∞, w ≥ h.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/rectangle-partition-asymptotics/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

Complete formalization. Lean proves the uniform asymptotic for every w ≥ h as h → ∞, counting integer-sided blocks at arbitrary real positions and identifying rotations and arrangements of the same multiset. The real-to-grid bridge, cumulative partition estimate, packing reservations, and exact leading constant are proved internally. See the complete checked scope, the source and verification receipt, and the status report.