dedekind_number_pos
lemmaverified
Every Dedekind number is strictly positive.
Statement
lemma dedekind_number_pos (n : ℕ) : 0 < dedekind_number n- Source
- arXiv:2611.13887 Section 1
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- dedekind_numberThe n-th Dedekind number d_n is the number of monotone Boolean functions on n variables, defined as the cardinality of the poset of…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - Cslib.Logic.PL.instInhabitedOfBotCslib.Logic.PL.instInhabitedOfBot
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - inst_fintype_orderHomThe type of order-preserving maps between two finite partial orders is finite.
Read back from the Lean
For every natural number $n$, dedekind_number n is strictly greater than 0.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Every Dedekind number is strictly positive. -/ lemma dedekind_number_pos (n : ℕ) : 0 < dedekind_number n := by unfold dedekind_number exact Fintype.card_pos