Good Cut Subspaces: Theory and Applications

• Good cut subspaces are specialized subspaces defined by stronger cut conditions that yield extremal geometric configurations and enhanced partition guarantees.
• They feature prominently in Lorentzian geometry, combinatorial geometry, coding theory, and aperiodic order, enabling shear-free congruences and optimal mass partitions.
• These subspaces facilitate practical advances including improved sum-rank distances, linear repetitivity in quasicrystals, and robust structural invariants in various mathematical settings.

“Good Cut Subspaces” is not a single standardized term across the literature represented here. In Lorentzian geometry it denotes distinguished subsets of the four-complex-dimensional solution manifold of the good cut equation; in combinatorial geometry it refers to $k$-flats on which partition guarantees exceed the per-subspace Ham-Sandwich bound; in coding theory it is closely tied to families of subspaces with uniformly small intersections against prescribed cuts; in aperiodic order it can be read operationally as a choice of physical subspace yielding linear repetitivity; and in several other settings it labels subspaces singled out by extremal behavior across coordinate cuts, affine root-system cuts, or bipartite entanglement cuts (Adamo et al., 2010, Schnider, 2019, Santonastaso et al., 2022, Walton, 2023).

1. Scope of the term across research areas

The cited literature assigns “good cut” structure to subspaces by imposing a cut condition that is stronger than generic behavior in the ambient category. In each case, the subspace is distinguished not merely by inclusion but by the existence of a canonical family of cuts, slices, or projections with additional regularity, symmetry, or extremality.

Area	Ambient object	“Good cut” feature
Lorentzian geometry	$\mathcal{I}^+$, horizons, H-space	Shear-free or asymptotically shear-free NGCs from good cut functions (Adamo et al., 2010)
Discrete geometry	$G_k(\mathbb{R}^d)$	A $k$-flat with enhanced Ham-Sandwich or center-transversal guarantees (Schnider, 2019)
Finite-field/coding theory	$V(k,q^m)$	Small total intersections with low-dimensional $F_{q^m}$-subspaces (Santonastaso et al., 2022)
Aperiodic order	Cut-and-project schemes	A physical subspace yielding linear repetitivity (Walton, 2023)
Quantum information	Multipartite Hilbert spaces	NPT or 1-distillability across every bipartition (Antipin, 2022)
Numerical linear algebra / graph theory	$k$-subspaces of $\mathbb{R}^n$	Large principal-angle distance from every coordinate subspace (Nesterenko, 4 Nov 2025)
Root systems	Affine subspaces in $\mathbb{E}$	Root slices with interval, orbit, and projection structure (Cellini et al., 2021)

This suggests a unifying pattern: a good cut subspace is typically a subspace on which a cut operation becomes structurally rigid, extremal, or classification-friendly.

2. Good cut subspaces in Lorentzian geometry and H-space

In the good-cut-equation literature, a good cut is a cross-section $u = Z(\zeta,\bar{\zeta})$ of a null $\mathcal{I}^+$0-surface $\mathcal{I}^+$1 such that the null directions constructed from the tangent to the cut determine an (asymptotically) shear-free null geodesic congruence at $\mathcal{I}^+$2. The relevant setting takes $\mathcal{I}^+$3 to have topology $\mathcal{I}^+$4, with coordinates $\mathcal{I}^+$5 and complex stereographic coordinates $\mathcal{I}^+$6 on $\mathcal{I}^+$7, and works on the complexification $\mathcal{I}^+$8, where $\mathcal{I}^+$9 are independent complex variables close to real and conjugate values (Adamo et al., 2010).

The generalized good cut equation is posed on a sphere cross-section with conformal factor $G_k(\mathbb{R}^d)$0, where $G_k(\mathbb{R}^d)$1. In the metric-sphere case $G_k(\mathbb{R}^d)$2, it reduces to the standard good cut equation

$G_k(\mathbb{R}^d)$3

The generalized equation is conformally equivalent to the standard equation after the change of stereographic coordinate

$G_k(\mathbb{R}^d)$4

with $G_k(\mathbb{R}^d)$5 determined by

$G_k(\mathbb{R}^d)$6

Accordingly, all generalized versions share the same solution-space structure as the standard good cut equation.

For sufficiently regular $G_k(\mathbb{R}^d)$7, the solution space is a four-complex-dimensional manifold known as H-space, with solutions written as

$G_k(\mathbb{R}^d)$8

In the homogeneous case $G_k(\mathbb{R}^d)$9, the regular solution space is spanned by the $k$0 modes,

$k$1

so H-space reduces to complex Minkowski space. This homogeneous four-complex-parameter family is the “Minkowski good cut subspace.” Its associated congruences are shear-free everywhere, not merely asymptotically. More generally, the full H-space remains four-complex-dimensional for $k$2; the higher harmonics are fixed by $k$3, while the $k$4 modes enter as the constants of integration in the Green’s-function iteration.

The phrase “Good Cut Subspaces” in this setting refers to distinguished subsets of H-space obtained by imposing additional geometric or physical conditions. The explicit examples given are the complex Minkowski subspace $k$5, real slices selected by the requirement that $k$6 be real on the real sphere and that the associated $k$7-field be regular, and horizon subspaces on a vacuum non-expanding horizon. On a horizon, the time-independent generalized equation

$k$8

can be shifted by a complex supertranslation $k$9 so that $V(k,q^m)$0, and then mapped conformally to the homogeneous good cut equation; the resulting horizon good cut subspace is therefore equivalent to the Minkowski good cut subspace. Each point or curve $V(k,q^m)$1 in H-space yields a good cut function $V(k,q^m)$2 and hence a shear-free or asymptotically shear-free null direction field through

$V(k,q^m)$3

3. Geometric partition theory: Ham-Sandwich and center-transversal subspaces

In geometric transversal theory, “good cut subspaces” arise from continuous assignments of mass distributions to subspaces of $V(k,q^m)$4. For $V(k,q^m)$5, a mass assignment is a continuous map

$V(k,q^m)$6

where $V(k,q^m)$7 is the Grassmann manifold of $V(k,q^m)$8-dimensional linear subspaces and $V(k,q^m)$9 is the space of $F_{q^m}$0-dimensional mass distributions. The central phenomenon is that by varying the $F_{q^m}$1-flat, one can sometimes obtain simultaneous partition guarantees for more masses than are available inside a fixed $F_{q^m}$2-flat (Schnider, 2019).

The paper’s main theorem states that if $F_{q^m}$3 are mass assignments on $F_{q^m}$4, with $F_{q^m}$5, then there exists a $F_{q^m}$6-dimensional linear subspace $F_{q^m}$7 such that $F_{q^m}$8 have a common $F_{q^m}$9-center transversal. Equivalently, there is an affine $k$0-flat $k$1 such that every halfspace $k$2 containing $k$3 satisfies

$k$4

for all $k$5. In the special case $k$6, one obtains a $k$7-flat on which $k$8 assigned masses admit a simultaneous Ham-Sandwich cut. The paper therefore identifies a good cut subspace as a $k$9-flat on which enhanced partition guarantees—beyond the per-flat bound $\mathbb{R}^n$0—hold for a larger family of assigned masses.

A second theorem treats $\mathbb{R}^n$1-horizontal subspaces, namely $\mathbb{R}^n$2-dimensional subspaces containing $\mathbb{R}^n$3. If $\mathbb{R}^n$4 are mass assignments on $\mathbb{R}^n$5, with $\mathbb{R}^n$6, then there exists a $\mathbb{R}^n$7-dimensional $\mathbb{R}^n$8-horizontal subspace $\mathbb{R}^n$9 such that the assigned masses admit a common Ham-Sandwich cut inside $\mathbb{E}$0. In the language used in the paper, “choosing $\mathbb{E}$1 vectors” means fixing those coordinate directions and retaining one free direction.

The same work extends the perspective from single hyperplanes to families of $\mathbb{E}$2 hyperplanes. For a family $\mathbb{E}$3 of oriented hyperplanes, the parity-colored regions

$\mathbb{E}$4

are defined using the parity of the number of positive sides containing $\mathbb{E}$5. The paper proves a relaxed version of Langerman’s conjecture: any $\mathbb{E}$6 mass distributions in $\mathbb{E}$7 can be almost simultaneously bisected by $\mathbb{E}$8 hyperplanes. Throughout, the existence proofs use configuration-space/test-map constructions, a Borsuk–Ulam-type obstruction, Stiefel–Whitney classes, and quasi-sections rather than algorithms.

4. Finite-field and coding-theoretic formulations

In the finite-field literature on subspace designs, “good cutting” is formulated through uniformly small intersections with low-dimensional subspaces. The ambient space is $\mathbb{E}$9, a $u = Z(\zeta,\bar{\zeta})$0-dimensional vector space over $u = Z(\zeta,\bar{\zeta})$1, and the basic objects are ordered families of $u = Z(\zeta,\bar{\zeta})$2-subspaces $u = Z(\zeta,\bar{\zeta})$3. The paper’s central notion is an $u = Z(\zeta,\bar{\zeta})$4-subspace design: an ordered set $u = Z(\zeta,\bar{\zeta})$5 such that

$u = Z(\zeta,\bar{\zeta})$6

and for every $u = Z(\zeta,\bar{\zeta})$7-dimensional $u = Z(\zeta,\bar{\zeta})$8-subspace $u = Z(\zeta,\bar{\zeta})$9,

$\mathcal{I}^+$00

An $\mathcal{I}^+$01-design is an $\mathcal{I}^+$02-subspace design. In this setting, good cutting means that every low-dimensional $\mathcal{I}^+$03 intersects the family $\mathcal{I}^+$04 in small total $\mathcal{I}^+$05-dimension; for hyperplanes, this is the case $\mathcal{I}^+$06 (Santonastaso et al., 2022).

The theory establishes several sharp parameter bounds. Proposition 2.1 gives $\mathcal{I}^+$07. Theorem 2.8 shows that if $\mathcal{I}^+$08 is an $\mathcal{I}^+$09-design in $\mathcal{I}^+$10, then

$\mathcal{I}^+$11

Maximum $\mathcal{I}^+$12-designs attain the upper dimension bound when $\mathcal{I}^+$13, and Theorem 3.5 constructs them when $\mathcal{I}^+$14, $\mathcal{I}^+$15, and $\mathcal{I}^+$16, by direct-sum glueing of linearized-polynomial constructions.

The good-cut interpretation becomes especially concrete in the code correspondence. For a non-degenerate sum-rank code with generator blocks $\mathcal{I}^+$17, letting $\mathcal{I}^+$18 be the $\mathcal{I}^+$19-span of the columns of $\mathcal{I}^+$20, the paper shows that

$\mathcal{I}^+$21

and hence

$\mathcal{I}^+$22

Thus small sums of intersections are exactly the structural input producing large sum-rank distance. The same framework yields optimal subspace designs, MSRD codes, two-intersection sets with respect to hyperplanes, cutting blocking sets, minimal codes, and explicit lossless dimension expanders.

A further refinement is the notion of a cutting design. An ordered set $\mathcal{I}^+$23 is a cutting design if for any pair of hyperplanes $\mathcal{I}^+$24,

$\mathcal{I}^+$25

If there exists $\mathcal{I}^+$26 such that

$\mathcal{I}^+$27

for every hyperplane $\mathcal{I}^+$28, then the family is a non-degenerate cutting design. This is the design-theoretic analogue of a uniformly good cut profile.

5. Cut-and-project sets and linear repetitivity

In aperiodic order, the phrase can be used operationally for physical subspaces in cut-and-project schemes that yield linear repetitivity. A $\mathcal{I}^+$29-to-$\mathcal{I}^+$30 cut-and-project scheme is

$\mathcal{I}^+$31

where $\mathcal{I}^+$32, $\mathcal{I}^+$33 is a discrete cocompact lattice of rank $\mathcal{I}^+$34, and $\mathcal{I}^+$35 is a compact window equal to the closure of its interior. The associated cut-and-project set is

$\mathcal{I}^+$36

in non-singular position. The paper studies polytopal windows, including non-convex, disconnected, and labelled cases, and frames the quality of the cut through the dynamical property of linear repetitivity ($\mathcal{I}^+$37) (Walton, 2023).

Low complexity is defined by

$\mathcal{I}^+$38

where $\mathcal{I}^+$39 counts distinct $\mathcal{I}^+$40-patches. The complexity exponent is

$\mathcal{I}^+$41

with $\mathcal{I}^+$42 the set of flags in the supporting subspaces of the window. Low complexity $\mathcal{I}^+$43 is the sharp case $\mathcal{I}^+$44, equivalently the rank-sum condition

$\mathcal{I}^+$45

together with hyperplane spanning $\mathcal{I}^+$46.

Under weak homogeneity, the main theorem states:

• $\mathcal{I}^+$47 holds if and only if $\mathcal{I}^+$48 and $\mathcal{I}^+$49 hold.

Here $\mathcal{I}^+$50 is the Diophantine property of the projected lattice $\mathcal{I}^+$51: $\mathcal{I}^+$52 for all nonzero $\mathcal{I}^+$53. In the fully general case weak homogeneity is replaced by an inhomogeneous analogue $\mathcal{I}^+$54, formulated on flag-group projections and generalized vertex displacements. The paper’s Main Theorem B gives the two-sided criterion: if $\mathcal{I}^+$55 holds then $\mathcal{I}^+$56 and $\mathcal{I}^+$57 hold, and conversely there exists $\mathcal{I}^+$58 such that if $\mathcal{I}^+$59 and $\mathcal{I}^+$60 hold after replacing $\mathcal{I}^+$61 by $\mathcal{I}^+$62, then $\mathcal{I}^+$63 holds.

Within this framework, a good cut subspace is the choice of physical space $\mathcal{I}^+$64 for which the associated cut-and-project set is linearly repetitive. In weakly homogeneous settings, this means precisely minimal complexity plus a homogeneous Diophantine condition; in the general setting, minimal complexity plus inhomogeneous Diophantine avoidance of shifted vertex displacements. The paper applies this criterion to Ammann–Beenker, Penrose, generalized Penrose, and labelled-window variants, after MLD reduction when the internal space has the form $\mathcal{I}^+$65.

6. Other specialized uses: multipartite cuts, coordinate extremality, and affine root slices

In quantum information, a “Good Cut Subspace” is defined directly in terms of bipartitions. For a multipartite Hilbert space $\mathcal{I}^+$66, a subspace $\mathcal{I}^+$67 is a Good Cut Subspace if every density operator supported on $\mathcal{I}^+$68 is NPT across every bipartition $\mathcal{I}^+$69; a stronger form requires 1-distillability across every cut. The construction in “Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties” takes bipartite NPT or 1-distillable subspaces arranged along a chain, tensors them, and joins adjacent subsystems. In the tripartite case,

$\mathcal{I}^+$70

has the property that any density operator supported on $\mathcal{I}^+$71 is NPT across every bipartition, and 1-distillable across every bipartition if each input subspace is 1-distillable. The same paper also proves that joining adjacent bipartite CESs yields a genuinely entangled subspace, with

$\mathcal{I}^+$72

for the resulting tripartite joined product (Antipin, 2022).

In numerical linear algebra and graph theory, the phrase is used informally for $\mathcal{I}^+$73-dimensional subspaces of $\mathcal{I}^+$74 that are maximally far from all coordinate $\mathcal{I}^+$75-subspaces in largest-principal-angle distance. For $\mathcal{I}^+$76 of dimension $\mathcal{I}^+$77,

$\mathcal{I}^+$78

For a coordinate subspace $\mathcal{I}^+$79,

$\mathcal{I}^+$80

The 2025 paper proves that if $\mathcal{I}^+$81 is realized as the star space $\mathcal{I}^+$82 of a nontrivial $\mathcal{I}^+$83-connected series-parallel graph with graph-induced weights, then

$\mathcal{I}^+$84

for every coordinate $\mathcal{I}^+$85-subspace $\mathcal{I}^+$86. These star spaces therefore supply explicit extremal subspaces for the GTZ1997 coordinate-subspace hypothesis (Nesterenko, 4 Nov 2025).

In the root-system literature, the paper “Root systems, affine subspaces, and projections” does not introduce the term verbatim, but it studies a natural class of affine cuts with the same flavor. For $\mathcal{I}^+$87 and $\mathcal{I}^+$88, the slice

$\mathcal{I}^+$89

is the intersection of $\mathcal{I}^+$90 with an affine subspace $\mathcal{I}^+$91. When $\mathcal{I}^+$92, $\mathcal{I}^+$93 is a root subsystem, $\mathcal{I}^+$94 is an interval in the root poset with explicit minimum and maximum, and $\mathcal{I}^+$95 acts transitively on the long roots in $\mathcal{I}^+$96 and on the short roots in $\mathcal{I}^+$97, so the slice breaks into at most two parabolic orbits. In codimension $\mathcal{I}^+$98, the projections of these slices are weight polytopes, and the orthogonal projection of the root polytope onto a standard parabolic subspace satisfies a containment

$\mathcal{I}^+$99

with $G_k(\mathbb{R}^d)$00. This extracted class functions as an affine-root-system analogue of a good cut subspace (Cellini et al., 2021).

Taken together, these specialized usages indicate that “Good Cut Subspaces” is best understood as a cross-disciplinary label for subspaces distinguished by unusually strong behavior under cutting: shear-free congruence generation, enhanced mass partition, uniformly controlled intersections, linear repetitivity, all-cut entanglement negativity, extremal distance from coordinate cuts, or root-slice orbit rigidity.