A total variation threshold for the first coordinates of uniform parking functions via Lorentzian polynomials

Igor Kortchemski

For the first k entries of a uniform parking function of length n, the total variation distance from k independent uniform choices is of order min⁡(1,(klog⁡(k+1)/n))\min (1, \sqrt{(k \log (k+1)/n)}). If k log⁡n/n\log n/n tends to λ\lambda , the distance tends to 2Φ((λ/π))−12\Phi (\sqrt{(\lambda /\pi )})-1, where Φ\Phi is the standard normal distribution function. The paper also bounds relative entropy for the comparison with independent entries drawn from the actual marginal law.

What was already known

Diaconis and Hicks proved fixed-coordinate asymptotic independence. Bellin established an earlier growing-coordinate regime. Brändén–Huh supply Lorentzian polynomial theory.

AI involvement AI-led

ChatGPT 6 Pro identified the scale, proposed matching bounds and the Gaussian profile, and contributed proof arguments. Igor Kortchemski formulated questions, directed revisions and checked proofs and uses of cited results. GPT-6 Astra Ultra developed the Lean proof.

Importance Notable

The result locates the transition and gives the limit throughout the critical window, strengthening the earlier sufficient regime.

Technical verification Formal (Lean + human)

The manuscript author checked all proofs and applications of citations. Lean kernel plus Comparator, NanoDa and con-ron cover the three main statements; repository correspondence compares the arXiv v1 arguments.

Formal checking

The manuscript author checked all proofs and applications of citations. Lean kernel plus Comparator, NanoDa and con-ron cover the three main statements; repository correspondence compares the arXiv v1 arguments.

Checker
Lean kernel, Comparator, NanoDa and con-ron, reported in §5.2
Scope
Theorem 1.1 finite bounds, Theorem 1.2 Gaussian profile, and Proposition 1.3 relative-entropy and total-variation comparison with independent actual marginals.
Basis
Reported by the linked checker

Formal checking

The manuscript author checked all proofs and applications of citations. Lean kernel plus Comparator, NanoDa and con-ron cover the three main statements; repository correspondence compares the arXiv v1 arguments.

Checker
Igor Kortchemski
Scope
All manuscript proofs and applications of cited results, including the three main statements.
Basis
Reported by the linked checker

Human understanding Few

The author checked the proofs and citations. The disclosure separates checking from the model-developed reasoning and does not identify a separately attributable human explanation of the central derivation.

Correction and publication history