AFTD Auto-Formalizing Theoretical Domains

persuasion_receiver_ratio_sharp

theoremverifiedoriginal

The 3/2 bound of arXiv:2606.22226 is sharp. For every c < 3/2 there is a prior with R_max(μ) > c · R_0(μ).

Statement

open Finset in
theorem persuasion_receiver_ratio_sharp (c : ℝ) (hc : c < 3 / 2) :
    ∃ m : ℕ, 1 ≤ m ∧ is_bit_prior (persuasion_slice_prior m) ∧
      c * persuasion_prior_utility (persuasion_slice_prior m) <
        persuasion_max_receiver_utility (persuasion_slice_prior m)
Related work
operator (Claude), 2026-10-03: the optimal constant in the receiver-utility bound of arXiv:2606.22226 v1 (Sec. 5, first open direction: the constant lies between 39/31 and 3/2) is 3/2. The slice prior (2m+1 equally likely states, one coordinate per m-subset) has R_max/R_0 = (3m+1)/(2m+2)
Verified
03 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
Used by 1

Lean source view module on GitHub

open Finset in/-- **The `3/2` bound of arXiv:2606.22226 is sharp.** For every `c < 3/2` there is a prior with`R_max(μ) > c · R_0(μ)`. -/theorem persuasion_receiver_ratio_sharp (c : ℝ) (hc : c < 3 / 2) :    ∃ m : ℕ, 1 ≤ m ∧ is_bit_prior (persuasion_slice_prior m) ∧      c * persuasion_prior_utility (persuasion_slice_prior m) <        persuasion_max_receiver_utility (persuasion_slice_prior m) := by  obtain ⟨N, hN⟩ := exists_nat_gt (1 / (3 / 2 - c))  refine ⟨N + 1, by omega, persuasion_slice_prior_is_bit_prior _, ?_⟩  obtain ⟨h1, h2⟩ := persuasion_slice_ratio (N + 1) (by omega)  set R := persuasion_max_receiver_utility (persuasion_slice_prior (N + 1))  set R0 := persuasion_prior_utility (persuasion_slice_prior (N + 1))  have hd : 0 < 3 / 2 - c := by linarith  have hN' : 1 < (3 / 2 - c) * N := by    rw [div_lt_iff₀ hd] at hN; linarith  push_cast at h1  have hR : R = (3 * ((N : ℝ) + 1) + 1) / (2 * ((N : ℝ) + 1 + 1)) * R0 := by    field_simp; linarith  rw [hR]  have : c < (3 * ((N : ℝ) + 1) + 1) / (2 * ((N : ℝ) + 1 + 1)) := by    rw [lt_div_iff₀ (by positivity)]    nlinarith  exact mul_lt_mul_of_pos_right this h2
See it in the graphDiscuss this resultChallenge it