Id: palomar/PALOMAR-2026-11-13-000021 Url: https://github.com/igor-kortchemski/invariance-principles-galton-watson-leaves/tree/0f3642f00d79fe45b87d6dae021868696f9c00f3 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000021-v1.json Repo: https://github.com/igor-kortchemski/invariance-principles-galton-watson-leaves Tags: math.PR, msc:60J80, msc:60F17, msc:05C05 Score: 0 Title: Invariance principles for Galton–Watson trees conditioned on the number of leaves 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-13 Formalized: true Formalizes: title=Invariance principles for Galton–Watson trees conditioned on the number of leaves identifier=arXiv:1110.2163v4 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000021 Lean 4 and Mathlib formalization of the scalar local limit theorem with corrected stable norming (Theorem 1.10), the admissible leaf counts and their probability asymptotics (Theorem 3.1, Introduction (I)), maximum degree concentration under the paper's hypothesis H (Theorem 7.1(ii)), and corrected probability asymptotics for the number of vertices with degree in an arbitrary set (Theorem 8.1(I)). The principal functional results are the joint convergence of the rescaled Lukasiewicz path, contour and height under leaf conditioning (Introduction (II), including lattice laws) and under…