There are several mathematical structures and concepts that are described as "bootstrapping" themselves into existence. These systems typically rely on self-reference, recursion, or fixed-point theorems, where a structure is defined by its own properties, allowing it to "pull itself up by its own bootstraps." [1, 2, 3, 4]

Here are the primary examples of mathematical structures that bootstrap themselves:

1. Tupper's Self-Referential Formula

This is a famous formula that plots a graph of itself. [1, 2]

• How it works: It is a 2D inequality:
  
  
  
  
  
• The Bootstrap: When this formula is graphed over a specific 543-digit integer constant \(k\) in the \((x, y)\) plane, the resulting black-and-white pixels produce an image of the formula itself. The formula generates the very visual pattern that defines it. [1, 2]

2. The Constructible Universe (\(L\)) in Set Theory

In axiomatic set theory, the Constructible Universe (\(L\)) is a model of Zermelo-Fraenkel set theory (ZF) that is built up by iterating the definition of "definable subsets" through all ordinal numbers. [1, 2]

• The Bootstrap: Every countable model of set theory \(M\) can embed itself into its own constructible universe, \(L^{M}\). This means the structure \(L\) defines a model that is a submodel of itself, providing a structured, hierarchical form of self-generation. [1, 2, 3]

3. Self-Referential Sets (Anti-Foundation Axiom)

Traditional set theory forbids a set from containing itself (\(A \in A\)). However, using an Anti-Foundation Axiom (AFA) instead of the Foundation Axiom (FA), one can create "non-well-founded sets" that bootstrap themselves. [1, 2, 3]

• The Bootstrap: AFA allows the existence of a set \(x\) defined by \(x = \{x\}\). This is a self-referential definition that is perfectly consistent, representing a set that is solely composed of itself. [1, 2, 3]

4. Mathematical "Quines" and Fixed Points

A quine is a program that produces its own source code as its only output. In mathematics, this corresponds to fixed-point theorems. [1, 2]

• How it works: According to the Recursion Theorem in computability theory, any consistent, sufficiently complex system can define functions that call themselves (recursive functions).
• The Bootstrap: The system defines a fixed point \(x = f(x)\), where the structure \(x\) is defined entirely by its relationship to the function \(f\). [1, 2]

5. Theoretical Physics: The "Bootstrap" Approach

In theoretical physics, which is rooted in mathematics, the "bootstrap" conjecture suggests that the fundamental laws of nature are the only consistent set of equations possible. [1]

• The Bootstrap: Particle scattering amplitudes can be constructed by forcing self-consistency conditions (like unitarity). It turns out that string theory, for example, can be derived not from arbitrary assumptions, but as the only mathematical structure that satisfies these strict self-consistency conditions—it bootstraps its existence from consistency. [1, 2]