The stationary signed Parry law
Abstract
The stationary signed Parry law.
Theorem 1.1 (The stationary signed Parry law).
Lean statement: D5/S3/TotalVariation/ParryResetLaw.parry_stationary_law
Proof. Machine-checked in Lean as D5/S3/TotalVariation/ParryResetLaw.parry_stationary_law (✓ std3). ∎
Source. Repository-derived.
Commentary.
For every natural k >= 2, set p = parryParameter k = (dbonacciPerronRoot k)^(-1), h_j = suffixWeight k p j, S = normalizer k, and pi(s) = parryLaw k s = p^(s.2.val) h_(s.2) / (2S). Then 1/2 < p <= Real.goldenRatio^(-1) and rootSum k p = sum over a in range k of p^(a+1) = 1. For every j in Fin k, p <= h_j <= 1, and S >= 1. Every entry of K = kernel k p is nonnegative, every row of K sums to one, and pi(s) >= 0 for every state s. The law is normalized, sum_s pi(s) = 1; it is stationary, with sum_s pi(s) K(s,t) = pi(t) for every t; and it is invariant under sign complement: pi(flip(s)) = pi(s) for every s.
References
- Truth anchor:
D5/S3/TotalVariation/ParryResetLaw.parry_stationary_law - Dependency: D5/S0/Tower/DBonacci/PerronRoot
- Dependency: D5/S3/TotalVariation/TwistedResetPaths