AFTD Auto-Formalizing Theoretical Domains

has_fractional_scd_with_denominator

def

A partially ordered type with an integer rank function admits a fractional symmetric chain decomposition with denominator D if there exists a finite collection π’ž of symmetric saturated chains and a weight function Ο„ assigning to each chain in π’ž a non-negative rational number of the form k / D for some natural number k, such that for every element x of the poset, the sum of weights of chains in π’ž containing x equals 1.

Statement

open scoped Classical BigOperators in
def has_fractional_scd_with_denominator
    {Ξ± : Type*} [PartialOrder Ξ±] (rank : Ξ± β†’ β„€) (D : β„•) : Prop
Defined in
arXiv:2610.24148, Section 2.7.4
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • 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…
Used by 3

Read back from the Lean

For a partially ordered type Ξ±, an integer-valued rank function rank : Ξ± β†’ β„€, and a natural number D : β„•, has_fractional_scd_with_denominator rank D asserts that there exist: 1. a finite set π’ž of subsets of Ξ± (Finset (Set Ξ±)), and 2. a weight function Ο„ : Set Ξ± β†’ β„š, such that: - for every C ∈ π’ž, C is a symmetric saturated chain with respect to rank (i.e., is_symmetric_saturated_chain rank C), - for every C ∈ π’ž, the weight Ο„ C is non-negative (0 ≀ Ο„ C), - for every C ∈ π’ž, there exists a natural number k : β„• such that Ο„ C = (k : β„š) / (D : β„š) (i.e., Ο„ C is a non-negative rational with denominator dividing D), and - for every element x : Ξ±, the sum of Ο„ C over all chains C ∈ π’ž containing x equals 1 (βˆ‘ C ∈ π’ž.filter (x ∈ Β·), Ο„ C = 1).

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

open scoped Classical BigOperators in
/-- A ranked poset admits a fractional symmetric chain decomposition with denominator D if all chain weights are of the form k / D for k ∈ β„•. -/
def has_fractional_scd_with_denominator
    {Ξ± : Type*} [PartialOrder Ξ±] (rank : Ξ± β†’ β„€) (D : β„•) : Prop :=
  βˆƒ (π’ž : Finset (Set Ξ±)) (Ο„ : Set Ξ± β†’ β„š),
    (βˆ€ C ∈ π’ž, is_symmetric_saturated_chain rank C) ∧
    (βˆ€ C ∈ π’ž, 0 ≀ Ο„ C) ∧
    (βˆ€ C ∈ π’ž, βˆƒ k : β„•, Ο„ C = (k : β„š) / (D : β„š)) ∧
    (βˆ€ x : Ξ±, βˆ‘ C ∈ π’ž.filter (x ∈ Β·), Ο„ C = 1)
See it in the graphDiscuss this resultChallenge it