the rule has
a repair bill

1. An offence needs a jurisdiction

An array is not inherently irreverent. A transition can depart from a specified grammar, representation convention, equivalence relation, symmetry requirement or target. That departure may be recoverable, expensive, ambiguous or irreversible relative to the information retained. Those are different predicates.

Proposed definition R1: a representation and repair regime. Specify a state space X; a named admissible subset A of X; a representation E:X -> Z; an observation O:X -> Y; a repair target I contained in X; a common control space U with allowed controls U(x); an endpoint T(x,u); a nonnegative cost c(x,u); a budget B; and a policy class P. Topologies, metrics and group actions belong in the specification wherever they are used.

The representation E and the observation O need not coincide: an operator may see a latent vector plus a journal, or only a released artifact. The target I need not equal A: being admitted by today's grammar, matching a frozen reading and restoring an original state can demand three different things.

This is a precise proposed meaning of one kind of irreverence. A representation departure instead names the required relation, such as E(x')=E(x), and exhibits its failure. Neither definition asserts consciousness, intention or universal disobedience. Changing A can change the verdict while leaving the state unchanged. Say which rule moved.

For repair, first retain the actual control, rather than only an attractive endpoint:

Use inf(empty set)=infinity. Pointwise B-repairability means V_B(x) is nonempty. An endpoint policy f(x) in F_B(x) need not lift to controls u(x) with the same continuity or measurability. An actuator has to receive a control; it cannot operate a theorem about endpoints.

The unpaid infimum. The inequality c_*(x)<=B is necessary, but can be insufficient at equality. Let U(x)=(0,1], every control reach the same ideal state, and c(x,u)=u. Then c_*(x)=0, although no zero-budget repair exists. Every positive budget succeeds. An infimum is not a receipt.

An attainment condition. If U(x) is compact, the successful-control subset is closed and nonempty, and c(x,.) is lower semicontinuous, then the minimum is attained. For example, success is closed when T(x,.) is continuous and I is closed. Write m for the finite infimum. Within the successful set, the sublevel sets {u:c(x,u)<=m+1/n}, n=1,2,..., are nested nonempty closed subsets of a compact space. Their intersection is nonempty; any member has cost m. This argument does not assume sequential compactness.

Policy requirements. A policy can be arbitrary, measurable, continuous, Lipschitz, causal, equivariant or faithful. Faithful means an already ideal state stays itself. These are extra requirements, not consequences of pointwise repairability. If unrestricted zero-cost replacement by one fixed ideal is permitted, everything is pointwise repairable. The model has then paid for its answer by deleting the question.

For fixed policy requirements, more budget or more permitted controls cannot destroy feasibility. Enlarging the target also preserves feasibility if no new obligations are introduced. But when faithfulness is required on the whole target, enlarging I adds fixed-point obligations; that qualification matters. More information helps only when a controller is allowed to ignore it.

2. One observation; several incompatible repairs

Suppose the policy sees y=O(x), not x. Its control must work for every state compatible with that observation. The relevant object is an intersection of controls:

Restrict y to O(X), so fibres are nonempty. This formula uses a common control alphabet; permissions, costs and endpoints may still depend on the hidden state. Under observation noise, replace H(y) by the explicitly declared compatibility set, such as {x:d(O(x),y)<=delta}. A probability model would give a different, distributional criterion.

Proposition R2. A successful deterministic observation policy of class P exists exactly when this robust correspondence admits a selection in P. For unrestricted set-theoretic policies, nonempty intersections suffice by choice; for finite observations, ordinary finite choice suffices. Nonemptiness alone supplies no continuous or measurable selection.

Proof. If pi succeeds, its one value at y belongs to each V_B(x) in that fibre. Conversely, membership in their intersection verifies permission, budget and target simultaneously for every compatible x. The same equivalence applies with the stated regularity imposed on pi. Nothing permits choosing a different pi(y) after learning a hidden x. End of proof.

The smallest latent-space ambush

Take the real line as the ambient state space, restrict initial inputs to {-1,+1}, and use the encoder and observation E(x)=O(x)=|x|. Permit real translations u with endpoint T(x,u)=x+u, target {0}, and cost |u|. On these inputs the observation is always 1. Each state repairs at cost 1, but their required controls disagree:

No increase in budget makes one translation exactly correct for both. The operation family, not merely the budget, matters.

If approximate success means |x+u|<=epsilon, then

Proof. The two residuals differ by 2, so the triangle inequality forces at least one magnitude to be 1 or larger. The zero control attains 1. Exact observation of the sign permits u=-x; the lossy latent does not. End of proof.

If the task were only to recover |x|, the latent already solves it. Exact source inversion asks for a distinction the encoder removed. The inversion chapter gives the general fibre criterion and separates a chosen representative from the original. Here the same fibre becomes an operational constraint: all hidden members must accept the same proposed control.

Information refinement. If O₁=h composed with O₂, then every O₂-fibre sits inside an O₁-fibre. Hence its robust-control intersection is at least as large. Any unrestricted successful coarse policy transfers by pi₂=pi₁ composed with h. Continuity also transfers if h is continuous; an imposed Lipschitz bound needs its own calculation.

2a. Price the whole procedure

The preceding correspondences characterize available one-shot controls. A search, decoder or repair program has its own resource bill. For a proposed procedure-level regime theta, let Hist be the allowed histories, E(h) the information exposed to a procedure, tau(h) its required target, and P the permitted deterministic procedures. Each r in P returns an outcome r(E(h)) on every admitted history. Its cost c_proc(r,E(h)) includes the charged computation and stopping rule; nontermination is infeasible, or receives infinite cost by an explicit convention.

Proposed definition R2a: uniform budget and residual task loss. Fix a nonnegative loss ell on outcomes and targets. Define

The infimum over no available procedures is infinity. A procedure here may be a finite program, an oracle algorithm or a control strategy, but the choice must be stated. Existence of an arbitrary mathematical selection does not establish existence of a terminating program with the same budget. This definition is a proposed accounting framework, not a theorem that all repair problems are computable.

Exactness is an attained zero. If ell(y,t)=0 exactly when the required outcome is correct, an r attaining zero worst loss is exact task repair. Merely having V_theta(B)=0 does not produce such an r. For a singleton history and target 0, let the only allowed procedures return 1/n, n=1,2,..., all at zero cost. With absolute error their infimum worst loss is zero; none returns the target. Closing the procedure class by limits would change the model.

Even zero measured defect may be insufficient. Distance to a nonclosed ideal family vanishes on its closure. For I=(0,1), the output 0 has dist(0,I)=0 but is not ideal. A claim of exact target membership must use a loss whose zero set expresses that claim, or separately verify membership. Approximate repair and exact repair cannot be exchanged by dropping an infimum sign.

Monotonicity with the charges held fixed. If B₁<=B₂, then R_B1 is contained in R_B2, hence V_theta(B₂)<=V_theta(B₁). Enlarging P while preserving each old procedure and its charges gives the same inclusion and cannot increase the infimum. Restricting the allowed histories also cannot worsen the worst-case optimum, provided the old procedures remain permitted. These claims follow directly by comparing the sets over which the infimum and supremum run.

More informative encodings need a cost condition. If E_coarse=q composed with E_fine, a coarse procedure can run on fine data by first applying q. Equal-budget dominance follows only when this simulation is permitted and its charged cost is no greater than the old cost. If computing q costs time, that time belongs in the budget. Information order is not automatically a free-runtime theorem.

The witness is there. The door is locked.

Consider a state containing a visible bit b=0 and a sealed exact witness w=1. Let the observation expose only b, and require restoring b to w. If all permitted operations preserve b, repair is impossible even if an external analyst knows w. Giving the controller a read operation exposes the right answer but still does not supply a write operation. Conversely, write access alone does not reveal an unobserved w when both witness values are possible. The two failures are independent.

The full physical record can therefore retain the exact original while a particular observation and operation regime cannot recover it. "No information exists" is stronger than "this interface exposes none of the information needed by this task." A journal, a sealed witness and a released latent artifact are different input specifications. A decoder's failure is not evidence of absolute erasure.

3. Three ways for a repair to be impossible

Invariants: the permitted action cannot get there

Proposition R3. If J(T(x,u))=J(x) for every allowed control, and J(x) is not in J(I), then no repair reaches I at any budget.

Proof. A successful endpoint would belong to I and have the forbidden invariant value J(x). Contradiction. End of proof.

Invertible linear maps preserve rank. Real invertible congruences preserve the numbers of positive and negative eigenvalues of a symmetric quadratic form (Sylvester's law of inertia). A flattened ellipse cannot become a nondegenerate circle by an invertible linear map; a hyperbola's indefinite form cannot become positive definite by real invertible congruence. Buying more distortion does not buy a different operation.

A one-way invariant is enough. Suppose states s evolve by allowed operations F_a, and a real-valued quantity v satisfies v(F_a(s))<=v(s) for every allowed action at every reachable state. If every target t in I satisfies v(t)>v(s₀), no finite allowed procedure can repair s₀ into I.

Proof. After zero steps the value is v(s₀). If after k steps v(s_k)<=v(s₀), then after the next allowed step v(s_k+1)<=v(s_k)<=v(s₀). Induction gives the bound for every finite word, including words whose next action depends on the observed history. No stopping state can have the strictly larger value required in I. The result also holds pathwise for random choices of allowed actions. End of proof.

A bill that really is exactly N

Let states be nonnegative integers, start at 0, target the positive integer N, and permit only the operation s -> s+1, charging one unit for each application. The exact repair cost is N. After k operations the state is k by induction, so stopping at N requires exactly N steps; applying the increment N times attains the bound.

Allowing a primitive jump to N would change the cost problem. Allowing the program to print the symbol "N" would change the endpoint task unless printing is itself the specified repair. Reference counts in the operations experiment have this declared-mechanism character: they count the supplied abstract operations, not hidden neural arithmetic.

Bounded structure does not mean finitely many states. One node carrying an arbitrary real coordinate already gives infinitely many states. One node with an unbounded integer identifier does too. A fixed maximum number of nodes or interpreter steps becomes a finite state space only when every stored field, label, identifier and relevant external input ranges over a specified finite set. Bounded real coordinates instead support a compactness question, with closedness and continuity still to check. The finite-real-computation transformer results do not rely on pretending real numbers form a finite alphabet.

Topology: the choices cannot be glued

Proposition R4. A continuous endpoint repair f:X -> I that fixes I is a retraction, by definition. Therefore any obstruction to a retraction obstructs continuous faithful repair, regardless of cost. Pointwise controls can exist everywhere while the required global policy does not.

The disk-to-boundary impossibility below is the classical no-retraction consequence of Brouwer's fixed-point theorem. Its job is precise: it rules out a continuous policy that preserves already ideal inputs. It does not forbid every continuous map into the target.

Symmetry: the input has not supplied a preferred answer

Let a group G act on inputs and endpoints. Suppose admissibility and repair rules respect that action. Write G_x={g:gx=x}. An equivariant endpoint policy satisfies f(gx)=g f(x).

Proof. For h in G_x, h f(x)=f(hx)=f(x). Thus h fixes the output too. End of proof.

On a single orbit this is also sufficient for an equivariant set map taking x to an allowed y: define f(gx)=gy. Stabilizer containment makes the definition independent of the representative g. If G is compact and acts continuously on Hausdorff spaces, the orbit quotient gives continuity of this map. This does not solve continuity across distinct orbits or the lifting of endpoints to controls.

This is the classical stabilizer restriction, often discussed as Curie's principle; see Lawrence, Portilheiro, Zhang and Kaba. Continuous canonicalization has related obstructions studied by Dym, Lawrence and Siegel. An axis smuggled in from the programmer's desk is extra input.

4. An ellipse can become a circle

Start with a centered nondegenerate ellipse E_a,b=diag(a,b)S¹, where a>=b>0. Let the target be any centered nondegenerate circle, permit invertible linear maps L, and charge the multiplicative distortion

Proposition R5: exact circularization cost.

Proof. If L sends the ellipse onto a radius-r circle, then L diag(a,b)=rQ for an orthogonal matrix Q. Consequently the singular values of L are r/a and r/b. Since a>=b, M(L)=max(r/b,a/r). The product of these two quantities is a/b, so their maximum is at least sqrt(a/b). Equality holds when r=sqrt(ab), giving the displayed L_*. Its determinant is 1; the optimum therefore survives an area-preservation constraint. End of proof.

For a=4, b=1 the circle has radius 2 and L_*=diag(1/2,2). The path L_t=diag(2^-t,2^t) preserves area 4 pi and ends there at t=1. For a rotated ellipse conjugate the positive repair by its rotation. More invariantly, if H is its positive-definite shape operator, the repair is sqrt(det H) H^-1. This varies continuously and rotation-equivariantly, and equals the identity on circles.

At b=0 rank prevents recovery by any invertible linear map. As b tends to zero with a fixed, the finite distortion cost diverges. The obstruction is at degeneracy, not at ordinary eccentricity. The next problem deliberately reverses the target: it asks a circle to become a noncircle with a preferred axis.

5. A circle cannot choose its own major axis

Use centered, area-normalized, orientation-registered ellipses. For z=(s,t), set

A²=r²I, so its eigenvalues are r and -r. This proves the semiaxis formula. A physical rotation by angle alpha rotates z by 2 alpha. The log-coordinate origin is the circle; its major axis is undefined. The points z and -z represent perpendicular major axes, not the same oriented ellipse.

Our declared cost is |z-w|=||A(z)-A(w)||_F/sqrt(2), a normalized log-Euclidean distance between positive shape operators. It is not asserted to equal outline distance, strain energy or physical work. The background metric framework is established log-Euclidean positive-definite matrix geometry.

This endpoint cost is achievable: take z(t)=(1-t)z+tw, and move an ellipse point by exp(A(z(t))) exp(-A(z)) applied to that point. Every map is invertible and area preserving; the log-coordinate path has length |z-w|. Thus continuous endpoints in this model have explicit continuous controls.

Let D_R={z:|z|<=R}, R>0, and let the target S_rho={w:|w|=rho}, rho>0. It represents all orientations of one fixed positive eccentricity, with axis ratio exp(2 rho).

Theorem R6: three invoices and a refused order

Proof of pointwise cost. Reverse triangle inequality gives |z-w|>=||z|-rho|. If z is nonzero the unique minimizer is w=rho z/|z|. At zero every target ties. Maximize ||z|-rho| over |z| in [0,R]; a convex function of the radius is maximized at an endpoint, giving max(rho,|R-rho|).

Proof of continuous cost, directly from Brouwer. Let f:D_R -> S_rho be continuous. The map h(z)=-(R/rho)f(z) is a continuous self-map of the closed disk. Brouwer supplies z_*=h(z_*). Necessarily |z_*|=R and f(z_*)=-(rho/R)z_*. Therefore |z_*-f(z_*)|=R+rho. The triangle inequality bounds every displacement by R+rho. This is the exact maximum for every such continuous f, not merely a lower bound achieved by the constant example.

Proof of faithful impossibility. If R>=rho, restrict f to D_rho. The preceding fixed-point argument supplies a boundary point whose image is its antipode, at distance 2 rho. Faithfulness would fix that point. Contradiction. This also proves that every continuous exact-target map moves at least one already ideal point by the entire target diameter.

Proof of equivariant impossibility. The origin is fixed by every physical rotation. Equivariance would require f(0) to be fixed by every rotation. No positive-eccentricity ellipse has that property. The stabilizer condition applies without continuity. End of proof.

These are classical Brouwer and stabilizer consequences. At R=rho, pointwise worst cost is rho and continuous nonfaithful cost is 2 rho. Saying only "continuity doubles the cost" would conceal that faithful continuous repair is impossible. At R=2 rho the two finite budgets have ratio 3. More generally the difference of global budgets is min(R,2 rho).

A global budget gap is not a pointwise regret

For every continuous f:D_R -> S_rho, the exact maximum excess over each input's own nearest cost is

Proof. At radius r, triangle inequality bounds the first difference by r+rho-|r-rho|=2 min(r,rho), and the squared difference by (r+rho)²-(r-rho)²=4r rho. The antipodal boundary point from Brouwer attains both upper bounds at r=R. End of proof.

6. Throwing away the troublesome question

If rotations are identified as equivalent shapes, the quotient of D_R is the interval [0,R], represented by r=|z|. Its quotient metric is |r-s|: aligning the two directions minimizes |ru-sv|. The target ring becomes the single point rho. The repair r -> rho is continuous, pointwise optimal, and faithful wherever rho is an input.

This solves a different recovery task. It does not return an oriented physical ellipse. To act back in the orientation-registered space, a representative still needs choosing; at the circle that is exactly the information missing. A quotient can delete the obligation that caused an obstruction. It cannot silently claim to have satisfied it.

Tolerance can change existence

Replace the target ring by the annulus I_a,b={w:a<=|w|<=b}, with 0<=a<=b. For eccentricity tolerance epsilon, take a=max(rho-epsilon,0) and b=rho+epsilon. Write (q)₊=max(q,0).

Proof. The pointwise distance is a-r below a, zero in [a,b], and r-b above b. Its maximum over [0,R] is the displayed formula. If a>0, normalize a continuous f to its direction and apply Brouwer to h(z)=-R f(z)/|f(z)|. At the fixed boundary point, f has the opposite direction and radius at least a, forcing cost at least R+a. A constant target of radius a attains the bound. If a=0, define f(z)=z for |z|<=b and f(z)=b z/|z| otherwise. This is continuous, equivariant, faithful and pointwise nearest. End of proof.

For a>0 equivariance still fails at zero. If R>=a, a continuous faithful repair would, on D_a, become a retraction onto S_a after radial projection of the output; this is impossible. Allowing the target to include the circle removes both obstructions.

Delete the singular state; keep the bill

On the input annulus delta<=|z|<=R, with 0<delta<=R, nearest ring repair is f(z)=rho z/|z|. Its exact Lipschitz constant in the declared norm is rho/delta.

Proof. Output distance is rho|u-v|, so the displayed identity gives the upper bound. Two distinct directions with r=s=delta give equality. Every rotation-equivariant map into S_rho has the same lower bound on this inner circle, because rotating inputs rotates their outputs by the same doubled angle. End of proof.

Excluding zero makes the policy continuous; admitting arbitrarily nearly circular inputs makes its required sensitivity unbounded. Existence and stable recovery have separated again.

7. Memory has entrance requirements

Replace the disk by the resolved state space Z=[0,R] times S¹, with physical-state projection q(r,u)=ru. The enriched repair f(r,u)=rho u is continuous, equivariant under the doubled rotation action, and pointwise optimal relative to q, at cost |r-rho|. At r=0 the variable u is extra orientation information.

This is the real oriented blow-up of the origin, also the closure of the nearest-repair graph from the punctured disk. It is not a fibre bundle over the disk: away from zero the projection fibre is a singleton, while above zero it is a circle. Standard bundle path-lifting claims do not apply.

Proposition R7: no universal continuous initialization. There is no continuous section s:D_R -> Z of q when R>0.

Proof. At every nonzero z, the section's direction is forced to be z/|z|. Approaching zero along different rays gives different limiting directions. A continuous extension at zero is impossible. End of proof.

Proposition R8: memory cannot mend an unchanged straight crossing. For z(t)=(t,0), -a<=t<=a, a>0, no continuous exact pointwise-nearest output into S_rho exists, irrespective of how much past information a controller stores.

Proof. For negative t the unique nearest output is (-rho,0); for positive t it is (rho,0). Their limits at zero disagree. A choice at the single time t=0 cannot make the path continuous. Historical memory changes neither forced optimum away from zero. End of proof.

The physical ellipse axes differ by pi/2, because the log-coordinate angle is doubled. If the process instead dwells at the circle for time tau, any axis remains optimal during that dwell. With physical angular speed at most omega>0, tau>=pi/(2 omega) is necessary and sufficient for this simple straight-crossing repair: rotate through the shortest right angle at constant speed during the dwell. This construction changes the permitted trajectory.

Merely appending an unconstrained independent memory label m does not fix global continuous cost: on each fixed-m slice D_R times {m}, the Brouwer bound still applies. The compatibility q(r,u)=ru is doing work. Nor can finite discrete memory with a continuous SO(2) action supply an equivariant axis at zero: each orbit map from connected SO(2) to that discrete set is constant. At zero the entire enriched state would remain rotation-fixed.

A meaningful memory theorem must specify initialization, the update equation, observations, allowed input histories and what future information is available. "Remember the missing axis" is a construction on an enlarged state space. It is not yet an algorithm that acquires the axis from an input that lacks one.

8. A continuous law can issue discontinuous orders

Now change the output type. Set R=rho and allow a probability measure on the target circle. Write z=ru for r>0 and |u|=1. Let sigma be uniform probability on S_rho, and let delta_w denote unit mass at w. Define

This probability-valued repair is rotation-equivariant, faithful on the boundary and continuous for weak convergence. At zero the moving atom's mass tends to zero; elsewhere the atom's location and its weight vary continuously. On the compact circle weak convergence is equivalent to convergence in each finite-p Wasserstein metric. It is not total-variation continuous where an atom of positive mass moves to a distinct point.

For Y drawn from mu_z, its mean is z and |Y|=rho almost surely. Therefore

Proof. The uniform circle mean is zero, so E Y=(r/rho)(rho u)=z. Expand the square: E|Y-z|²=E|Y|²-2z dot E Y+|z|²=rho²-|z|². Cauchy-Schwarz gives the first-moment bound. At z=0 every target lies at distance rho, so the worst expected cost rho is attained and optimal among all target-supported probability laws. End of proof.

This agrees with the optimal global worst expected budget. At any strict interior nonzero input, the uniform part assigns positive probability to nonnearest outputs, so this law is not pointwise nearest repair. Its outcome-wise worst essential cost at radius r<rho is r+rho; the supremum over inputs is 2 rho. An expected budget is not a per-outcome guarantee.

The continuity constant already has an author

With chord distance on the circle, W₁ is minimum expected transport distance. Put c=4/pi. For 0<=r<=s<=rho and unit u,v, this particular mixture has

These mixture identities and the sharp conical-extension constant are established in Giuliano Basso, Lemmas 7.4-7.5. The following is a derivation specialized to this circle; renaming the application does not rename the theorem's author.

Transport identity. Keep the common uniform mass 1-s/rho. Send atom mass r/rho from rho u to rho v, costing r|u-v|, and send remaining uniform mass (s-r)/rho to rho v. Mean chord length from a uniform point to rho v is (4/pi)rho, giving the second term. For the matching lower bound use the 1-Lipschitz test function phi(y)=-|y-rho v|. For any transport coupling, its change in expectation is bounded by expected movement. Its expectation difference here equals exactly the displayed transport cost.

Lipschitz upper bound and sharpness. Put a=s-r and q=r|u-v|. Then |ru-sv|²=a²+rs|u-v|²>=a²+q². Cauchy-Schwarz gives q+ca<=sqrt(1+c²)sqrt(q²+a²). For sharpness fix 0<r<rho, let a decrease to zero and choose |u-v|=a/(cr). The distance ratio tends to sqrt(1+c²). End of proof.

Any faithful rotation-equivariant probability repair has mu₀=sigma and mu_{rho u}=delta_{rho u}, so its W₁ Lipschitz constant is at least 4/pi. The exhibited kernel bounds the unrestricted optimum between 4/pi and sqrt(1+16/pi²). The upper constant is sharp for this kernel and for Basso's stated conical class; this does not prove optimality over all possible kernels. No literature-complete claim that the wider optimum is open is made here.

The sample is not the law

Proposition R9. A faithful probability-valued repair of the whole disk cannot be represented by sample maps that are almost surely continuous and land in the target circle everywhere.

Proof. Suppose F(z,omega) were such a representation. At each boundary point z, faithfulness implies F(z,omega)=z almost surely. Choose a countable dense subset of the boundary. The intersection of these countably many probability-one events still has probability one. Intersect also with the event of sample continuity and target membership everywhere. Each resulting sample map fixes the dense boundary set, hence by continuity the entire boundary. It would be a continuous disk-to-circle retraction, which Theorem R6 forbids. End of proof.

Likewise, a rotation-invariant law at the center has no preferred axis, but an individual draw has one. Finitely many fixed pencil directions have only finite rotational symmetry. The law's average log-shape is z itself, usually not an ideal ellipse: averaging ideal outputs need not remain in a nonconvex ideal family.

9. Underprint and the research contract

Underprint makes the specification tangible. The same ink can receive a different parse when the equivalence relation or reduction rule changes. The current grammar's admission test is not the frozen witness's reading test. A journal can restore a source state because it retains information; a released reading can merge sources into one fibre. Changing the repair target to match the new reading is not restoration of the old witness.

Its implemented machinery remains specific: ordered marks, kind equivalences, seams, authored pair reductions and a bounded deterministic interpreter. The gesture decoder, stage order, resource limits and export machinery form the trusted boundary. A changed internal rule is not an escape from that boundary.

Proposed sign-language extensions, not current features. A later reflective language could expose a fold of a syntax tree or quoted rule bodies as editable data. Such a proposal must define the data type, quotation and evaluation boundary, permitted rewrites, stopping rule and retained provenance. Merely drawing a fold does not implement it; merely storing a quoted program does not authorize evaluating it. No reflective evaluator or rule-body quotation mechanism is claimed for the existing Underprint implementation.

In latent inversion, the relevant quotient is the encoder fibre and the target may be a task rather than an exact source. In transformer dynamics, compact attained states do not by themselves make arbitrary compositions stable or invertible. In operational profiles, the cost of realizing an operation and composing it with others is an empirical object whose measurement needs a declared controller and budget. These are precise connections, not a claim that one theorem proves the whole project.

Proposed research question, not an established result. For a fixed regime, determine the joint feasible region of repair budget, target tolerance, sensitivity, observation noise and allowed memory dynamics. A concrete geometric version can prescribe V-Lipschitz shape histories, an initial memory state, a causal controller, an axis-speed bound omega, and an excess-cost objective relative to instantaneous nearest repair. Specify whether the adversary controls the path and whether randomization is judged in expectation, by tails or samplewise.

Such a theorem would need a matching construction and lower bound for those exact rules, followed by a serious prior-art comparison. Brouwer, invariant theory, continuous selections, control and stochastic retractions already occupy this territory. The new proposal here is the way the artwork names its regime and keeps its different failures inspectable.

A rule can be rewritten. A witness cannot be restored by changing what "restored" means halfway through the proof.

Return to the mathematical index / inspect the inverse / price the operations / check the sources