The lower tail of the half-space KPZ equation
Yujin H. Kim

TL;DR
This paper provides the first tight bounds on the lower tail probability of the half-space KPZ equation with specific boundary conditions, revealing a crossover in decay regimes and connecting to Painlevé II asymptotics.
Contribution
It establishes the first tight bounds on the lower tail of the half-space KPZ equation, identifying crossover regimes and linking bounds to Painlevé II asymptotics.
Findings
Demonstrates a crossover between super-exponential decay regimes with different exponents.
Shows the upper bound can be improved to match the lower bound crossover.
Provides new bounds on large deviations of the GOE point process.
Abstract
We establish the first tight bound on the lower tail probability of the half-space KPZ equation with Neumann boundary parameter and narrow-wedge initial data. When the tail depth is of order , the lower bound demonstrates a crossover between a regime of super-exponential decay with exponent (and leading pre-factor ) and a regime with exponent (and leading pre-factor ); the upper bound demonstrates a crossover between a regime with exponent (and arbitrarily small pre-factor) and a regime with exponent (and leading pre-factor ). We show that, given a crude leading-order asymptotic in the Stokes region (Definition , first defined in (Duke Math J., [Bot17])) for the Ablowitz-Segur solution to the Painlev\'e II equation, the upper bound on the lower tail probability can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The Lower Tail of the Half-Space KPZ Equation
Yujin H. Kim
Y. H. Kim Courant Institute
New York University
251 Mercer Street
New York, NY 10012, USA.
Abstract.
We establish the first tight bound on the lower tail probability of the half-space KPZ equation with Neumann boundary parameter and narrow-wedge initial data. When the tail depth is of order , the lower bound demonstrates a crossover between a regime of super-exponential decay with exponent (and leading pre-factor ) and a regime with exponent (and leading pre-factor ); the upper bound demonstrates a crossover between a regime with exponent (and arbitrarily small pre-factor) and a regime with exponent (and leading pre-factor ). We show that, given a crude leading-order asymptotic in the Stokes region (Definition 1.8, first defined in (Duke Math J., [Bot17])) for the Ablowitz-Segur solution to the Painlevé II equation, the upper bound on the lower tail probability can be improved to demonstrate the same crossover as the lower bound. We also establish novel bounds on the large deviations of the GOE point process.
Key words and phrases:
(Half-space) Kardar-Parisi-Zhang equation, Pfaffian point processes, GOE ensemble, large deviations, stochastic Airy operator, Ablowitz-Segur Solution to Painlevé II
2010 Mathematics Subject Classification:
Primary: 60H15. Secondary: 60B20, 45M05, 60F10, 60G55, 60H25.
Contents
-
1.1 The half-space KPZ equation with Neumann boundary conditions
-
1.3 Asymptotics of the Ablowitz-Segur solution to the Painlevé II equation
-
4.1 The thinned GOE point process and the Painlevé II equation
1. Introduction
The Kardar-Parisi-Zhang (KPZ) equation is formally given by
[TABLE]
where , , and is Gaussian space-time white noise with covariance . A physically relevant notion of solution to this equation is given by the Cole-Hopf solution to the KPZ equation with narrow-wedge initial data
[TABLE]
where solves the stochastic heat equation (SHE) with multiplicative space-time white noise
[TABLE]
The well-definedness of (1.2) is given by the work of [Mue91] establishing almost-sure positivity of for a wide class of initial data (including delta initial data).
The KPZ equation is a paradigmatic model in a class of models, known as the KPZ universality class, whose long-time limit is the KPZ fixed point. While this universality class is not strictly defined, all models in this class should share specific salient features. The KPZ equation itself has been shown to govern the long-time limits under weak asymmetric scaling of many other models in the universality class. The notes and surveys [Fer10], [Cor12], [Cor14] [QS15], [Sas16], [Tak18], and [Zyg18] provide further reading on various aspects of the KPZ universality class.
Just as in the full-space case, the half-space KPZ equation with Neumann boundary conditions plays a significant role within the half-space KPZ universality class. Mathematical analysis of the half-space analogues of models believed to lie in the KPZ universality class began with the work of [BR01, IS04], both of which consider variants of half-space TASEP. For a recent result relating to half-space TASEP, see [BBCS18]. Progress has been especially fruitful in the case of ASEP. [CS18] established convergence of the height function of half-space ASEP under weakly asymmetric scaling to the half-space KPZ equation with Neumann boundary parameter . Following this result, [BBCW18] established an exact one-point distribution formula for half-space ASEP with , and [Par19a] was able to extend the work of [CS18] to show convergence to the half-space KPZ equation for all real . See, for instance, [KLD18a], [Wu18], [KLD20], [BBC20], [BKLD20], [Lin20], and [BFO20] for additional results in the half-space KPZ universality class.
We now describe the half-space KPZ equation in detail.
1.1. The half-space KPZ equation with Neumann boundary conditions
This paper seeks to establish bounds on the lower tail of the half-space KPZ equation with Neumann boundary condition, an object which we presently define.
Definition 1.1** (Mild solution to the half-space SHE, half-space KPZ).**
We say is a mild solution to the SHE given in (1.3) on with delta initial data at the origin and Robin boundary condition with parameter
[TABLE]
if is adapted to the filtration given by and the following Duhamel-form identity is satisfied
[TABLE]
for all and . Here, the last integral is Itô with respect to the cylindrical Wiener process , and is the heat kernel on , i.e., the fundamental solution to the heat equation on , satisfying the Robin boundary condition
[TABLE]
The Hopf-Cole solution to the half-space KPZ equation with Neumann boundary parameter is then defined to be .
[Par19a, Proposition 4.2] establishes the existence, uniqueness, and almost-sure positivity of for all , which makes the Hopf-Cole solution to the half-space KPZ equation with Neumann boundary condition well-defined.
Our paper establishes tight bounds on the lower tail probability of , that is, the probability that is very close to [math], or equivalently, that is very negative, for the critical boundary parameter . Our result builds on the method used by [CG20] to find analogous bounds for the full-space KPZ lower tail.
We now explain the choice of boundary parameter . For this particular boundary parameter, [Par19a, Theorem 1.1] established Tracy-Widom GOE fluctuations at the origin.
Proposition 1.2** ([Par19a, Theorem 1.3]).**
Let be the solution to the half-space KPZ equation with inhomogeneous Neumann boundary parameter and narrow-wedge initial data (which corresponds to initial data for the SHE). Then the following weak convergence result holds
[TABLE]
Here, is the Tracy-Widom GOE fluctuations [TW96], and is the solution to the KPZ equation after centering and re-scaling.
For other choices of , establishing the limiting fluctuations of has been elusive, and thus establishing lower tail bounds in these regimes seems at the moment unfeasible. [Par19a, Conjecture 1.2] gives a conjecture establishing exactly two more regimes of distinct fluctuations: , with Gaussian fluctuations, and , with Tracy-Widom GSE distribution [TW96]. [Par19a, Section 1.3] gives a heuristic argument for the Gaussianity of the regime; see also [Par19b]. [GLD12, BBC16, KLD20] provides strong evidence towards the conjectured regime, though we emphasize that no part of this conjecture has been rigorously established.
On the other hand, for , we have access to Proposition 1.3, which provides the starting point for our analysis.
Proposition 1.3** ([Par19a]).**
Let denote the solution to the half-space KPZ equation on with Neumann boundary parameter and narrow-wedge initial data. Then for ,
[TABLE]
Here, the form the GOE point process (defined in Section 3.1).
Taking in (1.9) and recalling from (1.8), we obtain
[TABLE]
Note that the function is an approximate of the indicator function , and so the integrand of the left-hand side of (1.10) approximates for large . This heuristic is made rigorous in Section 2.1. Proposition 1.3 was conjectured in [BBCW18, Theorem 7.6], which proves the analogous formula for the height function of half-space ASEP and computes asymptotics which were expected to lead to the above result on the KPZ equation. Combining their result with [Par19a, Theorem 1.2] yields Proposition 1.3.
We our now ready to state our main result, Theorem 1.4, which establishes upper and lower bounds on the lower tail probability for large but fixed times .
Theorem 1.4**.**
Let denote the solution to the half-space KPZ equation with Neumann boundary parameter and narrow-wedge initial data, centered and re-scaled as in (1.8). Fix any , , , and . There exist positive constants , , , and such that for all and , we have
[TABLE]
and
[TABLE]
Assuming Conjecture 1, we have the stronger
[TABLE]
Conjecture 1 has a rather technical statement regarding the leading-order asymptotics of Ablowitz-Segur solution to the Painlevé II equation in a certain region, named the Stokes region. Its openness is due to the difficulty of a certain Riemann-Hilbert problem. One major goal of this article is to highlight the direct connection between leading-order asymptotics of in the Stokes region and the lower-tail of the KPZ equation, in hopes of motivating further study of the Stokes region. For the sake of a more stream-lined discussion of Theorem 1.4 and its proof, we postpone a detailed discussion of Conjecture 1 and the Painlevé II equation to Section 1.3. The proof of Theorem 1.4 is given in Section 2.1. We note that (1.12) and (1.13) differ only in the second term of each.
We can see Theorem 1.4 displays three distinct regions of decay as follows. First, note that Proposition 1.2 implies that, as , should decay according to , which is approximately for large (see Proposition 7.1). This cubic decay is exhibited in the last terms of (1.11)—(1.13). Note that in the range , either the second or the third term of (1.13) dominates; in (1.11), the second term dominates (though in the lower bound (1.11), the prefactor of the cubic exponent is not explicit). When , the third term of (1.13) dominates and thus recovers the cubic decay of the tail. On the other hand, in the “short time deep tail” region , the first term of both (1.13) and (1.11) dominates; however, in (1.12), the second term dominates the first term in all regions. The exponent and the prefactor for this region were first observed in [KLD18b]. The crossover from to cubic exponent that occurs when is of order can be understood in terms of large deviations: as , the crossover is exhibited by the large deviation rate function for the half-space KPZ equation, which has speed . In the full-space case, this crossover was first predicted by [SMP17], which also contains the first prediction of the full-space rate function; [CGK*+*18, KLD18a, KLDP18] each provide alternative methods of computing this rate function. In particular, [CGK*+*18] showed that the half-space rate function is simply one-half that of the full space. The rate functions for both the full and half-space case were finally rigorously established by [Tsa18]. Just over a year after the posting of this paper, the preprint [Zho20] obtained sharper upper and lower bounds than in Theorem 1.4 by proving large deviation bounds for the Airy point process. In particular, their upper-bound on the lower tail probability is given by , so that the aforementioned crossover from exponent to is attained. Large deviation bounds for the Airy point process were originally (non-rigorously) derived by [CGK*+*18] using Coulomb gas heuristics.
The techniques used to prove Theorem 1.4 are heavily inspired by the work of [CG20] on the lower tail of the full-space KPZ equation. Their work starts with the full-space KPZ analog to (1.9), which was established in [BG16], where the full-space KPZ equation is related to a multiplicative functional of the Airy (GUE) point process by manipulations of an exact formula for the one-point distribution of SHE with delta initial data. This one-point distribution formula was simultaneously and independently computed in [ACQ11, SS10, CLDR10, Dot10] and rigorously proved in [ACQ11]. In [CG20], the formula of [BG16] was manipulated to yield tight bounds on the lower tail of the full-space KPZ equation; however, in order to do this, [CG20] first establishes appropriate control on the fluctuations of the GUE point process. Their work strongly suggests that a careful manipulation of (1.10) would similarly yield tight bounds on the lower tail of the half-space KPZ equation, given analogous control on the GOE point process; indeed, this is the approach taken in the current article. We now outline our approach to studying the GOE point process and the methods used therein.
1.2. Fluctuations of the GOE point process
In Section 3.1, we define the GOE point process and describe its key properties as a simple Pfaffian point process (also defined in that section). The estimates on the GOE point process needed in this article pertain to (1) controlling the locations of individual GOE points, and (2) controlling the number of GOE points within intervals.
Towards (1), we detail in Section 3.2 the well-studied connection between the (stochastic) Airy operator (SAO) and the GOE points, and describe the relevant known results (Propositions 3.2—3.4). In particular, the seminal work of [RRV11] (Proposition 3.2) gives an equivalence in distribution between the eigenvalues of the SAO and the GOE points, while [CG20, Proposition 4.5] (Proposition 3.3 below) establishes uniform control on the deviations of the (random) SAO eigenvalues from deterministic locations given by the eigenvalues of the (deterministic) Airy operator. Theorem 1.5 below is then simply the combination of Proposition 3.2 and Proposition 3.3.
Theorem 1.5**.**
For , let be the smallest real number such that, for all ,
[TABLE]
where is the largest point of the GOE point process and is the smallest eigenvalue of the Airy operator. Then, for all , there exist constants and such that, for all ,
[TABLE]
Theorem 1.5 establishes an upper bound on the probability that the deviate away from the (deterministic) , uniformly in . This is extremely helpful because we know what the look like: Proposition 3.4 tells us that111Here, if they are asymptotically equivalent, i.e., . .
Towards (2), we define the counting function
[TABLE]
where denotes the Borel -algebra of . is a non-negative integer-valued random measure on , where denotes the Lebesgue measure on , that, informally speaking, counts the number of GOE points in a Borel set — see Section 3.1 for a formal description. We will also refer to as the GOE point process. The mean of on intervals is given by Theorem 1.6 below, which is proved at the end of Section 3.1.
Theorem 1.6**.**
Define the interval . For any , we have
[TABLE]
where .
We expect that this result and other statistics for should be known; however, we were unable to find such results in the literature. Note that the leading-order term of (1.16) matches the leading-order term of the expectation of the GUE (or, Airy) point process on , computed in [Sos00]. [Sos00] also computes the variance of and establishes a central limit theorem for .
In light of Theorem 1.6, we are interested in deviations of order of on intervals of size . The upper deviations result (Theorem 1.12, proved in Section 6) will actually follow from the results discussed in (1) and the lower deviations result (Theorem 1.11, proved in Section 5), and so we now turn our attention to the lower deviations. To introduce important related objects and motivate the results that follow, we begin with a preliminary computation of the lower deviations of . Recall from Theorem 1.6 the interval . For any and , define
[TABLE]
is the cumulant generating function for . Now, for any positive and , taking in Markov’s inequality and then applying Theorem 1.6 yields
[TABLE]
Thus, we see that in order to achieve decay in (1.17) for any , one needs to achieve an upper-bound like222Here, we use “little-Oh” notation: is called if .
[TABLE]
for some choice of . Obtaining (1.18) for optimal will be a major technical focus of this article. An important step towards this end is Theorem 1.7 below. Before giving this result, we must first uncover a connection to the thinned GOE/GUE point processes with parameter and the Ablowitz-Segur solution to the Painlevé II equation (this connection is developed further in Section 4).
The Ablowitz-Segur (AS) solution to the Painlevé II equation is a one parameter family of solutions to
[TABLE]
with the boundary condition
[TABLE]
as . When , is called the Hastings-McLeod solution and typically denoted . This particular solution was introduced in [HM80], where they solved the connection problem, that is, gave an asymptotic formula for as . For fixed, the connection problem for was partially solved by [AS77a, AS77b].
The thinned version of a point process with parameter removes each particle independently with probability ; we discuss the thinned GOE point process formally in Section 4.1. In Theorem 4.4, we prove by way of a Fredholm Pfaffian formula (defined in Section 4.2) that
[TABLE]
where denotes the distribution function of the largest particle of the thinned GOE point process with parameter . Let denote the distribution function of the largest particle of the thinned GUE point process with parameter . In Proposition 4.1, we recall a formula from [BB18] that relates to and , described in the next subsection. It is a result of [CG20], restated here as Proposition 4.2, that
[TABLE]
Combining Proposition 4.1, Proposition 4.2, and Theorem 4.4 yields Theorem 1.7, which yields a formula for in terms of and . Theorem 1.7 is proved in Section 4.3.
Theorem 1.7**.**
Fix any and . Define and ; note that . Then
[TABLE]
where
[TABLE]
In Corollary 5.1, we give an asymptotic expansion for for any fixed that satisfies (1.18), thus yielding exponential decay on the right-hand of (1.17) with exponent . This yields equation (1.32) of Theorem 1.11. However, the authors of [CG20] found optimum decay of when . Indeed, part of [CG20, Theorem 1.7] (recorded here as Proposition 4.2) states that, for any , as ,
[TABLE]
Fix . Throughout this paper, we fix
[TABLE]
Now, take in the notation of Theorem 1.7. Then upon substituting (1.21) into Theorem 1.7, we see that obtaining the bound
[TABLE]
would actually yield (1.18) with there. The result would be exponential decay on the right-hand side (1.17) with exponent instead of . Thus, showing (1.23) translates directly into a vastly improved bound on the right-hand of (1.17).
To achieve (1.23), one needs to control for all and . While much is known about both and for values of fixed (with respect to ), much less is understood for general values of . As we show in the following subsection, there is a particular region of , known as the Stokes region, on which leading-order asymptotics of do not exist at this time. This lack of knowledge prevents us from bounding in absolute value the integral of on the Stokes region, and therefore, we can not establish (1.23); however, we show that given crude leading-order asymptotics on in the Stokes region (see Conjecture 1), we can obtain (1.23).
1.3. Asymptotics of the Ablowitz-Segur solution to the Painlevé II equation
In this subsection, we recall what is known and unknown about the asymptotic properties of the Ablowitz-Segur solution to the Painlevé II equation as both and vary and detail what these results imply for .
As explained in the last paragraph of the previous subsection, we are interested in over , where , for any . Our goal is to show (1.23), for which we seek appropriate leading-order asymptotics of as . To understand for that may vary with , we turn to the important work of Bothner [Bot17], which contains the most up-to-date results on such asymptotics in the case and (regular transition in [Bot17]) or the case and (singular transition in [Bot17]). These results were achieved via a non-linear steepest descent analysis applied to a certain Riemann-Hilbert problem. Since , we are interested in the regular transition results of [Bot17]. To state these results, we define the following parameter for any and :
[TABLE]
Note that the exponential decay in (1.19) implies that for any constant , the integral of over is bounded. The remaining region is contained in . For any , Theorems and of [Bot17] achieve asymptotic expressions for as in the regions \aleph\in I_{1}(\zeta):=\big{(}0,\frac{2\sqrt{2}}{3}-\zeta\big{]} and \aleph\in I_{2}:=\big{[}\frac{2\sqrt{2}}{3},\infty\big{)}, respectively.333Actually, the expression holds for any fixed and I_{2}(f):=\big{[}\frac{2\sqrt{2}}{3}-\frac{f}{(-x)^{3/2}},\infty\big{)}. However, considering large (but fixed) does not change our results asymptotically, and so we simply take . [Bot17, Theorem 1.12] is transcribed here as Proposition 4.6. [Bot17, Theorem 1.10] gives an expression in terms of Jacobi theta functions and elliptic integrals that is pseudoperiodic. In Lemma 4.5, we manipulate this result to show that there exists such that uniformly over \aleph\in\big{(}0,\frac{2\sqrt{2}}{3}-\zeta_{0}\big{]} as . From Lemma 4.5 and Proposition 4.6, it follows almost immediately that
[TABLE]
In [Bot17], is named the regular Boutroux region and the Hastings-McLeod region; the remaining region of was named the Stokes region.
Definition 1.8** (Stokes region).**
For any , the region is referred to as the Stokes region.
[Bot17] does not give a full asymptotic expression for in the Stokes region, stating that “the nonlinear steepest descent analysis becomes increasingly difficult.” Moreover, at the time of this paper’s release, it appears that no progress has been made towards such results in the Stokes region [Bot]. As a result, not enough is currently known about in the Stokes region to obtain (1.23), and thus we can not at present achieve (1.18) with for any .
However, observe that only a crude upper-bound on is needed in order to show (1.23). Indeed, for , the part of the Stokes region that we are interested in is , which is equivalent to
[TABLE]
Note that has length , where denotes some constant.
Conjecture 1**.**
Fix . Recall from (1.22), and recall from (1.26). As , we have the following uniformly over all (equivalently, :
[TABLE]
Assuming Conjecture 1, we immediately have
[TABLE]
so that (1.23) follows from (1.25) and the last display. To be precise, we have the following results.
Lemma 1.9**.**
Fix . Recall the function from Theorem 1.7. There exist positive constants and such that for all ,
[TABLE]
Assuming Conjecture 1, we have the following expression as ,
[TABLE]
Lemma 1.9 is proved in Section 4.4. Combining this result with Theorem 1.7 and (1.21) will yield the following bound.
Theorem 1.10**.**
Assume Conjecture 1. For , we have the following expression as
[TABLE]
Theorem 1.10 is proved in Section 4.3.
Regarding evidence for the validity of Conjecture 1, we note that a leading-order expression for was obtained in [Bot17, Theorem 1.13] for the portion of the Stokes region satisfying
[TABLE]
for any . The expression shows that uniformly over this region of , which is consistent with Conjecture 1. We note further that the bound in (1.27) is much looser than both the aforementioned result and the existing leading-order asymptotics given for outside of the Stokes region (Proposition 4.6 and Lemma 4.5). Beyond these observations, we do not attempt to provide further justification for Conjecture 1.
1.4. Main results on the GOE Point Process
Theorems 1.11 and 1.12 establish the first bounds on the fluctuations of below and above its mean, respectively, and may be of independent interest.
Theorem 1.11**.**
Fix any , , and . There exists a positive constant such that for all ,
[TABLE]
Furthermore, assuming Conjecture 1, there exist positive constants and such that for all and ,
[TABLE]
where .
Theorem 1.11 is proved in Section 5, essentially by combining (1.17), (1.31), and (5.1).
Theorem 1.12**.**
Consider the intervals
[TABLE]
Fix and . There exist and such that, for all and for all , we have
[TABLE]
Theorem 1.12 is proved in Section 6.
1.5. Outline
We now give an outline for the remainder of the article. In Section 2, we prove Theorem 1.4 by realizing the left-hand side of the Laplace transform formula (1.10) as an approximate indicator function for . This translates our problem into bounding a multiplicative functional of the GOE point process, i.e., the right-hand side of (1.10). These bounds are given by Proposition 2.2.
We next turn to a fine analysis of the GOE point process, which involves estimating the typical locations of the GOE points in large intervals and bounding their deviations from these locations. In Section 3, we define the GOE point process (and Pfaffian point processes in general), and use known results on its correlation functions to prove Theorem 1.6. We then discuss the important connection with the eigenvalues of the stochastic Airy operator (abbreviated SAO). In particular, the result of [RRV11] (Proposition 3.2 below) gives an equivalence in distribution between the GOE points and the negatives of the SAO eigenvalues. Furthermore, [CG20, Proposition 4.5] (Proposition 3.3 below) establishes an upper bound on deviations of the SAO eigenvalues (uniformly over all eigenvalues) from their “typical locations”, which are given by the eigenvalues of the Airy operator. The locations of these deterministic eigenvalues are given by a result of [MT59] (Proposition 3.4 below). Combining Proposition 3.2 and Proposition 3.3 yields Theorem 1.5. Thus, we are able to effectively estimate the locations of individual GOE points.
In Section 4, we turn our attention to the cumulant generating function for the GOE point process. The importance of this function was established in equation 1.17 of Section 1.2. Via a Fredholm Pfaffian formula for , we prove in Theorem 4.4 a key equality between and the distribution function of the largest eigenvalue of the thinned GOE point process. This allows us to translate the work of [BB18] on this distribution function to , which in particular leads to the proofs of Theorem 1.7 and (assuming Lemma 1.9) Theorem 1.10 in Section 4.3. Lemma 1.9 is proved in Section 4.4.
In Sections 5 and 6, we prove Theorems 1.11 and 1.12 respectively. Theorem 1.11 is proved essentially by substituting the results of Corollary 5.1 and Theorem 1.10 into (1.17). Our strategy for proving Theorem 1.12 involves approximating the number of GOE points in a closed interval of length by carefully estimating the nearest GOE points to the endpoints of this interval, and then bounding the fluctuations of these GOE points via Theorem 1.5.
In Section 7, we apply our work on the GOE point process to prove Proposition 2.2.
Acknowledgements
We are grateful to Ivan Corwin for suggesting this problem and for providing helpful comments on numerous drafts of this paper, to Promit Ghosal for providing guidance and insight at several stages of this project, and to Thomas Bothner for enlightening discussions about the current literature on leading-order asymptotics for the Ablowitz-Segur solution to the Painlevé II equation in various regimes. We are also grateful to Guillaume Barraquand, Pierre le Doussal, Alexandre Krajenbrink, Yier Lin, Baruch Meerson, Li-Cheng Tsai, and Shalin Parekh for discussions and conversations related to this work. Finally, we are grateful to the anonymous referees for their time and effort in providing many important comments and suggestions. The author was partially funded by Ivan Corwin’s Packard Fellowship for Science and Engineering while working on this paper. The author is currently supported by the National Science Foundation Graduate Research Fellowship under Grant No. 1839302.
2. Proof of the main theorem
We begin by establishing upper and lower bounds on the right-hand side of the Laplace transform formula (1.10) in Proposition 2.1.
Proposition 2.1**.**
Fix any , , , and . There exist positive constants , , , and such that for all and , we have
[TABLE]
and
[TABLE]
Assuming Conjecture 1, we have the stronger upper bound
[TABLE]
We prove Proposition 2.1 in Section 2.2. We now prove the main result.
2.1. Proof of Theorem 1.4
From Markov’s inequality, we have
[TABLE]
From the above, we see that (2.2) and (2.3) imply (1.12) and (1.13) of Theorem 1.4, respectively.
We now show that (2.1) yields (1.11). Let . Observe that
[TABLE]
The second inequality follows from the fact that implies . Continuing from (2.4), we compute
[TABLE]
It follows from (2.1) that for all and ,
[TABLE]
Here, the term appears because for some constant . We now note that there exists a constant such that for all and ,
[TABLE]
Solving for in (2.5) and substituting the lower bound (2.6) on and the upper bound (2.7) on yields, for all and for all ,
[TABLE]
The multiplicative factor can be absorbed into the factor on the right-hand side above. Finally, taking yields the right-hand side of (1.11), thus completing the proof of Theorem 1.4. ∎
2.2. Proof of Proposition 2.1
As above, let denote the GOE point process. Define
[TABLE]
We now give upper and lower bounds on . These bounds and Proposition 1.3 allow us to complete the proof of Proposition 2.1.
Proposition 2.2**.**
Fix any , , , and . There exist positive constants , , , and such that for all and , we have
[TABLE]
and
[TABLE]
Assuming Conjecture 1, we have the stronger upper bound
[TABLE]
We complete the proof of (2.11) and (2.12) in Section 7.1, and the proof of(2.10) in Section 7.2.
Proof of Proposition 2.1.
This follows immediately from Proposition 1.3 and Proposition 2.2. ∎
3. The GOE point process
Proposition 2.2 reduces our problem to a question about the GOE point process. In this section, we formally define this process and examine results pertaining to the statistics of the process, such as the distribution of the GOE points, the typical locations of individual points, and deviations away from these typical locations. The results developed here connect the GOE point process to the stochastic Airy operator (see Section 3.2) and will be crucial to the proofs that follow.
3.1. First notions
The GOE point process, denoted by or , is a simple Pfaffian point process on , where here denotes Lebesgue measure. We define this object now. We first define point processes via random point configurations (see, for instance, [AGZ10, Section 4.2.1]). Give the Borel sigma algebra equipped with a positive Radon measure (not necessarily Lebesgue). Let denote the space of configurations of , that is, discrete subsets. For any and , let . Endow with the sigma algebra generated by the cylinder sets , for . A point process is a probability measure on . [AGZ10, Lemma 4.2.2] shows that a random configuration with distribution can be associated to a non-negative integer-valued random measure on such that
[TABLE]
and this random measure will also be referred to as the point process when clear. A point process is called simple if . Intuitively, a simple point process evaluated on a Borel set counts the number of points contained in of the designated random configuration.
Now, for , consider the measure on such that for disjoint Borel sets ,
[TABLE]
Assuming that is absolutely continuous with respect to , we define the -point correlation function of to be the Radon-Nykodym derivative of with respect to . This is a locally integrable function such that, for measurable functions , we have
[TABLE]
Here, is a random configuration with law . One might note that our definition of does not specify its value on points where for some . On such points, we set ; to understand the reasoning behind this, see [AGZ10, Remark 4.2.4]. We call a Pfaffian point process if there exists a skew-symmetric matrix-kernel such that
[TABLE]
where denotes the Pfaffian.
The GOE point process is the simple Pfaffian point process with correlation kernel , whose explicit form can be found, for instance, in [BBCW18, Definition 6.1] (we will not need the explicit form of here). The GOE point process can be constructed as the limiting point process of the largest eigenvalues of the GOE ensemble under so-called edge scaling, that is, centering by and scaling by . We write to denote the associated random measure and to denote the correlation function of the GOE point process. We also write to denote the random configuration of GOE points.
Proposition 1.3 and the work achieved in Section 2.1 show that studying the GOE point process can serve as a proxy for studying the lower tail of the half-space KPZ equation. Theorem 1.6 establishes a basic statistic of the GOE point process: its expectation on the interval , for any . We now prove this theorem.
Proof of Theorem 1.6.
Note that for any point process with one-point correlation function , we have on any interval ,
[TABLE]
Thus, we have
[TABLE]
for . Let denote the one-point correlation function for . From Equations and of [For10], we have the relation444[For10, Equation 7.147] writes this equation with “” instead of , as we have here, where is defined in [For10, Equation 7.12]. Our expression follows from [For10, Equation 7.67], which shows that , for any .
[TABLE]
where denotes the Airy function. Since ([Nis, Equation 9.10.11]), we may write (3.3) as
[TABLE]
Now, [For10, Equation 7.69], [Nis, Equation 9.7.9], and [Nis, Equation 9.10.6] yield the following asymptotic expansions for , , and respectively, as :
[TABLE]
Substituting (3.5)–(3.7) into (3.4) yields
[TABLE]
as (note that the cosine terms above cancel with one another after substitution into (3.4)). It follows that
[TABLE]
where satisfies .
Next, because , , and are bounded over , we have
[TABLE]
for some constant .
It remains to handle the integral of over . [For10, Equation 7.72] states that
[TABLE]
and thus we have , for some constant . Recall that for . It then follows from (3.4) and the triangle inequality that
[TABLE]
Since , ([Nis, Equation 9.10.11]), and for , we have for all . It then follows from (3.10) and the identity that
[TABLE]
for some constant . Combining equations (3.2), (3.8), (3.9), and (3.11) yields
[TABLE]
where , and therefore clearly satisfies . Thus, we have (1.16). ∎
3.2. The stochastic Airy operator
We now apply and enhance the tools developed in [CG20, Section 4.3] to connect the GOE point process with the eigenvalues of the stochastic Airy operator with . Observed in [ES07] and proved in [RRV11, Theorem 1.1], Proposition 3.2 gives an equivalence in distribution between the eigenvalues of and the negatives of the GOE points. Proposition 3.3 below was proved in [CG20, Proposition 4.5], and establishes a uniform bound on the deviations of the (random) eigenvalues from the eigenvalues of the (deterministic) Airy operator, and Theorem 1.5 establishes the same uniform bound on deviations of the GOE points from these deterministic eigenvalues. Finally, Proposition 3.4, which was proved in [MT59], approximates the location of each eigenvalue of the Airy operator.
We now define the stochastic Airy operator through the theory of Schwartz distributions.
Definition 3.1** (stochastic Airy operator).**
Let denote the space of distributions, i.e., the continuous dual of the space of smooth, compactly supported test functions equipped with the topology of uniform convergence of all derivatives on compact sets. All formal derivatives of any continuous function are distributions, with action on any test function given by integration by parts as follows:
[TABLE]
where is notation not to be confused with the inner product . In particular, since Brownian motion is a random continuous function, its formal derivative is a random element of . The stochastic Airy operator is a random linear map
[TABLE]
such that
[TABLE]
where is the space of functions such that for any compact , . Though is only closed under multiplication by smooth functions and , we make sense of as the derivative of . The Airy operator is the non-random part of .
To define the eigenvalues/eigenfunctions of , we define the Hilbert space with norm
[TABLE]
We say a pair is an eigenfunction/eigenvalue pair for if .
The following is a special case of [RRV11, Theorem 1.1], namely, the case.555The result is proved for any : under edge scaling, the largest eigenvalues of the Hermite -ensemble converge jointly in distribution to the smallest eigenvalues of as .
Proposition 3.2** ([RRV11, Theorem 1.1]).**
Let denote the eigenvalues of , and recall that denotes the GOE point process. Then for any , we have
[TABLE]
[RRV11] and [Vir14] show that there exists a random band with uniform width around each eigenvalue of the Airy operator such that each eigenvalue of is contained in the band around the corresponding Airy operator eigenvalue.
Proposition 3.3** ([CG20, Proposition 4.5]).**
Denote the eigenvalues of the Airy operator by and the eigenvalues of by . For any , define the random variable as the smallest real number such that for all ,
[TABLE]
Then for all , there exist positive constants , and such that for all ,
[TABLE]
Proposition 3.3 gives an exponential upper-tail bound on that will be crucial to our proof of Theorem 1.12. Note that Theorem 1.5 follows immediately from Propositions 3.2 and 3.3.
To prove Theorem 1.12, we will also need the following results on the approximate location of eigenvalues of the Airy operator .
Proposition 3.4** ([MT59]).**
If the eigenvalues of the Airy operator are denoted by , then for all , we have
[TABLE]
where for some large constant , we have
[TABLE]
Corollary 3.5**.**
For any , define . We have
[TABLE]
where ; thus,
[TABLE]
Proof.
From (3.15), it is clear that , where satisfies
[TABLE]
Solving for gives
[TABLE]
Recall from Proposition 3.4 that . As approaches , we have , and thus will simply be the the closest integer to . From the expression given by Theorem 1.6, the corollary follows. ∎
4. The cumulant generating function for
The proof of Theorem 1.11, which makes up the contents of Section 5, will boil down to estimating the cumulant generating function for ,
[TABLE]
The main result of this section is Theorem 4.4, which connects to the distribution function of the largest eigenvalue of the thinned GOE point process via a Fredholm Pfaffian. Theorem 4.4 is a major input towards Corollary 5.1 and Theorem 1.10, which provide the needed bounds on to prove Theorem 1.11 in Section 5.
4.1. The thinned GOE point process and the Painlevé II equation
Theorem 4.4 equates to the distribution function of the largest particle of the thinned GOE point process with parameter . This is the point process obtained by independently removing each particle of the GOE point process (see Section 3) with probability . We may similarly define the thinned GUE point process and the distribution function of the largest particle of the thinned GUE point process with parameter . Note that, like the GOE point process, the thinned GOE point process is simple and Pfaffian. To see that it is Pfaffian, let be a sequence of i.i.d. Bernoulli random variables such that . Let and be the laws on associated to the GOE and thinned GOE point processes respectively, and let and be random configurations with laws and respectively. Then, for a measurable function , we have
[TABLE]
where the last equality follows from the independence of the from each other and from the GOE point process. We then have from (3.1) that, for any ,
[TABLE]
where denotes the correlation functions for the thinned GOE point process. Furthermore, it follows that the correlation kernel for the thinned GOE point process is .
Proposition 4.1 below gives a formula for in terms of and a certain integral of the Ablowitz-Segur (AS) solution to the Painlevé II equation. Recall from Section 1.3 that is a one-parameter family of solutions to
[TABLE]
with boundary coundition
[TABLE]
Proposition 4.1 comes from [BB18, Proposition 1.1], though in [BB18, Remark 1.2], the authors note that the formula can be obtained via some combination of results in [BdCP09].
Proposition 4.1** ([BB18]).**
For any and , we have
[TABLE]
and
[TABLE]
where , and are defined as in the statement of Theorem 1.7.
Let be the cumulant generating function of the GUE point process. One of the major technical achievements of [CG20] is given below as Proposition 4.2, which bounds by equating it to and then using the connection to the Painlevé II equation given by (4.1) to conduct a fine analysis.
Proposition 4.2** ([CG20, Theorem 1.7]).**
For all and in , we have
[TABLE]
where . Furthermore, for any fixed , as goes to ,
[TABLE]
4.2. Fredholm Pfaffians
The Fredholm Pfaffian was first defined in [Rai00]; the definition reproduced below comes from [BBCS18].
Definition 4.3**.**
Let be a reference measure on , and let be a matrix-valued skew-symmetric kernel on . Define
[TABLE]
Then the Fredholm Pfaffian of is defined by the series expansion
[TABLE]
provided that the series converges.
Let the measure on be a Pfaffian point process on with matrix kernel , and let denote a random configuration with law (see Section 3.1 for definitions of these objects). For any measurable function , [Rai00, Theorem 8.2] gives the identity
[TABLE]
whenever both sides converge absolutely. This identity can be applied to obtain a Fredholm Pfaffian representation for . Consider the GOE point process, which we recall is a Pfafian point process on , where denotes the Lebesgue measure. Recall also that we write to denote the random configuration of GOE points. For any and , taking in (4.6) yields
[TABLE]
provided that the right-hand side above converges absolutely. The absolute convergence is shown in the proof of Theorem 4.4 below.
Theorem 4.4**.**
Let denote the distribution function of the largest particle of the thinned GOE point process with parameter , where and . Then we have
[TABLE]
where denotes the Lebesgue measure.
Proof.
We begin by demonstrating the absolute convergence of the right-hand side of (4.7), which may be expanded as
[TABLE]
Observe that since , . This along with the bound on \big{|}\mathrm{Pf}\left(K^{\mathrm{GOE}}(x_{i},x_{j})\right)_{i,j=1}^{k}\big{|} given in [Lin20, Proposition 4.1(i)] allows us to compute
[TABLE]
where is a positive constant, is a positive constant depending only on , and the above sum converges due to Stirling’s formula. This establishes the Fredholm Pfaffian representation (4.7) of .
Let us return to the expansion of the Fredholm Pfaffian in (4.9). From the definition of , we see that scaling every entry of the matrix by some constant and taking the Pfaffian is equivalent to , where is a matrix. Thus, from (4.9), we find
[TABLE]
Now, recall from the first paragraph of Section 4.1 that the thinned GOE point process is Pfaffian with correlation kernel . Thus, the gap probability for the thinned GOE point process is
[TABLE]
Substituting this into (4.11) yields (4.8) . ∎
4.3. Proofs of Theorems 1.7 and 1.10
We are now ready to prove Theorem 1.7. Assuming Lemma 1.9, we will then be able to prove Theorem 1.10 as well. Lemma 1.9 is proved in Section 4.4 below.
Proof of Theorem 1.7.
Equation (1.20) follows immediately from (4.2), Proposition 4.2, and Theorem 4.4. ∎
Proof of Theorem 1.10.
Fix any . Take to be (so that and is equal to ) in (1.20) . This yields
[TABLE]
Equation (4.4) gives the following bound as :
[TABLE]
Since and , the second term on the right-hand side of (4.12) may be crudely bounded above as by
[TABLE]
for some positive constants and (independent of and ). From Lemma 1.9 and the above display, we find that as ,
[TABLE]
Substituting the bounds given by (4.13) and (4.14) into (4.12) yields (1.31). ∎
4.4. Proof of Lemma 1.9
The proof of Lemma 1.9 is given at the end of this subsection.
Throughout this subsection, as in the statement of Lemma 1.9, we take fixed. The parameter is taken to be positive, and we define and as in (1.22). Note that . For some fixed constants and to be specified later, we will consider upper bounds on over each of the following intervals of :
- (1)
. 2. (2)
\big{(}\!\!-\!(\tfrac{2\sqrt{2}}{3}-\zeta_{0})^{-2/3}s^{1-\frac{2}{3}\delta},-(\tfrac{2\sqrt{2}}{3})^{-2/3}s^{1-\frac{2}{3}\delta}\big{)}=:\mathbf{I}_{0} 3. (3)
\big{[}\!-\!(\frac{2\sqrt{2}}{3})^{-2/3}s^{1-\frac{2}{3}\delta},-x_{0}\big{)} 4. (4)
,
Consider (where was defined for general in (1.24)). The interval corresponds to , which we recall from Section 1.3 is contained in the regular Boutroux region . [Bot17, Theorem 1.10] gives an expansion for (for general and such that ) in terms of Jacobi theta functions and elliptic integrals. In [CG20, Section 6], the authors manipulate the formula from [Bot17, Theorem 1.10] into a form that is more amenable to obtaining the estimates that they seek. In our case, we only seek crude upper bounds on , for which [Bot17, Theorem 1.10] and the work of [CG20, Section 6] can be combined to obtain an upper bound of order on uniformly over .
Lemma 4.5**.**
For some constant , there exists constants and such that for all and for all , we have
[TABLE]
Proof.
In what follows, we rely heavily on the notation set forth at the start of [CG20, Section 6.1]— since this notation is used only in the present proof, which is rather short, we do not redefine their notation here. From equations and of [CG20]666While [CG20, Proposition 6.1] is stated for , it is written in a footnote that the result holds for all , simply because [Bot17, Equation 1.26] holds for this wider range of , and [CG20, Equation 6.1,6.2] is a reformulation of [Bot17, Equations 1.25, 1.26]. (which is a reformulation of Equations and of [Bot17]), we see that it suffices to find appropriate bounds on
[TABLE]
where we define . It follows from [CG20, Equations 6.3, 6.4] that is bounded uniformly over bounded regions of , and so is bounded uniformly over .
Next, [CG20, Equation 6.9] implies that there exist and such that for all ,
[TABLE]
It is shown in the proof of Lemma 6.3 of [CG20] that goes to zero as goes to zero, and so there exists sufficiently close to such that for all , we have . Then from (4.17), we have
[TABLE]
for some . Thus, both terms in (4.16) are bounded uniformly over . Equation (4.15) then follows from [CG20, Proposition 6.1]. ∎
Taking as in Lemma 4.5, it follows from (4.15) that
[TABLE]
for some positive constant .
Interval corresponds to in the Stokes region , defined in Section 1.3. Since has length of order , equation (1.27) of Conjecture 1 implies that
[TABLE]
Interval corresponds to , which we recall from Section 1.3 is contained in the Hastings-McLeod region . Over this region, we have [Bot17, Theorem 1.12], reformulated below as Proposition 4.6.
Proposition 4.6** **([Bot17, Theorem 1.12]777It may be helpful to match the notation of [Bot17] with ours.
We have taken the parameter of [Bot17] to be [math]. For any , the function of [Bot17] is equal to in the special case , as stated in [Bot17, Remark 1.6]. The quantity of [Bot17] is defined as , which is equal to in our case. The parameter of [Bot17] is also written here as . The parameter of [Bot17] is defined in [Bot17, Equation 1.21] as , which, for , matches our definition of .).
There exist positive constants , , and such that for all , , and , we have
[TABLE]
where .
Take in Proposition 4.6 so that (where was defined at the start of this subsection), and let be as in the proposition. Consider such that and . Then for any and in interval (3) (equivalently, ), we have and . Thus, the hypotheses of the proposition are satisfied, and so there exists a constant (independent of the choice of ) such that . Thus, there exists a constant such that
[TABLE]
Finally, consider interval . For any fixed , the integral of over in interval evaluates to a constant due to the exponential decay in (1.19). That is, there exists a positive constant such that
[TABLE]
We are now ready to prove Lemma 1.9.
Proof of Lemma 1.9.
Equation (1.29) follows immediately from (4.18), (4.21), and (4.22). Equation (1.30) follows from the additional input (4.19). ∎
5. Proof of Theorem 1.11
The proof of Theorem 1.11 was sketched in Section 1.2, starting from (1.17). Here, we give a complete proof. The following corollary follows from Theorem 4.4 and a less precise formulation of [BB18, Theorem 1.4], which states that is given by the right-hand side of (5.1) (and thus, by Theorem 4.4, the same is true for ).
Corollary 5.1** ([BB18, Theorem 1.4]).**
Fix and define . There exist positive constants such that for all , we have
[TABLE]
Proof of Theorem 1.11.
Fix , , and . For brevity, we write to denote the event
[TABLE]
For any , taking in Markov’s inequality gives the upper-bound
[TABLE]
where (5.2) follows from the substitution of (1.16). Taking and substituting (5.1) into (5.2) yields
[TABLE]
where the last inequality holds for all sufficiently large (depending on and ). Thus, we have (1.32).
Now, assume Conjecture 1. Then taking in (5.2) gives
[TABLE]
Substituting the bound of Theorem 1.10 into the above yields equation (1.33). ∎
6. Proof of Theorem 1.12
We now prove Theorem 1.12. Our method of proof necessarily differs from the GUE case of [CG20], which benefits from the Airy kernel being a locally admissible and good trace-class operator (see [AGZ10, Section 4.2]). For such kernels, on any compact set , the point process can be expressed as the following sum:
[TABLE]
where the are independent Bernoulli random variables satisfying . Here, are the eigenvalues of the operator . An application of Bennet’s concentration inequality yields the desired upper large deviations bound on .
Pfaffian point processes possess matrix-valued kernels (see Section 3), and while [Kar14] describes a such class of kernels whose corresponding Pfaffian point processes can be expressed as a sum of Bernoulli random variables, no such result is known for the GOE point process. Instead, we estimate on intervals by carefully analyzing the closest GOE points to the boundary of the interval. The result is the exponential upper bound (1.34), which suffices to establish (2.10), which in turn gives the lower bound (1.11) on the half-space KPZ tail.
Proof of Theorem 1.12.
Throughout this proof, we write for brevity. Fix and . In what follows, we will write to denote a positive constant depending only on the parameter whose value may change from line to line. We first consider for .
As usual, let denote the GOE point process, and let denote the eigenvalues of the Airy operator. Define
[TABLE]
Note that . Theorem 1.6 gives us
[TABLE]
where ; note that is bounded in and . By Taylor’s theorem, we have
[TABLE]
where . By Corollary 3.5, we have
[TABLE]
where is bounded in and . Define the positive constant
[TABLE]
which is bounded above uniformly in , and satisfies
[TABLE]
Then substituting (6.2) and (6.3) into (6.1) yields
[TABLE]
where is bounded in and . The above display along with the relation gives
[TABLE]
It follows that the event is contained in the event
[TABLE]
The next two claims provide an upper-bound on each of the events in the above union.
Claim 6.1**.**
There exist positive constants , , and such that for all , we have
[TABLE]
Proof of Claim 6.1.
Since , Theorem 1.5 yields
[TABLE]
for any . Let . Since if and only if , the previous display gives us
[TABLE]
for any . Corollary 3.5 allows us to write
[TABLE]
where . Then, from Proposition 3.4 and the definition of , we compute
[TABLE]
where is bounded in and . Since the function is an increasing function in , (6.11) gives us
[TABLE]
for all (and recall that we have fixed ). Substituting (6.12) into (6.8), we find
[TABLE]
We now show that there exists some such that k\Big{(}(1-\varepsilon)\Big{(}1+\frac{\mathfrak{c}_{k}}{4}\Big{)}^{2/3}-1\Big{)} can be bounded below by a positive constant uniformly in . Define
[TABLE]
It is clear that from (6.4) that for any fixed , there exists such that . Thus, we need only consider arbitrarily large. We show that there exists a positive constant such that for all , there exists such that . Towards this end, using (6.4), we find the lower-bound
[TABLE]
That is trivial. Thus, it suffices to show that there exists a positive constant such that
[TABLE]
for all (for then it will follow that there exists such that , for all ). Let be large enough such that for all . Then, by Taylor’s theorem, we have
[TABLE]
where the last inequality holds for large enough and all (and the on the right-most side differs from the other ). Now, choose large enough such that, for all , we have . Then, from (6.16), it follows that (6.15) holds. Thus, we may take
[TABLE]
which depends only on .
Now, let and be such that . Thus, from (6.13), we have
[TABLE]
Equation (6.17) and Theorem 1.5 then give the final result: there exist positive constants and such that for all , we have
[TABLE]
This concludes the proof of Claim 6.1. ∎
Claim 6.2**.**
For any , there exists a positive constant such that for all , we have
[TABLE]
Proof of Claim 6.2.
Fix . Let the left-hand side of (6.18) be denoted by . By definition of , we have . Corollary 3.5 gives the expression
[TABLE]
where is bounded in and . This expression allows us to write as
[TABLE]
From equations (6.9), (6.10), and (6.2), we may write
[TABLE]
where is bounded in and . The above along with (6.4) yield the bound
[TABLE]
where is bounded in and and is a positive constant; and the last inequality holds for all , where is sufficiently large. Substituting (6.20) into the right-hand side of (6.19) yields
[TABLE]
We may now apply equation (1.32) of Theorem 1.11: in the notation of this theorem, we take to be , to be , and to be the same here. Then there exists a positive constant such that for all , we have as desired. This concludes the proof of Claim 6.2. ∎
We are now ready to conclude the proof of Theorem 1.12. Define
[TABLE]
From (6.6), we have
[TABLE]
Substituting the bounds obtained in (6.7) and (6.18) gives
[TABLE]
where the first inequality holds for any fixed and all , where is greater than or equal to . Fixing , the second inequality above holds for a (possibly larger) and another positive constant . This concludes the proof of the result for .
Now, if , take defined as in the case. Then (6.5) holds with , i.e., we have
[TABLE]
Then (6.7) finishes the proof for the case. ∎
7. Proof of Proposition 2.2
In this section, we prove Proposition 2.2, thus completing our proof of Theorem 1.4. Here, we follow closely the method of [CG20, Section 5]; indeed, many of the computations done there are adapted here to our case.
Before proceeding, we recall a result describing the tail behavior of , which follows the GOE Tracy-Widom distribution (see [TW96]). The following proposition is a much simplified version of a result of [BBD08], where the authors extract precise asymptotics up to the third order (prior, the asymptotic behavior had been known by studying the asymptotics of the solutions of the Painlevé II equation).
Proposition 7.1** ([BBD08]).**
Let denote the top particle in the GOE point process. Then
[TABLE]
7.1. Proof of the upper bound, equations (2.11) and (2.12)
Recall that we defined in (2.9)
[TABLE]
We will establish an upper bound on by deriving a lower bound on . To this end, we denote , where we write for any .
Lemma 7.2**.**
Fix . Define . There exist positive constants and such that for all and for all ,
[TABLE]
Proof.
We compute
[TABLE]
where the inequality comes from the fact that is a monotonically increasing function. We now divide the sum on the right-hand side of (7.3) into three ranges: , and , where we define
[TABLE]
Here, we recall from Proposition 3.4, and note that . Note further that does not depend on our choice of , but does, and so we can choose large enough so that . Thus, we take large enough such that for all , we have . The following two claims establish appropriate lower-bounds on the sum of over the first two ranges of .
Claim 7.3**.**
For all ,
[TABLE]
Proof of Claim 7.3.
Note that for any , we have . It follows that . Using this and the fact that the increase in , we have
[TABLE]
From Proposition 3.4,
[TABLE]
Since , (7.5) follows. This concludes the proof of Claim 7.3. ∎
Claim 7.4**.**
There exists a positive constant such that for all ,
[TABLE]
Proof of Claim 7.4.
Using similar bounds as in (7.6), along with the fact that for all , we find
[TABLE]
We now bound the following sum with an integral, as the summands are decreasing in :
[TABLE]
Note that , and thus for , we have
[TABLE]
Substituting this bound into (7.9) and then substituting into (7.8) leads to (7.7). This concludes the proof of Claim 7.4. ∎
Returning to the proof of Lemma 7.2, we substitute the bounds given by (7.5), (7.7), and into (7.3) to obtain
[TABLE]
Recalling , we note that is a constant which can be replaced by a large constant . Finally, for sufficiently large , we have , and thus we may make this replacement in (7.10) to obtain (7.2). This completes the proof of Lemma 7.2. ∎
Proof of (2.11) and (2.12) in Proposition 2.2.
From (7.2), we have
[TABLE]
for all and for all . Note that for sufficiently large, we have
[TABLE]
for all . Define . Then (7.11) and (7.12) yield
[TABLE]
On the other hand, if , then there exists at least one such that . Thus, . It follows that
[TABLE]
We split the indicator function as
[TABLE]
Since for all , we have that when ,
[TABLE]
Substituting (7.15) and (7.16) into (7.14) gives
[TABLE]
Using (7.1), we have
[TABLE]
for some constant and all sufficiently large. Now, taking and using Lemma 7.5, we obtain both (2.11) and (2.12). ∎
Lemma 7.5**.**
Fix , , and . Then there exist positive constants and such that the following holds for all . Divide the interval into segments for . Denote the left and right endpoints of by and respectively. Define , where denote the Airy operator eigenvalues. Then (recalling ), for all , we have
[TABLE]
and, assuming Conjecture 1, we have
[TABLE]
Proof.
If , then
[TABLE]
Corollary 3.5 gives us the following expressions:
[TABLE]
where . It follows from (7.23)–(7.25) that if , then
[TABLE]
where is a constant extracted from the fact that
[TABLE]
It follows that
[TABLE]
Now, for sufficiently large , we have
[TABLE]
for all and for all . Assuming Conjecture 1, we may now apply equation (1.33) of Theorem 1.11: there exist and such that for all ,
[TABLE]
This proves (7.21). Applying (1.32) instead of (1.33) above yields (7.19) (for all , for some .
Towards showing (7.20) and (7.22), assume is large enough so that . We will now show that
[TABLE]
First, choose and assume that . There exists such that . The left boundary point of is , and since , we have . Since , by definition of , we have . Thus, . It follows that
[TABLE]
where the last inequality uses the fact that , and thus . Hence, the distance between and is greater than or equal to , from which it follows that . This establishes (7.28).
Assuming Conjecture 1, we may combine (7.21) and (7.28) to obtain
[TABLE]
For sufficiently large, we can modify the constant to absorb the constant . This establishes (7.22). On the other-hand, from (7.19) and (7.28), we obtain
[TABLE]
for any . For any given , we may choose sufficiently close to [math] and sufficiently large such that
[TABLE]
Thus, we have (7.20). This completes the proof of Lemma 7.5. ∎
7.2. Proof of the lower bound, equation (2.10)
In this section we establish a lower bound on by deriving an upper bound on . The result will lead us to (2.10) of Proposition 2.2, thus completing the proof of Theorem 1.4. We begin with an algebraic inequality from [CG20].
Lemma 7.6** ([CG20, Lemma 5.6]).**
For all and all , we have
[TABLE]
The following lemma gives the needed upper-bound on when (see Claim 7.10).
Lemma 7.7**.**
Fix . There exist positive constants and such that for all , for all , and for all , we have
[TABLE]
where
[TABLE]
Proof.
Recall from (2.9) that is a monotonically increasing function, and recall from (1.14) that , for all . It follows that
[TABLE]
where , , and equal the sum of over all integers in the intervals , and respectively, and we define
[TABLE]
where is defined as in Proposition 3.4. Since the are strictly decreasing in , we have
[TABLE]
for all . Using this and the inequality for any , we obtain
[TABLE]
Terms and are bounded in the following two claims.
Claim 7.8**.**
For all , we have
[TABLE]
Proof of Claim 7.8.
Recall the constant , defined in (7.4). It follows that for , we have
[TABLE]
Combining this with Proposition 3.4, we find
[TABLE]
Using this, the inequality for any , and the monotonicity of , we obtain
[TABLE]
where
[TABLE]
Since is a monotonically decreasing function of , we may bound the sum in (7.37) with an integral:
[TABLE]
We now compute
[TABLE]
and
[TABLE]
Substituting the bounds from (7.39) and (7.40) into (7.38) yields the upper bound on in (7.35). This completes the proof of Claim 7.8. ∎
Claim 7.9**.**
There exists a positive constant such that for all , we have
[TABLE]
Proof of Claim 7.9.
Using the inequality for all , we obtain
[TABLE]
Recalling the lower bound on from (7.36) and the definition of from (7.37), we find
[TABLE]
For all , we have
[TABLE]
Since is a monotonically decreasing function, we have for all . Thus, for all , sufficiently large, and for all , we may write
[TABLE]
where the last inequality uses (7.31) with
[TABLE]
( need only be large enough so that and as above satisfy the conditions of Lemma 7.6 for all ). It follows from (7.44) and that
[TABLE]
for sufficiently large and for all . From (7.43) and the above, we find that for sufficiently large and all ,
[TABLE]
This completes the proof of (7.41) of Claim 7.9. ∎
We now return to the proof of Lemma 7.7. Define the bounded, positive constant
[TABLE]
Then substituting the bounds given by (7.34), (7.35), and (7.41) into (7.33) yields
[TABLE]
Now,
[TABLE]
Taking yields (7.32). ∎
Proof of (2.10) of Proposition 2.2.
In what follows, we fix , , and . We begin with two claims.
Claim 7.10**.**
There exist and such that, for all and ,
[TABLE]
Proof of Claim 7.10.
Negating both sides of (7.32) and then exponentiating yields
[TABLE]
Since is monotonically increasing, we may bound
[TABLE]
Take large enough so that for all ,
[TABLE]
From Theorem 1.5, there exist and a (potentially larger) such that. for all ,
[TABLE]
Furthermore, for large enough , we find from (7.1) that for all ,
[TABLE]
Thus, for large enough , we have
[TABLE]
Plugging this and (7.52) into (7.51) yields equation (7.50) of Claim 7.10. ∎
Claim 7.11**.**
There exist constants and such that for all , we have
[TABLE]
Proof of Claim 7.11.
Define the parameter , and note that . Let denote the interval . We seek an upper bound first on and then on . Since is monotonically increasing, we obtain the following upper bound by replacing all the ’s inside the interval by the right endpoint of the interval:
[TABLE]
Next, using Theorem 1.12, there exists and such that for all , we have
[TABLE]
holds with probability greater than or equal to . In what follows, we will write to denote a positive constant independent of and (but may depend on ) whose value may change from line to line. Then from Theorem 1.6, we have for large enough
[TABLE]
Substituting this into (7.55), we may deduce that
[TABLE]
holds with probability greater than or equal to .
It remains to bound the sum , which we now decompose into two sums:
[TABLE]
Using the bound for all gives
[TABLE]
for , large enough, and all . Corollary 3.5 shows
[TABLE]
Thus, for large enough , we have
[TABLE]
We now bound . From monotonicity and (1.14), we have , where is as defined in Theorem 1.5. We now employ Theorem 1.5, taking and as our variables instead of the and in the notation of the theorem to avoid confusion (though we take the in the statement of Theorem 1.5 to be the same as our here). With and , Theorem 1.5 implies that there exist and such that for all , we have
[TABLE]
Now, for large enough , we have . Since in , we have for large enough
[TABLE]
The bounds in (7.60), (7.61), and (7.67) of Claim 7.12 (given below), as well as the bound , we find that for large enough,
[TABLE]
Combining this bound with the bound in (7.57) yields
[TABLE]
where . We then obtain
[TABLE]
We finally estimate, for a constant and for large enough ,
[TABLE]
where the first inequality uses for any events and , and the second inequality uses (7.1) and the lower bound in (7.63). Substituting (7.65) into (7.64) yields (7.53). This concludes the proof of Claim 7.11. ∎
We may now complete the proof of (2.10) of Proposition 2.2 by substituting (7.50) and (7.53) into
[TABLE]
∎
Claim 7.12**.**
Fix , and . There exists a positive constant such that for all , we have
[TABLE]
Proof.
For sufficiently large , (3.15) implies that
[TABLE]
This gives
[TABLE]
To simplify the calculations that follow, we denote and . Note that for , we have for sufficiently large . We then use the fact that, for , we have . This is the bound we take on for .
For , we recall the inequality for , which gives
[TABLE]
Define and , and note that for . Then Taylor’s theorem yields
[TABLE]
Now, substituting the bound given in (7.71) into (7.70) yields
[TABLE]
From this bound, we have
[TABLE]
where the second-to-last inequality follows by bounding the sum with an integral. This gives the claim. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ACQ 11] G. Amir, I. Corwin, and J. Quastel. Probability distribution of the free energy of the continuum directed random polymer in 1 + 1 1 1 1+1 dimensions. Commun. Pure Appl. Math. , 64, 2011.
- 2[AGZ 10] G. W. Anderson, A. Guionnet, and O. Zeitouni. An Introduction to Random Matrices , volume 118. Cambridge Studies in Advanced Mathematics, 2010.
- 3[AS 77a] M. J. Ablowitz and H. Segur. Asymptotic solutions of the Korteweg-de Vries equation. Studies in Appl. Math. , 57:13–44, 1977.
- 4[AS 77b] M. J. Ablowitz and H. Segur. Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. , 38:1103–1106, 1977.
- 5[BB 18] T. Bothner and R. Buckingham. Large deformations of the Tracy-Widom distribution I. Non-oscillatory asymptotics. Commun. Math. Phys. , 359:223–263, 2018.
- 6[BBC 16] A. Borodin, A. Bufetov, and I. Corwin. Directed random polymers via nested contour integrals. Ann. Physics , 368:191–247, 2016.
- 7[BBC 20] G. Barraquand, A. Borodin, and I. Corwin. Half-space Macdonald processes. Forum of Mathematics, Pi , 8:E 11, 2020.
- 8[BBCS 18] J. Baik, G. Barraquand, I. Corwin, and T. Suidan. Pfaffian Schur processes and last passage percolation in a half-quadrant. Ann. Probab. , 46(6):3015–3089, 2018.
