Subspace Locking: Dynamics, Topology, & Beyond

• Subspace locking is a concept defining selective constraints on system dynamics and invariant subspaces across disciplines like arithmetic dynamics, quantum control, and topological phases.
• It enables tractable analysis by restricting the system to a lower-dimensional regime, facilitating decidability results, controlled state evolution, and unique spectral properties.
• Applications include orbit reachability, quantum Zeno effects, finite element locking in thin structures, and combinatorial rigidity in inference problems, highlighting its wide impact.

In contemporary research, subspace locking does not denote a single universally standardized construction; rather, it labels several technically distinct phenomena in which dynamics, topology, geometry, or inference become constrained by a subspace or by a fixed relation between subspaces. In arithmetic dynamics, it refers to the dimension-dependent tractability of deciding whether a matrix orbit enters a target subspace (Bacik et al., 26 Jan 2026). In quantum control, it denotes the confinement of evolution to a controlled subspace by making leakage states dynamically inaccessible (Busch et al., 2010). In free-fermion topology, it is the momentum-independent condition that a Hamiltonian maps one fixed subspace into another, thereby protecting new bulk invariants and boundary effects (Shimomura et al., 28 Aug 2025). Related usages appear in sliding interfaces, thin-structure discretization, projective blocking theory, pursuit-evasion games, and subspace identification from incomplete data, where the common theme is a restriction that is selective rather than global.

1. Cross-disciplinary meaning and common structure

Across the cited literature, subspace locking is associated with one of three structural patterns: entry into a target subspace, confinement within a preferred subspace, or protection by a fixed subspace relation. The resulting mathematics varies widely—linear dynamical systems, Lindblad dynamics, point-gap topology, Fourier spectral analysis, projective incidence geometry, and combinatorial linear algebra—but each case singles out a lower-dimensional sector whose accessibility, invariance, or identifiability is the central issue.

Domain	Locked object	Locking mechanism
Orbit reachability	Matrix orbit relative to $S$	Decidability changes with target dimension
Quantum control	Controlled subspace $\mathcal H_{\rm CS}$	Fast outside dynamics or dissipation suppress leakage
Topological phases	Pair $(\mathcal M,\mathcal M')$	$H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$
Sliding interfaces	Center-of-mass motion direction	Moiré-selected low-energy corridors
Finite elements	Bending-dominated mode family	Artificial stiffness distorts one spectral branch
Projective / pursuit / inference settings	$k$-spaces, target half-spaces, fitted subspaces	Blocking, guarding barriers, or combinatorial rigidity

This comparison suggests that “locking” is best understood as a selective constraint principle: only certain motions, trajectories, spectral branches, or admissible subspaces remain effectively available. In some fields the emphasis is algorithmic, in others physical or geometric, but the technical content is always organized around a privileged subspace structure [(Cao et al., 2021); (Hiemstra et al., 2023); (Pimentel-Alarcón, 2014)].

2. Orbit reachability, inherent dimension, and arithmetic hardness

In linear dynamics, the relevant formal problem is the Subspace Orbit Problem. A linear dynamical system is a pair

$(A,\mathbf{x}) \in K^{d\times d}\times K^d,$

with orbit

$$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$

Given a linear subspace $S\subseteq K^d$, the question is whether

$B(A,\mathbf{x})\cap S\neq\varnothing,$

equivalently whether there exists $n\ge 0$ such that $\mathcal H_{\rm CS}$0. The classical point-target case is polynomial-time decidable by Kannan and Lipton, and the case $\mathcal H_{\rm CS}$1 is decidable by Chonev, Ouaknine, and Worrell. At the opposite extreme, when the target is a hyperplane of dimension $\mathcal H_{\rm CS}$2, the problem is equivalent to the Skolem Problem for linear recurrence sequences, namely whether $\mathcal H_{\rm CS}$3 such that $\mathcal H_{\rm CS}$4 (Bacik et al., 26 Jan 2026).

A central refinement is the replacement of ambient dimension by the dimension intrinsically generated by the orbit. The relevant object is the Krylov subspace

$\mathcal H_{\rm CS}$5

whose dimension is the Krylov dimension. The paper introduces reduced linear dynamical systems—non-degenerate, full-dimensional, and of stable dimension—and shows that general instances can be decomposed into finitely many reduced subinstances. This motivates the notion of inherent dimension as the “true” dimension governing the orbit rather than an artificially inflated ambient space.

The main decidability theorem identifies a sharply dimension-sensitive tractable regime: $\mathcal H_{\rm CS}$6 or equivalently, if $\mathcal H_{\rm CS}$7,

$\mathcal H_{\rm CS}$8

Over $\mathcal H_{\rm CS}$9, this is strengthened to

$(\mathcal M,\mathcal M')$0

The proof route is: reduction to a simultaneous zero problem for linear recurrence sequences; a witness bound

$(\mathcal M,\mathcal M')$1

and verification by arithmetic-circuit zero testing after nondeterministically guessing $(\mathcal M,\mathcal M')$2.

The technical engine is MSTV-reducibility. One searches for a linear combination of the relevant linear recurrence sequences that lies in the MSTV class, meaning roughly an LRS with at most three dominant roots in the Archimedean case or two dominant roots in the non-Archimedean case. The key dominant-root theorem states that for an exponential polynomial with $(\mathcal M,\mathcal M')$3 terms and roots $(\mathcal M,\mathcal M')$4 such that no quotient $(\mathcal M,\mathcal M')$5 is a root of unity and all $(\mathcal M,\mathcal M')$6 are equal, there exists an absolute value $(\mathcal M,\mathcal M')$7 for which at most

$(\mathcal M,\mathcal M')$8

terms are dominant. This makes it possible to force tractable zero-testing behavior by a suitable valuation choice.

The complementary hardness theorem shows that the tractable regime does not extend uniformly to large targets: if there exists $(\mathcal M,\mathcal M')$9 such that $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$0 is decidable for all $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$1, then the Skolem Problem would be decidable. Hyperplanes are already Skolem-equivalent, and more generally linear-scale target dimensions are Skolem-hard. In this sense, the paper isolates a sharp “subspace locking” threshold: logarithmic-size target subspaces are algorithmically manageable, while linear-size targets are intertwined with a long-open arithmetic decidability problem.

3. Dynamical confinement by acting on the outside

In quantum control, subspace locking denotes the protection of a finite controlled subspace $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$2 by making leakage states outside it evolve much faster than the leakage process itself. The benchmark model is a single controlled state $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$3 resonantly coupled to one outside state $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$4 with strength $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$5: $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$6 If the system starts in $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$7, then

$H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$8

so population exits the controlled subspace on the timescale $H(\boldsymbol{k})\mathcal M \subseteq \mathcal M'$9 (Busch et al., 2010).

The basic protection mechanism is timescale separation. In the simplest successful coherent model, one adds an outside state $k$0 and a strong coupling $k$1 between $k$2 and $k$3: $k$4 The resulting survival probability is

$k$5

For $k$6,

$k$7

Thus the leakage amplitude is suppressed by $k$8. The interpretation given in the paper is Zeno-like: rapid outside oscillations average the leakage coherence to nearly zero.

This coherent mechanism can fail in the presence of dark states. In a four-level outside manifold with strong couplings $k$9 and $(A,\mathbf{x}) \in K^{d\times d}\times K^d,$0, the state

$(A,\mathbf{x}) \in K^{d\times d}\times K^d,$1

is a zero eigenstate of the fast outside dynamics. Because it does not participate in the rapid oscillations, leakage into it is not dynamically averaged away. Protection therefore requires not merely a large $(A,\mathbf{x}) \in K^{d\times d}\times K^d,$2, but the absence of relevant stationary dark leakage channels.

The same paper shows that dissipation outside the controlled subspace can provide more robust protection. With Lindblad dynamics

$(A,\mathbf{x}) \in K^{d\times d}\times K^d,$3

rapid decay of the outside states both suppresses persistent leakage and repairs leakage events that do occur. For the simple two-level leakage model, if $(A,\mathbf{x}) \in K^{d\times d}\times K^d,$4, $(A,\mathbf{x}) \in K^{d\times d}\times K^d,$5 stays close to 1. The average time spent in the protected subspace can scale like

$(A,\mathbf{x}) \in K^{d\times d}\times K^d,$6

much longer than the unprotected timescale $(A,\mathbf{x}) \in K^{d\times d}\times K^d,$7. The dissipative picture is also heralded: a photon emission signals that the system has left $(A,\mathbf{x}) \in K^{d\times d}\times K^d,$8. The effective post-protection dynamics inside the locked sector are summarized by

$(A,\mathbf{x}) \in K^{d\times d}\times K^d,$9

The resulting notion of subspace locking is operational rather than merely kinematic. The subspace need not be invariant under the full Hamiltonian; it is rendered effectively invariant because the outside is made dynamically inaccessible on the leakage timescale.

4. Subspace-protected topology and bulk-boundary correspondence

In topological band theory, the central object is the subspace property

$$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$0

where $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$1 and $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$2 are momentum-independent subspaces of the internal Hilbert space $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$3. Equivalently,

$$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$4

This is a selection rule forbidding scattering from $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$5 into the orthogonal complement of $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$6. The nontrivial regime is

$$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$7

which is further divided into the cases $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$8 and $$B(A,\mathbf{x})=\{\mathbf{x},A\mathbf{x},A^2\mathbf{x},\dots\}.$$9 (Shimomura et al., 28 Aug 2025).

Assuming a point gap at zero energy,

$S\subseteq K^d$0

one restricts the Hamiltonian to

$S\subseteq K^d$1

Because the full Hamiltonian is invertible and the two subspaces have equal dimension, this restricted map is also invertible and supports its own point-gap topology. In odd spatial dimension $S\subseteq K^d$2, the authors define a subspace-protected winding number $S\subseteq K^d$3, invariant under deformations that preserve both the point gap and the subspace property. The topological content is therefore attached not to an ordinary symmetry sector of the full Hamiltonian, but to a momentum-independent relation between two fixed subspaces.

Bulk-boundary correspondence is established through a doubled Hermitian Hamiltonian,

$S\subseteq K^d$4

which has an emergent sublattice symmetry. An index theorem yields

$S\subseteq K^d$5

where $S\subseteq K^d$6 count zero modes of $S\subseteq K^d$7 with chirality $S\subseteq K^d$8. This implies the boundary bound

$S\subseteq K^d$9

The boundary phenomenology depends on whether the two subspaces coincide. If $B(A,\mathbf{x})\cap S\neq\varnothing,$0, energy shifts generally destroy the subspace property, and the protected objects are boundary zero modes. In Hermitian systems this yields an unpaired zero mode localized at only one boundary. If $B(A,\mathbf{x})\cap S\neq\varnothing,$1, the property survives energy shifts, and in non-Hermitian systems the same structure protects zero-winding skin modes, namely a macroscopic boundary accumulation even when the full conventional point-gap winding vanishes.

The model examples make the distinction concrete. A triangular non-Hermitian one-way-coupled Hatano–Nelson model realizes $B(A,\mathbf{x})\cap S\neq\varnothing,$2, has full-system winding $B(A,\mathbf{x})\cap S\neq\varnothing,$3, but nonzero restricted invariant

$B(A,\mathbf{x})\cap S\neq\varnothing,$4

and displays a skin effect protected by the subspace structure rather than by the full Hamiltonian’s winding. An extended SSH model with $B(A,\mathbf{x})\cap S\neq\varnothing,$5 loses the usual symmetry but retains a nontrivial subspace invariant and exhibits an unpaired zero mode at open boundary. The paper further shows that the restricted Hamiltonian can carry additional symmetry-based structure of its own, such as a BDI-class $B(A,\mathbf{x})\cap S\neq\varnothing,$6 invariant, even when the full Hamiltonian has no conventional symmetry. In this usage, subspace locking is the organizing principle that replaces symmetry as the source of topological protection.

5. Geometric and spectral forms of locking

In driven sliding interfaces, locking arises from moiré coincidence between a rigid crystalline cluster and a patterned substrate. Orientational locking means that the cluster settles near a preferred angle $B(A,\mathbf{x})\cap S\neq\varnothing,$7, while directional locking means that its center-of-mass velocity is constrained to a preferred angle $B(A,\mathbf{x})\cap S\neq\varnothing,$8, generally different from the force direction $B(A,\mathbf{x})\cap S\neq\varnothing,$9. The geometric origin is a smallest real-space coincidence lattice vector

$n\ge 0$0

together with a corresponding reciprocal-space coincidence vector

$n\ge 0$1

For periodic lattices, the effective center-of-mass energy is dominated by

$n\ge 0$2

so motion follows troughs perpendicular to $n\ge 0$3. In the triangle-on-square experiment, the matching

$n\ge 0$4

yields

$n\ge 0$5

The generalized formalism extends this relation between locking orientation and locking direction to arbitrary periodic or quasiperiodic lattice symmetries (Cao et al., 2021).

A distinct but related use appears in finite element analysis of thin curved structures as membrane locking. There the issue is not a preferred trajectory but an artificially stiff bending response induced by curvature-coupled membrane and bending strains. For the circular Euler–Bernoulli ring, the continuous kinematics are

$n\ge 0$6

and the paper proposes a spectral criterion: at fixed normalized mode number $n\ge 0$7, a discretization is locking-free if the log-error spectrum is invariant under mesh refinement. Using

$n\ge 0$8

the criterion is

$n\ge 0$9

The analysis shows that standard displacement-based Galerkin discretizations remain susceptible to locking, especially in the bending-dominated branch, whereas a mixed Hellinger–Reissner-type formulation is largely locking-free. Locking becomes worse for smaller normalized thickness $\mathcal H_{\rm CS}$00, larger radius $\mathcal H_{\rm CS}$01, and coarser meshes; increasing polynomial degree improves accuracy but does not remove the locking mechanism (Hiemstra et al., 2023).

These two literatures treat different objects—sliding trajectories in one case, vibration branches in the other—but both isolate a lower-dimensional sector selected by geometry. This suggests a broader interpretation in which subspace locking can mean either dynamical collapse onto preferred channels or nonuniform distortion of a physically meaningful modal subspace.

6. Blocking, guarding, and combinatorial rigidity

In finite projective geometry, a blocking formulation treats subspace locking as an incidence obstruction problem. A set $\mathcal H_{\rm CS}$02 of points and hyperplanes in $\mathcal H_{\rm CS}$03 is a blocking set with respect to $\mathcal H_{\rm CS}$04-spaces if every $\mathcal H_{\rm CS}$05-space is incident with at least one element of $\mathcal H_{\rm CS}$06. The classification depends sharply on the threshold

$\mathcal H_{\rm CS}$07

If $\mathcal H_{\rm CS}$08, the smallest constructions are purely hyperplanar: equality in the lower bound occurs exactly for all hyperplanes through a fixed $\mathcal H_{\rm CS}$09-space. If $\mathcal H_{\rm CS}$10, the smallest constructions are purely point-based: equality occurs exactly for all points in a fixed $\mathcal H_{\rm CS}$11-space. At the critical value $\mathcal H_{\rm CS}$12, the minimal sets are genuinely mixed. Construction 1.5, built from a $\mathcal H_{\rm CS}$13-space $\mathcal H_{\rm CS}$14, a $\mathcal H_{\rm CS}$15-space $\mathcal H_{\rm CS}$16, and a partition of the $\mathcal H_{\rm CS}$17 $\mathcal H_{\rm CS}$18-spaces of $\mathcal H_{\rm CS}$19 through $\mathcal H_{\rm CS}$20, produces a blocking set of size

$\mathcal H_{\rm CS}$21

and Theorem 4.7 shows that every extremal mixed blocking set is of this form (Adriaensen et al., 2022).

In differential games, guarding a target subspace gives a dynamic barrier version of the same idea. The state space is divided by a target hyperplane

$\mathcal H_{\rm CS}$22

into a play subspace $\mathcal H_{\rm CS}$23 and a target subspace $\mathcal H_{\rm CS}$24. One attacker with speed $\mathcal H_{\rm CS}$25 attempts to enter $\mathcal H_{\rm CS}$26, while two defenders with speed $\mathcal H_{\rm CS}$27 attempt point capture. The attack subspace against one defender is

$\mathcal H_{\rm CS}$28

equivalently an open ball with center

$\mathcal H_{\rm CS}$29

and radius

$\mathcal H_{\rm CS}$30

For two defenders, the attacker’s attack subspace is the intersection of two such balls. The resulting barrier $\mathcal H_{\rm CS}$31 partitions $\mathcal H_{\rm CS}$32 into the defender winning subspace, attacker winning subspace, and the indifference surface on which optimal capture occurs exactly at $\mathcal H_{\rm CS}$33. When both defenders are active, $\mathcal H_{\rm CS}$34 is a union of three quadratic pieces, and the paper gives closed-form optimal capture points and straight-line saddle-point strategies (Yan et al., 2019).

A third formulation concerns partially observed data from a union of subspaces. There the locking question is when incomplete vectors behave as one complete validating vector. Each observation set $\mathcal H_{\rm CS}$35 has size $\mathcal H_{\rm CS}$36, and the paper characterizes exactly when the observed pattern forces a unique fitting $\mathcal H_{\rm CS}$37-dimensional subspace. The uniqueness theorem states that there is only one $\mathcal H_{\rm CS}$38-dimensional subspace fitting the observation family $\mathcal H_{\rm CS}$39 iff there exists a subset of size $\mathcal H_{\rm CS}$40 such that every subcollection satisfies

$\mathcal H_{\rm CS}$41

where $\mathcal H_{\rm CS}$42 is the number of columns and $\mathcal H_{\rm CS}$43 the number of distinct observed rows. The stronger “all of a kind” theorem requires a subset of size $\mathcal H_{\rm CS}$44 satisfying the same inequality for every strict subset; then all incomplete vectors are forced to belong to the same member of the union $\mathcal H_{\rm CS}$45, the fitting subspace is unique, and that subspace lies in $\mathcal H_{\rm CS}$46 itself (Pimentel-Alarcón, 2014).

Taken together, these results exhibit three recurring mechanisms of subspace locking: incidence saturation in projective space, barrier separation in pursuit-evasion dynamics, and combinatorial rigidity in incomplete-data subspace identification. In each case, the subspace is not merely present as background geometry; it is the object whose access, avoidance, or uniqueness is determined by sharp structural conditions.