Notes on the laboratory / Edition 01
Evidence before interpretation.
Mathematical Worlds asks you to do an experiment, observe a structure, and confront a philosophical question. Each mathematical result carries its method and source.
Four kinds of provenance
✓ Computed
Exact arithmetic, closed-form algorithms, symbolic certificates or exhaustive finite checks. This is programmatic verification, not a proof-assistant guarantee.
◇ Curated
A definition or mathematical theorem transcribed with a reference and explicit assumptions. The software can apply the relation without independently proving it.
✓ Formal proof
Reserved for a checked proof artifact with its system, version, declaration and axioms. No result in this edition uses this label.
Interpretation / Discussion
Philosophical lenses and questions. Curated prompts are always available. Optional AI questions are clearly labelled and cannot write to the mathematical record.
The computation has a boundary.
The input grammar accepts bounded integers, fractions, square roots of nonnegative integers and real cube roots of integers. It does not execute arbitrary expressions. Six stored algebraic certificates are generated and checked with SymPy. Their JSON is included with the application; no Python service is needed during a visit.
A displayed decimal or graph is approximate. It is never the evidence for algebraicity, irreducibility or transcendence. The constructibility test only concludes “yes” when an explicit construction is known. A power-of-two degree alone is not enough.
The framework has a name.
Choice equivalences are stated over classical ZF, including Infinity. Independence is qualified by consistency. Withholding an axiom and adding its negation are separate actions. Unknown combinations remain “Not modelled.” The intuitionistic controls expose a propositional-logic lens, not a complete implementation of intuitionistic set theory.
One group, several senses of sameness.
The Identity Lab accepts a bounded mathematical notation grammar. Finite groups are checked through exact operation tables and verified isomorphism witnesses. Classical matrix groups use sourced theorems and invariants: equal dimension alone proves no isomorphism. Abstract groups, Lie groups and real Lie algebras are separate comparisons. The SU(2) double-cover diagram illustrates a theorem; sampled matrices do not prove it. Unmodelled comparisons remain undetermined.
A place for AI, without mathematical authority.
The optional discussion service receives a fresh server-side evidence record for a selected object. Its output contains only philosophical questions. It cannot modify properties, certificates, dependencies or sources. Generated questions are interpretations and may still frame an issue poorly; their wording is not verified. This edition works completely without an AI key.
The schema reserves adapters for symbolic, curated and formal verification. A future Lean adapter can attach checked declarations and axiom reports; SageMath can provide larger algebraic calculations through the same evidence contract.
References in this edition
- J. S. Milne · Group Theory ↗
Cyclic groups, homomorphisms and direct products: residue-to-rotation maps and products of cyclic groups of coprime orders.
- Anthony W. Knapp · Lie Groups Beyond an Introduction ↗
Introduction and Chapter I, §§11 and 17: classical matrix groups, real Lie algebras, compact forms and covering groups. Sp(n) uses the compact quaternionic convention.
- Jonny Evans · Topology of Lie groups ↗
Connected components, fundamental groups, covering spaces and the topology of U(n), SU(n) and SO(n).
- Vincent Bouchard · SU(2) ↗
SU(2) and SO(3): isomorphic real Lie algebras, the two-to-one covering homomorphism, and the global distinction between the groups.
- Joan Bagaria · Set Theory ↗
ZF axioms, Infinity and the construction of standard mathematical objects.
- J. S. Milne · Fields and Galois Theory ↗
Minimal polynomials, field extensions and ruler-and-compass constructions; see Constructible numbers.
- SymPy · Number fields ↗
minimal_polynomial; symbolic certificates are generated with SymPy 1.14.0.
- H.-D. Ebbinghaus et al. · Numbers ↗
Classical number theory, irrationality and transcendence of e and π.
- University of Toronto · The Axiom of Choice ↗
§11.6: equivalence of Choice, well-ordering and the basis theorem over ZF.
- John L. Bell · The Axiom of Choice ↗
Independence and mathematical applications of Choice.
- Peter Koellner · The Continuum Hypothesis ↗
Relative independence of CH from ZFC; consistency qualifications.
- Joan Moschovakis · Intuitionistic Logic ↗
Excluded middle, double-negation elimination and Kripke semantics.
- Gregory Chaitin · The Halting Probability Omega ↗
A universal prefix-free machine has a noncomputable halting probability.
- Erich Reck & Georg Schiemer · Structuralism in the Philosophy of Mathematics ↗
Structuralist interpretations, identity and representation.
- Douglas Bridges & Erik Palmgren · Constructive Mathematics ↗
Constructive existence and the distinction between an algorithm and classical existence.
- Alan Weir · Formalism in the Philosophy of Mathematics ↗
Formal systems and philosophical interpretations of mathematics.