Exclusion process ($Lf(\eta )={\sum }_{x,y}p(x,y)\eta (x)(1-\eta (y))[f({\eta }^{xy})-f(\eta )]$)

Particles on a countable lattice attempt jumps at the rates $p(x,y)$, and an attempt into an occupied site is suppressed. Thus each site contains at most one particle and the number of particles is conserved when finite. Here ${\eta }^{xy}$ interchanges the occupations at $x$ and $y$. Bounded nearest-neighbour rates give a well-defined Markov process. A symmetric jump kernel gives the symmetric simple exclusion process; an unequal left-right kernel gives the asymmetric simple exclusion process.

On $\mathbb{Z}$, put independent rate-$c$ Poisson processes on unoriented nearest-neighbour edges, and exchange their endpoint occupations at each mark. Its generator on cylinder functions is $Lf(\eta )=c{\sum }_x[f({\eta }^{x,x+1})-f(\eta )]$. Equal occupations do not change the state, and a particle next to a vacancy jumps across at rate $c$. The stirring representation of symmetric exclusion constructs it for arbitrary initial configurations. The simple occupation-product product self-duality of symmetric exclusion requires symmetry and is not the ordinary duality of an asymmetric process.

On a finite graph with symmetric edge-swap rates, the stirring representation of symmetric exclusion transports the occupations by a random permutation. An independent identically distributed Bernoulli distribution occupation field is invariant under every deterministic permutation, and hence under this random permutation when it is independent of the initial field. Therefore the displayed product measure is invariant, including densities zero and one. Equivalently, an edge swap preserves the number of particles and has the same reverse rate, giving detailed balance.

Give every site a distinct label and interchange labels at the edge marks defining the symmetric simple exclusion process. Each forward or backward label path makes only finitely many jumps in a bounded time interval, since its total rate is $2c$. Occupations are transported along these paths. The backward ancestors of a finite set have the law of the finite-particle symmetric exclusion process, by time reversal of the Poisson marks. This proves the product self-duality of symmetric exclusion.

For finite $A\subset \mathbb{Z}$ put $D(\eta ,A)={\prod }_{x\in A}\eta (x)$, with empty product one. Interchanging occupations gives $D({\eta }^{xy},A)=D(\eta ,A^{xy})$, where $A^{xy}$ interchanges membership of the two sites. The edge-swap generators therefore agree on $D$. The stirring representation of symmetric exclusion proves the displayed identity at all times by tracing the ancestors of $A$ backwards. A general asymmetric jump kernel does not satisfy this product self-duality.

If the probability of occupation at every site in a finite set depends only on its cardinality, the law is exchangeable. The product self-duality of symmetric exclusion and conservation of the finite dual particle count imply that all these occupation-product moments are unchanged by evolution. Inclusion-exclusion principle reconstructs every finite cylinder probability from them, proving invariance. This direct argument does not require a representation theorem for exchangeable laws.