{ "format": "sumire-research-record", "version": 1, "exportedAt": "2026-11-04T08:11:13.800Z", "scope": "Reader-visible project fields and native live notes only; referenced notes in other projects, deleted notes and private AI context are excluded.", "submission": "not_submitted", "mathematicalCorrespondence": "not_automatically_checked", "project": { "id": "2609.00007", "url": "https://sumire.aiformath.jp/p/2609.00007", "title": "Rieg theory", "tagline": "Semirings with exponentiation, connecting arithmetic, logic, and categorical counting.", "visibility": "public", "owner": { "name": "hora", "handle": "ryuya" }, "origin": "", "source": "kobin:u_EMlmNonOMJFd:slogan:riegs", "goal": "Develop a coherent theory of semirings with exponentiation and use it to connect finite and profinite arithmetic, logic, enumerative combinatorics, and category theory.", "narrative": "A rieg is a commutative semiring equipped with exponentiation satisfying the usual exponent laws, including \\(x^0=1\\) and hence \\(0^0=1\\). This project studies the structure itself and the examples it connects.\n\nThe research programme is described in [note 7](https://sumire.aiformath.jp/p/2609.00007/n/7). The current questions concern [the subrieg generated by nonnegative rationals](https://sumire.aiformath.jp/p/2609.00007/n/1), [game interpretations of the free rieg](https://sumire.aiformath.jp/p/2609.00007/n/3), [functions represented by unary rieg terms](https://sumire.aiformath.jp/p/2609.00007/n/4), and [finite-valued presheaf categories](https://sumire.aiformath.jp/p/2609.00007/n/5).\n\nOne concrete result narrows the topological problem: [a compact Hausdorff topological rieg with cancellative addition is trivial](https://sumire.aiformath.jp/p/2609.00007/n/9). The question [whether a nontrivial connected compact Hausdorff rieg exists](https://sumire.aiformath.jp/p/2609.00007/n/2) therefore reduces to the noncancellative case, where it has a positive answer.\n\nFor finite-valued presheaves, essentially finite slices give a sufficient condition for a topos. [A partial answer](https://sumire.aiformath.jp/p/2609.00007/n/5) proposes an exact criterion stated in terms of finite presheaves. [The right Kan extension approach](https://sumire.aiformath.jp/p/2609.00007/n/8) is absorbed into that note, with the coreflection \\(X\\mapsto X_{\\mathrm{fin}}\\) onto locally finite presheaves as its comonad.\n\nThe next step is concrete: give a criterion for finite presheaf topoi in terms of the indexing category alone.", "history": "", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:34:57.980Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:34:57.980Z" }, "goals": [], "goalDependencies": [] }, "notes": [ { "id": "n_DxF4D4FsMY2k", "number": 1, "url": "https://sumire.aiformath.jp/p/2609.00007/n/1", "title": "Rational subrieg of [0,∞)", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:dntdvh", "body": "## Question\n\nWhat is the subrieg of \\([0,\\infty)\\) generated by \\(\\mathbb Q_{\\geq0}\\), with ordinary exponentiation and \\(0^0=1\\)? Which equations hold between its expressions? Is the canonical map from the rieg freely generated by the rig \\(\\mathbb Q_{\\geq0}\\) injective?\n\n## First distinction\n\nThe nonnegative rationals themselves are not closed under exponentiation: \\(2^{1/2}\\) is already irrational. The question concerns the closure under all rieg operations and the relations in that closure.\n\n## Next step\n\nState the universal property of the rieg generated by the rig \\(\\mathbb Q_{\\geq0}\\), then write its canonical evaluation map into \\([0,\\infty)\\). 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.\n\n[Original problem 7.0.3](https://github.com/hora-algebra/ryuya-hora-homepage/blob/1b8b74c2b3447bdc744a0cac256c5d5806588adc/scripts/site.js#L974-L984).", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T04:48:11.666Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T04:48:11.666Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "open-questions", "problemState": "open", "resolution": "", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_zpg854Oo6Xx_", "number": 2, "url": "https://sumire.aiformath.jp/p/2609.00007/n/2", "title": "Connected compact Hausdorff riegs", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:dyu9gy", "body": "## Question\n\nDoes a nontrivial connected compact Hausdorff topological rieg exist? All three binary operations—addition, multiplication, and exponentiation—are required to be continuous.\n\n## Current result\n\n[Compact rieg no-go](https://sumire.aiformath.jp/p/2609.00007/n/9) 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.\n\nThe original motivation compares connected topological algebra with profinite algebra. A path-connected topological rig is contractible: a path \\(p\\) from \\(0\\) to \\(1\\) gives \\(H(t,x)=p(t)x\\). This observation concerns path-connectedness and does not by itself settle the connected compact case.\n\n## Next step\n\nChoose a compact connected noncancellative topological semiring and test whether it admits a jointly continuous exponentiation satisfying all the rieg equations, especially \\(x^0=1\\), \\(x^1=x\\), and \\(x^{y+z}=x^yx^z\\). Failure of a particular candidate is not a general nonexistence theorem.\n\n## Source\n\n[Original problem 7.0.5](https://github.com/hora-algebra/ryuya-hora-homepage/blob/1b8b74c2b3447bdc744a0cac256c5d5806588adc/scripts/site.js#L996-L1017).", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:29:31.307Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:29:31.307Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "open-questions", "problemState": "solved", "resolution": "Yes. Every De Morgan algebra \\((A,\\vee,\\wedge,0,1,\\neg)\\) is a rieg with \\(x+y=x\\vee y\\), \\(xy=x\\wedge y\\) and \\(x^y=x\\vee\\neg y\\): the laws \\(x^0=1\\), \\(x^1=x\\), \\(1^x=1\\), \\(x^{y+z}=x^yx^z\\), \\((xy)^z=x^zy^z\\) and \\((x^y)^z=x^{yz}\\) follow from distributivity and \\(\\neg0=1\\), \\(\\neg1=0\\), \\(\\neg(y\\vee z)=\\neg y\\wedge\\neg z\\), \\(\\neg(y\\wedge z)=\\neg y\\vee\\neg z\\). For a Boolean algebra this is the rieg \\(x^y=(y\\Rightarrow x)\\) of [Notes on Rieg Theory](https://sumire.aiformath.jp/p/2609.00007?view=main), Example 5.0.2 and Proposition 5.3.1. In particular \\([0,1]\\) with \\(\\max\\), \\(\\min\\) and \\(x^y=\\max(x,1-y)\\) is a nontrivial connected compact Hausdorff topological rieg; all three operations are continuous. Its addition is idempotent, hence not cancellative, as [[2609.00007/9]] requires of every example. Not yet verified by a human.", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_njMFOHxv3Ybo", "number": 3, "url": "https://sumire.aiformath.jp/p/2609.00007/n/3", "title": "Free rieg elements as games", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:kvbsp5", "body": "## Question\n\nLet \\(F_1\\) be the free rieg on one generator \\(x\\). Can its elements be interpreted as combinatorial games? Can the unique rieg homomorphism\n\\[\nF_1\\longrightarrow\\mathbb N,\\qquad x\\longmapsto0\n\\]\nbe interpreted in terms of those games?\n\n## What an answer must provide\n\nSpecify the games and their equality, interpret \\(0,1,+,\\times\\), and exponentiation, and show that the rieg equations hold. A full model of \\(F_1\\) must also identify when two game expressions represent the same element; a map out of \\(F_1\\) alone need not be injective.\n\n## Next step\n\nGive a concrete candidate for exponentiation of games, then test the exponent laws and the evaluation \\(x\\mapsto0\\). The existing recursive-coalgebra model of impartial games does not by itself supply these rieg operations.\n\nSources: [original problem 7.0.1](https://github.com/hora-algebra/ryuya-hora-homepage/blob/1b8b74c2b3447bdc744a0cac256c5d5806588adc/scripts/site.js#L953-L962); [Classical vs quantum computation](https://golem.ph.utexas.edu/category/2006/10/classical_vs_quantum_computati_3.html).", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T04:48:13.344Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T04:48:13.344Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "open-questions", "problemState": "open", "resolution": "", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_ZNzJjsDrnFEf", "number": 4, "url": "https://sumire.aiformath.jp/p/2609.00007/n/4", "title": "Functions ℕ→ℕ from F1", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:pcaa53", "body": "## Question\n\nWhich functions \\(\\mathbb N\\to\\mathbb N\\) can be represented by a term in the free rieg \\(F_1\\) on one generator?\n\nHere a term is built from \\(0,1,x\\) using addition, multiplication, and binary exponentiation. Evaluating \\(x=n\\) in the natural-number rieg gives its function, with \\(0^0=1\\).\n\n## Two distinct tasks\n\n1. Characterize the functions obtained by this evaluation.\n2. Determine when two terms give the same function on \\(\\mathbb N\\).\n\nThe second question must distinguish equality of functions on this particular rieg from equality forced by the axioms in the free rieg.\n\n## Next step\n\nIdentify 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.\n\n[Original problem 7.0.2](https://github.com/hora-algebra/ryuya-hora-homepage/blob/1b8b74c2b3447bdc744a0cac256c5d5806588adc/scripts/site.js#L964-L972).", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:29:32.517Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:29:32.517Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "open-questions", "problemState": "answer-proposed", "resolution": "Partial answer to the second task. (a) Equality of the functions on \\(\\mathbb N\\) is decidable. For \\(x\\geq1\\) every subterm is either identically \\(0\\) or \\(\\geq1\\), and which case occurs is read off from the term; rewriting from the inside out by \\(u+0\\mapsto u\\), \\(u\\cdot0\\mapsto0\\), \\(u^0\\mapsto1\\) and \\(0^v\\mapsto0\\) for \\(v\\neq0\\) turns a term, without changing its values at \\(x\\geq1\\), into \\(0\\) or into a term without \\(0\\). Two \\(0\\)-free terms agree on \\(\\mathbb N_{>0}\\) exactly when the one-variable identity holds in \\((\\mathbb N_{>0},+,\\cdot,\\uparrow,1)\\), 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 \\(x=0\\) are computed directly. (b) The evaluation \\(F_1\\to\\mathbb N^{\\mathbb N}\\) is not injective: \\(x\\cdot0^x\\) and \\(0\\) define the same function, but in the three-element rieg \\(\\{0,\\tfrac12,1\\}\\) with \\(\\max\\), \\(\\min\\) and \\(y^z=\\max(y,1-z)\\) (one of the four exponentiations on the three-element chain in [Notes on Rieg Theory](https://sumire.aiformath.jp/p/2609.00007?view=main), Appendix B.2, Figure 8; see also [[2609.00007/2]]) the term \\(x\\cdot0^x\\) takes the value \\(\\tfrac12\\) at \\(x=\\tfrac12\\). Without \\(0\\) the analogous question is Tarski's high school algebra problem (Wilkie; Gurevič). The first task, a characterization of the functions, remains open; on \\(\\mathbb N_{>0}\\) the one-variable term functions without \\(0\\) form Skolem's class, which is well ordered by eventual domination (Ehrenfeucht, Algebra Universalis 3 (1973)). Not yet verified by a human.", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_pVrpVp9EBz36", "number": 5, "url": "https://sumire.aiformath.jp/p/2609.00007/n/5", "title": "Finite presheaf topoi", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:tk8psy", "body": "## Question\n\nFor a small category \\(\\mathcal C\\), when is the category\n\\[\n\\mathbf{fPSh}(\\mathcal C)=[\\mathcal C^{\\mathrm{op}},\\mathbf{FinSet}]\n\\]\nof pointwise finite-valued presheaves an elementary topos, or locally cartesian closed?\n\nThe motivation is enumerative combinatorics and Burnside riegs. This question was discussed with Jérémie Marquès.\n\n## Known sufficient condition\n\nFinite limits are computed pointwise. If every slice \\(\\mathcal C/c\\) is essentially finite, then the usual presheaf subobject classifier and exponentials are finite-valued, so \\(\\mathbf{fPSh}(\\mathcal C)\\) is an elementary topos. This includes finite categories and groups regarded as one-object categories.\n\nHere are the two relevant ambient formulas. The value \\(\\Omega(c)\\) is the set of sieves on \\(c\\), so the ambient classifier is finite-valued exactly when there are finitely many sieves on each object. For finite-valued \\(F,G\\),\n\\[\n(G^F)(c)=\\operatorname{Nat}(y(c)\\times F,G),\n\\]\nso the ambient exponential is finite-valued exactly when these sets are finite for every \\(c\\).\n\nThese 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.\n\n## Remaining question and next step\n\nFind 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.\n\n[Note 8](https://sumire.aiformath.jp/p/2609.00007/n/8) records the right Kan extension approach. Its first missing ingredient is the precise adjunction or comonad that would implement the reduction.\n\n## Source\n\n[Original problem 6.0.1](https://github.com/hora-algebra/ryuya-hora-homepage/blob/1b8b74c2b3447bdc744a0cac256c5d5806588adc/scripts/site.js#L941-L951).", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:29:33.421Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:29:33.421Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "open-questions", "problemState": "answer-proposed", "resolution": "Partial answer. For a presheaf \\(X\\) let \\(X_{\\mathrm{fin}}\\subseteq X\\) consist of the elements that generate a finite-valued subpresheaf; \\(X\\mapsto X_{\\mathrm{fin}}\\) is the left exact coreflection onto locally finite presheaves (for a free monoid it is \\(h_*\\) of Hora, *Topoi of automata I*, arXiv:2411.06358, Lemma 2.20). Every map from a finite presheaf into \\(X\\) lands in \\(X_{\\mathrm{fin}}\\), and a finite presheaf representing \\(\\operatorname{Hom}(-,X)\\) on \\(\\mathbf{fPSh}(\\mathcal C)\\) is necessarily \\(X_{\\mathrm{fin}}\\). Hence: (1) With \\(\\Omega\\) and \\(G^F\\) computed in all presheaves, \\(\\mathbf{fPSh}(\\mathcal C)\\) has a subobject classifier iff \\(\\Omega_{\\mathrm{fin}}\\) is finite-valued, and has an exponential of \\(G\\) by \\(F\\) iff \\((G^F)_{\\mathrm{fin}}\\) is finite-valued; these are then the universal objects. (2) It is a topos iff for every object \\(c\\) and finite \\(X\\) only finitely many \\(R\\subseteq y(c)\\times X\\) have, for every \\(d\\), finitely many pullbacks \\((f\\times X)^*R\\) along \\(f:d\\to c\\). (3) If all hom-sets are finite, it is a topos iff every finite presheaf on each slice \\(\\mathcal C/c\\) has finitely many subpresheaves. Essentially finite slices are not necessary: for an infinite group \\(G\\) and \\(M=G\\sqcup\\{0\\}\\), \\(\\mathbf{fPSh}(M)\\) is a topos (\\(M\\) has three right ideals and \\(\\operatorname{Sub}(M\\times X)\\) has at most \\(4^{|X|}\\) elements), although \\(\\operatorname{End}(0)=M\\) in \\(M/{\\ast}\\). A subobject classifier is not enough: on nonempty finite sets \\(\\Omega\\) is finite-valued, but the presheaf of equivalence relations has the subpresheaves “at most \\(k\\) classes” for all \\(k\\), so it has no power object. For the monoid \\((\\mathbb N,+)\\) there is no subobject classifier, since every ideal \\(n+\\mathbb N\\) lies in \\(\\Omega_{\\mathrm{fin}}\\) (nor is it cartesian closed: [Notes on Rieg Theory](https://sumire.aiformath.jp/p/2609.00007?view=main), Example 4.1.8). Open: a criterion in terms of \\(\\mathcal C\\) alone, local cartesian closedness, and whether for finite hom-sets the condition in (3) forces essentially finite slices. Not yet verified by a human.", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex, Claude", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_auoCYpMREqUb", "number": 6, "url": "https://sumire.aiformath.jp/p/2609.00007/n/6", "title": "Higgs Prime conjecture", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:v28vby", "body": "The earlier problem list records the name “Higgs Prime conjecture” but does not state the conjecture. No precise claim or proof is specified here.\n\nThe 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.\n\nSources: [original problem 7.0.4](https://github.com/hora-algebra/ryuya-hora-homepage/blob/1b8b74c2b3447bdc744a0cac256c5d5806588adc/scripts/site.js#L986-L994); [Higgs prime](https://en.wikipedia.org/wiki/Higgs_prime). The latter identifies the terminology, not the missing conjecture.", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-18T12:39:38.812Z", "legacyRecordedAt": "2026-03-30T00:00:00.000Z", "legacyUpdatedAt": "2026-10-18T12:39:38.812Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "unassigned", "problemState": "unknown", "resolution": "", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_1Kk7ESJ_I_Ho", "number": 7, "url": "https://sumire.aiformath.jp/p/2609.00007/n/7", "title": "Rieg theory: the research programme", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:suw4hw", "body": "The aim is to develop the theory of semirings with exponentiation across four subjects: logic, finite and profinite arithmetic, enumerative combinatorics, and category theory.\n\nThe central object is a rieg: a commutative semiring with an exponentiation operation satisfying the exponent laws, with the convention \\(0^0=1\\).\n\nThe concrete questions in this project are:\n\n- [Rational subrieg of the nonnegative reals](https://sumire.aiformath.jp/p/2609.00007/n/1): determine the relations introduced by exponentiation.\n- [Free rieg elements as games](https://sumire.aiformath.jp/p/2609.00007/n/3): find a game interpretation compatible with the rieg operations and evaluation at zero.\n- [Unary functions represented by terms](https://sumire.aiformath.jp/p/2609.00007/n/4): characterize the functions on natural numbers obtained from a free rieg.\n- [Connected compact Hausdorff riegs](https://sumire.aiformath.jp/p/2609.00007/n/2): answered positively by the unit interval with \\(\\max\\), \\(\\min\\) and \\(x^y=\\max(x,1-y)\\); by the [compact no-go theorem](https://sumire.aiformath.jp/p/2609.00007/n/9) every example has noncancellative addition.\n- [Finite-valued presheaf categories](https://sumire.aiformath.jp/p/2609.00007/n/5): identify when categorical counting has the topos structure motivating Burnside riegs.\n\nThe 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*.", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:29:34.425Z", "legacyRecordedAt": "2026-07-14T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:29:34.425Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "idea", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "goals", "problemState": "unknown", "resolution": "", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex, Claude", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_y5PlwhcXQ9m1", "number": 8, "url": "https://sumire.aiformath.jp/p/2609.00007/n/8", "title": "A right Kan extension approach to finite presheaves", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:pcsyhq", "body": "## Aim\n\nFind a criterion for \\([\\mathcal C^{\\mathrm{op}},\\mathbf{FinSet}]\\) to be an elementary topos or locally cartesian closed, as asked in [Finite presheaf topoi](https://sumire.aiformath.jp/p/2609.00007/n/5).\n\n## Proposed approach\n\nUse 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.\n\nThis 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.\n\n## Next step\n\nSpecify 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 \\(\\mathcal C/c\\) is essentially finite.\n\nThe underlying finite-presheaf question was discussed with Jérémie Marquès.", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:31:08.017Z", "legacyRecordedAt": "2026-08-16T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:31:08.017Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "conjecture", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "unassigned", "problemState": "withdrawn", "resolution": "Absorbed into [[2609.00007/5]]. The left exact comonad can be taken to be \\(X\\mapsto X_{\\mathrm{fin}}\\), 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 \\(\\mathbf{fPSh}(\\mathcal C)\\), when they exist, are \\(\\Omega_{\\mathrm{fin}}\\) and \\((G^F)_{\\mathrm{fin}}\\); the resulting criterion is in the resolution of that note. Not yet verified by a human.", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "Codex, Claude", "additions": "" }, "originalQuestion": "", "references": [] }, { "id": "n_W9UnCZv-g0q8", "number": 9, "url": "https://sumire.aiformath.jp/p/2609.00007/n/9", "title": "Compact riegs with cancellative addition are trivial", "author": { "name": "hora", "handle": "ryuya" }, "source": "kobin:u_EMlmNonOMJFd:idea:kw5c85", "body": "## Theorem\n\nLet \\(R\\) be a compact Hausdorff topological rieg. If its additive commutative monoid is cancellative, then \\(R\\) has one element. Connectedness is not required.\n\n## Lemma\n\nEvery compact Hausdorff commutative cancellative topological monoid \\((S,+,0)\\) is a group.\n\n**Proof.** First, every nonempty compact Hausdorff commutative topological semigroup has an idempotent. By compactness and Zorn's lemma, choose a minimal nonempty closed subsemigroup \\(K\\). For \\(a\\in K\\), the set \\(a+K\\) is a nonempty closed subsemigroup (using commutativity), hence equals \\(K\\). Thus\n\\[\nE=\\{x\\in K:a+x=a\\}\n\\]\nis a nonempty closed subsemigroup and equals \\(K\\). In particular, \\(a+a=a\\).\n\nFor \\(s\\in S\\), the closure of \\(\\{ns:n\\geq1\\}\\) is a compact commutative subsemigroup and contains an idempotent \\(e\\). Cancellativity applied to \\(e+e=e+0\\) gives \\(e=0\\). Choose a net \\(n_i s\\to0\\). A subnet of \\((n_i-1)s\\) converges to some \\(t\\), and continuity gives \\(s+t=0\\). Every element therefore has an additive inverse. \\(\\square\\)\n\n## Proof of the theorem\n\nThe lemma gives an additive inverse \\(-1\\) of \\(1\\), and a rieg containing an additive inverse of \\(1\\) is degenerate ([Notes on Rieg Theory](https://sumire.aiformath.jp/p/2609.00007?view=main), Claim 2.3.1: \\(1=0^0=0^{1+(-1)}=0^1\\,0^{-1}=0\\)). \\(\\square\\)\n\n## What remains\n\nThis settles the cancellative case of [the connected compact Hausdorff problem](https://sumire.aiformath.jp/p/2609.00007/n/2). The noncancellative case has a positive answer: the unit interval with \\(\\max\\), \\(\\min\\) and \\(x^y=\\max(x,1-y)\\) is a nontrivial connected compact Hausdorff rieg ([[2609.00007/2]]).", "dates": { "inspiration": null, "sourceRecorded": null, "evidence": null, "registeredInSumire": null, "updatedInSumire": "2026-10-30T14:31:08.891Z", "legacyRecordedAt": "2026-08-27T00:00:00.000Z", "legacyUpdatedAt": "2026-10-30T14:31:08.891Z" }, "language": null, "projectLanguage": "ja", "languageSource": "not_recorded", "legacyStage": "proof", "classification": "unclassified", "classificationStatus": "unclassified", "importance": "unspecified", "section": "main", "problemState": "unknown", "resolution": "", "verificationEvidence": { "ai": "", "lean": "", "human": "" }, "aiClaimModel": "", "formalization": "unknown", "humanReview": "unreviewed", "verification": "unverified", "ai": { "use": "assisted", "tools": "ChatGPT, Codex, Claude", "additions": "" }, "originalQuestion": "", "references": [] } ], "noteDependencies": [ { "fromNoteId": "n_1Kk7ESJ_I_Ho", "toNoteId": "n_DxF4D4FsMY2k", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_1Kk7ESJ_I_Ho", "toNoteId": "n_zpg854Oo6Xx_", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_1Kk7ESJ_I_Ho", "toNoteId": "n_njMFOHxv3Ybo", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_1Kk7ESJ_I_Ho", "toNoteId": "n_ZNzJjsDrnFEf", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_1Kk7ESJ_I_Ho", "toNoteId": "n_pVrpVp9EBz36", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_1Kk7ESJ_I_Ho", "toNoteId": "n_auoCYpMREqUb", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_y5PlwhcXQ9m1", "toNoteId": "n_pVrpVp9EBz36", "relation": "builds_on", "status": "unspecified" }, { "fromNoteId": "n_y5PlwhcXQ9m1", "toNoteId": "n_1Kk7ESJ_I_Ho", "relation": "related", "status": "unspecified" }, { "fromNoteId": "n_W9UnCZv-g0q8", "toNoteId": "n_zpg854Oo6Xx_", "relation": "builds_on", "status": "unspecified" }, { "fromNoteId": "n_W9UnCZv-g0q8", "toNoteId": "n_1Kk7ESJ_I_Ho", "relation": "builds_on", "status": "unspecified" } ], "guides": { "arxiv": "https://info.arxiv.org/help/submit/index.html", "formal_conjectures": "https://github.com/google-deepmind/formal-conjectures/blob/main/CONTRIBUTING.md", "mathlib": "https://leanprover-community.github.io/contribute/index.html" }, "search": { "arxiv": "https://arxiv.org/search/", "formal_conjectures": "https://google-deepmind.github.io/formal-conjectures/browse/", "mathlib": "https://leanprover-community.github.io/mathlib4_docs/" } }