Maths is discovery, not invention. Nearly every piece of this site was found before — often decades before, sometimes by engineers solving an unrelated problem. This page names them. Arriving somewhere already furnished does not make the walk less real.
Red −1, green 0, blue +1 in base two — a redundant representation, where the same number has many spellings.
Blue and red edges read as a number, and the +/− address that names it.
+ − + − address
The sign expansion — a sign expansion of a surreal number is exactly
a Hackenbush chain. Combinatorial game theory
Where the digits come from — and why they cannot start any earlier.
0 is not a point. Between −0 and +0 sits an entire structure of games, and the numbers on the rest of this site only begin once you are out of it. The order, Red to Blue, with every step ascending:
It is not linearly ordered, and that is the point. The game
∗ = {0 | 0} is not less than 0, not greater than 0, and not equal to
it — it is confused with it. Trichotomy fails, so there is no side to be on.
Left and right are total-order words and cannot be used in here. Red
and Blue can, because they name whose advantage rather than which direction — which
is also the Winning Ways convention: bLue is Left, Red is Right. The
vocabulary did not happen to fit. It is the only vocabulary that can.
The rim is made of the centre. tiny-on is not tiny stacked on tiny.
on = {on |} is a game, pronounced omega, and it is above everything;
tiny-on is tiny parameterised by it — the smallest thing you can build,
made out of the biggest thing there is. So the structure closes on itself. Stretch the
pinhole at 0 open and look down, and on is what is at the bottom, because it
was the material all along. That is inversion in a circle: the map that swaps a disc’s
centre with its boundary. Every positive infinitesimal is greater than 1/on,
so the floor of the whole zoo is the reciprocal of what sits at its middle.
Zero is doubled and ω is unified, and that asymmetry is a choice. Floating point doubles both; the Riemann sphere unifies both. Doubling only zero is what makes this a disc with a centre rather than a sphere, and what turns the chain above into a closed loop rather than a line.
The bits cannot start until you are out. A sign expansion is a number’s
address, and ∗, ↑ and tiny are not
numbers — they have no position for a bit string to point at. Everything else on this site
begins exactly where this zoo ends, and that is forced by the theory rather than chosen.
Meanwhile everything ordinarily called a number — the counting numbers, the reals, the
irrationals, all of analysis — is the single greyed band above, between ε and
ω. One step of thirteen. All the structure is at the two ends.
+x and
miny-x as −x — the two halves are called plus
and minus at the source. miny is exactly −tiny, so the halves of the disc are one
negation apart.
+0 = {0 | {0 | 0}} = {0 | ∗} = ↑,
Winning Ways vol. 1 p. 126
on, the largest there is — is the smallest. The chain is a single
family, not a stack of species.
1/+0 = +∞ while 1/−0 = −∞
Rings of integers, ordered by value — which turned out to be an FFT, a machine part, and a hyperbolic plane.
Move the point, or drop a digit — two different operations, both classical.
One is a rectangle you read; the other is the same rectangle, searched for.
The anti-diagonal sums this site has drawn since its first commit turn out to be one step of a cascade that generates Pascal’s triangle. We had been printing row two the whole time without knowing what it was.
squashDiagonals(hexProduct(A,B)) equals the convolution of A and B on 81 of 81
shapes. Weight depending only on r+c is what makes it one.
arcs(n) — where the commas fall
The two-fold convolution of all-ones, which is
Pascal’s second diagonal
arcs(n) equals the squash of an n×n
all-ones grid, 12/12. arcs(8) = 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 is the
255 × 255 pyramid in the spec. Convolving all-ones k times
gives C(i+k−1,
k−1) exactly — checked for k = 2 to 6.
Phasors summed tip to tail, riding surfaces, tying knots.
Anti-diagonals, mirror symmetry, inversion in a circle, and the basin boundary they turn out to be.
J Aᵀ J
Persymmetric matrices
— symmetric about the anti-diagonal
ρ = 2^((r+c)−(n−1)) and Inner is |ρ|<1, Outer
|ρ|>1, and the Fold the unit circle — which is the Julia set of
z ↦ z², whose two basins are exactly those two hemispheres, with the
anti-transpose as the inversion ρ ↦ 1/ρ between them. 89,439 cells
checked, no exceptions. Cayley asked the
matching question in 1879 —
where Newton’s method lands from a guess
— and for two roots the answer is this picture. For three he could state it and not solve it.
z ↦ z² is the oldest
example there is, and the doubling map credited under Shifting is what it does on the circle
— named here for years without the circle ever being named as its invariant set. Still held
loosely on one point: the coordinate is an exact place value on the product rectangle and a
magnitude ordering on a single folded stalk.
I + F + O = V doing the accounting
It works, and it has a name: an
interleaved
residue (AN) code, with the fold as the
interleaving pattern.
V − σV, gives each hemisphere a
second equation and names any same-region pair with no search: a two-syndrome
arithmetic (AN) code, the residue cousin of a
two-locator BCH code, blind to the Fold it turns
on. As a mirror it is a repetition code
that reads a burst off the partner at twice the size; as an interleaver it is a no-op. The green's
forced slack is the 2-adic valuation of
the value — mean one, and no random square carries its own checks — and a green cannot be a
three-valued erasure on a run, because the
signed-digit alphabet spells
adjacent cells the same integer two ways: the identity push is built on.
L run, along a row, a column, an anti-diagonal, and the
row-major tape that wraps at row boundaries — it has a floor of
⌈L/3⌉ by the
pigeonhole principle, and the
partitions that reach it are
block
interleavers: class(j) = g(j mod L) for a balanced
g. Named again, and not by this project.
3 divides
L a window at the floor has no slack, which forces the tape to be
L-periodic, and then a
coset count decides everything: for a run that
fits across the grid, a partition at the floor exists exactly when 3 divides both
L/gcd(n, L) and L/gcd(n−1, L). So it is arithmetic in the
grid’s width that rules most widths out, not the shape of the partition — while the
fold’s own (r+c) mod 3 is ruled out at every width for a simpler reason:
an anti-diagonal is its level set, so a burst along one lands entirely in a single class. Nothing
here is a claim about the instrument; it is what the instrument’s geometry looks like once the
right question is asked of it.