Matpic
mathematics, in pictures
Theme

The same thing twice — page 7

Two constructions that look unrelated and turn out to be the same object wearing different clothes.
The half of 24 permutations that commutators reach. A block of 24 squares, one per permutation, with the 12 generated by commutators shaded, beside bars counting the homomorphisms to each cyclic group. Algebra

The only bit that survives

A shuffle can be called even or odd, and the label behaves under composition. Ask whether some cleverer label — a number out of three, or out of four — could behave the same way, and the answer is that nothing else can — one bit is exactly what a permutation gives up.

 The character table of the permutations of 4 places, computed from traces. A table with one row per irreducible representation and one column per conjugacy class, giving the trace of the matrix each representation assigns, with the dimension column marked. Algebra

When the label may be a matrix

A permutation carries exactly one bit into any commutative target, and commutativity is the restriction doing all the work. Drop it — let the label be a matrix — and what survives is a short finite table, computed here from traces and checked for orthogonality over every pair of rows.

 Two convex sets 1.50 apart, and the line that separates them. Two convex polygons with a straight line drawn between them, together with the shortest segment joining the two sets, whose perpendicular bisector the line is. Analysis

A wall between two bodies

Two convex sets that do not meet can be told apart by a single straight line, and the line is a certificate — one object, checkable in a moment, proving something about every point of both. Remove convexity from either and no line exists, which is what the hypothesis was for.

 Every parity pattern of length up to 12, and each occurring exactly once. A bar for each pattern length, showing the number of distinct parity patterns produced by all remainders of that power of two, which equals the number of remainders at every length. Dynamics

Every pattern happens exactly once

Choose any sequence of odds and evens and there is exactly one residue class whose orbit follows it, and exactly one fraction that cycles through it forever. The Collatz conjecture is then the statement that only one of those infinitely many cycles is made of whole numbers.

 A 6-cycle and two 3-cycles: refinement cannot tell them apart. Two graphs side by side — one cycle and two smaller cycles — with the same number of points, the same number of edges and every point of the same degree. Logic

The game the algorithm was playing

Change what Duplicator has to offer — a whole bijection instead of one element — and the game stops measuring first-order logic and starts measuring colour refinement, the algorithm every practical graph-isomorphism test begins with. Two subjects that grew apart are one game with the moves relabelled.

 Where a word of m letters stops being distinguishable from one of m + 1. A row for each quantifier depth and a cell for each length, shaded where Duplicator survives the game between words of that length and one longer. Logic

A language that can name a set

Allow a sentence to quantify over sets of positions as well as positions, and on words the answer changes completely: the sets buy exactly the languages a finite automaton recognises. Whether the number of letters is even is the smallest example of what the sets are for.

 Two charts on one sphere, meeting by the reciprocal. A sphere with its two polar caps marked, each the part missed by one of the two stereographic charts, and the band where both charts are defined shaded between them. Topology

One chart is never enough

Stereographic projection matches the sphere minus a point with the whole plane, and the missing point is not a blemish to be tidied away. It is a theorem — no single flat picture covers a sphere — and the repair is two pictures with a rule for passing between them.

 5 circles filling a three-sphere, every pair linked once. Several closed curves in space, nested on tori of different sizes, each pair passing through the other exactly once and none of them touching. Topology

The circles that fill a three-sphere

A three-sphere is filled by circles — one through every point, no two meeting, every two linked exactly once. Stereographic projection is the only way anybody sees it, and the projected picture is a nest of circles on tori whose linking can be counted off the drawing.

 One subtraction clears a direction. Gram–Schmidt on two planar vectors, in 3 panels: the pair as given, the shadow of the second on the first, and the perpendicular pair that is left when the shadow is removed. Algebra

One subtraction clears a direction

A basis is a set of directions to measure along, and most bases are awkward because the directions get in each other's way. Removing one shadow at a time turns any basis into one where every coordinate is a shadow and nothing interferes.

 1/(1 + x²), expanded about 1.2. 1/(1 + x²) with Taylor sums of degree 2, 6, 14 about x = 1.2 rather than about zero. The interval they converge on reaches 1.562 either side of the centre. Analysis

The centre is a choice

A Taylor series is nearly always written about zero, and nothing about the construction prefers zero. Moving the centre moves the interval the series works on, and moving it repeatedly walks the function into places its first series could never reach.

 A dissection that never comes apart. The three pieces of the triangle-to-rectangle dissection drawn at 4 moments of the swing. Each top piece turns about a pin at the end of the slice it stands on, and the pieces stay joined throughout. Computation

A dissection that never comes apart

The plane theorem lets the pieces be picked up and put down anywhere. Require instead that they stay joined at their corners and swing, and the theorem survives — which was open for a century and is a much stronger statement about the same cuts.

 35 routes across a 4 by 3 grid. A grid with each cell holding the number of monotone routes reaching it. The far corner holds 35, which is the binomial coefficient of 7 choose 3. Discrete

Every entry counts the routes to it

Turn Pascal's triangle forty-five degrees and it becomes a grid of street corners, with each entry counting the ways of walking there. Identities between the entries then become statements about routes, and the statements are proved by cutting the routes in one place.

 3 carries in base 2, and 2 divides it 3 times. The addition of 5 and 7 written in base 2, column by column, with the carries marked. There are 3, and 2 divides the binomial coefficient 792 exactly 3 times. Discrete

The carries decide the divisibility

How many times a prime divides a binomial coefficient is not a fact about the coefficient at all. It is a count of the carries that happen when two numbers are added in that prime's base, which is a question about column addition and has nothing to do with choosing anything.

 A carpet whose two dimensions differ by 0.076. A self-affine carpet built by keeping 5 cells of a 4 by 2 grid and repeating 4 times. Its box dimension is 1.6610 and its Hausdorff dimension 1.5850. Dynamics

A carpet with two dimensions

For every self-similar set met so far the two definitions of dimension agree, and the agreement is a theorem about sets built from copies of themselves scaled equally. Stretch one direction more than the other and the two numbers come apart, by an amount that can be computed exactly.

 A dimension of 1.2576, from two stretching rates. The running averages of the Hénon map's two Lyapunov exponents, settling at 0.4177 and -1.6217. Kaplan and Yorke's formula turns them into a dimension of 1.2576 without counting a single box. Dynamics

A dimension from the stretching rates

An attractor has no construction rule, so its dimension has to be counted — which was the whole case for defining dimension by counting. Kaplan and Yorke's formula computes it instead, from two numbers that describe the map and never look at the set.

 Every ray aimed at one focus is turned towards the other. A hyperbola with its two foci and 13 rays aimed at the far one. Each strikes the near branch from outside and is turned towards the near focus — which is the property a Cassegrain telescope's secondary mirror uses. Geometry

Aimed at one focus, turned towards the other

An ellipse sends every ray leaving one focus through the other. A hyperbola does something that sounds like the same sentence and is not — it takes a ray aimed at the far focus and turns it towards the near one, which is what the second mirror of a telescope is for.

 Two families of conics, crossing at right angles. 4 ellipses and 3 hyperbolas with the same pair of foci. Every ellipse meets every hyperbola at a right angle, checked at all 12 crossings. Geometry

Two families that cross at right angles

Fix two points and draw every ellipse with those foci, then every hyperbola with the same two. Each curve of the first family meets each of the second at a right angle, so between them they are a coordinate system — and the reason is one sentence about angle bisectors.

 One sign decides which curve it is. 3 conics drawn from the general quadratic, each labelled with its discriminant B² − 4AC and the curve that sign names, checked against how many times the curve meets a large circle. Geometry

One sign decides which curve

The general quadratic in two variables has six coefficients and draws a conic. Which of the four it draws is settled by a single combination of three of them, and the other three cannot change the answer however they are chosen.

 7 steps and 3 withdrawn assumptions. A natural-deduction derivation of (p → q) → (¬q → ¬p). Each horizontal bar is one inference, named on its right; the bracketed formulas are assumptions, and each is withdrawn at the step that names it. Logic

The assumption a proof pays back

A tableau assumes the opposite once and takes it apart. Natural deduction assumes things freely, uses them, and then withdraws them — and the withdrawal is what turns a derivation of a consequence into a proof of an implication.

 The tree as words in two matrices. 6 nodes of the Stern–Brocot tree, each as the word of turns reaching it, the matrix that word multiplies out to, its two columns as fractions, and the mediant of those columns. Number

Two matrices that generate the tree

A node of the Stern–Brocot tree is not really a fraction — it is the pair of fractions it lies between. Written as the columns of a matrix, the two turns of the tree become two multiplications, and the determinant that kept everything in lowest terms becomes a property of a product.

 Every positive rational, in one sequence. The first 32 terms of Stern's diatomic sequence as bars, with the ratios of consecutive terms beneath. Every ratio is in lowest terms, no two agree, and each term counts the hyperbinary representations of its index. Number

Every rational in one sequence

The tree lists every positive fraction once and needs a tree to do it. One recursion on the whole numbers lists them in a single row — and each term of it counts something nobody was asking about, which is why the enumeration works.

 3 symmetries over 3 sheets: a regular covering. A 3-sheeted covering of a wedge of 2 circles, with the permutations of its sheets that commute with every generator. There are 3, against 3 sheets. Topology

The symmetries a cover has of its own

A covering space can be shuffled without disturbing anything below it, and how many ways there are is decided by the subgroup it corresponds to. When there are as many symmetries as sheets the covering is called regular, and that is the same statement as the subgroup being normal.

 3 sheets, 8 of 26 words coming back. A table of reduced words in two generators with the sheet each sends the base sheet to. The words returning to it are the covering's subgroup, and the 3 sheets are its cosets. Topology

A covering is a permutation

Describing a covering means saying where each loop sends each sheet, which is a permutation for every generator. So a covering of a wedge of circles is nothing but a homomorphism to a symmetric group, and the subgroup it corresponds to is a stabiliser.

 6 vertices folded to 4, and a graph that decides. The graph built from 3 generator words, folded until no vertex has two edges of one label leaving it. Reading a word from the base vertex decides membership, and 6 words are tested. Topology

Folding a graph until it decides

A subgroup of a free group usually arrives as a list of words, and almost nothing about it is readable from the list. Draw the words as loops, merge every pair of edges with the same label leaving one point, and what is left is a machine that decides membership by reading.

All themes