forest_greedy_law_enveloped
def
A finite uniform integer law has one fixed parity, is symmetric, and its positive tail at each positive integer is bounded by the forest carpool envelope.
Statement
noncomputable def forest_greedy_law_enveloped (α : Type) [Fintype α] (X : α → ℤ) : Prop
- Source
- Helper for OP-1106, forest greedy carpooling; related background arXiv:2611.00388.
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- forest_carpool_tail_envelopeThe proposed one-sided discrepancy tail envelope is 3/8 at level 2 and otherwise two to the negative Fibonacci number of the level.
- Used by 6
- forest_greedy_merge_large_levelsTwo independent enveloped laws remain within the Fibonacci tail envelope after a greedy step at every integer level at least four.
- forest_greedy_enveloped_tie_bias_oneAn enveloped fixed-parity law and a fair coin permit an increase from discrepancy 1 with probability at most 3/8.
- forest_greedy_enveloped_tie_bias_twoAn enveloped fixed-parity law and a fair coin permit an increase from discrepancy 2 with probability at most 1/4.
- forest_greedy_enveloped_tie_bias_boundFor an enveloped fixed-parity law and a fair coin, the probability of a greedy increase from a positive discrepancy j is bounded by the…
- forest_greedy_envelope_preserved_by_independent_mergeIndependent symmetric finite uniform discrepancy laws of fixed parity that satisfy the envelope still satisfy it after one greedy step…
- forest_carpool_final_one_sided_fibonacci_tailFor any forest arrival sequence and any vertex, the finite uniform probability that its final greedy discrepancy is at least D is bounded…
Lean source view module on GitHub
noncomputable def forest_greedy_law_enveloped (α : Type) [Fintype α] (X : α → ℤ) : Prop := (∃ p : ℤ, ∀ a, X a % 2 = p) ∧ (∀ z : ℤ, (Finset.univ.filter (fun a => X a = z)).card = (Finset.univ.filter (fun a => X a = -z)).card) ∧ (∀ k : ℕ, 1 ≤ k → (((Finset.univ.filter (fun a => (k : ℤ) ≤ X a)).card : ℝ) / (Fintype.card α : ℝ)) ≤ forest_carpool_tail_envelope k)