Process-level ↔ path-law bridges for exchangeability #
This file connects the process-level FullyExchangeable/Exchangeable predicates with the
path-space ExchangeableLaw predicate: a process is fully exchangeable exactly when its
pathLaw is an exchangeable path-space law, and (under a finite base law) finite exchangeability
is the same statement. It also connects process-level contractability with the path-space
ContractableLaw predicate.
Contractable.coordinate_pathLaw packages the form path-space arguments use: contractability
transferred to the coordinate process under pathLaw μ X, so an argument may be run on path space
and its conclusion carried back. It needs no finiteness hypothesis: contractability is a family of
finite-dimensional map equalities.
The bridges realize the Layer 0 roadmap item asking for process-level ↔ path-law bridges in both
directions. They reuse the existing FullyExchangeable path-law bridge from
FullyExchangeable.lean and the contractability bridge from Contractability.lean; no
measure-theoretic infrastructure is vendored.
A fully exchangeable process has an exchangeable path law.
A process is fully exchangeable iff its path law is an exchangeable path-space measure.
For finite laws, finite exchangeability of a process is equivalent to exchangeability of its path law.
A process whose path law is exchangeable is fully exchangeable.
A process whose path law is exchangeable is finitely exchangeable under a finite base law.
A contractable process has a contractable path law.
Contractability of a process is equivalent to contractability of its path law.
If a process has a contractable path law, then the process is contractable.
The coordinate process under a contractable process's path law is contractable. This is the
form path-space arguments need: transfer the hypothesis to pathLaw μ X, work there — path space
being standard Borel whenever the state space is — and carry the conclusion back.