Cherlin–Zilber algebraicity conjecture

A group describes reversible operations and how they combine. An operation such as changing a coordinate from x to 2x+3 can be undone; this is a toy illustration of a group operation, not an example satisfying the conjecture. The question concerns infinite simple groups: groups with no smaller nontrivial normal subgroup to separate out. If their definable sets have a finite logical dimension, must these groups come from polynomial geometry? A line and a plane over the complex numbers illustrate one and two dimensions; finite dimension does not mean finitely many points.[1] [2]

An infinite collection of reversible operations may be described by logical formulas rather than by matrices or coordinates. The question is whether a finite dimension for its definable sets forces a simple group to have a polynomial-geometric description. The dimension condition is called finite Morley rank; it does not bound the number of group elements. For a concrete model of this dimension, the complex plane has infinitely many disjoint vertical lines, while each line has infinitely many points. In algebraically closed fields, Morley rank agrees with algebraic dimension.

Precisely, for an infinite simple group G of finite Morley rank, seek an algebraically closed field K and a simple algebraic group H with $G\cong H(K)$. An algebraic group has a space of points defined by polynomial equations, with multiplication and inversion given by algebraic maps. The conjecture asks for an isomorphism of groups; a finite simple group or an exotic infinite group lacking finite Morley rank does not meet its hypotheses.[1] [2]

Small logical dimensions are understood. At higher dimensions, mathematicians have not proved that every such group is algebraic. An exotic infinite simple group alone is not enough to disprove the claim: it must also satisfy the finite-dimension requirement.[1] [2]

Known low-rank and even-type cases do not settle the universal statement. Split BN-pairs of Tits rank≥2 lead to established algebraic recognition; rank-one recognition remains a frontier described in the 2026 survey. Non-split sharply 2-transitive constructions need additional finite-rank control before becoming relevant counterexamples.[1] [2]

Logic can describe an infinite collection of symmetries without supplying coordinates or polynomial equations. Geometry gives a different description, in which those equations organize the symmetries. Knowing whether the logical dimension condition always leads to that geometric description would tell us how far these two ways of understanding infinite symmetry agree.[1] [2]

Recovering a field would do more than attach a name to the group: it would provide coordinates and polynomial geometry with which to understand its symmetries. Recognition results using incidence geometry already illustrate this bridge in special classes. The wider issue is whether logical dimension alone warrants that geometric description, or whether genuinely different infinite simple symmetries can obey the same finite-rank constraint.[1] [2]