OAI/Combinatorics/UniformKServer/TreeDistribution.lean
8 declarations, 0 contain sorry, 0 declared as axioms
Initial and next rounded configurations live in one fixed finite alphabet; conditional extension states are eliminated by exact finite push-forward.
- def
OAI.UniformKServer.TreeRounding.Law.finiteLawline 20 - def
OAI.UniformKServer.TreeRounding.Distribution.supportLawline 22 - theorem
OAI.UniformKServer.TreeRounding.Distribution.support_meanline 29 - theorem
OAI.UniformKServer.TreeRounding.map_positiveline 33 - theorem
OAI.UniformKServer.TreeRounding.distribution_initialline 44 - def
OAI.UniformKServer.TreeRounding.stateDistanceline 59 - structure
OAI.UniformKServer.TreeRounding.Couplingline 62 - theorem
OAI.UniformKServer.TreeRounding.distribution_stepline 68