Foundation Singular Subdivision Exists Asub Iter Small

The iterated subdivision

In geometry, subdivision is the act of cutting a shape into smaller pieces that fit together to form the original. A triangle can be cut into four smaller triangles, a square into four smaller squares, and so on. The Recognition Science framework, a body of formal mathematics, studies this operation in a very general setting, where the shapes are abstract objects called affine chains, which are finitely supported integer combinations of vertex tuples. The declaration exists_asubIter_small establishes that this process of repeated subdivision, called the iterated subdivision, is always well-defined and produces a finite result at every step.

The theorem is a formal statement in the framework's machine-checked library of formal theorems. It concerns a function that takes a shape and a number of steps, and returns the shape after that many subdivisions. The declaration proves that this function exists and behaves correctly: the result of zero subdivisions is the original shape, and the result of one more subdivision is obtained by applying the subdivision operation once to the previous result. This is a basic but essential property, ensuring that the operation is consistent and can be iterated any number of times.

The theorem does not claim anything about the geometric properties of the subdivided shapes, such as their size, shape, or volume. It does not say that the subdivision process converges to a limit or that it has any particular topological effect. It is a purely algebraic statement about the existence and behavior of the iterated operation, not a statement about the geometry of the result. The theorem is a foundational piece, a building block for further results, not a complete description of the subdivision process.

In Recognition Science, this result is part of a larger effort to understand how geometric structures can be built from basic combinatorial data. The framework models physical space as a collection of such chains, and the ability to subdivide them repeatedly is a prerequisite for many constructions. The theorem provides a solid foundation for this work, ensuring that the basic operation is sound. It is a small but necessary step in a larger program, and its value lies in its precision and its role as a verified component of a larger formal system.

The declaration is a formal theorem, meaning it has been checked by a computer. This gives it a high degree of certainty, but it is important to understand its scope. It is a statement about the abstract algebraic structure, not about the physical world. It does not, for example, prove that space can be infinitely subdivided, or that any physical process of subdivision is possible. It is a mathematical fact about a formal operation, and its applications are limited to the framework in which it is defined.

@[simp] lemma asubIter_zero (bary : ∀ {m : ℕ}, (Fin (m + 1) → α) → α) (n : ℕ) :
    asubIter bary 0 n = LinearMap.id := rfl

What this page does not claim

The theorem does not claim that the subdivision process converges to a limit. It does not claim anything about the geometric size or shape of the subdivided pieces. It does not claim that space can be physically subdivided infinitely.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/SingularSubdivision.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: