Komorebi MethodologyReading edition

When failure becomes an obstruction

Reading tools
Reading library
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Read and explore

Proofs and implementation

About this work

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

4 When failure becomes an obstruction

A search that has found no solution has established something about the search. It has not necessarily established anything decisive about the existence of a solution. Perhaps the representation is poor, the search space too narrow, or the required idea absent. An obstruction analysis asks for more: a mathematical condition that every permitted solution must satisfy. A verified failure of that condition can certify nonexistence, rather than merely report an unsuccessful search.

The distinction is exact in a linear correction problem. Let \(D:U\to W\) be a linear map over a field, and let \(r\in W\) be a defect. An admissible correction is a vector \(h\in U\) satisfying \(Dh=-r\). Such a correction exists precisely when the class of \(r\) vanishes in the quotient

\[ W/\operatorname{im}D. \]

Indeed, vanishing says \(r=Dg\) for some \(g\), so \(h=-g\) corrects it. Conversely, a correction puts \(r\) in the image. The quotient records exactly what the available corrections cannot change.

Take \(U=\mathbb Q\), \(W=\mathbb Q^2\), and \(D(u)=(u,u)\). Only diagonal corrections are allowed. For \(r=(1,2)\), the functional

\[ \lambda(w_1,w_2)=w_2-w_1 \]

vanishes on every possible correction but satisfies \(\lambda(r)=1\). If \(Dh=-r\) held, applying \(\lambda\) would give \(0=-1\). No additional search is needed. The functional is a short certificate of impossibility for the stated correction problem.

Now allow \(D'(u,v)=(u,u+v)\). The choice \((-1,-1)\) supplies the correction \((-1,-2)\), and the defect disappears. Nothing contradictory has happened. The admissible correction space has changed. That change may be an intelligent way to solve a broader problem, but it is not a solution of the original problem unless the extra freedom was permitted.

A repair has to preserve something

In a serious application, the restrictions are often the point. One may need to keep a boundary value, retain integrality, preserve positivity, or leave an already established observation unchanged. A method that removes every defect by discarding these requirements has not solved the task. It has replaced it.

For a linear protected quantity \(p:U\to V\), corrections that leave the quantity unchanged lie in \(\ker p\). The relevant correction image is therefore \(D(\ker p)\), not all of \(D(U)\). The obstruction must be calculated relative to that smaller image. This is the elementary form of protected repair developed in the realization framework. It explains why two superficially identical defects may have different answers when their preservation requirements differ.[2], [3]

Even a valid obstruction test needs its logical direction stated. A nonzero test value may prove impossibility, while a zero value merely removes one known reason for failure. A complete criterion proves the converse as well. The linear quotient above is complete for its declared problem. A more complicated invariant should not inherit that completeness merely because we also call it an obstruction.

The same care applies to small residuals. On the Hilbert space \(\ell^2\), define \(D(x)_n=x_n/n\) for positive integers \(n\). The map is bounded and injective. For the unit vector \(e_n\), however,

\[ \|De_n\|=1/n\longrightarrow0, \qquad \operatorname{dist}(e_n,\ker D)=1. \]

There is no uniform bound \(\operatorname{dist}(x,\ker D)\leq C\|Dx\|\) on this space. Taking \(x=e_n\) would require \(1\leq C/n\) for every \(n\). A tiny residual can therefore coexist with a fixed distance from the exact solution set. A stability estimate needs additional structure, not just a smaller numerical threshold.

This makes the word “resolution” demanding. A resolution may supply an admissible correction, a finer representation, or an estimate relating the defect to a genuine solution. It must say which of these it provides. Existence, a constructive algorithm, a canonical choice, and a stable numerical procedure are separate achievements, even when they concern the same equation.

Failure now has several possible outputs. A witness can close an existence problem. A separating functional can close a nonexistence problem. A reduction can isolate the one hypothesis still needed. The last is not equivalent to a solution, but it can substantially improve the next inquiry. Instead of returning to the original question with no guidance, the researcher returns with a sharply located boundary.

There is a practical reason to preserve this boundary. A later idea may enlarge the correction space legitimately, supply the missing stability estimate, or reveal that the requested preservation was unnecessary. The failed attempt then becomes reusable mathematics. Its value comes from the precision of what it leaves behind, not from failure considered as a virtue in itself.

Source and conversion record

Source SHA-256: 525944d3003bfb588248e92c85c0c5b43eeac69be6c2d44d7d38a2f168606f1f

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Komorebi Methodology

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