§3.1, after equation (7) — the minimum over is
ProvedRandomOrderCRS.minimum_after_7attenuationcontention-resolutionp2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis
Consider, for and , the function
Its minimum on occurs at , where it takes the value , and .
This is the last step of the proof of Theorem 3. It contains no graph.
Differences from the source:
- encoding: the minimum occurs at when it takes on the value → on , and ; reason: the same statement
Preamble
import Mathlib import Definitions.Def_RandomOrderCRS_Attenuation open Real
Formal statement
namespace RandomOrderCRS
/-- MacRury, Ma & Grammel, arXiv:2209.07520v2, §3.1, after equation (7), p.22, for `a = a₁`: "Upon
evaluating the integral in (7), we get a function of x_e whose minimum occurs at x_e = 0 when it
takes on the value (e²−4e³+e⁴+20e−22)/(4e²) ≥ 0.474035."
1. `c*` is a lower bound of the function on `[0, 1]`;
2. the value at `0` is `c*`;
3. `c* ≥ 0.474035`. -/
theorem minimum_after_7 :
(∀ t ∈ Set.Icc (0 : ℝ) 1,
cStar ≤ a₁ t * ∫ y in (0 : ℝ)..1, exp (-2 * y * (1 - t)) * (1 + a₁ 1 * (1 - t) * y ^ 2)) ∧
(a₁ 0 * ∫ y in (0 : ℝ)..1, exp (-2 * y * (1 - 0)) * (1 + a₁ 1 * (1 - 0) * y ^ 2)) = cStar ∧
(0.474035 : ℝ) ≤ cStar := by sorry
end RandomOrderCRS
Source
MacRury, Ma & Grammel, On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs, arXiv:2209.07520v2, §3.1, after equation (7), p.22
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.