Constructive higher sheaf models with applications to synthetic mathematics
Pith reviewed 2026-05-15 02:59 UTC · model grok-4.3
pith:4D77BGG2 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{4D77BGG2}
Prints a linked pith:4D77BGG2 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
The pith
Higher sheaf models of type theory with univalence and higher inductive types can be built in a constructive metatheory.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
There have recently been several developments in synthetic mathematics using extensions of dependent type theory with univalence and higher inductive types: simplicial homotopy type theory, synthetic algebraic geometry and synthetic Stone duality. We provide a foundation of higher sheaf models of type theory in a constructive metatheory and, in particular, build constructive models of these formal systems.
What carries the argument
Constructive higher sheaf models for dependent type theory extended by univalence and higher inductive types.
If this is right
- Synthetic algebraic geometry acquires a constructive model.
- Simplicial homotopy type theory can be interpreted without classical logic.
- Synthetic Stone duality receives a constructive sheaf-theoretic semantics.
- Other synthetic developments built on univalent type theory become available inside constructive foundations.
Where Pith is reading between the lines
- The models may support program extraction or computational content from synthetic proofs.
- The same technique could be applied to further extensions of type theory beyond those listed.
- These constructions give an explicit bridge from synthetic mathematics to ordinary constructive set theory.
Load-bearing premise
Higher sheaf models satisfying univalence and higher inductive types can be assembled using only constructive methods in the metatheory.
What would settle it
A specific construction of a simplicial homotopy type theory model whose internal logic is shown to require the law of excluded middle or a choice principle would refute the central claim.
read the original abstract
There have recently been several developments in synthetic mathematics using extensions of dependent type theory with univalence and higher inductive types: simplicial homotopy type theory, synthetic algebraic geometry and synthetic Stone duality. We provide a foundation of higher sheaf models of type theory in a constructive metatheory and, in particular, build constructive models of these formal systems.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to provide a foundation of higher sheaf models of type theory in a constructive metatheory, and in particular to build constructive models of formal systems extending dependent type theory with univalence and higher inductive types, with applications to simplicial homotopy type theory, synthetic algebraic geometry, and synthetic Stone duality.
Significance. If the constructions are correct, the work supplies a direct constructive foundation for these synthetic developments rather than a reduction to classical set theory. This strengthens the metatheoretic justification for univalent type theory with HITs in sheaf models and supports the reliability of synthetic proofs in the cited areas.
minor comments (2)
- [Abstract] The abstract states the existence of the constructions but does not name the precise constructive metatheory (e.g., which variant of Martin-Löf type theory or set theory is used as the ambient theory); adding this would clarify the scope of constructivity.
- Notation for the higher sheaf toposes and the interpretation of univalence/HITs is introduced without a dedicated preliminary section; a short table or diagram summarizing the key functors and their constructivity properties would improve readability.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our work on constructive higher sheaf models and the recommendation for minor revision. No specific major comments were raised in the report, so we have no point-by-point responses to provide at this stage. We will incorporate any minor suggestions during the revision process to strengthen the presentation of the constructive metatheory and its applications to synthetic mathematics.
Circularity Check
No significant circularity
full rationale
The paper constructs higher sheaf models of type theory directly from a constructive metatheory, providing foundations for extensions with univalence and higher inductive types. No load-bearing step reduces by definition, fitted parameter, or self-citation chain to the inputs; the models are built explicitly against external type-theoretic benchmarks without renaming known results or smuggling ansatzes. The derivation chain is self-contained and independent.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Dependent type theory extended with univalence and higher inductive types
- domain assumption Constructive metatheory
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We provide a foundation of higher sheaf models of type theory in a constructive metatheory... using lex modalities... cobar modality... descent data operation D
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
construct models of HoTT... supporting higher inductive types... Blechschmidt’s duality axiom
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.