Alphabeta Math
Pipeline-generated
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.

Diffusive hydrodynamics from the symmetric exclusion process

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Weak heat solutions on the continuum torus

Definition

Assume the Axiom of Countable Choice (ACω), meaning every at most countable family of nonempty sets has a choice function. Let d≥1, let Td=(R/Z)d carry the normalized product Haar measure dx with dx(Td)=1, and let ρ0 be a real measurable function on Td with 0≤ρ0≤1 almost everywhere. For a finite T≥0, a weak heat solution with datum ρ0 is a family (ut)0≤t≤T of real essentially bounded measurable-function classes (elements of L∞(Td,dx;R)), with u0=ρ0 as a function class, such that for every complex-valued smooth periodic test function G, the map t↦∫Tdut(x)G(x) dx is continuous and

∫Tdut(x)G(x) dx=∫Tdρ0(x)G(x) dx+∫0t∫Tdus(x)ΔG(x) dx ds

for every 0≤t≤T. Here Δ=∑i=1d∂xi2 is the periodic Laplacian; equality of function classes means equality almost everywhere with respect to dx. For the Fourier convention on this torus, set ek(x)=exp⁡(2πik⋅x) for k∈Zd and f^(k)=∫Tdf(x)e−k(x) dx for f∈L1(Td,dx).

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Connectedness of fixed-occupancy exclusion sectors

Statement

Let G=(V,E) be a finite connected simple undirected graph with m:=∣V∣≥1. For 0≤k≤m, let Ck(G) be the set of all k-element subsets of V. Join distinct A,B∈Ck(G) when there is an edge {x,y}∈E with x∈A, y∉A, and B=(A∖{x})∪{y}. Then this graph on Ck(G) is connected.

Facts & Assumptions

Given: A finite connected simple undirected graph G=(V,E), its number of vertices m≥1, and an integer 0≤k≤m.

[A1]

The graph definitions, finite vertex set, connectedness, and fixed-cardinality configuration graph are exactly those in the Statement.

[L1]

In this proof, a path in a graph is a finite vertex sequence whose consecutive vertices are joined by edges; it is simple if its vertices are distinct. A tree is a connected acyclic graph, a spanning tree is a tree subgraph containing every vertex, and a leaf is a vertex incident to exactly one edge. A legal configuration move replaces an occupied vertex by an adjacent vacant vertex, as in the configuration graph of the Statement.

Proof

1.1A1L1construct

A finite connected graph has a spanning tree: start with one vertex and, while the current vertex set is not V, add an edge from that set to its complement together with the new endpoint. Such an edge exists because otherwise no path could join the current set to its complement. Finiteness makes this process terminate; each added edge attaches one new vertex, so the resulting spanning subgraph is connected and has no cycle.

2.1A1L1step 1.1construct

We prove by induction on the number of vertices that the k-element subsets of any finite tree are connected for every admissible k. The assertion holds for a one-vertex tree, since its 0- and 1-element subset graphs each have one vertex. For a tree T with at least two vertices, choose a simple path of maximum length; either endpoint is a leaf, because an additional neighbor outside the path would extend it, while an additional neighbor on the path would create a cycle. Let v be a leaf. Removing a leaf leaves a connected acyclic graph, hence a smaller tree: the unique path between two remaining vertices cannot have the leaf as an interior vertex. If two configurations A,B have the same occupancy at v, removing v leaves two subsets of the same cardinality in T−v; by induction a sequence of legal moves there connects them, and the same moves in T keep the occupancy at v fixed.

3.1A1L1step 2.1construct

Suppose v∈A and v∉B. Since k<m, choose a vacant vertex w∉A and let v=v0,v1,…,vr=w be the unique simple path in T from v to w. Existence follows from connectedness, and two distinct simple paths would contain a cycle, so the path is unique. Let j be the first index with vj∉A; then v0,…,vj−1 are occupied. Move the particle at vj−1 to the vacancy vj, then the particle at vj−2 to the new vacancy vj−1, and continue until the particle at v0 has moved to v1. These are legal edge moves and leave v vacant. The resulting configuration and B, restricted to T−v, both have k particles; induction connects them without using v.

3.2A1L1step 2.1construct

Suppose v∉A and v∈B. Since k>0, choose an occupied vertex w∈A and use the unique path v=v0,…,vr=w. Let j be the first index with vj∈A; all earlier vertices are vacant. Move the particle from vj to vj−1, then from vj−1 to vj−2, and continue until v0=v is occupied. The moves are legal along the path. The resulting configuration and B, restricted to T−v, both have k−1 particles; induction connects them without using v. This proves the claim for trees, including the cases k=0 and k=m already covered by their singleton configuration graphs.

4.1A1L1step 1.1step 2.1step 3.1step 3.2∎

Apply step 1.1 to G and let T be a spanning tree. Every move along an edge of T is also an allowed move in G. steps 3.1 and 3.2 therefore connect any two k-element subsets using edges of G, so Ck(G) is connected.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Fourier heat flow on the continuum torus

Statement

Assume the Axiom of Countable Choice. Let d≥1 and let ρ0:Td→R be measurable with 0≤ρ0≤1 almost everywhere, using normalized product Haar measure dx. For k∈Zd define ek(x)=exp⁡(2πik⋅x) and f^(k)=∫Tdf(x)e−k(x) dx. For t>0 set

ρt(x):=∑k∈Zde−4π2∣k∣2tρ^0(k)ek(x),

and at t=0 set ρt=ρ0 as an almost-everywhere class. For smooth periodic G, define

PtG(x):=∑k∈Zde−4π2∣k∣2tG^(k)ek(x)(t>0),P0G:=G.

Then on every strip [ϵ,T]×Td with 0<ϵ<T<∞, the series for ρt and all its space and time derivatives converge absolutely and uniformly; in particular ρt is real and smooth for each t>0 and ∂tρt=Δρt. For every finite T and every smooth G, PtG is smooth on [0,T]×Td, satisfies ∂tPtG=ΔPtG, has uniformly bounded derivatives of every fixed order there, and PtG→G uniformly as t↓0. Moreover

∫TdρtG dx=∫Tdρ0PtG dx,

so (ρt)0≤t≤T is the unique weak heat solution with datum ρ0 in the stated weak formulation. It preserves 0≤ρt≤1 almost everywhere and the mass ∫ρt dx=∫ρ0 dx.

Facts & Assumptions

Given: The Axiom of Countable Choice, d≥1, a real measurable ρ0 with 0≤ρ0≤1 almost everywhere on the normalized torus Td, and smooth periodic test functions.

[A1]

Assume ACω. Full Choice is not needed for this heat-flow lemma; The Axiom of Countable Choice (ACω) states that every countable family of nonempty sets has a choice function.

[F1]

Fourier coefficients and trigonometric polynomials on the torus: on Td the characters are ek(x)=exp⁡(2πik⋅x), the normalized measure has total mass one, and f^(k)=∫fe−k dx for f∈L1.

[F2]

The Fourier basis and Parseval's identity on the finite torus: under ACω, the characters form a complete orthonormal basis of L2(Td); smooth functions equal their Fourier sums in L2 and Parseval holds.

[F3]

Weak heat solutions on the continuum torus: a weak heat solution has continuous pairings with smooth tests and satisfies the displayed integral identity for every such test.

Proof

1.1A1F1constructalgebra

Since 0≤ρ0≤1 and dx(Td)=1, ρ0∈L1 and ∣ρ^0(k)∣≤1 for every k. For any smooth G and integer m≥1, periodic integration by parts gives (1+4π2∣k∣2)mG^(k)=(1−Δ)mG^(k), hence ∣G^(k)∣≤∥(1−Δ)mG∥L1(1+4π2∣k∣2)−m. If q≥0 is fixed, choose m>(d+q)/2; grouping lattice points by r=∥k∥∞ gives at most (2r+1)d−(2r−1)d≤Cdrd−1 points in shell r. The shell contribution to ∑k(1+∣k∣)q∣G^(k)∣ is at most Crd−1+q−2m. Grouping shells into dyadic blocks 2j≤r<2j+1 bounds the jth block by C′2j(d+q−2m), a convergent geometric series since 2m>d+q. Thus ∑k(1+∣k∣)q∣G^(k)∣<∞.

2.1F1step 1.1algebra

For each t>0 and each fixed derivative order, multiplication of the coefficients by any corresponding polynomial in k still leaves an absolutely summable sequence, because ∣ρ^0(k)∣≤1 and the Gaussian factor e−4π2∣k∣2t dominates every inverse power on lattice shells. Therefore the heat series and all fixed-order differentiated series converge uniformly on Td for t≥ε>0. Pairing the k and −k terms shows ρt is real. Termwise differentiation is valid on every such compact time interval; both ∂t and Δ multiply the kth term by −4π2∣k∣2, so ∂tρt=Δρt.

2.2F1F2step 1.1construct

The decay estimate in step 1.1 makes the Fourier series for G and for each fixed space or time derivative of PtG uniformly absolutely convergent even at t=0. By [F2], the series at t=0 equals G in L2; both are continuous, so equality almost everywhere implies equality everywhere. Uniform convergence of the differentiated series proves smoothness and uniform derivative bounds on [0,T]×Td. Also ∥PtG−G∥∞≤∑k∣G^(k)∣ ∣e−4π2∣k∣2t−1∣→0 by splitting into a finite set of modes and an absolutely summable tail. Termwise differentiation gives ∂tPtG=ΔPtG.

3.1F1F3step 2.2algebra

Absolute convergence permits termwise integration against ρ0∈L1. Reindexing k↦−k and using the even multiplier e−4π2∣k∣2t gives ∫ρtG=∑ke−4π2∣k∣2tρ^0(k)G^(−k)=∫ρ0PtG. By step 2.2 this pairing tends to ∫ρ0G as t↓0. Differentiating the pairing for t>0 and using ΔPtG=PtΔG yields ddt∫ρtG=∫ρtΔG; integration from 0 proves the weak identity in [F3]. Thus the constructed family is a weak heat solution.

3.2A1F1F2step 2.1algebra

Parseval and the heat coefficients give ∥ρt−ρ0∥22=∑k∣ρ^0(k)∣2∣e−4π2∣k∣2t−1∣2→0 as t↓0: choose a finite set whose tail in the convergent series ∑k∣ρ^0(k)∣2 is small, then take the limit on that finite set. For ϵ>0 put aϵ(z)=12(1−z/z2+ϵ2) and Φϵ(z)=∫0z∫0raϵ(q) dq dr. Then Φϵ is smooth and convex, Φϵ(0)=Φϵ′(0)=0, and 0≤Φϵ(z)≤z2/2. On any interval [a,b]⊂(0,T], the heat equation, chain rule, and periodic integration by parts give ∫Φϵ(ρb)−∫Φϵ(ρa)=−∫ab∫Φϵ′′(ρs)∑i=1d∣∂xiρs∣2 dx ds≤0. For each real z, the defining double integral tends to 12(z−)2, where z−:=max⁡{−z,0}; dominated convergence on the bounded range of ρ over [a,b]×Td gives the same monotonicity for ∥ρt−∥22. Letting a↓0, the L2 continuity just proved and ρ0≥0 imply ρt−=0. The assumed datum already gives the required bound when T=0.

4.1A1F1F2step 3.2algebra

For the upper bound put bϵ(z)=12(1+(z−1)/(z−1)2+ϵ2) and Ψϵ(z)=∫1z∫1rbϵ(q) dq dr. This is smooth and convex with Ψϵ(1)=Ψϵ′(1)=0 and 0≤Ψϵ(z)≤(z−1)2/2. The same integration by parts gives ∫Ψϵ(ρb)≤∫Ψϵ(ρa) for 0<a<b, and Ψϵ(z)→12((z−1)+)2, where r+:=max⁡{r,0}. Dominated convergence and L2 continuity at zero, together with ρ0≤1, give (ρt−1)+=0. The zero Fourier coefficient is unchanged by the heat multiplier, so ∫ρt=ρ^0(0)=∫ρ0. The assumed datum already gives the bound when T=0.

5.1F1F2F3step 3.1algebra∎

Let (ut) be any weak heat solution in the sense of [F3]. Testing its weak identity with e−k shows gk(t):=u^t(k) is continuous and satisfies gk(t)=ρ^0(k)−4π2∣k∣2∫0tgk(s) ds. Hence gk is differentiable and solves gk′=−4π2∣k∣2gk, so gk(t)=e−4π2∣k∣2tρ^0(k), the coefficient of the constructed ρt. For each t, both functions are in L2; equality of all Fourier coefficients and completeness in [F2] imply ut=ρt almost everywhere. Thus the weak heat solution is unique.

DefinitionDefinition: AI-adaptedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Symmetric exclusion process under diffusive scaling

Definition

Assume the Axiom of Choice, meaning every family of nonempty sets has a choice function. Fix an integer d≥1 and an integer N≥3. Let ΛN=(Z/NZ)d, with each coordinate represented by 0,1,…,N−1, and let EN be the set of unordered nearest-neighbor bonds {x,x+ei}, where 1≤i≤d and addition is modulo N. The condition N≥3 makes this a simple graph with each bond listed once as x ranges over ΛN. The site graph is connected because any two coordinate tuples are joined by finitely many steps of +ei or −ei.

The configuration space is ΩN={η:ΛN→{0,1}}, ordered lexicographically by its binary occupation vector in the fixed site order; this labels it as a finite set {1,…,2Nd}. The occupation ηx is 1 for an occupied site and 0 for a vacant site. For b={x,y}∈EN, let ηb be the configuration obtained by swapping ηx and ηy.

The coordinates x/N have dimensionless spacing 1/N on the unit torus, and t is dimensionless diffusive time: it is the microscopic unit-rate bond clock accelerated by the factor N2. Thus the continuum heat equation below has normalized diffusion coefficient D=1.

Define a rate matrix LN on ΩN by giving each distinct state change η→ηb≠η rate N2 and setting the diagonal entry to the negative sum of the off-diagonal row. If the two occupations on a bond agree, swapping them produces no state change and contributes no off-diagonal transition. On a column observable f:ΩN→R, use the row-generator convention (LNf)(η)=∑ξ≠ηLN(η,ξ)(f(ξ)−f(η)); a row probability vector evolves by p′=pLN. The symmetric simple exclusion process (SSEP) is the uniformized finite-state chain with rate matrix LN and any specified initial probability vector. The finite-generator existence result supplies its all-pairs transition matrices etLN and càdlàg paths. Every jump conserves ∑x∈ΛNηx.

For k=0,1,…,Nd, the fixed-occupancy sector is ΩN,k={η∈ΩN:∑xηx=k}. When 0<k<Nd, this sector has at least two states and its transition graph is connected by the fixed-occupancy connectivity lemma. Setting every sector energy to 0, β=1, and each allowed transition rate to N2 makes this sector a finite reversible stochastic rate model with uniform stationary weights. The sectors k=0 and k=Nd are singleton constant chains. The full SSEP state graph is reducible across particle-number sectors; the generic finite rate-matrix construction, not the irreducible reversible-model definition, defines the full process.

Let Td=(R/Z)d with normalized Haar measure dx. For x∈ΛN, write x/N∈Td for the point with coordinates represented in [0,1). The empirical measure and its action on a smooth periodic test function G are

πtN:=N−d∑x∈ΛNηx(t) δx/N,⟨πtN,G⟩:=∫TdG dπtN=N−d∑x∈ΛNηx(t)G(x/N).

Here δy denotes unit point mass at y. Thus πtN is a finite positive measure of total mass at most 1, not necessarily a probability measure. For a smooth periodic G, define its discrete Laplacian on grid points by

ΔNG(x/N):=N2∑i=1d[G((x+ei)/N)+G((x−ei)/N)−2G(x/N)].

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Diffusive heat limit for symmetric exclusion

Statement

Assume the Axiom of Choice. Fix d≥1, T≥0, and for each integer N≥3 let (ηtN)0≤t≤T be the SSEP on ΛN=(Z/NZ)d with rate N2 on each unordered nearest-neighbor bond, started from any initial probability vector on a probability space (ΞN,AN,PN). Write πtN=N−d∑x∈ΛNηxN(t)δx/N for its empirical measure. Suppose a measurable ρ0:Td→[0,1] satisfies, for every real-valued smooth periodic G and every ϵ>0,

PN ⁣(∣⟨π0N,G⟩−∫Tdρ0(x)G(x) dx∣>ϵ)⟶0(N→∞),

where the probability spaces may depend on N. Let ρt be the unique weak heat solution on Td with initial datum ρ0, defined by the Fourier heat profile. Then for every real-valued smooth periodic G and every ϵ>0,

PN ⁣(sup⁡0≤t≤T∣⟨πtN,G⟩−∫Tdρt(x)G(x) dx∣>ϵ)⟶0(N→∞).

Facts & Assumptions

Given: The Axiom of Choice; a fixed d≥1 and finite T≥0; for each N≥3 an SSEP process with arbitrary initial law; a measurable density ρ0 with 0≤ρ0≤1; and convergence in probability of the initial empirical measures against every real-valued smooth periodic test.

[A1]

Assume the Axiom of Choice, meaning every family of nonempty sets has a choice function. The finite-chain realization, martingale bracket, and finite-horizon Doob suppliers below carry this assumption (The Axiom of Choice).

[F1]

Symmetric exclusion process under diffusive scaling: Td=(R/Z)d has normalized product Haar measure; bonds are unordered, each allowed swap has rate N2, πtN is a finite positive measure of total mass at most 1, and ΔN is the displayed second-difference operator.

[F2]

Fourier heat flow on the continuum torus: with ek(x)=e2πik⋅x and G^(k)=∫Ge−k dx, PrG=∑k∈Zde−4π2∣k∣2rG^(k)ek for r>0 and P0G=G; this Fourier series is absolutely convergent for smooth G. The supplier also proves that ρt is the unique weak heat solution, ∫ρtG=∫ρ0PtG, that PtG is smooth on each compact [0,T]×Td with uniformly bounded derivatives of every fixed order, that ∂tPtG=ΔPtG, and that 0≤ρt≤1 with conserved mass.

[F3]

SSEP martingale for time-dependent test functions: for smooth Hs, the empirical-field martingale with drift ∂sHs+ΔNHs has bracket bounded by TN−d∑isup⁡s∥∂iHs∥∞2.

[F4]

SSEP empirical-field martingale and bracket: for fixed smooth G, ⟨πtN,G⟩−⟨π0N,G⟩−∫0t⟨πsN,ΔNG⟩ds is a square-integrable martingale whose bracket is bounded by tN−d∑i∥∂iG∥∞2.

[F5]

Finite-horizon L2 maximal bound for martingales with right-continuous paths and left limits: a square-integrable càdlàg martingale M with M0=0 satisfies E[sup⁡0≤t≤T∣Mt∣2]≤4E∣MT∣2.

Proof

1.1A1F1F2F3algebra

Fix t∈[0,T] and a real-valued smooth periodic G. For every r≥0, PrG is real-valued: since G is real, G^(−k)=G^(k)‾, and the Fourier multiplier e−4π2∣k∣2r is real and unchanged by k↦−k; pairing the absolutely convergent k and −k terms (with the zero mode real) gives a real sum. By [F2], these functions are smooth, so Hs=Pt−sG is an admissible real-valued test in [F3]. Denote its martingale by MsN,t. By [F2], ∂sHs=−ΔHs. The time-dependent martingale identity at its terminal time gives ⟨πtN,G⟩=⟨π0N,PtG⟩+MtN,t+∫0t⟨πsN,(ΔN−Δ)Pt−sG⟩ ds, and MN,t starts at zero with terminal second moment equal to the expected bracket.

2.1F1F2F3step 1.1algebra

The fourth spatial derivatives of Pt−sG are uniformly bounded for 0≤s≤t by [F2]. Taylor's formula for each symmetric second difference therefore gives sup⁡s,x∣(ΔN−Δ)Pt−sG(x)∣≤CG,TN−2. Since πsN(Td)≤1, the drift-error integral in step 1.1 is at most tCG,TN−2. By [F3], EN∣MtN,t∣2≤CG,T′N−d, so Chebyshev's inequality makes that martingale term tend to zero in probability. Step 1.1 establishes that PtG is real-valued, and [F2] gives its smoothness; hence the initial-profile assumption applies to this test. Also [F2] gives ∫ρ0PtG=∫ρtG. Thus for each fixed t, ⟨πtN,G⟩→∫ρtG in probability.

3.1step 2.1construct

If T=0, the conclusion is the initial-profile assumption. Suppose T>0 and fix a finite time mesh 0=t0<⋯<tm=T. Step 2.1 and a finite union bound imply max⁡j∣⟨πtjN,G⟩−∫ρtjG∣→0 in probability.

4.1A1F2F4F5step 3.1algebra∎

By the fundamental theorem of calculus applied twice to each centered second difference, ∥ΔNG∥∞≤KG:=∑i∥∂iiG∥∞ for all N. The fixed-test martingale in [F4] gives ∣⟨πtN,G⟩−⟨πsN,G⟩∣≤KG∣t−s∣+2sup⁡0≤u≤T∣MuN,G∣ for all s,t∈[0,T]. By [F4], E∣MTN,G∣2≤TN−d∑i∥∂iG∥∞2; [F5] therefore implies sup⁡u≤T∣MuN,G∣→0 in probability. Also [F2] and the mass bound ∫ρt≤1 show t↦∫ρtG is Lipschitz with constant ∥ΔG∥∞. Given δ>0, choose a finite mesh with spacing at most δ; the supremum error is bounded by the maximum mesh error from step 3.1, 2sup⁡∣MN,G∣, and (KG+∥ΔG∥∞)δ. First let N→∞ and then δ↓0. This proves the stated uniform-in-time convergence in probability.

Remarks

The result is a mathematical deduction from the adopted finite stochastic model; it reports no measured diffusion and derives no Navier–Stokes equation from Newtonian mechanics. If one assigns a microscopic bond rate 1/τ0 before the N2 time acceleration and a physical lattice spacing ℓ0/N, then the accelerated rate is N2/τ0 and the single-particle variance rate in each coordinate is 2(N2/τ0)(ℓ0/N)2=2ℓ02/τ0. Thus the normalized coefficient D=1 corresponds to D=ℓ02/τ0 with physical units of length squared per time; this is a unit conversion for this chosen model.

5 · Examples, experiments and counterexamples

None yet.

Sources