OAI/Combinatorics/ProgressionColoring/ProbabilityScales.lean
11 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.QuantitativeVanDerWaerden.Parameters.log_prime_slackline 12 - theorem
OAI.QuantitativeVanDerWaerden.Parameters.log_two_le_power_logline 21 - def
OAI.QuantitativeVanDerWaerden.Parameters.richEnvelopeline 32Source documentation
The exact exponent appearing in the rich-progression union bound.
def richEnvelope (k : ℕ) : ℝ := …
- theorem
OAI.QuantitativeVanDerWaerden.Parameters.richEnvelope_tendstoline 36 - def
OAI.QuantitativeVanDerWaerden.Parameters.affineEnvelopeline 71Source documentation
Envelope for twice the affine-signature count times the survival bound.
def affineEnvelope (C : ℝ) (k : ℕ) : ℝ := …
- theorem
OAI.QuantitativeVanDerWaerden.Parameters.affineEnvelope_tendstoline 75 - theorem
OAI.QuantitativeVanDerWaerden.Parameters.affine_risk_leline 80 - def
OAI.QuantitativeVanDerWaerden.Parameters.rowEnvelopeline 97Source documentation
A global-row envelope, from
log T ≤ C k^(3/10) log k.def rowEnvelope (C : ℝ) (k : ℕ) : ℝ := …
- theorem
OAI.QuantitativeVanDerWaerden.Parameters.rowEnvelope_tendstoline 101 - theorem
OAI.QuantitativeVanDerWaerden.Parameters.eventually_row_risk_leline 106 - theorem
OAI.QuantitativeVanDerWaerden.Parameters.eventually_perturbation_budgetline 134Source documentation
One threshold suffices to make both perturbation union bounds less than one. The scalar entropy constant is fixed before the number of colors is introduced.
theorem eventually_perturbation_budget {C : ℝ} (hC : 0 ≤ C) : ∀ᶠ k : ℕ in atTop, richEnvelope k + affineEnvelope C k < 1 := by …Mentions: OAI.QuantitativeVanDerWaerden.Parameters.richEnvelope, OAI.QuantitativeVanDerWaerden.Parameters.affineEnvelope