has_fractional_scd_with_denominator
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
- fractional_scd_with_denominator_mulIf a partially ordered type with an integer rank function admits a fractional symmetric chain decomposition with denominator D, then forβ¦
- fractional_scd_with_denominator_one_of_scdIf a finite partially ordered type with an integer rank function admits an ordinary symmetric chain decomposition, then it admits aβ¦
- fractional_scd_of_with_denominatorIf a partially ordered type with an integer rank function admits a fractional symmetric chain decomposition with denominator D, then itβ¦
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)