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.

Continuous and strictly increasing norm distributions for density bridges

Statement

Assume AC. Let P0 have density 0<ρ≤f0≤D<∞ on [0,1], and put F0(t)=∫0tf0. Use a complete real orthonormal wavelet basis, allowing the Haar basis with its finite scaling coordinate, and admissible weights w as in Little-o multiscale coefficient space M0(w). Assume the wavelet geometry and summability conditions of The multiscale primitive map is continuous into C[0,1], and write J:M0(w)→C([0,1]) for its primitive map. Let G be the Borel centered Gaussian bridge random element of A bounded-density Gaussian bridge has a Borel multiscale law, with coefficient covariance Cov⁡(Glk,Gl′k′)=P0[(ψlk−P0ψlk)(ψl′k′−P0ψl′k′)]. Then the distribution functions of ∥G∥M(w) and ∥JG∥∞ are continuous on R and strictly increasing on (0,∞). Both assign probability zero to 0, and take values strictly between 0 and 1 at every positive argument. Consequently, for every u∈(0,1), each has a unique positive finite lower u-quantile q, with CDF value u, and is strictly increasing on an open neighborhood of q.

Facts & Assumptions

Given: AC, the bounded positive density, complete wavelet basis, admissible weights, primitive map and Gaussian bridge in the Statement.

[F1]

The multiscale coefficient space is separable and has vanishing projection tails and The multiscale primitive map is continuous into C[0,1]: M0(w) is separable, finite-level projections converge in its norm, and J is continuous linear into C([0,1]).

[F2]

Logarithmic negative Sobolev spaces for white noise: the basis is complete and orthonormal in L2([0,1]), so its finite orthogonal projections converge in L2.

[F3]

A bounded-density Gaussian bridge has a Borel multiscale law supplies the Borel centered Gaussian law and its finite coefficient covariances. A finite stack of independent Gaussian vectors is jointly Gaussian and Mean and covariance determine Gaussian finite-dimensional laws identify finite Gaussian laws, including singular laws, by means and covariances under AC.

[F4]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique supplies two independent copies of each Borel probability. Finite measures agreeing on a generating pi-system and on the whole space are equal identifies Borel laws from their finite-coordinate laws whenever those coordinates generate the Borel sigma-algebra.

[F5]

Finite and countable subadditivity of measures and Continuity from above when one set has finite measure give the countable null-union rule and continuity of probabilities along decreasing measurable events.

[F6]

Cauchy-Schwarz for random variables controls the difference of second moments when both factors converge in L2.

[F7]

Under AC, standard Brownian motion B exists by Existence of continuous Brownian motion, and put βt=Bt−tB1. The A-page definitions Brownian motion and Gaussian process, finite expectation linearity in Linearity, monotonicity, and the modulus bound for expectation, and Covariance is symmetric and bilinear in finite linear combinations give the direct bridge verification in step 4.2. Use the everywhere-continuous zero-start representative of Brownian reflection principle.

[F8]

Uncorrelated jointly Gaussian blocks are independent: finite jointly Gaussian blocks with zero cross-covariance are independent, including singular blocks.

[F9]

Brownian reflection principle: for a>0 and z≤a, P(max⁡t≤1Bt≥a,B1≤z)=P(B1≥2a−z).

[A1]

The Axiom of Choice: full AC is assumed for [F3], [F4], [F7]–[F9].

Proof

1.1A1F1F3F4givenconstruct

In either E=M0(w) or E=C([0,1]), the Borel sigma-algebra is generated by countably many continuous linear coordinates: the wavelet coordinates in the first case, and evaluations at rational times in the second. Indeed, the norm distance to a fixed point is their countable supremum, with the weights included in the first case; in the second case continuity makes the rational supremum equal the full supremum. Separability then gives a countable base of coordinate-measurable balls. Separability of M0(w) is [F1]; rational polygonal functions give a countable dense family in C([0,1]) by uniform continuity and finite rational approximation. Thus finite-coordinate laws determine Borel laws by [F4]. If X is any centered Borel Gaussian random element in either space and X′ an independent copy, [F3] gives −X=dX and X+X′=d2X: every finite coordinate vector on either side is centered Gaussian with the same covariance.

2.1F4F5step 1.1constructalgebra

For the law μ of such an X, let S be its support, the set of points whose every open neighborhood has positive probability. Its complement is the union of all zero-mass balls in a countable base, hence has measure zero by [F5]; S is closed and nonempty. Symmetry from step 1.1 gives S=−S. The support of X+X′ is S+S‾: independent positive-mass balls around s,t∈S give positive mass to every neighborhood of s+t, proving one inclusion; the other follows because X,X′∈S almost surely, so their sum lies almost surely in the closed set S+S‾. Scaling by 2 is a homeomorphism, so step 1.1 gives 2S=S+S‾. Taking any s∈S and −s∈S shows 0∈2S, hence 0∈S. Now x+0∈S+S‾=2S gives S⊆2S, while x+x∈2S gives 2x∈S and hence 2S⊆S. Therefore 2S=S and S+S‾=S. The set S is additive and symmetric, and division by 2 follows by applying division by 2 twice. It is closed under dyadic rational scalars, and closure gives all real scalars. Thus S is a closed linear subspace.

2.2A1F4F5F7F8F9step 1.1constructalgebra

Put Z=B1 and M=max⁡0≤t≤1βt. Every finite vector of bridge values is jointly Gaussian with Z and has zero cross-covariance, because Cov⁡(Bt−tB1,B1)=t−t=0. By [F8] these finite vectors are independent of Z. The coordinate generation in step 1.1 and finite-measure uniqueness [F4], applied to rectangles and then the generated sigma-algebra, show that the entire bridge path, and hence M, is independent of Z. Write ϕ for the standard-normal density. For c>ε>0, [F9] implies that the measure P(max⁡t≤1Bt<c,Z∈dz) on [−ε,ε] has density ϕ(z)−ϕ(2c−z): subtract the reflected-event measure from the terminal normal measure; the reflected-event CDF in [F9] differentiates to ϕ(2c−z) for z<c. Thus Aε(c):=P(max⁡t≤1Bt<c,∣Z∣≤ε)P(∣Z∣≤ε)=∫−εε[ϕ(z)−ϕ(2c−z)] dz∫−εεϕ(z) dz. For fixed a>0, take 0<ε<a/3. Since ∥B−β∥∞≤ε on {∣Z∣≤ε}, the inclusions with thresholds a−ε and a+ε, together with independence, give Aε(a−ε)≤P(M<a)≤Aε(a+ε). Continuity and positivity of ϕ show that both bounds tend to 1−ϕ(2a)/ϕ(0)=1−e−2a2. Hence P(M<a)=1−e−2a2 for every a>0. By [F5], P(M≤a)=lim⁡k→∞P(M<a+1/k)=1−e−2a2 for a>0, and M≥0 together with the same formula as a↓0 gives P(M=0)=0. Therefore M is atomless.

3.1F3step 2.1givenalgebra

If X has any nondegenerate scalar coordinate, then P(X=0)=0 and S≠{0}. For every r>0, 0∈S gives P(∥X∥<r)>0. A nonzero s∈S can be scaled to have norm greater than r, so some neighborhood of that scaled point lies in {∥X∥>r} and has positive probability. Likewise, for 0<a<b, scale s to have norm (a+b)/2; a sufficiently small ball about it is contained in {a<∥X∥<b} and has positive probability. Consequently its norm CDF is strictly between zero and one at every positive argument and strictly increasing there. This applies to G: any nonconstant wavelet has positive P0-variance, because f0≥ρ makes the P0 and Lebesgue null sets identical and a nonconstant wavelet cannot equal a constant almost everywhere.

4.1F3F5step 3.1givenalgebra

For each nonzero x∈M0(w), its norm is attained by some coordinate: if r=∥x∥M(w)>0, the normalized level maxima are below r/2 after finitely many levels, and the maximum over the remaining finite set equals r. Enumerate all coordinates by j, and write bj>0 for their norm weights: bj=wl on detail level l, and bj=1 for any additional Haar scaling coordinate. Hence, for r>0, {∥G∥M(w)=r} is contained in the countable union of events {∣Gj∣=rbj}. Each has probability zero: a positive-variance normal has a density, and a zero-variance centered normal is zero whereas rbj>0. By [F5] the union is null. At r=0, the nondegenerate coordinate from step 3.1 again gives probability zero; negative values are impossible. Absence of atoms and continuity of probability in [F5] show that this norm CDF is continuous on R.

4.2A1F1F2F3F6F7step 1.1step 3.1givenalgebra

First verify the bridge used in [F7] directly. Every finite linear combination of βtj=Btj−tjB1 is a finite linear combination of Brownian values with time 1 appended, so it is normal by [F7], including repeated times and singular combinations. Finite expectation linearity makes its mean zero. Covariance bilinearity gives Cov⁡(βs,βt)=min⁡(s,t)−ts−st+st=min⁡(s,t)−st for s,t∈[0,1]. On the single continuous zero-start Brownian path event supplied in [F7], subtraction of the continuous function tB1 makes β continuous, with β0=β1=0. Thus it is the needed centered continuous Gaussian bridge, without an example as a logical supplier. Write Y=JG. For every continuous real linear functional L on C([0,1]), L∘J is continuous linear on M0(w), so L(Y) is centered normal by [F3]; thus Y is centered Gaussian. For s∈[0,1], let pN1[0,s] be the orthogonal wavelet projection through level N. Its Lebesgue L2 limit is 1[0,s] by [F2], and f0≤D gives the same convergence in L2(P0). Put UN(s)=J(PNG)(s). The coefficient covariance in [F3] gives Cov⁡(UN(s),UM(t))=P0[(pN1[0,s]−P0pN1[0,s])(pM1[0,t]−P0pM1[0,t])]. In particular UN(s) is Cauchy in L2, and it converges almost surely to Y(s) by [F1]. Its L2 limit therefore equals Y(s) almost surely, since convergence in L2 implies convergence in probability and two probability limits agree. The means are zero; applying [F6] to the product differences passes the covariances to the limit. Thus Y is a centered continuous Gaussian process with covariance F0(s∧t)−F0(s)F0(t). The function F0 is a continuous strictly increasing bijection of [0,1] onto itself. By [F3], Y and t↦βF0(t) from [F7] have the same finite Gaussian laws; step 1.1 then gives equality of their Borel laws on C([0,1]). In particular ∥Y∥∞=d∥β∥∞, and Y has a nondegenerate evaluation coordinate, for example at any s with 0<F0(s)<1. Step 3.1 therefore applies to its norm as well.

5.1F3F5step 4.2step 2.2algebra

By symmetry of the centered Gaussian bridge, −min⁡tβt has the same atomless distribution as M. For r≥0, continuity on a compact interval gives {∥β∥∞=r}⊆{M=r}∪{−min⁡tβt=r}. Both events on the right are null by step 2.2 and symmetry; [F5] gives no atom at r. Negative norm values are impossible. By step 4.2, the CDF of ∥JG∥∞ is therefore continuous on R.

6.1F1F5step 3.1step 4.1step 4.2step 5.1givenalgebra∎

Both norm CDFs are continuous by steps 4.1 and 5.1, vanish at zero, and are strictly increasing on (0,∞) with values strictly between zero and one by steps 3.1 and 4.2. They tend to one at infinity because both random norms are finite almost surely. For each u∈(0,1), continuity therefore gives a positive finite point q with CDF value u, strict increase gives its uniqueness, and monotonicity makes it the lower u-quantile. Any sufficiently small open interval around q is contained in (0,∞), where strict increase holds. These are all the asserted quantile conditions.

Depends on

Used by

Dependency tree · two levels

86 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