Research Methodology¶

Synopsis

This page describes the organizational framework: the layer model, the proof-tier classification, the knowledge-gap convention, the badge system, and the process for extending the knowledge base.

The Layer Model¶

Mathematics is organized into nine layers numbered 0 through 8. The numbering is not arbitrary — it reflects logical dependency:

Layer 0 (Logic) depends on nothing within mathematics; it is the rules of reasoning.
Layer \(n\) may depend on any layer \(k < n\), but never on a layer \(k > n\).

This is a directed acyclic graph, not a strict linear chain. Layer 5 (Analysis), for instance, draws on Layers 2, 3, and 4 simultaneously. The full dependency structure is shown in the Landscape.

Each layer page follows a consistent template:

Section	Purpose
Abstract	One-paragraph summary with key metrics
Core Idea	The conceptual heart of the layer in plain language
Key Structures	Definitions, axioms, and constructions with KaTeX notation
Canonical Constants	Constants that originate or play a central role at this layer
Historical Trigger	The crisis that made this layer necessary
Key Proofs	Landmark results classified by tier
Connections	Downward dependencies and upward impact
Sources	References and further reading

The Proof-Tier System¶

Not all proofs serve the same purpose. We classify each key proof into one of three tiers:

Foundational¶

A proof that validates the layer itself — it establishes that the axioms are consistent, that the basic constructions work, or that the layer's objects have the properties claimed.

Example: Soundness of Propositional Logic (Layer 0)

If a formula is provable, it is true in every truth-value assignment.

This result is foundational because without it, the entire proof mechanism is unreliable. Every subsequent layer inherits its trustworthiness from this result.

Bridge¶

A proof that connects two layers — it shows that a construction in one layer produces or embeds into objects in another layer.

Example: Construction of \(\mathbb{N}\) from Sets (Layer 1 → Layer 2)

The von Neumann ordinals \(0 = \emptyset,\; 1 = \\{\emptyset\\},\; 2 = \\{\emptyset, \\{\emptyset\\}\\}, \ldots\) satisfy the Peano axioms.

This is a bridge proof because it shows how Set Theory (Layer 1) gives rise to Number Systems (Layer 2). Without it, the transition from sets to numbers would be an unexplained leap.

Insight¶

A proof that reveals a deep or surprising truth — often one that connects distant parts of mathematics or overturns conventional expectations.

Example: Gödel's First Incompleteness Theorem (Layer 0)

Any consistent formal system capable of expressing basic arithmetic contains true statements it cannot prove.

This is an insight proof because it establishes an intrinsic limitation of formal systems — something entirely unexpected before 1931 — and it reshapes our understanding of what mathematics can and cannot achieve.

The Knowledge-Gap Convention¶

No research project of this scope can verify every claim from primary sources on the first pass. Where a statement is included based on secondary knowledge and has not been independently verified against a primary source, it is flagged:

Knowledge Gap

The specific claim or detail that needs verification.

Why flagged: Brief explanation of uncertainty. To resolve: What primary source or computation would settle it.

These flags are not signs of weakness — they are epistemic hygiene. A knowledge base that hides its uncertainties is less trustworthy than one that marks them explicitly.

The goal is to reduce the count of Knowledge Gap flags over time, converting each one into either a verified claim (with citation) or a corrected statement.

The Badge System¶

Badges provide at-a-glance classification for proofs and concepts:

Badge	Class	Meaning
Foundational	`badge-foundational`	Validates the layer; part of the structural bedrock
Bridge	`badge-bridge`	Connects two layers; shows how one gives rise to another
Insight	`badge-insight`	Reveals deep, surprising, or unifying truths
Proven	`badge-proven`	The result has a rigorous proof
Conjectured	`badge-conjectured`	The result is believed true but unproven

Badges are applied inline using <span class="badge badge-*">Label</span> and can be combined — a result can be both Bridge and Proven.

Confidence Badges¶

The Findings section (e.g., Principles) uses a separate set of badges to indicate the maturity and confidence level of each reported finding:

Badge	Class	Meaning
Established	`badge-established`	Well-supported by evidence across multiple layers
Developing	`badge-developing`	Supported by evidence but needs further investigation
Emerging	`badge-emerging`	Preliminary observation; requires more research

These badges are not proof-status indicators — they reflect how much cross-layer evidence has accumulated for a given principle or observation. A finding rated Established has been corroborated by results in several layers, while one rated Emerging may rest on a single layer or a small number of examples.

The confidence level of a finding is expected to change over time as new evidence is gathered. Promotion from Emerging → Developing → Established requires documenting the additional supporting evidence.

Extensibility Model¶

The knowledge base is designed to grow. Adding a new topic follows a four-step process:

graph LR
    A["1. Write<br/>research page"] --> B["2. Update<br/>hub card grid"]
    B --> C["3. Update<br/>dependency graph"]
    C --> D["4. Add<br/>glossary terms"]

Step 1 — Write the research page. Follow the layer template (Abstract, Core Idea, Key Structures, etc.). Place it in docs/research/ and use the appropriate layer tag.

Step 2 — Update the hub. Add a card to docs/research/index.md so the new page is discoverable.

Step 3 — Update the dependency graph. If the new page introduces cross-layer connections, update the Mermaid diagram in Landscape.

Step 4 — Add glossary terms. Every new technical term introduced on the page should be added to the Glossary, both in the table and in the hover-tooltip section at the bottom.

This process ensures that no page is an island — every addition is woven into the navigational and conceptual fabric of the knowledge base.

Conventions at a Glance¶

Convention	Format	Purpose
Math notation	KaTeX: `\( ... \)` inline, `\[ ... \]` display	Precise mathematical statements
Admonitions	`theorem`, `proof-sketch`, `conjecture`, `counterexample`	Structured mathematical content
Badges	`<span class="badge badge-*">`	At-a-glance classification
Knowledge gaps	`!!! warning "Knowledge Gap"`	Epistemic transparency
Diagrams	Mermaid `graph`, `timeline`, `mindmap`	Visual structure
Tags	YAML front matter `tags:`	Cross-referencing and search

title: Glossary tags: - reference - glossary

Glossary¶

A working reference of essential terms spanning all nine layers of the mathematical hierarchy. Terms are grouped alphabetically; hover-tooltip definitions are provided at the bottom for use across the knowledge base.

A¶

Term	Definition
Abelian Group	A group \((G, \ast)\) in which the operation is commutative: \(a \ast b = b \ast a\) for all \(a, b \in G\).
Algebraic Closure	A field extension in which every non-constant polynomial has a root. \(\mathbb{C}\) is the algebraic closure of \(\mathbb{R}\).
Axiom	A statement accepted without proof that serves as a starting point for a deductive system.
Axiom of Choice	For any collection of non-empty sets, there exists a function selecting one element from each set. Equivalent to Zorn's lemma and the well-ordering theorem.

B¶

Term	Definition
Bijection	A function that is both injective (one-to-one) and surjective (onto), establishing a one-to-one correspondence between two sets.
Boolean Algebra	An algebraic structure capturing the laws of classical logic: complement, meet, join, with identities \(0\) and \(1\).

C¶

Term	Definition
Cardinality	A measure of the "size" of a set. Two sets have equal cardinality if a bijection exists between them.
Category	A collection of objects and morphisms (arrows) between them, equipped with composition and identity morphisms satisfying associativity and identity laws.
Cauchy Sequence	A sequence \((a_n)\) in a metric space where for every \(\varepsilon > 0\) there exists \(N\) such that \(d(a_m, a_n) < \varepsilon\) for all \(m, n > N\).
Commutative Ring	A ring in which multiplication is commutative: \(ab = ba\).
Complex Number	An element of \(\mathbb{C} = \{a + bi \mid a, b \in \mathbb{R}\}\), where \(i^2 = -1\).
Conjecture	A mathematical statement believed to be true but not yet proven.
Continuity	A function \(f\) is continuous at \(a\) if \(\lim_{x \to a} f(x) = f(a)\). Intuitively, small changes in input produce small changes in output.
Convergence	A sequence \((a_n)\) converges to \(L\) if for every \(\varepsilon > 0\) there exists \(N\) such that (
Corollary	A result that follows directly from a theorem with little or no additional proof.

D¶

Term	Definition
Dedekind Cut	A partition of \(\mathbb{Q}\) into two non-empty sets \((A, B)\) where every element of \(A\) is less than every element of \(B\) and \(A\) has no greatest element. Used to construct \(\mathbb{R}\).
Derivative	The instantaneous rate of change of \(f\) at \(x\): \(f'(x) = \lim_{h \to 0} \frac{f(x+h) - f(x)}{h}\).
Distribution	A probability measure on a measurable space describing the likelihood of outcomes for a random variable.

E¶

Term	Definition
Eigenvalue	A scalar \(\lambda\) such that \(Av = \lambda v\) for some non-zero vector \(v\) (the eigenvector) and linear map \(A\).

F¶

Term	Definition
Field	A commutative ring with unity in which every non-zero element has a multiplicative inverse. Examples: \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\).
Functor	A structure-preserving map between categories, sending objects to objects and morphisms to morphisms while respecting composition and identities.

G¶

Term	Definition
Graph	A combinatorial structure \(G = (V, E)\) consisting of vertices \(V\) and edges \(E \subseteq V \times V\).
Group	A set \(G\) with a binary operation satisfying closure, associativity, existence of identity, and existence of inverses.

H¶

Term	Definition
Homeomorphism	A continuous bijection whose inverse is also continuous. Two spaces are homeomorphic if they are "topologically the same."
Homomorphism	A structure-preserving map between algebraic structures (groups, rings, etc.).

I¶

Term	Definition
Injection	A function \(f\) where \(f(a) = f(b) \implies a = b\). Also called "one-to-one."
Integral	The Riemann or Lebesgue integral measures the "accumulated value" of a function over a domain. \(\int_a^b f(x)\,dx\).
Irrational Number	A real number that cannot be expressed as a ratio of integers. Examples: \(\sqrt{2}\), \(\pi\), \(e\).
Isomorphism	A bijective homomorphism — a structure-preserving map with a structure-preserving inverse. Two objects are isomorphic if they are "algebraically the same."

L¶

Term	Definition
Lemma	A proven statement used as a stepping stone toward a larger theorem.
Limit	The value that a function or sequence approaches as the input or index approaches some value.

M¶

Term	Definition
Manifold	A topological space that locally resembles \(\mathbb{R}^n\). Smooth manifolds carry differentiable structure.
Measure	A function assigning a non-negative extended real number to subsets of a space, generalizing length, area, and volume. Must be countably additive.
Morphism	An arrow in a category — a generalization of "structure-preserving map" that abstracts functions, homomorphisms, and continuous maps.

N¶

Term	Definition
Natural Transformation	A family of morphisms connecting two functors \(F, G : \mathcal{C} \to \mathcal{D}\) that commutes with every morphism in \(\mathcal{C}\).

P¶

Term	Definition
Predicate	A statement containing one or more variables that becomes a proposition when values are substituted. Example: \(P(x) \equiv x > 5\).
Prime	A natural number \(p > 1\) whose only divisors are \(1\) and \(p\). The fundamental building blocks of \(\mathbb{N}\) under multiplication.
Proof	A finite sequence of logical deductions establishing the truth of a statement from axioms and previously proven results.

Q¶

Term	Definition
Quantifier	A logical symbol binding a variable: the universal quantifier \(\forall\) ("for all") and the existential quantifier \(\exists\) ("there exists").

R¶

Term	Definition
Random Variable	A measurable function from a probability space to \(\mathbb{R}\) (or \(\mathbb{R}^n\)).
Ring	A set equipped with two operations (addition and multiplication) where addition forms an abelian group, multiplication is associative, and multiplication distributes over addition.

S¶

Term	Definition
Surjection	A function \(f: A \to B\) where every element of \(B\) is the image of at least one element of \(A\). Also called "onto."

T¶

Term	Definition
Tautology	A propositional formula that is true under every truth-value assignment. Example: \(P \lor \lnot P\).
Theorem	A mathematical statement proven true within a formal system.
Topology	The study of properties preserved under continuous deformations. A topology on a set \(X\) is a collection of "open" subsets closed under arbitrary unions and finite intersections.
Transcendental Number	A real or complex number that is not a root of any non-zero polynomial with integer coefficients. Examples: \(\pi\), \(e\).
Tree	A connected acyclic graph. Equivalently, a graph on \(n\) vertices with exactly \(n - 1\) edges and no cycles.

V¶

Term	Definition
Vector Space	A set \(V\) over a field \(F\) equipped with addition and scalar multiplication satisfying eight axioms (closure, associativity, distributivity, identity elements, inverses).

Z¶

Term	Definition
ZFC	Zermelo-Fraenkel set theory with the Axiom of Choice — the standard axiomatic foundation for modern mathematics.