Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Conditional quantile couplings for Gaussian anchored sums

Statement

Assume AC and the hypotheses of Gaussian anchored bounded sums have uniform cumulant and Fourier bounds: S=Z+∑i=1mXi∈Rd, 1≤d≤4, the centered summands are independent, ∣Xi∣≤B, Z is Gaussian with covariance G≥γsId, and cov⁡(S)=sId, where s,B>0 and 0<γ≤1. Put τ=C0B, with C0 from that supplier, and let Φs be the CDF of N(0,s). There are constants cγ>0 and Cγ<∞, independent of the summand laws, m,d,s,B, with the following properties.

For 1≤j≤d, let Hj(x′,y) be the conditional CDF of Sj given S<j=x′∈Rj−1 obtained by dividing the joint prefix density by its marginal density. These densities are strictly positive, so this defines a probability kernel at every x′, including prefixes of probability zero. Its quantile transport Tj(x′,z)=Hj(x′,⋅)−1(Φs(z)) is jointly Borel measurable and takes a fresh N(0,s) variable to that conditional law. If s≥Cγτ2, then, with y=Tj(x′,z), ∣y−z∣≤Cγτ(1+∣x′∣2+y2s)when ∣x′∣+∣y∣≤cγs/τ, and also ∣Tj(x′,z)−z∣≤Cγτ(1+∣x′∣2+z2s)when ∣x′∣+∣z∣≤cγs/τ. For j=1, the prefix is empty and its norm is zero. The resulting successive coordinate transport R sends Nd(0,sId) to the law of S and satisfies ∣R(g)−g∣≤Cγτ(1+∣R(g)∣2s)when ∣R(g)∣≤cγs/τ.

If d=2a with a≤2, write S=(P,D) with P,D∈Ra. The last a successive conditional transports give a jointly measurable Tp taking a fresh E∼Na(0,sIa) to the conditional law of D given P=p, and ∣Tp(e)−e∣≤Cγτ(1+∣p∣2+∣Tp(e)∣2s) when s≥Cγτ2 and ∣p∣,∣Tp(e)∣≤cγs/τ. The Gaussian reference bridge E is independent of its Gaussian parent.

There is also the following scalar unequal-variance form. Let L,R be independent centered scalar sums of independent variables bounded by B and independent Gaussian terms, with variances VL,VR∈[s/2,s], and with Gaussian component variances at least γVL,γVR, respectively. Put W=VL+VR,w=VL/W,v=VLVR/W,P=L+R,D=L−wP. Then W∈[s,2s], w∈[1/3,2/3], v∈[s/4,s/2]. There is a jointly measurable transport taking a fresh N(0,v) variable to D conditional on P=p with ∣Tp(e)−e∣≤Cγτ(1+p2+Tp(e)2s) when s≥Cγτ2 and ∣p∣,∣Tp(e)∣≤cγs/τ. The corresponding root transport from N(0,W) to P obeys the analogous bound with ∣P∣2/s. The reconstructed children are L=wP+D and R=(1−w)P−D.

All these maps are jointly measurable in an additional measurable parameter whenever, on each fixed finite row length, the bounded input laws are probability kernels, their Gaussian covariance and s are measurable functions, and the displayed hypotheses hold parameterwise. This includes countable arrays with different row lengths. No claim here asserts the conditional estimates for raw bounded laws without a positive Gaussian component.

Facts & Assumptions

Given: The centered independent Gaussian anchored sum and its parameters as in the Statement; vector norms are Euclidean, and all constants below depend only on γ.

[A1]

AC is assumed and inherited by the Gaussian suppliers. (The Axiom of Choice)

[F1]

The sum has an analytic cumulant with ∣Kuvv(z)∣≤τs∣u∣∣v∣2, and every real tilt retains an independent Gaussian component with covariance at least γsI. Each coordinate prefix has the same properties. (Gaussian anchored bounded sums have uniform cumulant and Fourier bounds)

[F2]

Every tilted density is positive and continuously differentiable, has supremum at most (2πγs)−d/2, and on the small tilt and moderate deviation region has its Gaussian density times exp⁡(Oγ((τ/s)(1+r3))). Tilted covariance lies between 7sI/8 and 9sI/8. The assertions hold in each prefix's coordinates. (Moderate deviation density bounds for Gaussian anchored sums)

[F3]

Positive definite Gaussian laws have their positive quadratic-form densities, and the standard normal CDF is continuous, strictly increasing, with limits zero and one. (A positive-definite multivariate normal law has its Gaussian density, The standard normal CDF is continuous and strictly increasing)

[F4]

Nonnegative product integration and dominated convergence apply to the integrals below. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Dominated convergence)

[F5]

Integrating a nonnegative product-measurable function against a finite or uniformly sigma-finite kernel gives a measurable function, and finite products of probability kernels are probability kernels. (Measurability of integration against a kernel, Finite products of probability kernels are probability kernels)

Proof

1.1A1F1F2F6givenconstruct

Work with a fixed prefix of length j≤4 and write its dimension as d during the proof. Its law satisfies [F1]–[F2]. Set σ=s, ϵ=τ/σ, and normalize coordinates by σ. Its cumulant f has mean zero, covariance I, and third derivatives bounded by ϵ∣u∣∣v∣2. Polarization and [F6], integrating along a real segment, give ∥f′′(a)−I∥≤ϵ∣a∣ and ∣f′(a)−a∣≤ϵ∣a∣2/2. Fix a prefix x′, put b=x′/σ, δ=∣b∣, and assume ϵδ sufficiently small. The map a′↦b−(∇′f(a′,0)−a′) sends ∣a′∣≤2δ into itself and has Lipschitz constant at most 2ϵδ<1/2. Its iterates from zero have geometrically decreasing consecutive distances, hence converge by [F6] to a solution of ∇′f(a′,0)=b with ∣a′∣≤2δ. For the empty prefix use a′=0. Put a=(a′,0) and let y0=σ∂df(a) be the physical last mean under this prefix tilt. The last mixed covariance row at zero vanishes; integrating its Hessian deviation yields ∣y0∣≤Cτδ2. The physical tilt parameter is h=a/σ, so τ∣h∣≤2ϵδ can be kept below 1/8.

2.1F2F3F4step 1.1algebra

Let p,p′ be the joint and prefix densities. The Gaussian convolution representations in [F2] and [F4] give ∫Rp(x′,y) dy=p′(x′) at every x′: integrate the Gaussian joint density over its last coordinate and then integrate the bounded-summand law. Both densities are everywhere positive. Thus p(x′,y)/p′(x′) defines a probability density for each x′ and, by integration, a version of the conditional kernel. Denote tilted densities by pˉ,pˉ′. Since hd=0, their exponential factors cancel exactly, and the density v of Sd−y0 conditional on S′=x′ is v(u)=p(x′,u+y0)/p′(x′)=pˉ(x′,u+y0)/pˉ′(x′). The centered tilted covariance C satisfies ∥C/s−I∥≤Cϵδ by step 1.1. Apply [F2] to its full density at (0,u) and prefix density at zero. The ratio of the matching Gaussian densities is a centered normal density with variance det⁡C/det⁡C′=1/(C−1)dd=s(1+O(ϵδ)); the determinant identity follows by eliminating the off-diagonal blocks in C. Consequently ∣log⁡v(u)ϕs(u)∣≤Cϵ(1+δ(1+u2s)+∣u∣3s3/2) for ∣u∣≤cs/τ. Here ϕs is the density of N(0,s), and the small constants also ensure all [F2] moderate bounds for the full centered tilt.

3.1F1F2F3F6step 1.1step 2.1algebra

In standardized units set g(t)=σv(σt) and let ϕ be the standard normal density. Step 2.1 implies, on ∣t∣≤c/ϵ, ∣log⁡(g(t)/ϕ(t))∣≤Cϵ(1+δ+δt2+∣t∣3) and hence c1e−C1t2≤g(t)≤C1e−c1t2 after reducing ϵ and ϵδ. There is also a global bound g(t)≤Cexp⁡[−cmin⁡(t2,∣t∣/ϵ)]. Indeed the standardized prefix-tilted law has prefix density at its mean bounded below by a positive constant by [F2]. Tilt its centered full law further by qed, where ∣q∣≤c/ϵ. Its full density is bounded above by a constant by the global part of [F2], while integration of its bounded Hessian gives a centered log mgf at most Cq2. The density tilt identity therefore gives g(t)≤CeCq2−qt at every real t. Choosing q=sign⁡(t)min⁡(∣t∣/(4C),c/(2ϵ)) proves the bound. The combined real tilt remains in a fixed smaller analytic ball, where the Hessian bound from step 1.1 applies; the global density bound in [F2] itself permits every real tilt.

4.1F3step 3.1algebrachoose

We next convert the density estimate into a CDF displacement without a coupling theorem. Write R(t)=ϵ(1+δ+δt+t2) for t≥0. Choose a fixed large T≥10 and then a sufficiently large fixed K. Put r(t)=KR(t) and b=c0/ϵ, with fixed c0 sufficiently small. Reduce the allowed bounds on ϵ and ϵδ so that for T/2≤t≤2b one has 0≤r(t)≤t/8 and 0≤r′(t)≤1/2; this is possible because R′(t)≤2R(t)/t for t≥1 and r(t)/t≤CKϵ(1+δ+t). Also choose 3b within the moderate interval of step 3.1. For t≥T, the maps f±(t)=t±r(t) are increasing and their arguments are comparable with t. Since (log⁡ϕ)′(t)=−t, step 3.1 bounds the logarithmic density error at either perturbed argument by CtR(t), whereas the Gaussian log-density changes by at least a fixed positive multiple of tr(t) in the favorable direction. The log Jacobians are at most r′(t) and at least −2r′(t), respectively. Since r′(t)≤2r(t)/t, first taking T large and then K large gives g(f+(t))f+′(t)≤ϕ(t) and g(f−(t))f−′(t)≥ϕ(t). These comparisons follow by adding the three logarithmic contributions; the Jacobian contribution divided by tr(t) is at most 4/t2, and the density-error contribution is at most C/K.

5.1F3step 3.1step 4.1algebrachoose

The inverse equations and monotonicity of r imply f+−1(z)≥z−r(z) and f−−1(z)≤z+r(2z) in the range below. Substituting u=f+(t) and u=f−(t) in the inequalities of step 4.1 gives, for 2T≤z≤b, ∫zbg(u) du≤∫z−r(z)∞ϕ(u) du,∫zbg(u) du≥∫z+r(2z)bϕ(u) du. Only a smaller range z≤c1/ϵ, with c1≪c0, will be retained, so the lower integral has its endpoints in the stated order. The global tail estimate in step 3.1 and the Gaussian tail give ∫b∞g+∫b∞ϕ≤Ce−cb2: split the first integral at a constant multiple of 1/ϵ and integrate the Gaussian and exponential parts. Enlarge the shifts in the displayed inequalities to 3r(2z). Each extra Gaussian interval has mass at least cR(z)e−Cz2≥cϵe−Cz2. Choose c1 so small that Cc12<cc02/2. For sufficiently small ϵ, uniformly for 2T≤z≤c1/ϵ, that interval mass exceeds the discarded tail, since ϵ−1exp⁡(−(cc02−Cc12)/ϵ2)→0. Thus the full tails have the corresponding inequalities with shift CR(z); here R(2z)≤4R(z). Reflecting g,ϕ proves the negative-tail version as well.

6.1F3step 3.1step 5.1algebrachoose

At z=2T step 5.1 bounds the tail-probability difference by CR(2T). For ∣z∣≤2T, step 3.1 bounds the density-ratio error by Ca, where a=ϵ(1+δ); integrating over this fixed interval gives a CDF difference at most Ca. The Gaussian density is bounded below by a fixed positive constant on [−2T−1,2T+1], so a shift of length Ca in either direction dominates that difference, after reducing the allowed bound on a to keep the shift within this compact interval. Since R(∣z∣)≥a, this proves together with step 5.1, for the standardized conditional CDF Fg, Φ(z−CR(∣z∣))≤Fg(z)≤Φ(z+CR(∣z∣))(∣z∣≤c/ϵ). All constant choices are finite and made in the indicated order; reducing the common cutoff enforces every smallness requirement. Returning to physical units, the CDF Fv of the centered conditional coordinate satisfies Φs(u−ρ(u))≤Fv(u)≤Φs(u+ρ(u)), where ρ(u)=Cτ(1+δ(1+∣u∣/σ)+u2/s).

7.1F3step 1.1step 2.1step 6.1algebra

Every conditional density is positive and continuous by step 2.1, so its CDF is continuous, strictly increasing and has limits zero and one. Its inverse on (0,1) is therefore unique. For a fresh N(0,s) variable Z, [F3] implies that Φs(Z) is uniform: for 0<u<1, the event Φs(Z)≤u is Z≤Φs−1(u), of probability u. Thus the inverse-CDF map has the asserted conditional law. If Y=Tj(x′,Z) and U=Y−y0, then Fv(U)=Φs(Z). Step 6.1 and strict monotonicity imply ∣U−Z∣≤ρ(U) whenever U is moderate. Step 1.1 gives ∣y0∣/σ≤Cϵδ2≤Ccδ, so ∣x′∣+∣Y∣≤cs/τ implies the required moderate bounds on U and δ. The inequalities 2δ∣U∣/σ≤δ2+U2/s and δ≤1+δ2 now give ∣Y−Z∣≤Cτ(1+(∣x′∣2+Y2)/s).

8.1F3step 1.1step 6.1algebrachoose

The bound in Gaussian rather than target values follows by bracketing, not by substituting Z for Y in step 7.1. In standardized units fix a Gaussian coordinate z and put A=1+δ2+z2, L=K1ϵA, with fixed large K1. If ϵδ and ϵ∣z∣ are small enough, z±L remain in the moderate region and the standardized version of ρ(z±L) is at most L/2. Indeed ρ(t)≤Cϵ(1+δ2+t2) and (z±L)2≤2z2+2L2; the extra CϵL2 is absorbed into L because ϵ2A is small. Step 6.1 therefore gives Fg(z−L)<Φ(z)<Fg(z+L), so its inverse at Φ(z) lies in [z−L,z+L]. Adding the shift y0 from step 1.1 and restoring units gives ∣Tj(x′,Z)−Z∣≤Cτ(1+(∣x′∣2+Z2)/s) under the stated Gaussian-value cutoff.

8.2F3F5F7step 2.1step 7.1algebra

The maps just constructed are jointly measurable, also under the additional parameter in the Statement. On each fixed row length the product of the bounded input-law kernels exists by [F5]. The Gaussian density is jointly Borel in its positive definite covariance and its argument: its determinant and inverse are continuous functions of the matrix entries by their polynomial and cofactor formulas. Consequently pθ(x)=∫qGθ(x−∑iti) ⨂iKi(θ,dti) is jointly measurable by [F5], as are the prefix densities, their positive ratios and their CDF integrals. Lebesgue integration here uses its common exhaustion by bounded intervals. The conditional inverse can be written inf⁡{r∈Q:Hj,θ(x′,r)≥u}; by [F7] this equals the continuous strictly increasing inverse and is jointly measurable, since strict sublevel sets are countable unions of measurable sets indexed by r∈Q. Compose with the continuous Φs(z)=Φ(z/s). Different finite row lengths are handled on their countable measurable disjoint union. This constructs the kernel versions explicitly at every prefix.

9.1F3F4step 7.1step 8.2algebra

Starting with independent Gaussian coordinates of variance s, apply the conditional maps successively to coordinates 1,…,d. Conditional integration of the densities in step 2.1 shows inductively that the first j constructed coordinates have density pj; their joint density is the product of the successive density ratios, which telescopes to pj. The full map R therefore has the law of S. On ∣R(g)∣≤cs/τ, every coordinate and prefix meets the target-value cutoff in step 7.1 after reducing c by a fixed factor. Summing at most four coordinate bounds gives ∣R(g)−g∣≤Cτ(1+∣R(g)∣2/s). For S=(P,D) apply only its last a conditional maps with the specified prefix P=p and fresh independent Gaussian coordinates; the same telescoping gives the conditional law of D and the same coordinate estimates give ∣Tp(e)−e∣≤Cτ(1+(∣p∣2+∣Tp(e)∣2)/s). Separate bounds on the two norms imply the joint cutoff by reducing c. The Gaussian reference has covariance sI, so its parent and bridge coordinate blocks are independent by the product Gaussian density in [F3]. Joint measurability follows by composing the maps of step 8.2.

10.1F1F3step 8.2step 9.1algebra∎

For the scalar extension put a=s/W, b=s/v and Q=(aP,bD). Independence gives Var⁡(P)=W, Cov⁡(P,D)=VL−wW=0 and Var⁡(D)=VLVR/W=v, hence cov⁡(Q)=sI2. The stated ranges follow from VL,VR∈[s/2,s]; the function uv/(u+v) is increasing in either positive argument, giving v∈[s/4,s/2]. Thus a∈[1/2,1], b∈[2,2] and w∈[1/3,2/3]. A bounded left increment X contributes (aX,b(1−w)X) to Q, whose norm is at most 2B; a bounded right increment contributes (aX,−bwX) with the same bound. The joint Gaussian component is obtained from independent child Gaussians by the same linear map. Since their variances are at least γVL,γVR, its covariance, by congruence, is at least γcov⁡(Q)=γsI2. Therefore Q satisfies the original hypotheses with bound 2B and parameter 2τ. Apply step 9.1 conditionally on aP=ap, feeding be∼N(0,s), and divide the output by b. The uniform bounds on a,b convert its estimate and its cutoffs into the asserted scalar bridge bound after changing cγ,Cγ by fixed factors. Applying the scalar root construction to aP and rescaling gives the root bound. Finally D=L−wP rearranges to the two stated child formulas. Every coefficient is a continuous function of the positive variances, so the parameter measurability in step 8.2 is preserved. All conclusions follow.

Depends on

Used by

Dependency tree · two levels

119 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources