One-round exact drift #
The cubic majority map p(x) = 3x² - 2x³: the exact probability that a
single agent adopts opinion 1 in one round, as a function of the current
fraction x of opinion-1 agents. avg_card_step computes the exact
expected size of step I r as n * p(|I|/n), via the algebraic identity
maj(a,b,c) = ab+bc+ac-2abc for a,b,c ∈ {0,1} (the majority-of-three
function, as a polynomial) plus the independence toolkit of Prob.lean.
Y_maj and card_step_eq_sum expose the underlying {0,1}-valued,
per-agent decomposition of (step I r).card as ∑ v, Y_maj I v (r v),
which is exactly the shape the Chernoff bounds of Dynamics.Chernoff need; Growth.lean
and Saturation.lean apply them directly to Y_maj.
The per-agent {0,1} contribution: whether a majority of the sample
triple s lies in I. Independent of the agent index v; kept as a
function Fin n → (Fin n × Fin n × Fin n) → ℝ to match the shape
the Chernoff bounds of Dynamics.Chernoff expect.
Equations
- ThreeMajority.Y_maj I x✝ s = if 2 ≤ ThreeMajority.sampleCountOf I s then 1 else 0
Instances For
Exact one-round drift: the average number of agents adopting
opinion 1 after one round equals n · p(x), p(x) = 3x²-2x³, x = |I|/n.