math / data /lean /OAI /Combinatorics /ExpectationThreshold /SelectorTruncationDefinitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.74 kB
import Mathlib.Basic.Real.Basic
import Mathlib.Data.Fintype.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
namespace OAI
/-!
# Finite weighted truncation
The heavy set uses a strict cutoff. Weights equal to the cutoff are already
saturated when the cutoff increases, as required by the maximal truncation
argument.
-/
namespace TalagrandThreshold.Selector
open scoped BigOperators
variable {Ξ± : Type*} [Fintype Ξ±] [DecidableEq Ξ±]
/-- The points whose weight is strictly above the cutoff. -/
noncomputable def heavySet (w : Ξ± β†’ ℝ) (u : ℝ) : Finset Ξ± := by
classical
exact Finset.univ.filter (fun x => u < w x)
/-- The excess mass after every coordinate is truncated at the same cutoff. -/
noncomputable def truncatedExcess (w : Ξ± β†’ ℝ) (A : Finset Ξ±) (d u : ℝ) : ℝ :=
βˆ‘ x, min (w x) u * ((if x ∈ A then 1 else 0) - (1 - d))
/-- An admissible cutoff includes all heavy points and meets the truncated
weighted-excess test. -/
def Admissible (w : Ξ± β†’ ℝ) (A : Finset Ξ±) (m d u : ℝ) : Prop :=
0 ≀ u ∧ u ≀ 1 ∧ (βˆ€ x, u < w x β†’ x ∈ A) ∧
m * u ≀ truncatedExcess w A d u
omit [DecidableEq Ξ±] in
@[simp] theorem mem_heavySet {w : Ξ± β†’ ℝ} {u : ℝ} {x : Ξ±} :
x ∈ heavySet w u ↔ u < w x := by
classical
simp [heavySet]
theorem Admissible.heavy_subset {w : Ξ± β†’ ℝ} {A : Finset Ξ±} {m d u : ℝ}
(hu : Admissible w A m d u) : heavySet w u βŠ† A := by
intro x hx
exact hu.2.2.1 x (mem_heavySet.mp hx)
theorem Admissible.outside_le {w : Ξ± β†’ ℝ} {A : Finset Ξ±} {m d u : ℝ}
(hu : Admissible w A m d u) {x : Ξ±} (hx : x βˆ‰ A) : w x ≀ u := by
exact le_of_not_gt (fun h => hx (hu.2.2.1 x h))
end TalagrandThreshold.Selector
end OAI