How Are Synthetic Algebraic Geometry Worlds Built?

Imagine you want to draw a map of a universe where algebraic equations behave like objects in a video game: you can move them, combine them, and instantly check if two structures are equal. This is the essence of "synthetic algebraic geometry," a more abstract and logical version of traditional algebraic geometry.

A team of researchers discovered how to build real models of this universe using rings (the number systems we work with) that have a special property: for every finitely presented algebra over them, you can decide whether two elements are equal. In practice, it’s like having an algorithm that tells you right away if two puzzles are identical.

The construction takes place in a very weak "meta-theory," similar to the one used in dependent type programming languages such as Coq. This meta-theory has the same proof‑theoretic strength as dependent type theory with universes, so it’s powerful enough for complex concepts while staying constructive: every step comes with a method to actually build the object.

The outcome is a model where algebraic structures can be manipulated computationally, opening the door to new computer‑assisted proofs and a deeper grasp of the links between algebra and logic. It’s a significant stride toward a more interactive mathematics, where abstract ideas become concrete operations we can program and verify.

The work fits within the framework of Synthetic Algebraic Geometry (SAG), a discipline that merges model theory with classical algebraic geometry. In SAG, varieties are treated as dependent types, and geometric properties are expressed as logical propositions.

The paper's pivotal contribution is the construction of SAG models over rings k where every finitely presented k‑algebra has decidable equality. This condition holds, for instance, for Noetherian rings of finite type over a computable field, where a finite presentation reduces equality to solving polynomial systems.

The adopted meta‑theory is a variant of dependent type theory with universes, but without choice or impredicative axioms. This ensures all constructions are computable: each object defined in the model comes with a construction algorithm. The approach aligns with the Univalent Foundations program, where mathematical structures are identified via homotopic equivalences.

The construction defines an internal category of finitely presented k‑algebras equipped with an interpretation functor that assigns to each algebra its synthetic spectrum. Decidable equality enables the definition of an “identity” functor that is strictly monomorphic, guaranteeing that type identities coincide with computational equalities.

Finally, the paper proves that the resulting model satisfies the SAG axioms, including gluing and descent principles, and that classical geometric theories (such as the theory of Schemes) can be interpreted within this synthetic setting. This paves the way for a computer‑formalized algebraic geometry, with potential applications in proof assistants and formal verification of complex algebraic results.