Skip to content

Maths as Games

One story for all of it: every structure is a GAME — pieces (the carrier set) + rules (the legal moves = the structure). A theorem is an outcome the rules force; a proof is a winning strategy; a definition is a rulebook entry; two games identical once you relabel the pieces are connected (isomorphism = a reskin). The First Isomorphism Theorem is the one universal beat — translate to a new game, fold your game by the moves that do nothing (the kernel), and the fold is a perfect reskin of the positions you can reach. Games shade into machines (inputs → mechanism → outputs) and workshops (materials → tools → product): same skeleton, pick the flavour. Compact by design — each concept is one grid-row + one tiny reused diagram, and reading down a column IS the connection.
🌱 seedling tended 2026-06-02 S714 plan mathematics games metaphor compression structure oxford notes compact 
flowchart LR
  g["a GAME<br/>pieces + rules"] --> m["legal moves<br/>= the structure"]
  m --> t["theorem = forced outcome<br/>proof = winning strategy"]
  g -.->|"reskin"| o["same game, relabeled<br/>= the connection"]
Read next
  • Oxford Math Notes (plan) — the parent build plan — object-indexed notes, the roadmap this compact form serves
  • Three Games, One Board — this method at full depth — information theory, Lie algebras & analytic topology explained whole and fused at the partition function
  • The Master Board — the densest capture — universal moves + 5 deep structures as one grid (~80 concepts at once), the games method generalised
  • statement composition — the operator algebra under the grid — a rule is a constraint; a reskin is transport ≅
  • equivalences atlas — reskins at corpus scale — two games that are one game is the cross-field connection
  • Plans — the build-spec format + index

S714 swarmgod. Compact rebuild after the verbose blueprint pages were rejected: combo of a fixed structural grid (carrier·rules·map·fold·law) + reused mini commutative diagrams, all inside ONE story (games / machines / workshops). Grounded in the downloaded notes (../oxford-lecture-notes-2024-25/): A2.1 Metric Spaces arc, M1 Groups, M1 Linear Algebra I.

Every structure is a game. Pieces + rules. A theorem is an outcome the rules force; a proof is a winning strategy; a connection is the same game with the pieces relabeled. Games shade into machines (inputs → mechanism → outputs) and workshops (materials → tools → product) — one skeleton, pick the flavour.

The world — one story, many things

in the game is the maths
pieces / board the carrier set
rules = legal moves the structure: combine two pieces (·, +·, +scale), distance (d), rank (≤)
lawful translation a structure-preserving map — replay game A inside B (homomorphism · continuous · monotone)
mini-game a sub-structure (fewer pieces, same rules)
house rules a quotient A/∼ — agree some positions are "the same", fold them into one
null-moves / reachable the kernel (lands on home) / the image (positions you can get to)
fill the endgame completion — add the missing limit-positions (ℚ→ℝ, X→X̂)
reskin isomorphism ≅ — same game, pieces relabeled → this is the connection

The central beat — one move, every game

flowchart LR
  A["game A"] -->|"lawful map f"| B["game B"]
  A -->|"fold by ker f"| Q["A / ker f"]
  Q -->|"reskin"| B

Translate to a new game, fold your game by the moves that do nothing, and the fold is a perfect reskin of the positions you can reach: \(A/\ker f \cong \operatorname{im} f\) — groups, rings, vector spaces, modules, one move.

The grid — rows are games, columns are the rules of play

Read across = one game's structure; read down a column = the connection (same slot, different fill).

game pieces rules (legal moves) lawful translation house-rules (fold) reskin law
group G · , reset e , undo ⁻¹ hom G/N G/ker f ≅ im f
ring R + , · preserves +,· R/I R/ker f ≅ im f
vector space V + , scale linear V/U V/ker f ≅ im f
metric space X distance d continuous X̂ (fill endgame) X ↪ X̂ dense
order P rank ≤ monotone P/∼ —

Theorem = a forced outcome · proof = a strategy

  • theorem = "from this position the rules force that one" (or "no strategy can do X")
  • proof = the winning sequence of legal moves · counterexample = a legal position that breaks the claim
  • Lagrange = every mini-game's size divides the whole game's (\(|H|\mid|G|\)) · Rank–Nullity = frozen pieces + still-movable pieces = pieces you started with (\(\dim\ker f+\dim\operatorname{im} f=\dim V\))

A lecture = a playthrough

Metric Spaces, one play: set the board with a ruler → learn which squares are "near" → keep only no-teleport moves → spot boards that are the same game reskinned → fill in the endgame → ask if the board is one connected region. (8 chapters, one playthrough.)

Flavours — game · machine · workshop

Same skeleton, different feel; pick per topic:

  • machine (best for maps · operators · transforms): inputs = pieces, mechanism = rules, kernel = inputs giving 0, image = achievable outputs.
  • workshop (best for constructions): materials = pieces, tools = operations, span = everything buildable from the starting materials, product = what you make.

See also