fractional_scd_with_denominator_mul
If a partially ordered type with an integer rank function admits a fractional symmetric chain decomposition with denominator D, then for every positive integer m it also admits a fractional symmetric chain decomposition with denominator D * m.
Statement
open scoped Classical BigOperators in theorem fractional_scd_with_denominator_mul {α : Type*} [PartialOrder α] (rank : α → ℤ) (D m : ℕ) (hm : 0 < m) (h : has_fractional_scd_with_denominator rank D) : has_fractional_scd_with_denominator rank (D * m)
- Source
- arXiv:2610.24148, Section 2.7.4
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- has_fractional_scd_with_denominatorA partially ordered type with an integer rank function admits a fractional symmetric chain decomposition with denominator D if there…
- is_symmetric_saturated_chainA subset of a ranked poset is a symmetric saturated chain if there is an integer k such that the chain contains exactly one element of…
Read back from the Lean
For any partially ordered type α, any rank function rank : α → ℤ, and any natural numbers D and m with 0 < m: if α admits a fractional symmetric chain decomposition with denominator D with respect to rank, then it also admits a fractional symmetric chain decomposition with denominator D * m with respect to rank.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that a fractional symmetric chain decomposition with denominator $D$ also has denominator $D \cdot m$ for any positive integer $m$, the proof preserves the exact same family of chains and weight function. The only condition that changes is the denominator requirement: for each chain with weight $k / D$, multiplying numerator and denominator by $m$ gives the equivalent fraction $(k \cdot m) / (D \cdot m)$, which is valid because $m > 0$ ensures $m \neq 0$.
The same collection of chains and weight function witness the fractional SCD with denominator $D \cdot m$, leaving only the denominator condition to verify.
Unpack the assumed fractional SCD with denominator $D$ into its finite family of chains $\mathcal{C}$, weight assignment $\tau$, and the four required properties: every chain is symmetric and saturated, every weight is non-negative, every weight has denominator $D$, and the weights sum to $1$ at every element. Using the exact same $\mathcal{C}$ and $\tau$, the chain conditions, non-negativity, and unit-sum condition all hold immediately, leaving only the requirement that every weight can be expressed with denominator $D \cdot m$.
rcases h with ⟨𝒞, τ, h_symm, h_pos, h_den, h_sum⟩ refine ⟨𝒞, τ, h_symm, h_pos, ?_, h_sum⟩
For any chain $C \in \mathcal{C}$ with weight $k / D$, the product $k \cdot m$ serves as the numerator for denominator $D \cdot m$.
Consider any chain $C \in \mathcal{C}$. By the original denominator hypothesis, there is a natural number $k$ such that $\tau(C) = k / D$. To express $\tau(C)$ with denominator $D \cdot m$, we choose $k \cdot m$ as the witness for the numerator.
intro C hC rcases h_den C hC with ⟨k, hk⟩ refine ⟨k * m, ?_⟩
The fraction $k / D$ equals $(k \cdot m) / (D \cdot m)$ in $\mathbb{Q}$.
Substitute $\tau(C) = k / D$ and expand the natural-to-rational coercions across the products. It remains to show that $k / D = (k \cdot m) / (D \cdot m)$. Because $m > 0$, the rational coercion of $m$ is strictly positive and thus nonzero. Canceling $m$ from both the numerator and denominator using `mul_div_mul_right` concludes the proof.
uses
mul_div_mul_rightrw [hk] push_cast have hm_ne : (m : ℚ) ≠ 0 := by positivity exact (mul_div_mul_right (k : ℚ) (D : ℚ) hm_ne).symm
mul_div_mul_right- In a group with zero (such as the rational numbers), multiplying both numerator and denominator by a nonzero element does not change the quotient: $(a \cdot c) / (b \cdot c) = a / b$.
- The tactic `push_cast` formally distributes the coercion from $\mathbb{N}$ to $\mathbb{Q}$ across multiplication, a detail taken for granted in textbook mathematics.
- The deduction that $m \neq 0$ in $\mathbb{Q}$ from $0 < m$ is discharged automatically by the `positivity` tactic.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
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.
open scoped Classical BigOperators in/-- A fractional SCD with denominator D also has denominator D * m for any positive integer m. -/theorem fractional_scd_with_denominator_mul {α : Type*} [PartialOrder α] (rank : α → ℤ) (D m : ℕ) (hm : 0 < m) (h : has_fractional_scd_with_denominator rank D) : has_fractional_scd_with_denominator rank (D * m) := by rcases h with ⟨𝒞, τ, h_symm, h_pos, h_den, h_sum⟩ refine ⟨𝒞, τ, h_symm, h_pos, ?_, h_sum⟩ intro C hC rcases h_den C hC with ⟨k, hk⟩ refine ⟨k * m, ?_⟩ rw [hk] push_cast have hm_ne : (m : ℚ) ≠ 0 := by positivity exact (mul_div_mul_right (k : ℚ) (D : ℚ) hm_ne).symm