has_fractional_symmetric_chain_decomposition
A ranked poset admits a fractional symmetric chain decomposition if there exists a finite set of symmetric saturated chains and non-negative rational weights on them such that for every element in the poset, the sum of weights of chains containing that element equals 1.
Statement
open scoped Classical BigOperators in def has_fractional_symmetric_chain_decomposition {α : Type*} [PartialOrder α] (rank : α → ℤ) : Prop
- Defined in
- arXiv:2610.24148, Section 2.7
- Verified
- 24 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_of_scdIf a finite ranked poset admits an ordinary symmetric chain decomposition, then it admits a fractional symmetric chain decomposition.
- young_lattice_one_fractional_scdFor any positive integer n ≥ 1, the Young lattice L(1, n) admits a fractional symmetric chain decomposition.
- 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 α and an integer-valued function rank : α → ℤ, has_fractional_symmetric_chain_decomposition rank asserts that there exist a finite set 𝒞 of subsets of α and a weight function τ : Set α → ℚ such that:
1. Every subset C ∈ 𝒞 is a symmetric saturated chain with respect to rank.
2. For every C ∈ 𝒞, τ(C) ≥ 0.
3. For every element x : α, the sum of τ(C) over all C ∈ 𝒞 that contain x is equal to 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 if there exists a finite collection of symmetric saturated chains with non-negative rational weights covering each element with total weight 1. -/ def has_fractional_symmetric_chain_decomposition {α : Type*} [PartialOrder α] (rank : α → ℤ) : Prop := ∃ (𝒞 : Finset (Set α)) (τ : Set α → ℚ), (∀ C ∈ 𝒞, is_symmetric_saturated_chain rank C) ∧ (∀ C ∈ 𝒞, 0 ≤ τ C) ∧ (∀ x : α, ∑ C ∈ 𝒞.filter (x ∈ ·), τ C = 1)