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.
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 and an integer . Let , with each coordinate represented by , and let be the set of unordered nearest-neighbor bonds , where and addition is modulo . The condition makes this a simple graph with each bond listed once as ranges over . The site graph is connected because any two coordinate tuples are joined by finitely many steps of or .
The configuration space is , ordered lexicographically by its binary occupation vector in the fixed site order; this labels it as a finite set . The occupation is for an occupied site and for a vacant site. For , let be the configuration obtained by swapping and .
The coordinates have dimensionless spacing on the unit torus, and is dimensionless diffusive time: it is the microscopic unit-rate bond clock accelerated by the factor . Thus the continuum heat equation below has normalized diffusion coefficient .
Define a rate matrix on by giving each distinct state change rate 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 , use the row-generator convention ; a row probability vector evolves by . The symmetric simple exclusion process (SSEP) is the uniformized finite-state chain with rate matrix and any specified initial probability vector. The finite-generator existence result supplies its all-pairs transition matrices and càdlàg paths. Every jump conserves .
For , the fixed-occupancy sector is . When , this sector has at least two states and its transition graph is connected by the fixed-occupancy connectivity lemma. Setting every sector energy to , , and each allowed transition rate to makes this sector a finite reversible stochastic rate model with uniform stationary weights. The sectors and 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 with normalized Haar measure . For , write for the point with coordinates represented in . The empirical measure and its action on a smooth periodic test function are
Here denotes unit point mass at . Thus is a finite positive measure of total mass at most , not necessarily a probability measure. For a smooth periodic , define its discrete Laplacian on grid points by