Id: palomar/PALOMAR-2026-11-07-000010 Url: https://github.com/igor-kortchemski/critical-trees-height-width/tree/96b7595cda3a0dedf6f97af3dbcae2ed694c0b11 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000010-v1.json Repo: https://github.com/igor-kortchemski/critical-trees-height-width Tags: math.PR, math.CO, msc:60J80, msc:60C05, msc:05C05, msc:60F05 Score: 0 Title: Critical trees are neither too short nor too fat Trust: high Domain: math.PR Source: palomar Authors: Igor Kortchemski Reviews: 0 Subject: math.PR Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-07 Formalized: true Formalizes: title=Critical trees are neither too short nor too fat identifier=arXiv:2311.06163 relationship=formalizes Formalizes: title=Random trees have height O(sqrt(n)) identifier=arXiv:2201.11773 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-07-000010 Lean 4 proofs of the main results of Addario-Berry, Donderwinkel and Kortchemski, "Critical trees are neither too short nor too fat" (arXiv:2311.06163). For every critical offspring law, the height of the size-conditioned Bienaymé tree divided by log n tends to infinity and its width divided by n tends to zero in probability, along admissible sizes. These bounds are sharp: for every function f tending to infinity, a single critical offspring law has limsup P(height n/f(n)) = 1. For critical offspring laws in the local domain of attraction of the asymmetric Cauchy law (mu_n = L(n)/n^2 with L…