Regular semi-algebraic system

A parameterized triangular polynomial system with regular specialization and possibly empty strict positivity conditions, with a real solution at every permitted parameter point.

Version

v1 · 2026-10-31 · History

Domain-specific #

14567

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Real Algebraic Geometry, Computational Algebra → Mathematics

Core Idea

A regular semi-algebraic system represents real solutions with a triangular polynomial chain, an open nonempty parameter region, and possibly empty strict positivity conditions. Its regularity requires good specialization and at least one satisfying real solution at every permitted parameter point.^[1]

How would you explain it like I'm…

Safe-Zone Knob Machine

Imagine a machine with some knobs you can turn anywhere inside a safe zone. Once you set the knobs, the other numbers are figured out one after another. The special promise is that for every knob setting in the safe zone, there's always a real answer that works.

Knobs and Dependent Answers

Some math puzzles have knobs you can turn freely and other numbers that depend on where the knobs are set. A Regular semi-algebraic system is a careful way to describe all the answers to such a puzzle. It picks out a range of knob settings, a whole region and not just one point, where things behave nicely. Then, for every knob setting in that region, the dependent numbers can be found one after another from equations, and at least one real answer always exists that also meets the 'strictly greater than' rules.

Parametrized Triangular Polynomial Systems

A Regular semi-algebraic system is a way of describing a family of real solutions to polynomial equations and inequalities. It splits the unknowns into free parameters and dependent variables. The dependent variables are governed by a triangular system: the first equation involves only the first dependent variable (plus parameters), the next adds one more, and so on, so they can be solved in order. A condition on the parameters picks out an open, nonempty region. For every parameter point in that region, the equations must specialize well, meaning they don't degenerate, and must have a real solution satisfying the strict inequalities.

 

A Regular semi-algebraic system is a structured representation of part of a real semi-algebraic set, used in real algebraic geometry and computer algebra. The variables are split into free parameters and main variables. The main variables are constrained by a triangular set of polynomial equations, each introducing a new leading variable, which permits successive solving. A condition on the parameters defines an open, nonempty parameter region. The defining requirement is uniformity over that region: at every permitted parameter point, the triangular system specializes well (it remains regular rather than degenerating) and has at least one real solution that satisfies the system's strict polynomial inequalities. This makes the system a reliable description of a solution family parametrized over the region.

How It Works

Write [Q,T,P>]: Q restricts the free parameters, T gives the ordered equations for the remaining variables, and every polynomial in P must be positive. The source requires P to be regular modulo the saturated ideal of T and the regular system to specialize well throughout Q.^[1]

Examples

In a cubic root-existence problem, one generic component uses T={3x²−y²+a, 8x³+2ax−b}, P={1−xy}, and the parameter restrictions h1=4a³+27b²>0 and h2≠0. Boundary branches require separate treatment.^[1][2]

In a surface intersection, Chen gives five components. One has free x, −1<x<1 and x¹²−3x⁸+4x⁴−1≠0, chain {z⁵+(1−x⁴)y+x², y²+x⁴−1}, and empty P. It describes one part of the intersection of x²+y³+z⁵=0 and x⁴+y²=1.^[2]

Boundaries

A triangular list alone is not enough. One regular component is not necessarily the entire solution, and deferred boundary cases are not yet analyzed. A triangular chain and its parameter conditions describe the solutions; they do not by themselves specify an operation that eliminates variables.^[1]

Neighborhood in Abstraction Space

Regular semi-algebraic system sits in a sparse region of the domain-specific corpus (91^st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2835 abstractions)

Nearest neighbors

• Exponential polynomial — 0.80
• N-Square Identity — 0.79
• Freiling's Axiom of Symmetry — 0.78
• Daniell Integral — 0.78
• Étale morphism — 0.78

Computed from structural-signature embeddings · 2026-10-31

References

[1] Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia and Rong Xiao, “Triangular Decomposition of Semi-algebraic Systems”, 2010, definitions and cubic example pp. 1–2; directly inspected PDF text extraction. registry ↩a ↩b ↩c ↩d

[2] Changbo Chen, Solving Polynomial Systems via Triangular Decomposition, 2011, Example 8.1 printed p. 130, cubic example pp. 132–133; directly inspected PDF text extraction; equation typography not visually verified. registry ↩a ↩b