Paper II visual guide · Visual 3 of 24 · MODEL A / LOSSLESS ADDRESS REFINEMENT

Follow one coefficient through the tower

Traditional paper: Theorem 3.3 (p. 3), Theorem 4.6 (p. 11)

Start reading

Resources & source

Original plate in the visual-guide PDF · Original atlas source

Skip contents and start reading

Take a vector \(x=(x_0,\ldots,x_{15})\). A packet is not a single summary number: it retains every coefficient at its selected addresses. For example,

\[ P_{2,0}x=(x_0,0,x_2,0,\ldots,x_{14},0). \]

The rail below lists the addresses in each packet. Its display order groups descendants under their parents. The matrix example on V5 instead uses increasing residue order.

Sixteen addresses in three packet arrangements
Original drawing. Read the description below; expand the labels and data for selectable text.

Reading the drawing

Each arrangement contains all sixteen addresses once. The heavier boundaries in the drawing group the residues into packets; the coefficient values are unchanged. The label tables list the residue groups in the displayed order.

Drawing labels and data 69 labels

Read the original labels as selectable text. Tables preserve grid relationships; other short labels are grouped compactly.

\(N=2\)
Residue groupAddress 1Address 2Address 3Address 4Address 5Address 6Address 7Address 8
\(r=0\)\(0\)\(2\)\(4\)\(6\)\(8\)\(10\)\(12\)\(14\)
\(r=1\)\(1\)\(3\)\(5\)\(7\)\(9\)\(11\)\(13\)\(15\)

Total addresses

  • 16
\(N=4\)
Residue groupAddress 1Address 2Address 3Address 4
\(r=0\)\(0\)\(4\)\(8\)\(12\)
\(r=2\)\(2\)\(6\)\(10\)\(14\)
\(r=1\)\(1\)\(5\)\(9\)\(13\)
\(r=3\)\(3\)\(7\)\(11\)\(15\)

Total addresses

  • 16
\(N=8\)
Residue groupAddress 1Address 2
\(r=0\)\(0\)\(8\)
\(r=4\)\(4\)\(12\)
\(r=2\)\(2\)\(10\)
\(r=6\)\(6\)\(14\)
\(r=1\)\(1\)\(9\)
\(r=5\)\(5\)\(13\)
\(r=3\)\(3\)\(11\)
\(r=7\)\(7\)\(15\)

Total addresses

  • 16

Each cell is an address n; its coefficient travels with it.

Open the full-size drawing

Evidence note from the source edition

Every row contains all sixteen addresses exactly once. A heavier boundary separates packet ranges. The numbers are coefficient addresses, not new coefficient values. There is no interpolation, averaging, or omitted high-frequency tail.

The address \(6\) is even, is \(2\) modulo \(4\), and is \(6\) modulo \(8\). Its coefficient therefore lies in the successive ranges

\[ P_{8,6}X\subseteq P_{4,2}X\subseteq P_{2,0}X. \]

The corresponding identities hold as operators:

\[ P_{2,0}=P_{4,0}+P_{4,2},\qquad P_{4,2}=P_{8,2}+P_{8,6}. \]

Applying either composite parent selector to \(P_{8,6}x\) leaves it unchanged. Applying the odd selector kills it. This is absorption between a parent and a child, rather than an approximate resemblance between nearby scales.

Why the reconstruction is unique

If a vector is a sum of components in disjoint packet ranges, apply the projector for one range. All other components vanish and the selected component remains. Thus every child component is recovered uniquely from the sum.

Read this as

Refinement is a sharper address book for the same coefficients. The total number of free coordinates does not change.

Source and conversion record

The original atlas wording, equations, and drawing labels are retained. Drawings are views of the retained visual-guide PDF. Text descriptions and table headings are added reading aids. This conversion does not rebuild TeX, rerun the examples, audit proofs or compile Lean.

Conversion checks and source hashes

Notation in Paper II

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index