AFTD Auto-Formalizing Theoretical Domains

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

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)
See it in the graphDiscuss this resultChallenge it