How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Intervals in a poset; locally finite, lower-finite and upper-finite posets
Definition
Let be a poset (Partial order and partially ordered set). For comparable elements , the closed interval from to is
The principal ideal below and the principal filter above are
The poset is
- locally finite when is finite for every ;
- lower-finite when is finite for every ;
- upper-finite when is finite for every .
Here finite has the meaning of Finite, countably infinite, countable, uncountable, and finite cardinalities are those of The cardinality of a finite set. Every lower-finite poset is locally finite because , and every upper-finite poset is locally finite because ; both conclusions use that a subset of a finite set is finite (A subset of a finite set is finite, with , and equality holds if and only if ).
Remarks
Local finiteness controls sums over one interval . It does not imply that a whole principal ideal or principal filter is finite. The one-sided hypotheses are therefore stated separately because global inversion sums range over those larger sets.
Depends on
Used by
- A poset with a bottom, a top and countably many incomparable middle elements has an infinite interval, so convolution of constant-one functions is not defined Counterexample
- The incidence functions I(P,R) of a locally finite poset and their convolution Definition
- False: convolution defines an incidence algebra for every poset False statement
- If every diagonal value of an incidence function is a unit, recursive interval formulas construct both a left and a right convolution inverse Lemma
- The divisibility poset is lower-finite, and each divisor interval factorises as a product of finite chains of prime exponents Lemma
- Möbius inversion on a lower-finite poset, with the dual upper-finite form Theorem
- The Möbius function of a product poset is the product of the Möbius functions Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 35 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- R. Stanley, Enumerative Combinatorics, Volume 1, §§3.6–3.8 (standard reference, not scraped)