Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

The RSK and longest-increasing-subsequence consequences remain owned by the hook-length/RSK page

Remark

This page consumes the distribution of the Robinson-Schensted shape of a uniform permutation (The RSK shape of a uniform random permutation has the Plancherel law) and Schensted's longest increasing and decreasing subsequence theorem only to localize Plancherel profiles (The RSK union bound localizes Plancherel profiles). It does not re-mint RSK, the LIS/LDS identities, the Baik-Deift-Johansson theorem, the Tracy-Widom distribution, determinantal point processes or edge statistics of Plancherel measure: those belong to the hook-length/RSK page and to separate analytic-probability suppliers, and the limit-shape theorem proved here (Plancherel Young diagrams converge to the limit shape) is the qualitative law of large numbers, not a fluctuation or edge result. In particular no sharp constant, rate or fluctuation-distribution statement is asserted: the localization lemma gives only the bound λ1,λ1′≤Cn with probability tending to one, for each fixed C>e, and the limit-shape theorem gives only convergence in probability of the scaled profile to Ω.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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