Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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 Sn

Statement

For every n∈N and every k∈N, the number of permutations of Sn with exactly k descents equals the number with exactly k excedances.

Facts & Assumptions

Given: A natural number n, the order-reversing permutation c(i):=n−1−i of n, and the fundamental transformation F:Sn→Sn.

[L1]

Under Foata's fundamental transformation, anti-excedances become descents (Under Foata's fundamental transformation, anti-excedances become descents).

Proof

technique · constructive
1.1givenalgebra

Define τ:=c∘σ∘c. Then, for every i∈n, τ(i)<i if and only if c(σ(c(i)))<i, which is equivalent to σ(c(i))>c(i). Thus i is an anti-excedance of τ exactly when c(i) is an excedance of σ, so ∣AExc⁡(τ)∣=exc⁡(σ).

1.2givenconstruct

The map σ↦τ=c∘σ∘c is a bijection of Sn, because conjugation by a permutation has inverse itself. Also F 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.

2.1step 1.1step 1.2L1discharge-construct∎

By [L1], des⁡(F(τ))=∣AExc⁡(τ)∣, which equals exc⁡(σ) by step 1.1. Since step 1.2 makes σ↦F(cσc) a bijection of Sn, the statistics des⁡ and exc⁡ 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