ErrorCorrectingCodes.Codeword.one_sub_pos_of_lt_one
theoremverifiedimported Lean
Positivity of one minus a subunital real. Let $p$ be a real number with $p < 1$. Then $1 - p > 0$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in set_option linter.unusedSectionVars false in open Set Filter Asymptotics Finset in variable {α : Type*} [Fintype α] [Nonempty α] [DecidableEq α] [Field α] in variable {n k : ℕ} in lemma ErrorCorrectingCodes.Codeword.one_sub_pos_of_lt_one {p : ℝ} (hp : p < 1) : 0 < 1 - p
- Source
- TCSlib, `ErrorCorrectingCodes.Codeword.one_sub_pos_of_lt_one`
- Lean proof
- By Allan Li, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.ErrorCorrectingCodes.Codeword.one_sub_pos_of_lt_one← ErrorCorrectingCodes.Codeword.one_sub_pos_of_lt_one (TCSlib/ErrorCorrectingCodes/Basic.lean:123): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 2
- ErrorCorrectingCodes.Codeword.qary_entropy_posPositivity of the $q$-ary entropy. Let $\alpha$ be a finite alphabet with $q = \abs{\alpha}$ symbols, and let $p$ be a real number with…
- ErrorCorrectingCodes.Codeword.hamming_ball_size_asymptotic_upper_boundEntropy upper bound on Hamming balls. Let $\alpha$ be a finite alphabet with at least two symbols, write $q = \abs{\alpha}$ for its size,…
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.
set_option autoImplicit true inset_option relaxedAutoImplicit true inset_option linter.unusedSectionVars false inopen Set Filter Asymptotics Finset invariable {α : Type*} [Fintype α] [Nonempty α] [DecidableEq α] [Field α] invariable {n k : ℕ} in/-- If `p < 1`, then `1 - p` is positive. -/lemma ErrorCorrectingCodes.Codeword.one_sub_pos_of_lt_one {p : ℝ} (hp : p < 1) : 0 < 1 - p := by exact sub_pos.mpr hp