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.
, with
Statement
, and for every , in ,
the sum being over the finite index set (The sum over a finite index set, and its product form) and the Catalan number (The Catalan number ).
Facts & Assumptions
Given: a natural number , and the set of triples with , and .
, and (The Catalan number ).
The map sending to the diagonal path whose step word is , the step word of , , the step word of , is a bijection (Every Dyck path of semilength factors uniquely as with and ).
is finite and nonempty for every ( is a finite set).
If is finite and are pairwise disjoint finite sets, then is finite with (The sum rule: a finite disjoint union is finite with and , and a sum over a finite index set splits along a partition, clause 2).
If and are finite then is finite and (The product rule: , and , clause 1).
For a finite index set and , is defined and equals for any bijection with ; taking and the identity gives (The sum over a finite index set, and its product form, clause (a)).
If is finite and is a bijection then is finite and (The cardinality of a finite set).
Proof
For each with put . These sets are pairwise disjoint, since their members differ in the first coordinate, and their union is . Each is finite with : the sets and are finite by [L2], so [L4] makes the product finite of cardinality by [F1], and pairing with the single element is a bijection onto , which [L6] makes cardinality preserving.
The index set is finite, so [L3] applies and gives that is finite with , the sum being the natural-number sum of [L5] over that index set.
By [L1] and [L6], , which with step 2.1 is the stated identity; and by [F1]. At the identity reads , and at it reads .
Remarks
-
The recurrence determines the sequence, and the definition does not need it. Every value is computable from by the displayed convolution, but was defined as a count, so the recurrence is a theorem about that count rather than the object's definition. That is what makes the three closed forms on this page statements rather than restatements.
-
Where the first-return decomposition is spent. Only in the bijection: the sum has one summand for each possible length of the inner block, and the disjointness of the summands is the uniqueness half of that decomposition.
Depends on
- Every Dyck path of semilength $n+1$ factors uniquely as $U\,P\,D\,Q$ with $P\in\mathcal{D}_i$ and $Q\in\mathcal{D}_{n-i}$
- The Catalan number $C_n:=\lvert\mathcal{D}_n\rvert$
- $\mathcal{D}_n$ is a finite set
- The sum rule: a finite disjoint union is finite with $\lvert A \cup B\rvert = \lvert A\rvert + \lvert B\rvert$ and $\lvert\bigcup_{i \in I} A_i\rvert = \sum_{i \in I}\lvert A_i\rvert$, and a sum over a finite index set splits along a partition
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
- The sum $\sum_{i \in S} a_i$ over a finite index set, and its product form
- The cardinality $\lvert A\rvert$ of a finite set
Used by
Dependency tree · two levels
34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- A. Postnikov (notes by A. Lin), MIT 18.212 Algebraic Combinatorics, Spring 2019, Proposition 5 (standard reference, not scraped)
- D. Guichard, An Introduction to Combinatorics and Graph Theory, §3.5 (standard reference, not scraped)