← All parts of this equation

Equation 73 · Part 10 · The Bit Comes Back Before the Bearing

superscript

⟨Sm,n⟩=∑k=n+1mn1k  −  m−12n\langle S_{m,n}\rangle = \sum_{k=n+1}^{mn}\frac1k \;-\; \frac{m-1}{2n}
superscript

What this part means

A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.

Its job in the formula

A raised mark can be a power or an index. Its position and the surrounding notation determine which.

The passage around this formula

Hayden and Preskill’s own result, sharpened into an explicit, efficient decoding circuit by Yoshida and Kitaev, is that once scrambling of this kind has run for about t∗t_* , collecting only a handful more qubits of radiation than were thrown in — not a number that grows with the hole’s size — suppresses ϵL\epsilon_L exponentially in that small handful [ 15 ] . The mechanism behind that exponential suppression is worth seeing exactly rather than taking on faith, and Page’s own formula for the average entanglement entropy of a subsystem of a random pure state supplies it. For an m -dimensional subsystem embedded in an mn -dimensional Haar-random pure state, ⟨Sm,n⟩=∑k=n+1mn1k  −  m−12n\langle S_{m,n}\rangle = \sum_{k=n+1}^{mn}\frac1k \;-\; \frac{m-1}{2n}. is exact [ 4 ] .…

Read this part in the article →

Learn the underlying idea

An exponent tells how a base is used in multiplication. In x³, x is the base and 3 is the exponent: x³ = x × x × x.

Open the illustrated exponents: repeated multiplication and powers guide →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.