Overview

The two-dimensional Kardar–Parisi–Zhang equation describes a growing random surface, but its noise is too irregular for the equation to have a classical meaning. Berger, Caravenna, Clark, Dunlap, Gu, Liu, Nakajima, Sun, Tsai, Xie, and Zygouras construct a critical limiting height field by centering logarithms of directed-polymer partition functions. The same field is a renormalized logarithm of the critical stochastic heat flow. Its spatial averages are non-Gaussian, although a further limit at shrinking spatial scales is Gaussian (Berger et al., 2026).

The construction rests on Gaussian convexity, a decomposition at two intermediate times, and estimates for products of random kernels. Scott Armstrong’s Lean development supplies formal counterparts and four additional results; the final sections explain these results and the precise scope of the Palomar registration.

🏷️ The equation and its critical dimension

The Kardar–Parisi–Zhang equation, with the normalization used in the paper, is formally

Here is a height and is space-time white noise. White noise is a centered Gaussian random distribution: for smooth compactly supported space-time tests ,

Thus is symbolic notation, not a random function with values at individual points. The resulting height is also rough, and the square of its gradient cannot simply be formed pointwise.

For smooth functions, the substitution gives

This is the Cole–Hopf transformation. It suggests constructing from the multiplicative stochastic heat equation

In a stochastic regularization, Itô’s formula also produces a deterministic correction. Both the regularization and the correction must be specified before the transformation becomes a mathematical definition.

Dimension two is critical under diffusive scaling. In spatial dimensions, the rescaled noise has the law of . Rescaling the equation therefore multiplies its noise coefficient by . This power is zero when . The coupling changes on logarithmic scales, and the construction below tunes it inside a logarithmically narrow critical window.

🏷️ Gaussian directed polymers and the critical window

Let be the nearest-neighbor simple random walk on . Independently, let

be independent standard Gaussian variables. We write for expectation over a walk started at at time , and for expectation over the environment .

The point-to-point partition function is

The terminal environment variable is included and the initial one is excluded. Summing over gives the point-to-plane partition function , whose endpoint is unrestricted. The subtraction ensures

The relevant measure of recurrence is the expected overlap of two independent walks:

Fix . For sufficiently large , choose by

The quantity is the variance of the mean-one random weight . In particular, . The parameter specifies the next-order tuning; retaining only the leading equivalence would lose the distinction between different critical limits.

Diffusive normalization

Each coordinate of one walk step has variance . Consequently, macroscopic space is represented by lattice sites near . To handle parity, let for time and let denote a fixed nearest point in

Write and . The rescaled kernel is

The factor is the reciprocal of a rescaled even-lattice cell’s area. With this convention, the limiting mean kernel is

For a positive initial profile , define the forward field by

This is the discrete approximation to a stochastic heat evolution from .

🏷️ The stochastic heat flow and the logarithm problem

The critical two-dimensional stochastic heat flow, abbreviated SHF, is a family of random locally finite measures

Its two coordinates describe the initial and terminal positions. Caravenna, Sun, and Zygouras constructed it as the joint scaling limit of the polymer kernels, tested against compactly supported continuous functions (Caravenna, Sun & Zygouras, 2023). Its mean is

For suitable functions , write

The heat evolution from is the measure

For flat data , this measure is almost surely singular with respect to Lebesgue measure (Caravenna, Sun & Zygouras, 2025). It has no density to which an ordinary pointwise logarithm could be applied.

Even convergence of strictly positive densities as measures would not justify passing to their logarithms.

Weak convergence does not control logarithms

On the unit square, divide each of equal vertical strips into two halves. Let a density equal on the first half and on the second. Then converges weakly to Lebesgue measure, but

A logarithm detects small values that weak convergence of measures does not control.

The new construction must therefore control lower tails and determine which diverging deterministic quantity to subtract.

🏷️ Renormalized Cole–Hopf construction

Take a bounded continuous initial height , so that is bounded above and away from zero. Define

Translation invariance makes the flat-data mean independent of the spatial point. The same constant is used for every , preserving the effect of changing the initial height. The paper proves

This asymptotic identifies the divergence. The definition uses the exact mean: replacing it by its leading term alone need not give the same limiting deterministic offset.

For the continuum construction, set . For , define

This evolves with the SHF until and then with the deterministic heat kernel for duration . It removes the final short interval of disorder. The paper also proves that directly smoothing in its terminal spatial variable gives the same centered logarithmic limit.

Random distributions and local negative Sobolev spaces

A distribution acts continuously and linearly on tests ; its evaluation is denoted . This permits a height field to have well-defined averages without having pointwise values.

For , the negative Sobolev norm has the Fourier representation

where . A distribution belongs to when for every smooth compactly supported cutoff .

Construction and convergence — Theorem 1.2

Fix . There is an SHF-measurable family of random distributions , for positive times and bounded continuous initial heights, such that for every ,

Both convergences hold jointly for finitely many positive times and initial conditions. For each test , the continuum convergence of pairings also holds in every , (Berger et al., 2026).

There is no additional amplitude normalization in this theorem. A fixed macroscopic spatial average has a nontrivial limit after deterministic centering alone. The factor appears later, when the averaging scale itself tends to zero.

Dependence on the initial height

Positivity of the heat kernels immediately gives a useful comparison. If , then

Integrate against the positive kernel, take logarithms, and subtract the common flat-data centering. Passing to the limit yields, for fixed data and test , almost surely,

The paper highlights this comparison for bounded Lipschitz initial data. Adding a constant to the initial height likewise adds to the tested field, because the partition function is multiplied by .

🏷️ The convergence argument

The proof is easiest to describe at time , with flat data and a fixed test . It uses the time-reversed, point-to-plane formulation. Reversing the lattice model changes its endpoint noise convention; the resulting vanishing correction is accounted for when returning to the forward statement.

Write for the centered tested log-polymer field. Let be its version with disorder removed up to the even time , and let be the corresponding tested logarithm of the SHF.

Two estimates carry the construction:

and

The first estimate uses SHF convergence together with control of the logarithm near zero. The second is the main new approximation theorem.

flowchart TD
  A["Gaussian convexity<br/>and block factorization"]
  B["Moments, covariances,<br/>and endpoint estimates"]
  C["Two-time decomposition<br/>at m and n"]
  D["Uniform L²<br/>smoothing estimate"]
  E["Cauchy limit of<br/>centered log SHF"]
  F["Convergence in local<br/>negative Sobolev spaces"]
  A --> B --> C --> D --> E --> F

The fixed-cutoff convergence is joint in different cutoffs. Hence Portmanteau’s inequality, applied to the squared difference, and the triangle inequality give

Thus is Cauchy in and defines a limit . This simultaneously constructs the continuum logarithm and identifies the discrete limit.

For completeness, let be the bounded-Lipschitz distance between probability laws. Since for variables on the same probability space,

First send at fixed , then send . The order of these limits is essential; the uniform smoothing estimate permits the second passage.

🏷️ Gaussian convexity and lower-tail control

The logarithm of a finite polymer partition function is a convex function of its Gaussian environment: it is a logarithm of a positive sum of exponentials of affine functions. It is also increasing in each environment coordinate.

Chen’s Gaussian convexity theorem supplies a stronger property than ordinary convexity of a log moment-generating function. If is a finite convex function of a finite-dimensional Gaussian vector and for every , then

is convex on the entire real line (Chen, 2026). Liu and Xie developed its moment-comparison consequences for polymers and the SHF (Liu & Xie, 2026).

Normalize so that . Then

The supporting-line inequality at , evaluated at , gives

The midpoint inequality at gives

At , multiplication of the supporting-line inequality by the negative number reverses its direction. For this yields

Consequently, a mean-one partition function satisfies

This converts second-moment information into control of arbitrarily small values of . Such control is exactly what is needed to pass to .

Covariance comparison and the Gaussianity defect

Define

It vanishes for a Gaussian normalized by . The paper proves

For two normalized convex functions of the same Gaussian vector,

To see the mechanism, apply to

and expand its variance. For increasing functions of independent Gaussian coordinates, positive association also gives a nonnegative covariance. Bounds on ordinary polymer moments and on therefore become bounds on the covariance of logarithms.

🏷️ Factorization at two intermediate times

Let and let be the law of started from . Removing disorder from gives

where for a starting distribution .

A decomposition directly at leaves two very different endpoint distributions. The proof allows them to evolve through a common environment until a later time

As and then , the ratios and both diverge. Define the endpoint probabilities

The Markov property gives the exact identities

Taking their logarithmic ratio separates two errors:

where

The local term depends only on disorder up to . Its correlations occur on a spatial scale comparable to , much shorter than the macroscopic averaging scale . Its individual logarithms become small after centering and averaging, despite their large pointwise fluctuations.

The global term compares the future masses produced by two profiles that have already evolved through the same noise on . Their remaining discrepancy is small in the estimates appropriate to the future evolution. Negative moments allow this comparison of masses to survive taking logarithms.

Let and denote these terms after centering and spatial averaging with the same cell weights as . The paper obtains

Taking square roots and applying the triangle inequality gives the exponent in the smoothing estimate. This is an explicit sufficient rate for convergence, not a claimed optimal rate.

Geometric blocks and cancellation

The profile estimates adapt Gu and Tsai’s geometric factorization (Gu & Tsai, 2026). Fix a sufficiently large ratio and divide at times

Write for the walk’s distribution at time when started at the origin. The random kernels use disjoint pieces of the environment. Replace each kernel by one that preserves its total mass and resets its endpoint to the deterministic heat profile:

The discrepancy has the exact cancellation

Expanding products of the kernels into reset terms and discrepancy terms isolates strings of consecutive discrepancies. Their estimates decay geometrically in string length. This makes the product of independent block masses a controlled approximation to the full partition function.

There is also a quantitative exceptional-event estimate. Put and let be the ratio of the full mass on blocks , started from , to . On

the estimates, for , are

To handle reciprocal masses, the proof also changes measure by a density proportional to . Under that probability law, both bounds have order . This weighted estimate is a key addition: ordinary second-moment factorization alone does not control rare small denominators.

🏷️ From tested limits to spatial distributions

Convergence for each test does not by itself establish convergence in . The paper obtains tightness from uniform spatial covariance bounds of the form

for the flat-data regularizations at fixed time , with and . Here .

The Fourier multiplier in the Sobolev norm has the integral representation

Fourier inversion converts the expected squared localized norm into a heat-kernel integral of the covariance. For , the resulting Bessel kernel behaves near zero like . The radial singularity is integrable because

This gives uniform expected bounds for every positive ; larger orders also follow by weakening the norm. To obtain compactness in , use a bound at the stronger order , localize, and apply the compact Sobolev embedding. The already constructed test-function limits identify every subsequential limit. The initial-data comparison transfers the argument from flat heights to bounded initial heights.

🏷️ Local fluctuations and the log-log covariance

For the rest of the spatial results, fix , , and flat initial data, and abbreviate to .

For a test and scale , define

Its integral equals , independently of scale.

Local structure — Theorem 1.4

For every fixed and nonnegative ,

There is a nonnegative radial covariance kernel , continuous away from zero. Writing and , for real smooth compactly supported we have

Matching temporal and spatial scales

The local central limit theorem uses the heat scale . In the reversed time-one notation, let

Gu–Tsai log-normal fluctuations, with the centering adjusted to the expectation, give

For a nonnegative test of integral one and barycenter zero, the KPZ paper proves the scale-matched comparison

The bounded error disappears after division by . Translation and normalization recover the general statement. This is stronger information than the fixed-test smoothing bound, whose constant can depend on the test being rescaled.

For a probability-density test, the variance also satisfies

The covariance singularity is much weaker than the logarithmic singularity of a planar Gaussian free field. Nevertheless, the height is too singular to be a locally finite signed measure.

🏷️ Non-Gaussianity through rigidity

The local central limit theorem concerns a limit of rescaled observables. At each fixed nonzero averaging scale, a stronger structural theorem holds.

Non-Gaussianity — Theorem 1.6

For every nonzero nonnegative , the random variable has a non-Gaussian law. Constant Gaussian laws are excluded as well (Berger et al., 2026).

The proof uses a class of laws that retains convex Gaussian geometry after passage to a limit. A real random variable has Ehrhard type if it has the same law as

for a finite nondecreasing convex function . Constant functions are allowed. Convex functions of finite-dimensional Gaussian vectors have Ehrhard-type laws, and this class is closed under weak convergence. In particular, nonnegative tested averages of the limiting logarithmic field have this property.

The decisive rigidity statement is:

Gaussian rigidity under bounded perturbations

Suppose are centered, is Gaussian, and almost surely for a deterministic finite . If both and have Ehrhard-type laws, then almost surely.

The condition on retains information about the joint law. Separate knowledge of the two marginal distributions would not suffice.

To apply rigidity, normalize and work in the reversed formulation. For spatial smoothing radius , define the continuum polymer endpoint probability

Changing the terminal weight from to a bounded Lipschitz function satisfying changes the logarithm by

This difference lies in . Center each tested observable by its own expectation for this argument. Their difference is then bounded by , and their joint limits have the Ehrhard properties required by the rigidity lemma.

If the flat observable were Gaussian, rigidity would force every such centered perturbation to vanish in the limit. Choosing , then controlling the first-order expansion in , implies that the averaged endpoint measures

have deterministic subsequential limits. A separate estimate ensures these limits are nonzero; this cannot be inferred from vague convergence of probability measures alone, because mass could escape to infinity.

The contradiction comes from the singularity of the SHF. The paper proves that such a nonzero deterministic limit would overlap, with positive probability, with the later heat-flow measure

Yet is almost surely mutually singular with every deterministic finite positive measure. Indeed, write a deterministic as its absolutely continuous and singular parts. Almost-sure singularity of separates it from the first part. The second part is supported on a deterministic Lebesgue-null set , and forces almost surely. These two separations imply .

The substantial comparison lemma leading to the overlap uses the flow over successive time intervals and integrates out an intervening interval of disorder. It is the probabilistic ingredient that turns scalar Gaussian rigidity into a contradiction with spatial singularity.

🏷️ Spatial symmetry and scaling covariance

For flat data, the process is invariant in law under translations and rotations. Its scaling relation also changes the critical parameter. For , put

Then, jointly for finitely many times and tests,

The factor preserves the integral of a test in two dimensions. The shift is the remaining effect of the logarithmic critical tuning. Thus the scaling law relates different members of the critical family.

🏷️ The Lean formalization and Palomar record

Scott Armstrong’s Lean repository at the registered revision contains formal statements for the construction, its principal properties, selected supporting results, and four extensions (Armstrong, 2026). Its statement catalogue has 26 entries: 22 covering the paper and inputs, and four for Armstrong’s companion note.

The supplied Palomar entry, version 1, registers the theorem Critical2DKPZAudit.criticalKPZ_main at commit f1c98dacb2a83737096bd976019dfa2c5986ee5a. It uses Lean 4.35.0-rc2. The recorded verification report reports acceptance by Lean’s default kernel and NanoDa, together with an accepted con-ron replay. The permitted axioms are the standard propext, Classical.choice, and Quot.sound.

The formal statement’s mathematical content

The standalone Challenge file imports only Mathlib and defines the walk, Gaussian environment, critical tuning, partition functions, random distributions, and local Sobolev energies. Its theorem takes an SHF satisfying the predicate IsCriticalSHF and constructs the KPZ field with the stated convergence properties.

Mathematical object or assertionFormal counterpart
Gaussian product environment and critical lattice modeldisorderLaw, criticalBeta, pointToPoint
Joint polymer limit defining the SHFIsCriticalSHF
Existence of a flow satisfying that predicateexists_isCriticalSHF, separately proved in the library
Centered logarithmic approximationskpzRegularized, kpzLattice
Finite localized negative Sobolev energyMemLocalNegSobolev
SHF-measurable KPZ construction and convergencecriticalKPZ_main

The SHF hypothesis is a specified joint scaling-limit property, rather than an assumption that the desired KPZ conclusions already hold. The separate existence theorem establishes that this class of flows is nonempty. That existence declaration is outside the theorem selection in this particular Palomar entry.

The Challenge’s final proof is a placeholder used to freeze the statement. The Solution file supplies the proof from the development; the verification applies to that solution.

Scope of the registered comparison

Version 1 selects one theorem and has an empty definition_names list. Its editorial review explicitly notes that the README’s claim about separately comparing all 40 definitions is broader than this configuration. The repository contains Lean-checked definition-equality lemmas, but these are not separately selected for comparator checking or independent replay in this entry. The 26-result catalogue and the four additional results therefore describe the wider development, not 26 independently registered conclusions of this one record.

Conventions and correspondence

The errata and deviations document makes several mathematically useful distinctions explicit.

The exported lattice statements fix ; they do not include the paper’s extension to all deterministic sequences . The local Sobolev carrier is implemented as the full distribution space with a topology generated by extended Sobolev energies. Reading its convergence as convergence in uses the finite-energy support results and the identification of the restricted topology.

The terminal-noise convention also produces an endpoint correction under lattice time reversal. The formalization bounds the discrepancy between the two flat logarithmic means by , which vanishes and preserves the asymptotic. This illustrates why the endpoint convention matters even when it does not alter the limiting theorem.

Kernel checking establishes the formal implications. Relating the precise SHF predicate to the earlier literature, and reading the chosen topology and null-set conventions against the manuscript, remain mathematical correspondence questions. The repository documents these choices and states that the paper’s authors have not reviewed the formalization.

🏷️ Four additional results in the formal development

Armstrong’s companion note, Four results on the critical 2D KPZ process, goes beyond the original paper (Armstrong, 2026a). The following statements fix and a positive physical time ; their scope should be distinguished from the original construction and from the single theorem selected in the Palomar entry. The note gives complete arguments for the first two results and combines proofs with sketches for the last two, referring to the Lean development for the full formal proofs.

Strict positive skewness

For nonzero nonnegative smooth compactly supported , the flat-data variable has a finite third absolute moment and

This strengthens non-Gaussianity by identifying a strictly positive centered moment. The distinction matters because a non-Gaussian distribution can have zero third centered moment.

Twice differentiable response to initial data

For bounded continuous and a real smooth compactly supported test , the response

has a version, unique up to almost-sure equality. With and ,

It is convex when . For this theorem, the approximating responses retain the disorder over the full interval and smooth the terminal position. At a positive smoothing scale, the first derivative of the logarithm is the polymer expectation of , and its second derivative is the variance of . The theorem justifies the limiting response and the convergence of the first two derivatives in every finite , uniformly on compact intervals.

Brownian motion across spatial scales

Fix , a nonnegative smooth compactly supported with , and . Set

As real , the continuous paths converge in law in , with the supremum norm, to standard Brownian motion. The clock is natural because

The Brownian parameter is the logarithm of a logarithmic spatial scale. Physical time remains fixed.

A Gaussian free field tangent on zero-integral tests

For finitely many real smooth compactly supported with ,

where equals

This is the whole-plane Gaussian free field covariance on zero-integral tests, with the normalization displayed above. Degenerate Gaussian vectors are allowed. The assertion is finite-dimensional convergence of these pairings, rather than convergence of an entire rescaled distribution in a function-space topology.

The different normalizations reflect cancellation. A nonzero-integral test sees the common fluctuation of size . A zero-integral test removes that contribution and detects a much smaller fluctuation, which must be multiplied by . Proving this finer limit requires more than the leading covariance equivalence .

🏷️ Scope and further questions

The construction is a precise notion of critical KPZ based on Gaussian polymers and the SHF. Its convergence is joint at finitely many positive physical times. It does not establish convergence in a path space over physical time, almost-sure temporal continuity, or a uniqueness theorem for every possible interpretation of the formal SPDE.

The paper also discusses the KPZ equation driven by spatially mollified white noise. It expects the corresponding centered logarithms to converge to the same process, but omits the required adaptations. This differs from spatially smoothing the already constructed SHF: the latter convergence is proved in Corollary 6.2. Extension to more general disorder laws, walks, and unbounded initial data requires additional results.

Appendix C records how the authors developed the analytic proof through interactions with generative AI. It attributes contributions to the tightness, convergence, and non-Gaussianity arguments, and describes an abandoned approach whose contraction argument failed an audit. The authors supplied mathematical inputs, directed revisions, and take responsibility for the manuscript. Armstrong’s subsequent Lean development is a separate contribution with its own statements, proofs, and correspondence documentation.

  • on Slepian’s lemma and Gaussian comparison — Gaussian comparison supplies useful background for covariance arguments; the central input here is instead convexity of normalized logarithmic moment-generating functions.
  • on Liouville quantum gravity and KPZ — Gaussian free fields and renormalized random measures provide a comparison with the SHF and its GFF tangent. The KPZ relation in that title is the Knizhnik–Polyakov–Zamolodchikov relation, a different use of the acronym from the growth equation here.
  • on limit laws for two-dimensional torus cover times — another setting where two-dimensional recurrence and singular random measures determine limiting observables, with a different underlying stochastic mechanism.

📚 References

🐻  Armstrong, S. 2026a. Four results on the critical 2D KPZ process.
🐻  Armstrong, S. 2026b. The Critical 2D KPZ Process: a Lean formalization.
🐻  Berger, Q., Caravenna, F., Clark, J., Dunlap, A., Gu, Y., Liu, Z., Nakajima, S., Sun, R., Tsai, L.-C., Xie, Z. & Zygouras, N. 2026. The Critical 2D KPZ Process.
🐻  Caravenna, F., Sun, R. & Zygouras, N. 2023. The critical 2d stochastic heat flow. Inventiones Mathematicae 233(1), 325–460.
🐻  Caravenna, F., Sun, R. & Zygouras, N. 2025. Singularity and regularity of the critical 2D Stochastic Heat Flow.
🐻  Chen, W.-K. 2026. A Gaussian convexity for logarithmic moment generating functions with applications in spin glasses. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 62(1), 195–206.
🐻  Gu, Y. & Tsai, L.-C. 2026. Log Log Fluctuations of the Stochastic Heat Flow.
🐻  Liu, Z. & Xie, Z. 2026. Moments Comparison Inequalities for Critical 2d Stochastic Heat Flow, Polymers and GMC.