Magic & Math with Cards

Lecture 35 · Mathematics

The ultimate invariant

Prefixes are intervals

Video in production

This lecture is still face down. Its script is written; filming and animation are under way.

Meanwhile, read the outline

What you will learn

Characterize Gilbreath deck-list permutations exactly by their consecutive-prefix sets.

Before this lecture

In this lecture

An outline of the lecture, scene by scene, with the statements that appear on screen. It follows the draft script, so details may change in production.

  1. Define the exact permutation convention

    • π(i) = original card at output position i

  2. Prove necessity

    • Next card extends an interval endpoint

  3. Build a prefix test

    • max(prefix) − min(prefix) + 1 = prefix length

  4. Prove sufficiency

    • Every interval-prefix permutation is realizable

  5. Reconstruct and expose duplicates

    • Different histories can give the same output

  6. Unify label effects and distinguish inverse

    • The inverse need not satisfy the prefix property

  7. View the process backward

    • Remove only an endpoint

  8. Play the characterization

    • Characterization = necessity + sufficiency

Companion interactive

Planned

Build or recognize exactly the Gilbreath permutations and reconstruct a legal shuffle.

The interactive for this lecture is being built and will appear here.

Notes

Written notes for this lecture will appear here.

Sources

How these sources were used
  • Persi Diaconis and Ron Graham, Magical Mathematics: Consecutive-prefix characterization, with explicit deck-list convention and constructive converse.