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.
Descents and excedances are equidistributed on
Statement
For every and every , the number of permutations of with exactly descents equals the number with exactly excedances.
Facts & Assumptions
Given: A natural number , the order-reversing permutation of , and the fundamental transformation .
Under Foata's fundamental transformation, anti-excedances become descents (Under Foata's fundamental transformation, anti-excedances become descents).
Proof
Define . Then, for every , if and only if , which is equivalent to . Thus is an anti-excedance of exactly when is an excedance of , so .
The map is a bijection of , because conjugation by a permutation has inverse itself. Also is a bijection: from a one-line word, insert a left parenthesis before each left-to-right maximum and a closing parenthesis just before the next such maximum, or at the end, to recover the standard cycle form.
By [L1], , which equals by step 1.1. Since step 1.2 makes a bijection of , the statistics and are equidistributed.
Depends on
Used by
Dependency tree · two levels
4 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
- Andrew Lin, MIT 18.212 Algebraic Combinatorics, Lecture 10 (standard reference, not scraped)