Paper I visual guide · Visual 20 of 22 · EXACT COMPUTATION / AN INVARIANCE CERTIFICATE

Stop when the subspace stops growing

Main text: Construction 19.1

Start reading

Resources & source

Original plate in the monograph PDF · Original atlas source

Skip contents and start reading

For a fixed finite operator family \((O_i)\), start from \(W_0={\operatorname{span}} S\) and iterate

\[ W_{n+1}=W_n+\sum_i O_iW_n. \]

This is an ascending chain. When two consecutive subspaces agree, every generator maps the stable subspace into itself. The stable value is therefore the entire hull of operator words, not just the span of the words tested so far.

Dimensions of successive generated subspaces
Original drawing. Read the description below; expand the labels and data for selectable text.

Reading the drawing

The horizontal axis is iteration and the vertical axis is subspace dimension. The dashed curve permits only N; the solid curve also permits both chain projectors. Repeated plateau values indicate the checked stopping condition.

Drawing labels and data 17 labels

Read the original labels as selectable text. Tables preserve grid relationships; other short labels are grouped compactly.

  • 0
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5
  • with \(P_e,P_f\)
  • \(N\) only
  • iteration \(n\)
  • \(\dim W_n\)

Open the full-size drawing

Evidence note from the source edition

Exact dimensions for the same mixed seed in Model A. The dashed curve allows only \(N\). The solid curve also admits the two chain projectors. Plateau values are repeated to show the certified stop.

Why the process stops in finite dimensions

If an inclusion is strict, the dimension rises by at least one. It cannot rise beyond \(\dim X\). At equality, invariance and containment of the seeds prove both inclusions between the stable space and the least invariant hull.

What the companion code actually does

The new checker retains exact column bases using rational row reduction. It then verifies that adjoining the images of those bases under every generator does not increase rank. These examples use neither a cutoff on singular values nor a numerical tolerance.

The Lean statement is a mathematical termination and correctness specification. It is not a claim that this Python implementation for maintaining a basis was extracted from Lean or that a particular runtime bound was proved. The original numerical companion and its tolerances remain separate.

Read this as

“No new directions” is a stopping certificate only after checking the full declared operator family. Stopping after a convenient selection of words is not the same test.

Source and conversion record

The original atlas wording, equations, and drawing labels are retained. Drawings are views of the retained monograph PDF. Text descriptions and table headings are added reading aids. This conversion does not rebuild TeX, rerun the examples, audit proofs or compile Lean.

Conversion checks and source hashes

Notation in Paper I

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index