A read gives a weight to every set of positions of a register. The paper asks five things of it (its B1 to B5, the definition “Reads of the register”, Definition 14). Each is a premise of the theorem “The read is the square” (Theorem 16): the first and the last are its two principal premises, the middle three are mild, and the first is also owed, on the paper’s list as O2:
- B1 · Position by position. The read of one position uses the value held there and nothing else: one rule φ turns each value into its term of the total. Owed
- B2 · Additive. The read of a set of positions is the sum of the reads of its positions. Mild premise
- B3 · An empty position is silent. A position that holds 0 reads 0. Mild premise
- B4 · More is not less. A value at least as large in size never reads less, so a value and its opposite read the same. Mild premise
- B5 · Blind to a common turn. On the registers that four ticks reverse, the total read does not change under the eighth turn, which turns every complex value together (why: What it means, 02). Principal premise
Now take equal halves, a = b. Before the turn, positions 0, 2, 4 and 6 hold a, a, −a, −a (the other four hold 0); after it they hold √2a, 0, −√2a, 0. The turn sends everything to positions 0 and 4 and leaves 2 and 6 empty, the form of a beam splitter’s dark port. A value and its opposite read the same (the fourth item), so the total before is four reads of a, and the total after is two reads of √2a plus two empty positions, which read nothing. Blindness says the totals are equal:
φ(√2 a) = 2 φ(a).
A value √2 times larger reads exactly twice as much. Of all the powers |x|p, only p = 2 does that: the magnitude grows by √2 ≈ 1.414 and the fourth power by 4. Among all reads the doubling alone does not force the square; the whole equation below does, with the rule that more is not less. (The figure at the top runs the same arithmetic on a beam splitter’s two arms, a and b; the register holds each half twice, once with its sign reversed, so its totals are exactly twice the figure’s.)
With any two values the same blindness gives φ(a) + φ(b) = φ((a + b)/√2) + φ((a − b)/√2). The doubling clears the √2 and leaves the parallelogram law, φ(a + b) + φ(a − b) = 2φ(a) + 2φ(b). A rule that obeys it and never reads less for a value larger in size is a constant times the square (“The parallelogram law forces the square”, Lemma 15). So the read of any set of positions, of any register, is that constant times the sum of the squared values there (Theorem 16). The constant is free until the total is set to one; then the read of a set is its share of the sum of squares.
Complex values read as their squared size
On the registers that four ticks reverse, each complex value z is carried by two positions two ticks apart, with their negatives opposite them; the read of the two positions is the constant times |z|², the squared size, and of all four, twice that. Multiplying the register by any unit complex number leaves that read unchanged. The read of one position alone does change: with the constant set to 1, the register with 1 at position 0 and −1 at position 4 reads 1 at position 0 before the eighth turn and 1/2 after (Corollary 17). So the read is still taken position by position, and what a common turn cannot move is its total over each pair: the squared size of that pair’s complex value, the form in which the textbook states the rule.
A single position is half of a complex value, and its read is a term of the total, not an outcome. Were it posted alone, the record would hold a count that a common turn moves (1 to 1/2 above). Between records, a state left alone turns by the step (the second rule in part 01). A stationary state, one that the law between records only multiplies by a number, turns all together at a rate of its own (that histories turn at all is not proved in the paper). The record’s working statement takes the step’s i to be the clock’s two ticks, and with it that turn is a common turn of the register. So the count would rise and fall at twice the state’s own rate, while the record’s counts show only differences of rates (“Counts show beats”, Proposition 10).
So the outcomes a held register offers (one about which nothing has been posted) are sets of positions whose read no common turn moves, and the least of them are its complex values, each carried by two positions two ticks apart. The position read gives the form of a read, one function of each value, added up; it does not say that each term can be posted by itself. On these registers, what is owed is that the read of one complex value is the sum of one function of each of its two halves. That a laboratory’s outcomes are such reads, and which posting a click is, belong to attachment, the paper’s owed statement O1.
A unit total forces the same weights
A second theorem starts from the other end, and it is about a different object: not the two complex values of one register that four ticks reverse, but a system with several outcomes, each carrying a complex value, such as registers taken together. Take such a system with three or more positions, each holding one complex value (the paper states it for eight; the proof uses three), whose squared sizes add to one, and ask five things of a read: the reads add to one, none is negative, an empty position reads nothing, two positions holding values of the same size read the same whatever the other positions hold, and reads add over sets of positions. Then each position reads exactly its squared size (the theorem “Unit total forces the weights”, Theorem 18).
It drops the clock, the rule that more is not less, and every assumption of continuity. It takes the sum of squared sizes as the measure of the whole, as the read above gives on the registers that four ticks reverse, and carries the square from the whole to each part: had fourth powers added to one instead, the same five items would give fourth powers. The argument is of the kind Everett gave in 1957 (part 02), and the proof weighs three positions holding √x, √y and √(1 − x − y), with the rest empty. Three positions are needed: with two, the weight sin²(πx/2) of a squared size x meets every item and is not x (“Three positions are needed”, Remark 19). On the two complex values of the registers that four ticks reverse, the square comes from the first theorem instead.