Trees and spectra of Heyting algebras

TL;DR

This paper characterizes Esakia representable posets, especially root systems and well-ordered forests, using order-theoretic conditions, advancing understanding of their spectra in Heyting algebras and rings.

Contribution

It provides a new order-theoretic characterization of Esakia representable root systems and well-ordered forests, strengthening previous results and addressing an open problem from 1985.

Findings

Root systems are Esakia representable if they have enough gaps and each chain has an infimum.

Well-ordered forests are Esakia representable if they have enough gaps and each chain has a supremum.

The characterization links Esakia representability to simple order-theoretic conditions.

Abstract

A poset is Esakia representable when it is isomorphic to the prime spectrum of a Heyting algebra. Notably, every Esakia representable poset is also the spectrum of a commutative ring with unit. The problem of describing the Esakia representable posets was raised in 1985 and remains open to this day. We recall that a forest is a disjoint union of trees and that a root system is the order dual of a forest. It is shown that a root system is Esakia representable if and only if it satisfies a simple order theoretic condition, known as "having enough gaps", and each of its nonempty chains has an infimum. This strengthens Lewis's characterisation of the root systems which are spectra of commutative rings with unit. While a similar characterisation of arbitrary Esakia representable forests seems currently out of reach, we show that a well-ordered forest is Esakia representable if and only if it has enough gaps and each of its nonempty chains has a supremum.