B.7, p. 34 — is increasing and is decreasing in
ProvedSampleDrivenOS.Linear.b7_monotonemonotonicityoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis
Fix and let
be the two sides of equation (19). Then
- is strictly increasing on ;
- is non-increasing on .
Together they give the uniqueness of the root of (19) (Lemma 7), and after the substitution they are the monotonicity used in the first step of the proof of Theorem 9.
Formalization Note The paper's sentences say "increasing" and "decreasing" without naming the domain. Strictness is stated for (its slope is positive); is stated as non-increasing on , where every logarithm's argument is at least ; at the paper itself notes , so is excluded. The continuity claim of the same paragraph is used only for Lemma 7 and is not part of this statement.
Preamble
import Mathlib import Definitions.Def_SampleDrivenOS_Linear_Setting
Formal statement
namespace SampleDrivenOS.Linear
theorem b7_monotone (p : ℝ) (hp : p ∈ Set.Ioo (0 : ℝ) 1) :
StrictMonoOn (fB7 p) (Set.Icc 0 1) ∧ AntitoneOn (gB7 p) (Set.Ico 0 1) := by sorry
end SampleDrivenOS.Linear
Source
Correa, Cristi, Epstein & Soto, Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality, arXiv:2011.06516v2, p. 34, B.7 (Proof of Lemma 7), first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.