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.
Path systems between two families of lattice points, and non-intersecting systems
Definition
Fix a natural number , start points and end points in .
For a permutation (The finite symmetric group , one-line notation, and cycle notation), a -system is an -tuple
such that for each index , the path is a monotone lattice path from to (Monotone lattice paths with steps and ).
Two monotone lattice paths intersect when they share a lattice point, that is, when the images of their point functions have a common element of . A -system is non-intersecting when no two of its paths intersect.
Write for the set of -systems and for the non-intersecting ones.
Each set is finite. Indeed, for every index , either the endpoints and are compatible and counts a finite set of monotone paths between them, or they are incompatible and Monotone lattice paths with steps and makes that set empty. Repeated use of The product rule: , and therefore makes the product of those finite sets finite, and that product is exactly . Therefore the subset is finite as well (A subset of a finite set is finite, with , and equality holds if and only if ).
Remarks
-
The definition uses all lattice points of the paths, not only their step words. Two paths that merely cross between lattice points are not visible in this model; everything below is about sharing a lattice vertex.
-
The permutation is part of the datum. A path system records not only which paths occur but also which start is matched to which end.
Depends on
- Monotone lattice paths with steps $E=(1,0)$ and $N=(0,1)$
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- $\lvert\mathcal{M}((0,0),(m,n))\rvert=\binom{m+n}{n}$
- 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 cardinality $\lvert A\rvert$ of a finite set
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
Used by
Dependency tree · two levels
29 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
- C. Krattenthaler, "Lattice Path Enumeration", ch. 10 of the Handbook of Enumerative Combinatorics, §10.13 (standard reference, not scraped)