Rieg theory
hora
Semirings with exponentiation, connecting arithmetic, logic, and categorical counting.
Goal
Develop a coherent theory of semirings with exponentiation and use it to connect finite and profinite arithmetic, logic, enumerative combinatorics, and category theory.
Background
A rieg is a commutative semiring equipped with exponentiation satisfying the usual exponent laws, including and hence . This project studies the structure itself and the examples it connects.
The research programme is described in note 7. The current questions concern the subrieg generated by nonnegative rationals, game interpretations of the free rieg, functions represented by unary rieg terms, and finite-valued presheaf categories.
One concrete result narrows the topological problem: a compact Hausdorff topological rieg with cancellative addition is trivial. The question whether a nontrivial connected compact Hausdorff rieg exists therefore reduces to the noncancellative case, where it has a positive answer.
For finite-valued presheaves, essentially finite slices give a sufficient condition for a topos. A partial answer proposes an exact criterion stated in terms of finite presheaves. The right Kan extension approach is absorbed into that note, with the coreflection onto locally finite presheaves as its comonad.
The next step is concrete: give a criterion for finite presheaf topoi in terms of the indexing category alone.
1. Rational subrieg of [0,∞)
Question
What is the subrieg of generated by , with ordinary exponentiation and ? Which equations hold between its expressions? Is the canonical map from the rieg freely generated by the rig injective?
First distinction
The nonnegative rationals themselves are not closed under exponentiation: is already irrational. The question concerns the closure under all rieg operations and the relations in that closure.
Next step
State the universal property of the rieg generated by the rig , then write its canonical evaluation map into . To prove a relation is additional, exhibit two terms with the same real value and prove that their equality does not follow from the rieg axioms and the specified rational rig relations. Merely finding two equal real expressions does not establish this.
2. Connected compact Hausdorff riegs
Resolved
Yes. Every De Morgan algebra is a rieg with , and : the laws , , , , and follow from distributivity and , , , . For a Boolean algebra this is the rieg of Notes on Rieg Theory, Example 5.0.2 and Proposition 5.3.1. In particular with , and is a nontrivial connected compact Hausdorff topological rieg; all three operations are continuous. Its addition is idempotent, hence not cancellative, as Compact riegs with cancellative addition are trivial requires of every example. Not yet verified by a human.
Question
Does a nontrivial connected compact Hausdorff topological rieg exist? All three binary operations—addition, multiplication, and exponentiation—are required to be continuous.
Current result
Compact rieg no-go proves that every compact Hausdorff topological rieg with cancellative addition is trivial. Connectedness is not needed for that result. Thus a positive answer must have noncancellative addition; the general existence question remains open here.
The original motivation compares connected topological algebra with profinite algebra. A path-connected topological rig is contractible: a path from to gives . This observation concerns path-connectedness and does not by itself settle the connected compact case.
Next step
Choose a compact connected noncancellative topological semiring and test whether it admits a jointly continuous exponentiation satisfying all the rieg equations, especially , , and . Failure of a particular candidate is not a general nonexistence theorem.
Source
3. Free rieg elements as games
Question
Let be the free rieg on one generator . Can its elements be interpreted as combinatorial games? Can the unique rieg homomorphism
be interpreted in terms of those games?
What an answer must provide
Specify the games and their equality, interpret , and exponentiation, and show that the rieg equations hold. A full model of must also identify when two game expressions represent the same element; a map out of alone need not be injective.
Next step
Give a concrete candidate for exponentiation of games, then test the exponent laws and the evaluation . The existing recursive-coalgebra model of impartial games does not by itself supply these rieg operations.
Sources: original problem 7.0.1; Classical vs quantum computation.
4. Functions ℕ→ℕ from F1
Answer proposed
Partial answer to the second task. (a) Equality of the functions on is decidable. For every subterm is either identically or , and which case occurs is read off from the term; rewriting from the inside out by , , and for turns a term, without changing its values at , into or into a term without . Two -free terms agree on exactly when the one-variable identity holds in , which is decidable (Richardson, Z. Math. Logik Grundlagen Math. 15 (1969); see Burris–Yeats, The saga of the high school identities, Algebra Universalis 52, §3), and the values at are computed directly. (b) The evaluation is not injective: and define the same function, but in the three-element rieg with , and (one of the four exponentiations on the three-element chain in Notes on Rieg Theory, Appendix B.2, Figure 8; see also Connected compact Hausdorff riegs) the term takes the value at . Without the analogous question is Tarski's high school algebra problem (Wilkie; Gurevič). The first task, a characterization of the functions, remains open; on the one-variable term functions without form Skolem's class, which is well ordered by eventual domination (Ehrenfeucht, Algebra Universalis 3 (1973)). Not yet verified by a human.
Question
Which functions can be represented by a term in the free rieg on one generator?
Here a term is built from using addition, multiplication, and binary exponentiation. Evaluating in the natural-number rieg gives its function, with .
Two distinct tasks
- Characterize the functions obtained by this evaluation.
- Determine when two terms give the same function on .
The second question must distinguish equality of functions on this particular rieg from equality forced by the axioms in the free rieg.
Next step
Identify a property shared by all representable functions and prove it by induction on terms, or exhibit a function together with a rigorous nonrepresentability argument. A table of small inputs alone cannot establish representability or equality for all natural numbers.
5. Finite presheaf topoi
Answer proposed
Partial answer. For a presheaf let consist of the elements that generate a finite-valued subpresheaf; is the left exact coreflection onto locally finite presheaves (for a free monoid it is of Hora, Topoi of automata I, arXiv:2411.06358, Lemma 2.20). Every map from a finite presheaf into lands in , and a finite presheaf representing on is necessarily . Hence: (1) With and computed in all presheaves, has a subobject classifier iff is finite-valued, and has an exponential of by iff is finite-valued; these are then the universal objects. (2) It is a topos iff for every object and finite only finitely many have, for every , finitely many pullbacks along . (3) If all hom-sets are finite, it is a topos iff every finite presheaf on each slice has finitely many subpresheaves. Essentially finite slices are not necessary: for an infinite group and , is a topos ( has three right ideals and has at most elements), although in . A subobject classifier is not enough: on nonempty finite sets is finite-valued, but the presheaf of equivalence relations has the subpresheaves “at most classes” for all , so it has no power object. For the monoid there is no subobject classifier, since every ideal lies in (nor is it cartesian closed: Notes on Rieg Theory, Example 4.1.8). Open: a criterion in terms of alone, local cartesian closedness, and whether for finite hom-sets the condition in (3) forces essentially finite slices. Not yet verified by a human.
Question
For a small category , when is the category
of pointwise finite-valued presheaves an elementary topos, or locally cartesian closed?
The motivation is enumerative combinatorics and Burnside riegs. This question was discussed with Jérémie Marquès.
Known sufficient condition
Finite limits are computed pointwise. If every slice is essentially finite, then the usual presheaf subobject classifier and exponentials are finite-valued, so is an elementary topos. This includes finite categories and groups regarded as one-object categories.
Here are the two relevant ambient formulas. The value is the set of sieves on , so the ambient classifier is finite-valued exactly when there are finitely many sieves on each object. For finite-valued ,
so the ambient exponential is finite-valued exactly when these sets are finite for every .
These criteria describe when the ambient constructions stay in the finite-valued subcategory. They are not, without an additional argument, a necessary-and-sufficient classification of when that subcategory has its own classifier and exponentials.
Remaining question and next step
Find a general criterion beyond essentially finite slices. For a proposed criterion, distinguish closure under the ambient presheaf constructions from existence of the required universal objects inside the finite-valued category.
Note 8 records the right Kan extension approach. Its first missing ingredient is the precise adjunction or comonad that would implement the reduction.
Source
6. Higgs Prime conjecture
The earlier problem list records the name “Higgs Prime conjecture” but does not state the conjecture. No precise claim or proof is specified here.
The next step is to recover the intended statement and its connection to riegs from the original source before using this item as a research problem or a result.
Sources: original problem 7.0.4; Higgs prime. The latter identifies the terminology, not the missing conjecture.
7. Rieg theory: the research programme
The aim is to develop the theory of semirings with exponentiation across four subjects: logic, finite and profinite arithmetic, enumerative combinatorics, and category theory.
The central object is a rieg: a commutative semiring with an exponentiation operation satisfying the exponent laws, with the convention .
The concrete questions in this project are:
- Rational subrieg of the nonnegative reals: determine the relations introduced by exponentiation.
- Free rieg elements as games: find a game interpretation compatible with the rieg operations and evaluation at zero.
- Unary functions represented by terms: characterize the functions on natural numbers obtained from a free rieg.
- Connected compact Hausdorff riegs: answered positively by the unit interval with , and ; by the compact no-go theorem every example has noncancellative addition.
- Finite-valued presheaf categories: identify when categorical counting has the topos structure motivating Burnside riegs.
The target is a single mathematical account that states the definitions and examples precisely and separates established results from these remaining questions. The proposed title is Notes on Rieg theory: semiring with exponentials in logic, profinite arithmetic, enumerative combinatorics, and category theory.
Connections
- Related to: 1. Rational subrieg of [0,∞)
- Related to: 2. Connected compact Hausdorff riegs
- Related to: 3. Free rieg elements as games
- Related to: 4. Functions ℕ→ℕ from F1
- Related to: 5. Finite presheaf topoi
- Related to: 6. Higgs Prime conjecture
8. A right Kan extension approach to finite presheaves
Retired
Absorbed into Finite presheaf topoi. The left exact comonad can be taken to be , the coreflection onto locally finite presheaves (elements generating finite-valued subpresheaves). Every map from a finite presheaf factors through it, so the subobject classifier and the exponentials of , when they exist, are and ; the resulting criterion is in the resolution of that note. Not yet verified by a human.
Aim
Find a criterion for to be an elementary topos or locally cartesian closed, as asked in Finite presheaf topoi.
Proposed approach
Use a left-exact comonad to reduce the question to existence of suitable right Kan extensions. The motivating idea is to understand which indexing categories have limits for every finite-set-valued diagram, then impose corresponding conditions on comma categories.
This is an approach to formulate, not an established reduction. A particular comonad and adjunction have not yet been specified. In particular, no right adjoint to the inclusion of finite-valued presheaves into all presheaves is assumed here.
Next step
Specify the categories, functors, and adjunction involved. Write the proposed right Kan extension pointwise as a limit, then prove both its finiteness and the implication for exponentials or the subobject classifier. Compare the resulting condition with the existing sufficient condition that every slice is essentially finite.
The underlying finite-presheaf question was discussed with Jérémie Marquès.
Connections
- Builds on: 5. Finite presheaf topoi
- Related to: 7. Rieg theory: the research programme
9. Compact riegs with cancellative addition are trivial
Theorem
Let be a compact Hausdorff topological rieg. If its additive commutative monoid is cancellative, then has one element. Connectedness is not required.
Lemma
Every compact Hausdorff commutative cancellative topological monoid is a group.
Proof. First, every nonempty compact Hausdorff commutative topological semigroup has an idempotent. By compactness and Zorn's lemma, choose a minimal nonempty closed subsemigroup . For , the set is a nonempty closed subsemigroup (using commutativity), hence equals . Thus
is a nonempty closed subsemigroup and equals . In particular, .
For , the closure of is a compact commutative subsemigroup and contains an idempotent . Cancellativity applied to gives . Choose a net . A subnet of converges to some , and continuity gives . Every element therefore has an additive inverse.
Proof of the theorem
The lemma gives an additive inverse of , and a rieg containing an additive inverse of is degenerate (Notes on Rieg Theory, Claim 2.3.1: ).
What remains
This settles the cancellative case of the connected compact Hausdorff problem. The noncancellative case has a positive answer: the unit interval with , and is a nontrivial connected compact Hausdorff rieg (Connected compact Hausdorff riegs).
Connections
- Builds on: 2. Connected compact Hausdorff riegs
- Builds on: 7. Rieg theory: the research programme