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 martingale for time-dependent test functions

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. Let H:[0,T]×Td→R be smooth up to the time endpoints, meaning all time and space derivatives used below extend continuously to [0,T]×Td. Define

FsN(η):=N−d∑x∈ΛNηxH(s,x/N),0≤s≤T.

Then

MtN:=FtN(ηt)−F0N(η0)−∫0t⟨πsN,∂sH(s,⋅)+ΔNH(s,⋅)⟩ ds

is a square-integrable martingale, and

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

is a continuous predictable increasing process with (MtN)2−AtN a martingale. In particular,

ATN≤TN−d∑i=1dsup⁡0≤s≤T∥∂iH(s,⋅)∥∞2.

Facts & Assumptions

Given: The Axiom of Choice, the finite SSEP rate matrix and its uniformized realization, a smooth time-dependent periodic test function H, and a finite horizon T.

[A1]

Assume the Axiom of Choice, meaning every family of nonempty sets has a choice function, as required by the finite-chain realization and martingale suppliers (The Axiom of Choice).

[F1]

Symmetric exclusion process under diffusive scaling: the state space is finite, each allowed bond swap has rate N2, and FsN(η)=⟨πN(η),H(s,⋅)⟩.

[F2]

Uniformization constructs every finite-state rate matrix chain: for a finite rate matrix, uniformization has a finite dominating event rate and conditional transition matrices ehL.

[F3]

Martingale and predictable bracket for a finite-state chain: a fixed bounded state function has a generator martingale with compensated squared-jump rate Γf(i)=∑j≠iLij(f(j)−f(i))2.

[F4]

Progressively measurable and predictable processes: the predictable sigma-algebra is generated by rectangles (a,b]×B with B∈Fa and time-zero sets; a continuous adapted process is predictable by its left-step approximations.

Proof

1.1F1algebra

For fixed s, reindexing the bond sum as in the model generator gives LNFsN(η)=⟨πN(η),ΔNH(s,⋅)⟩; also ∂sFsN(η)=⟨πN(η),∂sH(s,⋅)⟩. Hence the compensating drift in the Statement is exactly (∂sFsN+LNFsN)(ηs).

2.1A1F1F2F3step 1.1constructalgebra

Fix N and a state i=ηs. By [F2], on an interval of length h, two or more potential uniformization events have probability ON(h2), one actual transition i→j has probability hLN(i,j)+ON(h2), and no state change has probability 1−hλi+ON(h2), with λi=∑j≠iLN(i,j). Taylor expansion is uniform over the finite state set and s∈[0,T]. If no state change occurs, then Fs+hN(i)−FsN(i)=h∂sFsN(i)+ON(h2) and the compensating integral is h(∂sFsN+LNFsN)(i)+ON(h2), so the increment of MN is −hLNFsN(i)+ON(h2). A single transition i→j gives increment FsN(j)−FsN(i)+ON(h); summing its conditional mean over j gives hLNFsN(i)+ON(h2), which cancels the no-transition term. Paths with at least two potential events contribute ON(h2) because MN has bounded increments for fixed N,T. Therefore ∣E[Ms+hN−MsN∣Fs]∣≤CNh2. In the conditional second moment, no transition contributes ON(h2), one transition contributes h∑j≠iLN(i,j)(FsN(j)−FsN(i))2+ON(h2)=hΓFsN(i)+ON(h2), and two or more potential events contribute ON(h2).

3.1A1F1F2step 2.1algebra

If T=0, the only time is 0 and M0N=0. For T>0, fix s<t and partition [s,t] into n equal intervals of length h=(t−s)/n. Applying the conditional-mean estimate from step 2.1 on every subinterval, then the tower property, bounds ∣E[MtN−MsN∣Fs]∣ by nCNh2→0. Thus MN is an all-pairs martingale. For fixed N its paths are bounded on [0,T] because the state space is finite, H and its time derivative are bounded, and the compensating integrand is bounded; hence it is square-integrable.

4.1A1F1F2step 2.1step 3.1algebra

Set γs(η)=ΓFsN(η) and AtN=∫0tγs(ηs)ds. If T=0, both processes are zero. For T>0, the second-moment expansion in step 2.1 and continuity of γs(i) in s imply E[As+hN−AsN∣Fs]=hγs(ηs)+ON(h2): without a state change the integrand differs from γs(ηs) by ON(h), and a state change has probability ON(h) and changes the bounded integrand over an interval of length h. Hence E[(Ms+hN−MsN)2−(As+hN−AsN)∣Fs]=ON(h2). For fixed s<t, partition [s,t] into n equal intervals and write ΔjM=Mtj+1N−MtjN, ΔjA=Atj+1N−AtjN. Since MN is a martingale, E[MtjNΔjM∣Fs]=0 by the tower property. Expanding the square, conditioning each remainder ΔjM2−ΔjA first on Ftj, and using the bound just proved gives an absolute conditional expectation at most nCNh2→0. Therefore (MtN)2−AtN is an all-pairs martingale.

5.1F1F2F4step 4.1algebra∎

The integrand γs(ηs) is nonnegative, so AN is increasing; it is continuous and adapted. If T=0, the zero process is predictable. Otherwise, for each nested deterministic partition, the process equal to AN at the left endpoint on each interval (a,b] and zero at time zero is predictable by [F4]; these processes converge pointwise to AN by continuity. Thus AN is predictable. At a bond {x,x+ei}, the test-function jump is N−d(ηx+ei−ηx)(H(s,x/N)−H(s,(x+ei)/N)). Multiplying its square by the rate N2 and summing over all bonds yields the displayed formula for γs(ηs). The fundamental theorem of calculus gives ∣H(s,(x+ei)/N)−H(s,x/N)∣≤N−1∥∂iH(s,⋅)∥∞; using (ηx+ei−ηx)2≤1 and Nd bonds per coordinate gives the stated bound for ATN.

Depends on

Dependency tree · 2 levels

Sources