The zero label uses only u0. This gives ∣e0∣=1, a0=0 and a
constant active matrix with diagonal N(2N+d)/[(d+1)(d+2)] and
off-diagonal N(N−1)/[(d+1)(d+2)]. Its nonzero eigenvalues are
with multiplicities d−1 and one. For N>0 the rank is d; for N=0
the matrix vanishes and cannot determine a depth. The trace is
t=dN(2N+d)/[(d+1)(d+2)].
One explicit bounded completion uses the smooth step
s(x)=e(x)/[e(x)+e(1−x)], where e(x)=e−1/x for x>0 and zero
otherwise. Set η=1/22 and
r(C)=trs(2C/η−1),χd(r)=1−s([16(r−d)2−1]/3).
The nonnegative gates have disjoint positive supports. At all maintained
nonzero targets, r=d on a neighborhood, including repeated eigenvalues.
For maximum cutoffs (M2,M3,M4,M5,M6,M10)=(94,3,71,21,34,22),
define
The Hockey-Stick identity gives Fd(N)=(dN+d), with every
positive-order derivative zero at the retained integers. Put
md(t)=κdFd(nd(t)), m0=κ3, K=8933/3 and
ζ(t)=1−s((t−K)/K). One common local law is
It is positive, bounded and invariant under a common physical spatial
rotation. At all fourteen assigned targets, m=κdD and Dm=0.
The zero-matrix down target uses the supplied baseline κ3, not an
inferred depth. The common formula still contains prescribed sector units,
rank gates and a finite ladder. Its flat integer jets lose the positive
count-direction curvature of the earlier oscillatory polynomial flattening.
It supplies no special depth-five coefficient or exceptional response.
The trace cutoff is needed for the stated global regularity estimate.
Bounded eigenvalue gates alone allow one transition eigenvalue while another
grows without bound. Here Dm vanishes for t≥2K, so both Dm and
tDm are bounded on the positive-semidefinite cone. The local energy and
variation coefficients obey, with z=ψ, v=∇ψ,