AFTD Auto-Formalizing Theoretical Domains

fractional_scd_of_with_denominator

theoremverified

If a partially ordered type with an integer rank function admits a fractional symmetric chain decomposition with denominator D, then it admits a fractional symmetric chain decomposition.

Statement

theorem fractional_scd_of_with_denominator
    {α : Type*} [PartialOrder α] (rank : α → ℤ) (D : ℕ)
    (h : has_fractional_scd_with_denominator rank D) :
    has_fractional_symmetric_chain_decomposition rank
Source
arXiv:2610.24148, Section 2.7.4
Verified
25 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3

Read back from the Lean

Let α be a partially ordered type, rank : α → ℤ a rank function, and D : ℕ a natural number. If rank admits a fractional symmetric chain decomposition with denominator D (that is, there exists a finite family of symmetric saturated chains 𝒞 and a weight function τ : Set α → ℚ taking values of the form k / D with k : ℕ and τ C ≥ 0 such that for every element x : α, the sum of the weights of chains containing x is 1), then rank admits a fractional symmetric chain decomposition (the same property without the requirement that weights have denominator D).

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

A fractional symmetric chain decomposition with denominator $D$ is a special case of a fractional symmetric chain decomposition where each chain's weight is constrained to be an integer multiple of $1/D$. The proof unpacks the assumed decomposition and provides the same family of chains and weight function to witness the unconstrained decomposition, dropping the restriction on denominators.

  1. We obtain a finite collection of chains $\mathcal{C}$ and a weighting function $\tau$ satisfying the four conditions of a decomposition with denominator $D$.

    Unpacking the definition of `has_fractional_scd_with_denominator` from the hypothesis $h$ yields a finite family of chains $\mathcal{C}$, a weight assignment $\tau : \mathrm{Set}\,\alpha \to \mathbb{Q}$, and four properties: each chain in $\mathcal{C}$ is symmetric and saturated ($h_1$), the weights are non-negative ($h_2$), each weight is of the form $k/D$ for some $k \in \mathbb{N}$ ($h_3$), and for every element $x$, the sum of weights of chains containing $x$ is 1 ($h_4$).

    line 6

      obtain ⟨𝒞, τ, h1, h2, h3, h4⟩ := h
  2. The pair $(\mathcal{C}, \tau)$ witnesses that the ranked poset admits a fractional symmetric chain decomposition.

    The definition of `has_fractional_symmetric_chain_decomposition` requires existence of a chain family and non-negative weights summing to 1 at each element, but places no constraint on denominators. Supplying $\mathcal{C}$ and $\tau$ along with $h_1$, $h_2$, and $h_4$ satisfies the goal, discarding the denominator condition $h_3$.

    line 7

      exact ⟨𝒞, τ, h1, h2, h4⟩

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

/-- A fractional symmetric chain decomposition with denominator D implies a fractional symmetric chain decomposition. -/theorem fractional_scd_of_with_denominator    {α : Type*} [PartialOrder α] (rank : α → ℤ) (D : ℕ)    (h : has_fractional_scd_with_denominator rank D) :    has_fractional_symmetric_chain_decomposition rank := by  obtain ⟨𝒞, τ, h1, h2, h3, h4⟩ := h  exact ⟨𝒞, τ, h1, h2, h4⟩
See it in the graphDiscuss this resultChallenge it