{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"Invariance principles for Galton–Watson trees conditioned on the number of leaves","identifier":"arXiv:1110.2163v4","relationship":"formalizes"}]}