Lecture 42 · Mathematics
Four transfers restore the whole packet
Video in production
This lecture is still face down. Its script is written; filming and animation are under way.
Meanwhile, read the outlineWhat you will learn
Prove fourth-power identity and distinguish permutation order from individual orbit lengths.
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.
Ask whether every card returns
- Same k each time
- 2k≥n
- Does the WHOLE packet return?
Complete the fourth transfer proof
- F⁴=identity
- After 4: T M B
- Block locations AND internal order restored
Separate repeated return from least period
- Return after 4 ≠ first return after 4
- Order divides 4
- Possible cycle lengths: 1, 2, 4
Build cycles using the old-to-new map
- (1 10 3 8)(2 9)(4 7)(5 6)
- Every position appears once
- Arrows mean OLD position → NEW position
Explain why cycle lengths divide four
- L divides 4
- 1 | 4, 2 | 4, 4 | 4
- Three-cycles would contradict F⁴=identity
Find a fixed center and shorter cycles
- n=2m+1
- Center m+1 maps to itself
- Fixed point = cycle of length 1
Turn the proof into a verification routine
- Proof: symbolic blocks
- Check: exact arrays for stated inputs
- Test the boundaries
Set the companion challenge
- Predict FIRST return
- Find an order-2 and an order-4 example
- Whole-packet restoration includes every identity
Companion interactive
Planned
Determine individual and whole-packet first return times.
The interactive for this lecture is being built and will appear here.
Notes
Written notes for this lecture will appear here.
Sources
- Mathematical Card Magic, Chapter A, pp. 38–42
How these sources were used
- COAT mechanism and conditions checked against source; spoken presentation, examples and companion challenges are teaching adaptations.