Deterministic Geometric Criterion

• Deterministic geometric criterion is a rigorous, geometry-based condition that deterministically verifies the existence, uniqueness, or stability of structural properties.
• It reduces complex verification problems to explicit geometric constructions such as manifold intersections, distance inequalities, and transversality checks.
• Its applications span matrix completion, quantum separability, dynamical chaos, and model selection, underscoring broad interdisciplinary impact.

A deterministic geometric criterion is a rigorously specified, geometry-based condition that provides a necessary or sufficient (often both) test for the existence, uniqueness, or characterization of a structural property in a mathematical or physical system, where the verification process involves no random or heuristic elements. Such criteria often reduce complex or combinatorial search problems to explicit geometric constructions, inequalities, or transversality checks—thus enabling conclusive, algorithmically deterministic decisions about system properties. Deterministic geometric criteria appear across a wide range of domains including matrix completion, Markov decision processes, quantum separability, dynamical chaos detection, statistical mechanics, model selection in computer vision, phase transition analysis, and integrability constraints in gravity theories.

1. General Formal Structure of Deterministic Geometric Criteria

Deterministic geometric criteria operate by associating key system features with geometric or algebraic objects (manifolds, cones, convex hulls, submanifolds, eigenvalue spectra, tangent spaces) and then formulating precise, checkable properties—such as intersection, “width,” linear independence, or extremality—whose fulfillment conclusively determines the property of interest. The process is deterministic in the sense that for any candidate and data, the outcome is uniquely determined by the specified criterion.

Typical elements include:

• Reduction to geometric invariants: Properties such as matrix rank, separability, or optimality are characterized as the presence/absence of certain geometric configurations.
• Transversality or intersection conditions: Local uniqueness or stability is guaranteed if intersecting geometric sets (e.g., measurement subspaces and low-rank manifolds) meet transversally.
• Distance or diameter inequalities: Thresholds on geometric distances (e.g., simplex inradius, spectral curve length) translate directly into property guarantees.

2. Representative Cases Across Domains

2.1 Matrix Completion: The Well-Posedness Criterion

In matrix completion with deterministic observation patterns, local uniqueness of a rank-$r$ solution is characterized by the well-posedness criterion: if $T_{\mathcal M_r}(\overline Y)$ (the tangent space to the rank-$r$ manifold at the candidate $\overline Y$) intersects the unobserved-entry subspace $\mathbb R^{n_1\times n_2}_{\Omega^c}$ only at $\{0\}$, then $\overline Y$ is a locally unique completion. Algebraically, for all missing entries, the associated Kronecker vectors must be linearly independent; a computationally tractable deterministic test (Shapiro et al., 2018). This criterion is both necessary for local stability and generic under maximal-rank Jacobians.

2.2 Occupancy Faces in Markov Decision Processes

For uniformly absorbing Markov decision processes, the extremal faces of the convex set of occupancy measures admit a complete geometric characterization: every element in the performance set can be realized by a mixture of at most $d+1$ deterministic stationary policies, with the geometric criterion given by the Carathéodory-type face structure of the occupancy set. The minimal mixture order $k^*$ required for a given performance is determined by the dimension of the parallel affine subspace $V(\mu)$ at a point $\mu$, i.e., $k^*=1+\min_\mu \dim V(\mu)$—a deterministic function of system parameters (Dufour et al., 19 Dec 2025).

2.3 Separability in Quantum States

The geometric separability criterion for quantum states embeds density matrices in Euclidean space and provides explicit radius thresholds: all states within distance $r_{\rm in}=(N+1)^{-1}\sqrt{(N-1)/N}$ of the maximally mixed state are guaranteed separable. For arbitrary states, a tomographically complete set of local projectors defines post-measurement reduced states, whose maximal Hilbert–Schmidt distance from the identity must not exceed $r_{\rm in}$ across any bipartition; violation deterministically signals entanglement (Patel et al., 2016).

2.4 Geometric Chaos Certification

In continuous-time autonomous systems, a Smale horseshoe and hence chaos are detected via a deterministic geometric criterion: a periodic orbit with associated neighborhoods and return map satisfying explicit “partial intersection” patterns produces a subshift of finite type with positive entropy, with all conditions stated via invariant manifold geometry and Poincaré maps (Zhang et al., 2019).

2.5 Model Selection in Computer Vision

Methods such as Latent Semantic Consensus (LSC) and Superpixel-guided Deterministic Fitting (SDF) apply deterministic geometric criteria based on consensus scores, SVD-based embeddings, and redundancy-pruned hypothesis selection—all steps determined by geometric properties (e.g., affinity matrices, kernel-weighted scores, superpixel grouping), not stochastic sampling (Xiao et al., 2024, Xiao et al., 2018).

2.6 Geometric Criteria for Phase Transitions

Deterministic geometric criteria can be used to locate phase transitions by monitoring nonanalyticities in geometric observables—such as length of the spectral curve in the complex-energy plane for non-Hermitian systems, or Riccati-type entropy flows in phase-space geometry (Fan et al., 2023, Cairano, 1 Dec 2025).

3. Geometric Transversality, Uniqueness, and Stability

The critical role of transversality is a recurring theme: in matrix completion, transversality between the rank-constrained variety and the observed-entry plane guarantees not only uniqueness but also local stability, as infinitesimal deformation away from the intersection rapidly destroys the rank property if the condition is violated. Similarly, in MDPs, the faces and their algebraic interiors (relative interiors) are determined by the geometric configuration of occupancy measures, and Carathéodory’s theorem enforces deterministic mixture bounds (Shapiro et al., 2018, Dufour et al., 19 Dec 2025).

This is exemplified in the general test for well-posedness:

Step	Description	Outcome
Compute $r$-SVD of $\overline Y$	Form orthogonal complements $F$, $G$	Describe tangent space locally
For each missing $(i,j)$	Build $g_j^T \otimes f_i$	Generate test vectors
Check linear independence	All $g_j^T \otimes f_i$ must be lin. indep. for local uniqueness	Deterministic unique completion

4. Criterion Implementation: Explicitity and Computability

A hallmark of deterministic geometric criteria is their explicit, implementable formulation:

• In matrix completion, the well-posedness test is reduced to a matrix rank computation.
• In deterministic geometric model fitting, steps involve SVD, affinity/distance thresholding, and integer linear programming—all fully specified, repeatable procedures.
• In dynamical chaos, geometric intersection patterns and return maps are constructed from the dynamics and used to invoke standard symbolic dynamics machinery.

Computability and efficiency are often explicit priorities: for example, the occupancy mixture criterion can be algorithmically realized via convex analysis and face-decomposition; consensus-based model fitting eschews any randomness and guarantees repeatability to machine precision (Xiao et al., 2024, Dufour et al., 19 Dec 2025).

5. Domain-Specific Applications and Extensions

Domain (arXiv paper)	Geometric Criterion Summary	Deterministic Test
Matrix completion (Shapiro et al., 2018)	Well-posedness: tangent+missing space transverse, Kronecker vectors indep.	Matrix rank check
Absorbing MDPs (Dufour et al., 19 Dec 2025)	Convex face/affine hull characterization: mixtures of deterministic policies	Carathéodory construction
Quantum separability (Patel et al., 2016)	Distance to simplex in embedding space, post-measurement simplex inclusion	Euclidean norm, inradius
Non-Hermitian top. phases (Fan et al., 2023)	Discontinuity in complex-energy band boundary length as transition indicator	Numerical length computation
Dynamical chaos (Zhang et al., 2019)	Return map/intersecting strip configuration in phase space	Explicit cross-section, symbolic map
Computer vision fitting (Xiao et al., 2024, Xiao et al., 2018)	Consensus score, SVD, kernel weighting, superpixel grouping	Precise pipeline, zero randomness

6. Deterministic Criteria and the Foundations of Physical Irreversibility

In statistical physics, deterministic geometric criteria explain phenomena such as entropy growth and the arrow of time. Extended Structural Dynamics demonstrates that the volume occupied by equilibrium states exponentially dominates phase space, while constrained submanifolds (e.g., pure rotation) have measure zero; as a result, entropy increases deterministically for essentially all initial microstates, and the reversal/recurrence probabilities are exponentially or super-exponentially suppressed. Thus, the geometric structure of phase space provides a deterministic origin for irreversibility (BarAvi, 13 May 2025).

7. Limitations and Open Questions

While deterministic geometric criteria offer sharp sufficiency and necessity in many cases, certain settings raise unresolved issues:

• For highly degenerate or symmetrically constrained problems, practical verification of the criterion (e.g., full independence among large families of vectors) can still be computationally challenging.
• In dynamical systems, concrete identification of the requisite geometric structure (e.g., appropriate transition neighborhoods for subshift horseshoes) may be technically delicate.
• Extensions to systems with non-generic behavior, singularities, or discontinuities may require refinements or pose fundamental obstructions.

• Matrix completion with deterministic pattern – a geometric perspective (Shapiro et al., 2018)
• Absorbing Markov Decision Processes: Geometric Properties and Sufficiency of Finite Mixtures of Deterministic Policies (Dufour et al., 19 Dec 2025)
• Geometric criterion for separability based on local measurement (Patel et al., 2016)
• A geometric criterion for the existence of chaos based on periodic orbits in continuous-time autonomous systems (Zhang et al., 2019)
• Latent Semantic Consensus For Deterministic Geometric Model Fitting (Xiao et al., 2024)
• Superpixel-guided Two-view Deterministic Geometric Model Fitting (Xiao et al., 2018)
• Phase Transitions as Emergent Geometric Phenomena: A Deterministic Entropy Evolution Law (Cairano, 1 Dec 2025)
• Geometry of Topological Phase Transition for Non-Hermitian Systems (Fan et al., 2023)
• Extended Structural Dynamics -- Emergent Irreversibility from Reversible Dynamics (BarAvi, 13 May 2025)

Deterministic geometric criteria thus provide a universal framework for transforming conjectural or probabilistic statements about structural or dynamical properties into explicit, verifiable geometric computations and certificates.