Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Positive semidefiniteness of the Brownian covariance kernel

Statement

The kernel C(s,t)=min⁡(s,t) on [0,∞) is symmetric and positive semidefinite: for every integer n≥0, times t1,…,tn≥0, and coefficients a1,…,an∈R, ∑i,j=1naiajmin⁡(ti,tj)≥0.

Facts & Assumptions

Given: A finite time list and coefficient list as in the Statement.

Proof

technique · direct
1.1given

Symmetry is immediate from min⁡(s,t)=min⁡(t,s). If n=0, the displayed quadratic form is the empty sum 0. Now take n≥1, let 0=r0<r1<⋯<rk be the increasing list of the distinct positive values among t1,…,tn, and put Aℓ=∑i:ti≥rℓai. The list is finite and uniquely fixed by the given times; no choice function is used.

2.1step 1.1algebra

For every i,j, min⁡(ti,tj)=∑ℓ=1k(rℓ−rℓ−1)1{ti≥rℓ}1{tj≥rℓ}. Indeed, if the smaller of ti,tj is 0 both sides vanish, while if it is rm the right side telescopes to ∑ℓ=1m(rℓ−rℓ−1)=rm.

3.1step 1.1step 2.1algebra∎

Substituting step 2.1 and rearranging only finite sums gives ∑i,j=1naiajmin⁡(ti,tj)=∑ℓ=1k(rℓ−rℓ−1)(∑i:ti≥rℓai)2=∑ℓ=1k(rℓ−rℓ−1)Aℓ2. Every weight is positive and every square is nonnegative, so the quadratic form is nonnegative. This includes coincident times, zero times, zero coefficients, and the case k=0, where the last sum is empty.

Source notes

Durrett and Sousi use the Brownian covariance kernel in their Gaussian constructions. The standard identity min⁡(s,t)=∫1[0,s]1[0,t] interprets it as a Gram kernel; step 2.1 evaluates that identity as a finite level sum, avoiding an unnecessary measure construction and therefore remaining choice-free.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources