team_T2_mem
lemmaverified
If b is in [0,1], every entry of the list 0,b,...,0 is in [0,1].
Statement
lemma team_T2_mem (b : ℝ) (hb : 0 ≤ b ∧ b ≤ 1) (m : ℕ) : ∀ x ∈ team_T2 b m, 0 ≤ x ∧ x ≤ 1- Source
- step towards team_thm4_part2_false / team_thm4_part2_exists_false (The Team Order Problem: Maximizing the Probability of Matching Being Large Enough, SAGT 2024 (arXiv:2605.21234), Section 6, Theorem 4(2))
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- team_T2The list 0, b, 0, b, …, b, 0 (m copies of b).
- Used by 2
- team_T2_tailFor the list 0,b,...,0 with m copies of b, the probability of at least m successes is at least b^m.
- team_rot_winProb2The rotation line-up of the strengthened instance wins with probability at least 1/2 + 1/40.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
lemma team_T2_mem (b : ℝ) (hb : 0 ≤ b ∧ b ≤ 1) (m : ℕ) : ∀ x ∈ team_T2 b m, 0 ≤ x ∧ x ≤ 1 := by induction m with | zero => intro x hx; simp [team_T2] at hx; subst hx; norm_num | succ m ih => intro x hx simp only [team_T2, List.mem_cons] at hx rcases hx with rfl | rfl | hx · norm_num · exact hb · exact ih x hx