Mathematical Theory Generated with theVacuum.Net Theory

J.Konstapel,Leiden,16-11-2026.

Jump to the book here

Building Mathematics from Movement: A Plain-Language Guide to the Vacuum.Net Theory

What This Book Tries to Do

Most mathematics starts with rules and builds outward. This book starts with movement. It asks a simple question: what if we begin with the smallest possible act, a point that moves out and comes back? From that single act, the author builds a ladder of mathematical structures. Each rung of the ladder produces something new. Each rung asks: which field of mathematics already has a name for this?

The book is called “Mathematical Theory Generated with the Vacuum.Net Theory.” It is version 3.0, written by J. Konstapel, dated 16 November 2026. It has twenty-two rungs. Each rung is a chapter. Each chapter has four parts: what the net does, which field names it, what is established, and what remains open.

The goal is derivation. The book tries to show that mathematics can grow from below. Where the derivation stops, the book names the smallest assumption still needed. These stopping points are results too. They show exactly what the net does not yet give.

How to Read the Book

Each chapter follows the same pattern. First, the net does something. Second, a field of mathematics gives it a name. Third, the book lists what is established. Fourth, the book lists what is open.

Every statement in the third part carries a label. There are four labels.

Proved in Agda. Agda is a computer proof assistant. A theorem in Agda is checked by the machine. The proof must pass the type checker under a safety flag called –safe. No shortcuts are allowed. The Agda file name is given.

Checked by computation. A finite fact is recomputed in Python. The script is named. This is not a proof for all cases. It is a check for specific cases.

Known theorem. This is an established result of mathematics. It is cited to its source. It is not reproved here.

Reading. This is an interpretation. It links the net to the field. It is not a theorem. Readings are listed separately.

The Method

The book matches each rung to a field of mathematics. This shows where mathematics has already named a structure of the net. It does not show that the theory is true. The book claims only this: the structures arise in this order from one rule. Each already has a name.

The order of the book is the order of the net. It is not the order of history. History found these structures in no fixed order. A study found no significant relation between the order of the theory’s chain and the dates of the results it uses.

Working from below solves a problem. When a named concept is taken first and then written as trits, its trit word depends on how it is written down. When the net generates the structure first, the word comes first. The name is added afterwards.

The Two Lines of Mathematics

The book describes two lines in the history of mathematics.

The Indian and Chinese line generates. Rules produce words. Each word gets a place. The oldest example is Pāṇini’s grammar, around the fourth century BCE. It produces the words of Sanskrit from about four thousand short rules. Piṅgala, in the third or second century BCE, gives a procedure to list all metres of a given length. He also gives a rule to find the place of any pattern in that list. Brahmagupta, in 628, gives rules for three kinds of number: fortune, debt and zero.

The Greek and European line deduces. Theorems follow from axioms. Later the whole is ordered into trees and lattices. Euclid is the first example. Frege and Peano, Russell and Whitehead, and Zermelo follow. Bourbaki orders mathematics as a lattice of mother structures. Eilenberg and Mac Lane, Grothendieck, and Lawvere order it as a network of arrows. Martin-Löf and Voevodsky order it as a space of types. Klein and reverse mathematics order it by strength or symmetry.

The two lines were never separate. Indian numerals with zero reached Europe through the Islamic world. The Yijing reached Leibniz through the Jesuits.

The book stands in the generative line. It builds from below. It uses homotopy type theory as its language. Homotopy type theory has roots in Martin-Löf’s type theory and Voevodsky’s univalence.

The Twenty-Two Rungs: An Overview

The book has a table of all twenty-two rungs. The table has four columns: rung number, what the net does, which field names it, and status.

Rung 0 is movement: the eternal round. The field is the circle S¹ and connectedness. Status: Agda plus library.

Rung 1 is three directions. The field is windings -1, 0, +1 in the integers, and Boolean algebra as a still picture. Status: Agda.

Rung 2 is the return. The field is the circle and integers as windings. Status: Agda plus library.

Rung 3 is direction, the trit rule. The field is Z₃, F₃, and Kleene logic. Status: Agda.

Rung 4 is words. The field is balanced ternary. Status: Agda.

Rung 5 is the window. The field is Fox colouring, AG(n,3), and cap sets. Status: Agda plus computation.

Rung 6 is three closures. The field is Z₃ with mirror, and S₃. Status: Agda.

Rung 7 is closing everywhere. The field is linear cellular automata, circulants, and d³ = 0. Status: Agda plus computation plus proof.

Rung 8 is seams. The field is sheaves (reading). Status: Agda.

Rung 9 is closed without a start. The field is necklaces and Lyndon words. Status: computation.

Rung 10 is the plane. The field is Eisenstein integers. Status: computation.

Rung 11 is mirror and ring in one node. The field is modular group and braids. Status: Agda plus computation plus cited.

Rung 12 is two ladders. The field is continued fractions and the comma. Status: computation.

Rung 13 is into three dimensions. The field is knots, SU(2), and Hopf. Status: Agda (maps to Rung 11 and S¹); complement cited; plus embedding for the rest.

Rung 14 is coupling. The field is analysis and Laplace’s method. Status: computation plus energy.

Rung 15 is free path. The field is random walks and Pólya. Status: computation plus walk.

Rung 16 is closure on itself. The field is Clifford algebra, d d = 0, and d³ = 0. Status: computation plus Dirac; Agda via Rung 7.

Rung 17 is two registers. The field is quaternions and spectral theory. Status: computation plus Maxwell.

Rung 18 is measure. The field is dimensional analysis. Status: computation plus Larson.

Rung 19 is loss has an address. The field is Onsager and PSD matrices. Status: cited plus thermodynamics.

Rung 20 is numbers without end. The field is signed-digit reals and computable analysis. Status: Agda (average at finite depth), computation, cited; plus infinite streams.

Rung 21 is closure as oscillation. The field is difference equations and crystallographic restriction. Status: Agda, computation, cited; plus integer sum 0.

The plus sign names the hypothesis a rung adds to the net.

Rung 0: Movement, the Eternal Round

The net at this rung is movement. It has a direction: a point with a way out and a way back. Nobody was there at the start. But without movement nothing happens. So the movement never stops and never began. It is an eternal round.

The field that names it is algebraic topology and homotopy type theory. The circle S¹ is exactly this: one point, called base, and one movement, called loop, that returns to it. The circle is connected: every place on it is reached from the point. The type fixes one point, base, as a reference. It has no time in it.

The book mentions precursors. Kauffman reads the imaginary unit as an oscillation, a value that alternates in time. Spencer-Brown’s re-entry gives such an oscillating value. In this book the oscillation is not reached at the end but given at the start.

Martin-Löf traced the order of conceptual priority backwards. From mathematics he went to proposition and truth, then to judgement, and ended at act and object. Rightness belongs first to the act. An object is actual if an act with it has been performed. Read this way, the book starts at the same place. The movement is the act. A point or a trit is what the act leaves when seen still.

What is established: Agda proves that a point without movement has only standing still. Every return of the unit type is trivial. Agda also proves that every place on the round is reached from the point, base.

The reading is that the movement has no start and is eternal. S¹ has no time in it and fixes a base point as reference. That this point is no beginning is a reading, not a theorem.

What is open: the Foundations 9.2 begin with a first distinction. This rung follows the author’s correction of 16 November 2026. The written theory has not yet been brought into line with it.

Rung 1: Three Directions

The net at this rung: seen at one place, the round shows three directions. Back, the point, and out. These are the three trits T, 0 and 1. A trit is not a value but a still picture of the movement.

The field that names it is group theory and logic. On the circle the three directions are the reversed loop, the constant path and the loop. Their windings are –1, 0 and +1. A distinction in the sense of Spencer-Brown cuts a space into two sides. It is the still picture with the middle left out. Its algebra is Boolean.

The book mentions Spencer-Brown. He begins Laws of Form with the instruction to draw a distinction. In this version his mark is not the start but a view of the round.

What is established: Agda proves that the three directions have windings –1, 0 and +1, and out is not back. Agda also proves that the two sides of a mark do not coincide. A known theorem states that the primary algebra of Laws of Form is a Boolean algebra.

The reading is that these three directions are the trits T, 0 and 1 of the theory.

What is open: a still picture alone has no motion. The next rung shows why the motion must be a round.

Rung 2: The Return

The net at this rung: the theory states N1. There is one strand. Every distinction is a loop. A movement that goes out and comes back along the same way leaves nothing behind. Only a round that comes back by another way leaves a trace. That is why the eternal movement is a round.

The field that names it is algebraic topology and group theory. The windings of the circle are the integers. Licata and Shulman proved this inside homotopy type theory.

What is established: Agda proves that out and back along the same way cancels. Agda proves that one round is not standing still. Agda proves that every number of rounds is kept: n rounds equal m rounds only if n = m. A known theorem states that the loops of the circle are the integers.

The reading is that only a round leaves a trace, so the eternal movement is a round.

What is open: the loops are shown to be the trit words directly at Rung 4, without the library theorem. The integers still serve as a measuring rod inside that proof.

Rung 3: Direction

The net at this rung: at a return, the trit rule of the theory reads one of three answers. The passage leaves as the first passage left (+1, written R). It leaves the way the first passage came in (-1, written L). Or it does neither (0, written O). These are the three trits, read as digits of the trinity.

The field that names it is group theory, field theory and logic. The three trits add as the cyclic group of order three, Z₃. With multiplication they form the field with three elements. As truth values with an open middle they form Kleene’s strong three-valued logic.

The book mentions Brahmagupta. In 628 he gave rules for fortune (dhana, +), debt (rna, -) and zero (šūnya). A debt taken from zero is a fortune. A fortune taken from zero is a debt. That is the mirror of T12.1. Schemes with more than two answers are older still. The Jain sevenfold predication and the Buddhist four corners (catuškoṭi), used by Nāgārjuna, are examples. Reading them as many-valued logics is debated.

What is established: Agda proves that the addition of trits is commutative and associative. A known theorem states that Z₃ is the unique group of order three.

What is open: Foundations III.1 says the trits are not directions that compose but digits that add. Its argument is aimed at one reading: “the same as the first” as neutral and “the reverse” as its own inverse, a structure of two values. This book does not use that reading. III.2 reads the trits as winding (1), rest (0) and counterwinding (T). The Agda map follows III.2: R is the loop, O is the constant path, L is the loop reversed.

For whole words the two readings meet. The map p sends a word to the winding of its value. Composing windings adds integers. The carry of T1 is the scale step times 3 between places. For single trits they meet through the carry. Four copies of the map is three windings, while R plus R plus R is O in Z₃. The digit is the winding modulo three. The rest, (s – d)/3, passes to the next scale. Agda proves the digit part in general. The balanced residue modulo three is additive on the integers. With the winding homomorphism of the library this gives, for any two loops p and q: the digit of p composed with q is the digit of p plus the digit of q. For single trits the digit of the map d is d. So composing loops and adding digits agree for all loops. The carry (s – d)/3 to the next scale is stated, not proved. This settles the question for the III.2 reading. III.1’s objection concerns a different, two-valued reading. The physical reading of the trit rule stays open (IX.5).

Rung 4: Words

The net at this rung: trits in a row form a word. Every integer has exactly one balanced-ternary word (T12). Mirroring R and L gives the negative (T12.1).

The field that names it is number theory and computer science. Knuth analyses balanced-ternary arithmetic and its history.

The book mentions precursors. Piṅgala listed all words of two kinds of syllable. He gave rules to find the place of a given word in the list: a unique address, with two values instead of three. Pāṇini generated words from rules. Leibniz wrote numbers as words of 0 and 1 in 1679, published 1703. Only later, through Bouvet, did he see the Yijing hexagrams as the same.

What is established: Agda proves that the words are exactly the windings of the loop. By univalence, the type of words is equivalent to the loop space of the circle. Agda proves that the loop of a word is the winding of its value. The digit at each place is added by path composition. The rest of the word is traversed three times, which is the carry to the next place.

Agda proves, without the library theorem that the loop space of the circle is the integers, and without the library fact that the loop space of the circle is a set, that the loops of the circle are the trit words. Over the base point lie the words. One turn around the loop is one step. A loop is sent to the word that the encoding becomes after transport. Going round the loop adds R with carry. This is the Licata-Shulman argument with the net’s own words as the fibre. Decoding goes via the integer value. Since the words form a set, it follows that the loops form a set too.

Agda proves that the set-truncation of the word type is not needed. The type of words with only the empty word, double negation and stand is a set by itself. Every word reads to a list with no O on top and reads back to itself. It is equivalent to the truncated type and to the integers. So the net’s own rule, that a lone O on top falls away, is enough to make the words a set equal to the integers.

Agda proves that mirroring a word reverses its winding. A computation check with the Agda value function, least significant trit first, gives: thirteen is R R R, three is O R, minus thirteen is L L L.

What is open: the integers are still used as a measuring rod. A proof with the words alone, without the integers, is not done.

Rung 5: The Window

The net at this rung: three successive trits form a window. A window closes when its sum is zero modulo three (T2). Exactly 9 of the 27 windows close (T3). A window closes exactly when its three trits are all equal or all different (T4).

The field that names it is knot theory, combinatorics and finite geometry. The same rule appears three times in mathematics. In knot theory it is Fox’s three-colouring: at a crossing the arcs carry one colour or all three. In finite geometry, three points of the space F₃ⁿ lie on a line exactly when they sum to zero. In additive combinatorics, the cap set problem asks for the largest set in F₃ⁿ with no three distinct points that sum to zero, that is, with no line. Ellenberg and Gijswijt proved in 2017 that such a set has at most about 2.756ⁿ points.

What is established: Agda proves that a window closes exactly when its trits are all equal or all different, for all 27 windows. A computation check shows that the closed triples in F₃² are its 12 lines, and in F₃³ its 117 lines. A known theorem is the cap set bound of Ellenberg and Gijswijt.

The reading is that the rule is identical in the three fields, as a condition. That the fields therefore share more than this condition is a reading.

What is open: the cap set problem asks for the largest set without a closed window of three distinct trits. The theory has no answer to it yet.

Rung 6: Three Closures

The net at this rung: every closed word reduces to nothing by removing three kinds of closure (T7). A standing is a single 0. A meeting is a trit and its mirror. A ring is three equal trits. Beside them stands the open pair: two equal nonzero trits. It does not close. It keeps a nonzero digit and may carry: 1 + 1 = 1T (T7.1).

The field that names it is group theory. In Z₃ the standing is the zero and the meeting is the inverse. The ring is the fact that every element has order dividing three. The open pair gives the mirror of x: x + x = -x. The mirror itself has order two. Rotation of order three and mirror of order two together are the symmetries of the trinity, the group S₃.

What is established: Agda proves that x plus mirror x is O; x plus x plus x is O; x plus x is mirror x; mirror of mirror x is x. Agda proves on the loop that forward then back is no winding; a digit a scale up is three windings; one step with carry is one winding more. A known theorem states that Z₃ with its mirror forms S₃.

What is open: the equation x + x = -x is the arithmetic form of the open pair. That this is what T7.1 means is a reading.

Rung 7: Closing Everywhere

The net at this rung: a word may close in every window. The sum of the next window is the sum of this one, plus the trit that enters, minus the trit that leaves (T8). So a word closes everywhere exactly when its first window closes and it repeats with period three. For every length n at least 3 there are exactly nine such words. On a ring the count is nine when three divides n, and three otherwise (T9).

The theory then rewrites a ring. Each trit becomes minus the sum of its two neighbours (T10). Since 2 is congruent to -1 modulo three, each trit becomes the mean of its neighbours. A ring stays fixed exactly when every window closes. For lengths 3 to 10, rings that are not fixed end in cycles, except 24 rings of length 4 and 24 of length 8, which come to rest.

The field that names it is linear algebra over F₃, symbolic dynamics and cellular automata. The rewrite is a linear cellular automaton over Z₃. Martin, Odlyzko and Wolfram worked out the algebra of such automata. Its fixed points form the kernel of a circulant matrix with rows (1, 1, 1). The kernel has dimension two when three divides n, and one otherwise. The reason lies in the polynomial x² + x + 1, which over F₃ equals (x – 1)². The words that close everywhere form a shift of finite type with no freedom left: zero entropy.

What is established: Agda proves that the window sum moves by the new trit minus the old one; two closed windows in a row force the trit to repeat after three; a trit is fixed by the rewrite exactly when its window closes.

Computation checks show: nine words for n = 3 to 9. Nine or three rings, and five or three rotation classes, for n = 3 to 11. 24 rings come to rest for n = 4 and for n = 8, and none for the other n from 3 to 10. For n = 12, 6,552 rings come to rest. This goes beyond the range of T10. The fixed space has size 9 or 3 for n = 3 to 12.

Exact linear algebra shows: the count of rings that come to rest follows a rule for every n from 3 to 48. For n = 16 it is 24. For n = 36 it is 3,486,784,392.

Agda proves that closing is a second difference. With D the difference operator over Z₃, D² of three trits is their window sum. D³ of four trits is the last minus the first. So a constant word has D = 0. A word that closes everywhere has D² = 0. A word of period three has D³ = 0. This joins T8 and T9 in one chain: 3 contained in 9 contained in 27 rings when three divides n.

Agda proves that among all 27 local linear rules over Z₃, exactly two leave a trit in place precisely when its window closes. One is the rewrite of T10, minus the sum of the two neighbours. The other is t(i-1) – t(i) + t(i+1). The rewrite of T10 is the only one in which a trit does not read itself.

A computation check shows the same two rules, and no others, have as fixed points exactly the rings that close everywhere for all lengths 3 to 9 taken together. For a single length this holds when three divides n. Other lengths admit up to eight rules.

A note says the 27-window result is close to a tautology. A rule (a, b, c) works exactly when (a, b – 1, c) is a nonzero multiple of (1, 1, 1). The real choice is to allow only linear rules of radius one. Among those, the rule is forced up to a scalar.

A known theorem states that the kernel of a circulant matrix has dimension equal to the degree of the greatest common divisor of its polynomial with xⁿ – 1.

What is open: the Agda proofs are local. They concern one window. The counts for all n are proved on paper and computed here, not formalised.

Rings that come to rest are not limited to lengths 4 and 8. They occur exactly when four divides n. The count is 3²(2 · 3ᵛ) · F – F, with F the number of fixed rings and 3ᵛ the power of three in n. The proof is short. Read a ring as a polynomial modulo xⁿ – 1 over F₃. The rewrite is multiplication by -(x² + 1)/x. The difference operator minus identity is multiplication by -(x – 1)²/x. Over F₃ the factor x² + 1 is irreducible. Its roots are the fourth roots of one. So it divides xⁿ – 1 exactly when four divides n, with multiplicity 3ᵛ. That factor is where the rewrite is nilpotent. On all other factors the rewrite is invertible. Coming to rest means the difference operator applied repeatedly eventually gives zero. That kernel is the fixed space plus the x² + 1 part, of dimension 2 · 3ᵛ. The count follows.

This corrects the statement of T10, which lists only lengths 4 and 8 because it was computed up to length 10.

What This Means for Mathematics

The book makes a bold claim. Mathematics can be built from below, starting with movement. Each structure arises from a single rule. Each structure already has a name in mathematics.

The book does not claim that the theory is true. It claims only that the structures arise in this order from one rule. Where a rung needs a hypothesis, the hypothesis is quoted. The book adds two of its own at Rung 11 (H1, H2). At Rung 14 it takes the real numbers as an input. The chapter “Beyond Rung 21” builds the real numbers of an interval from the net, up to Bishop’s equality.

The Agda files are listed at the start. They type-check with Agda 2.8.0 and the cubical library v0.9.

The Place of This Work in History

The book places itself in the generative line of mathematics. This line includes Pāṇini, Piṅgala and Brahmagupta. It includes Leibniz and the Yijing. It includes Martin-Löf and Voevodsky. It does not include Euclid, Frege, Peano, Russell, Whitehead, Zermelo or Bourbaki, except as contrast.

The book is honest about its limits. Many rungs have open questions. Some rungs depend on hypotheses. Some counts are computed, not proved. The book says this clearly.

The value of the book is in its method. It shows how far one can get from a single starting point. It shows where the derivation stops. It names the smallest assumption still needed. This is good mathematics. It is also good philosophy.


Annotated Reference List

This list explains each reference in plain language. The numbers follow the book’s own citation system. Where a reference is not fully given in the PDF, I note what is known from the text.

[1] The Foundations of the theory. This is the author’s own foundational document. It is cited as “Foundations” with section numbers (9.2, III.1, III.2, IX.5). It contains the original statement of the theory. The book notes a correction dated 16 November 2026. The written theory has not yet been brought into line with this correction. The correction concerns the starting point: the first is the round, and a distinction is a still picture of it.

[2] A study of the theory against the history of mathematics. This is a study by the author or others. It found no significant relation between the order of the theory’s chain and the dates of the results it uses. This supports the book’s claim that the order comes from the net, not from history.

[3] A source on trit words depending on how concepts are written down. The book says: “When a named concept is taken first and then written as trits, its trit word depends on how it is written down.” This is a methodological point. The citation is to a source that demonstrates this problem.

[4] A source on the circle S¹ as one point and one loop. This is likely a standard topology textbook or the homotopy type theory book. The circle is defined as a point with a loop that returns to it. This is the basic model for Rung 0.

[5] Licata and Shulman, “Calculating the fundamental group of the circle in homotopy type theory.” This is a landmark paper in homotopy type theory. It proves that the loops of the circle are the integers. The proof is done inside homotopy type theory, without classical topology. The book uses this result at Rung 2 and Rung 4.

[7] Agda 2.8.0. Agda is a proof assistant. It is a programming language for writing and checking mathematical proofs. Version 2.8.0 is the version used for this book.

[10] Spencer-Brown, “Laws of Form.” This is a book from 1969. It begins with the instruction to draw a distinction. It develops a Boolean algebra from this act. The book uses Spencer-Brown’s mark as a still picture of the round, not as the starting point.

[11] Kleene, strong three-valued logic. This is a system of logic with three truth values: true, false, and unknown. It was developed by Stephen Kleene. The book uses it as a name for the trit rule at Rung 3.

[12] Fox, three-colouring of knots. This is a rule in knot theory. At a crossing, the arcs carry one colour or all three. The rule is the same as the window rule at Rung 5.

[13] Knuth, “The Art of Computer Programming,” volume 2. This volume covers seminumerical algorithms. It analyses balanced-ternary arithmetic and its history. The book cites it at Rung 4.

[14] The cubical library v0.9. This is a library of formalised mathematics in Agda. It uses cubical type theory. It provides the basic results about the circle and the integers. The book’s Agda files depend on it.

[15] The –safe flag in Agda. This flag tells Agda to reject any proof that uses postulates or other unsafe features. The book’s Agda proofs are accepted under –safe. This means they are fully checked, with no shortcuts.

[16] Ellenberg and Gijswijt, “On large subsets of F_q^n with no three-term arithmetic progression.” This is a 2017 paper. It proves a bound on the cap set problem. The cap set problem asks for the largest set in F₃ⁿ with no three distinct points that sum to zero. The bound is about 2.756ⁿ points. The book cites this at Rung 5.

[25] Martin, Odlyzko and Wolfram, “Algebraic properties of cellular automata.” This is a paper from 1984. It works out the algebra of linear cellular automata over finite fields. The book uses it at Rung 7 to understand the rewrite rule.

[26] A source on circulant matrices and their kernels. This is a standard result in linear algebra. The kernel of a circulant matrix has dimension equal to the degree of the greatest common divisor of its polynomial with xⁿ – 1. The book uses this at Rung 7.

[27] A source on shift of finite type and zero entropy. This is a concept from symbolic dynamics. A shift of finite type with no freedom left has zero entropy. The book uses this at Rung 7 to describe the words that close everywhere.

[50] Reverse mathematics. This is a program in mathematical logic. It asks which axioms are needed to prove which theorems. It orders mathematics by strength. The book mentions it in Table 0.

[56] Mathematics Subject Classification (MSC). This is a catalogue of mathematics by subject. It is maintained by the American Mathematical Society and other organisations. The book uses MSC codes to name fields.

[67] Pāṇini and Piṅgala. Pāṇini’s grammar is from around the fourth century BCE. It produces the words of Sanskrit from about four thousand short rules. Piṅgala is from the third or second century BCE. He gives a procedure to list all metres of a given length. He also gives a rule to find the place of any pattern in that list. The book cites them as the oldest generative work.

[68] Computer science and Pāṇini’s grammar. This is a source that sees a formal grammar in Pāṇini’s work. The book cites it at Rung 4.

[69] Piṅgala’s rules for listing and addressing. This is a source on Piṅgala’s procedure. It gives a unique address for each word. The book cites it at Rung 4.

[70] The Yijing and Leibniz. This is a source on the transmission of the Yijing to Leibniz through the Jesuits. Leibniz saw the hexagrams as binary numbers. The book cites it in the historical section.

[71] The Kerala series and Europe. This is a source on whether the Kerala series reached Europe. The book says it is not established. The Kerala series is a tradition of mathematics in India that includes infinite series.

[72] Jain sevenfold predication and Buddhist four corners. This is a source on these schemes. The Jain scheme has seven answers. The Buddhist scheme has four corners (catuškoṭi). Nāgārjuna used the four corners. Reading them as many-valued logics is debated. The book cites this at Rung 3.

[73] Brahmagupta, “Brāhmasphuṭasiddhānta,” 628. This is a foundational text of Indian mathematics. It gives rules for fortune (dhana, +), debt (rna, -) and zero (šūnya). A debt taken from zero is a fortune. A fortune taken from zero is a debt. The book cites this at Rung 3.

[74] Euclid, “Elements.” This is the foundational text of Greek mathematics. It orders mathematics from axioms. The book mentions it in Table 0.

[75] Russell and Whitehead, “Principia Mathematica.” This is a foundational work from 1910–1913. It tries to derive mathematics from logic. The book mentions it in Table 0.

[76] Bourbaki, “Éléments de mathématique.” This is a series of books that orders mathematics as a lattice of mother structures. The book mentions it in Table 0.

[77] Klein, Erlangen programme. This is a program from 1872. It orders geometry by symmetry. The book mentions it in Table 0.

[78] Eilenberg and Mac Lane, category theory. This is a foundational work from 1945. It orders mathematics as a network of arrows. The book mentions it in Table 0.

[79] Lawvere, topos theory. This is a foundational work. It contributes to homotopy type theory. The book mentions it in Table 0 and in the historical section.

[80] Grothendieck, topos theory. This is a foundational work. It looks at relations rather than objects. The book mentions it in Table 0 and in the historical section.

[81] Martin-Löf, type theory. This is a foundational work. It is one of the main roots of homotopy type theory. The book mentions it in Table 0 and in the historical section.

[82] Kauffman, the imaginary unit as an oscillation. This is a source on reading the imaginary unit as a value that alternates in time. The book cites it at Rung 0.

[83] Martin-Löf on act and object. This is a source on Martin-Löf’s order of conceptual priority. From mathematics he went to proposition and truth, then to judgement, and ended at act and object. Rightness belongs first to the act. An object is actual if an act with it has been performed. The book cites this at Rung 0.

Agda Files

The book lists twenty-seven Agda files. They are:

VacuumNetValue.agda, VacuumNetValue2.agda, VacuumNetArith.agda, VacuumNetLimit.agda, VacuumNetComma.agda, VacuumNetPhase.agda, VacuumNetRound.agda, VacuumNetHoTT.agda, VacuumNetFoundation.agda, VacuumNetDictionary.agda, VacuumNetLadder.agda, VacuumNetLadder2.agda, VacuumNetLadder3.agda, VacuumNetPairRing.agda, VacuumNetLadderPath.agda, VacuumNetBTO.agda, VacuumNetEigenform.agda, VacuumNetTrefoil.agda, VacuumNetStream.agda, VacuumNetAverage.agda, VacuumNetProduct.agda, VacuumNetDigitWinding.agda, VacuumNetOscillator.agda, VacuumNetHelix.agda, VacuumNetSLNode.agda, VacuumNetPSLNode.agda, VacuumNetOpenPair.agda, and VacuumNetHopf.agda.

They type-check with Ag

Book