Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

SSEP empirical-field martingale and bracket

Statement

Assume the Axiom of Choice. Let d≥1, N≥3, T≥0, and let (ηt)0≤t≤T be the SSEP from the diffusive-model definition with any initial probability vector. For a real smooth periodic G:Td→R, set

MtN,G:=⟨πtN,G⟩−⟨π0N,G⟩−∫0t⟨πsN,ΔNG⟩ ds.

Then MN,G is a square-integrable martingale. Its continuous predictable bracket is

AtN,G=N2−2d∫0t∑i=1d∑x∈ΛN(ηx+ei(s)−ηx(s))2(G((x+ei)/N)−G(x/N))2 ds,

in the continuous predictable compensator convention of the finite-chain martingale supplier. In particular,

ATN,G≤TN−d∑i=1d∥∂iG∥∞2.

Facts & Assumptions

Given: The Axiom of Choice, a finite SSEP rate matrix, its uniformized realization, a smooth real periodic G, and a finite horizon T.

[A1]

Assume the Axiom of Choice, meaning every family of nonempty sets has a choice function; the finite-chain martingale supplier requires it (The Axiom of Choice).

[F1]

Symmetric exclusion process under diffusive scaling: ΩN is finite; each occupation-changing unordered nearest-neighbor swap has rate N2. Equal endpoint occupations give no off-diagonal transition and zero observable increment, so generator and squared-jump sums may be extended over all bonds with coefficient N2. Also πtN=N−d∑xηx(t)δx/N and ⟨π,G⟩=N−d∑xηxG(x/N).

[F2]

Martingale and predictable bracket for a finite-state chain: for a finite rate matrix L, bounded f, and its uniformized realization, f(Xt)−f(X0)−∫0tLf(Xs)ds is a square-integrable martingale with continuous predictable bracket ∫0t∑j≠iLij(f(j)−f(i))2 ds along the chain.

Proof

1.1A1F1F2algebra

Put fG(η)=N−d∑xηxG(x/N). For the bond {x,x+ei}, fG(ηx,x+ei)−fG(η)=N−d(ηx+ei−ηx)(G(x/N)−G((x+ei)/N)). Summing its rate-N2 contribution over all x,i and reindexing the terms containing ηx+ei gives LNfG(η)=N−d∑xηxN2∑i[G((x+ei)/N)+G((x−ei)/N)−2G(x/N)]=⟨πN(η),ΔNG⟩. Thus the finite-chain martingale in [F2], applied to fG, is exactly MtN,G and has bracket given by the sum of rates times squared jumps.

2.1F1F2step 1.1algebra∎

A bond with equal endpoint occupations has zero jump; otherwise its squared jump is N−2d(G((x+ei)/N)−G(x/N))2. Substituting these jumps and rate N2 into [F2] gives the displayed bracket. By the fundamental theorem of calculus along the coordinate segment, ∣G((x+ei)/N)−G(x/N)∣≤N−1∥∂iG∥∞, while (ηx+ei−ηx)2≤1. There are Nd bonds in each coordinate direction, so the bracket is increasing, continuous, predictable, and bounded by TN−d∑i∥∂iG∥∞2. The finite state space makes fG bounded, hence [F2] also gives square integrability.

Depends on

Dependency tree · 2 levels

Sources