Cubist

READ THE ARGUMENT. INSPECT THE EVIDENCE.

Familiar mathematics.
Every step checked.

Explore proofs in cubical homotopy type theory. Follow the mathematical argument, open a definition, and inspect the kernel terms behind it.

Start with a highlight

Ten entry points into the library.

NUMBER THEORY · A GOOD FIRST PROOF

Infinitely many primes

Euclid’s argument: the least divisor of n! + 1 above one is a prime, and it is larger than n. A short proof over binary numbers, with definitions you can follow.

No axioms required. Read Euclid’s proof
HOMOTOPY TYPE THEORY
π₁(S¹) ≅ ℤ

The circle’s fundamental group

Winding number gives a group isomorphism from the circle’s loops to the additive group of integers. Its inverse turns each integer into a loop, and loop composition corresponds to addition.

S¹ is constructed as a suspension using pushouts. Explore loops and integers
ALGEBRA & UNIVALENCE
GroupIso(G, H) =𝒰₁ (G =Group H)

Isomorphic groups are equal

The type of group isomorphisms is equal to the type of equalities between groups. Univalence identifies the types themselves, preserving the full structures: carriers, operations, and laws.

Explore equality of structures
LOGIC & UNIVALENCE
LEM𝒰₀ ⟺ ‖ΣF : Aut(𝒰₀) F(𝟏) ≅ 𝟎‖

Excluded middle as a symmetry of the universe

Excluded middle holds exactly when some automorphism of the universe sends the unit type to the empty type. Such an automorphism makes every proposition equivalent to a negation. Conversely, negating every proposition and fixing every other type is an automorphism, by univalence.

No axioms required: excluded middle is a hypothesis. Follow both directions
SETS & MAPS

Cantor–Schröder–Bernstein

If each of two sets injects into the other, they are equivalent. Follow the construction of a bijection from the two injections.

For sets; uses excluded middle. Read the proof
FINITE TYPES & COUNTING

Pascal’s identity, as an equivalence

Split the subsets of a type with one more point into those that select the point and those that do not. Pascal’s rule becomes an equivalence of Rijke’s binomial types, for all types.

No axioms required. Explore the equivalence
FINITE TYPES & COUNTING

Why there are n! permutations

Pick the image of one element, then permute the rest. A recursive equivalence counts the self-equivalences of an n-element type.

No axioms required. Follow the counting argument
SETS & CHOICE

Every surjection has a right inverse

Apply choice to the fibers of a surjection between sets. The conclusion records mere existence of a right inverse.

Uses the set-level axiom of choice. Inspect the role of choice

Go deeper

Browse by topic in the proof workspace. Click a name to see its source, checked kernel term, and exact axiom dependencies. Send an expression to the workbench to explore its reductions.

Open the kernel workbench