Simplicial HoTT Extension to CCHM/CHM/HTS Type Systems

An Integrated Approach to Adding Simplicial and Infinity-Categorical Constructs

physical simplicial diagrams and abstract structures

Highlights

Holistic Integration: Seamlessly extend type systems with Simplicial and Infinity-categorical constructs.
Structured Inference Rules: Gradually expand algebraic inference encompassing Group, Monoid, Category, Chain, Ring, and Field.
Built-In Eliminators and Introduction Syntax: Design and incorporate Face, Degeneracies, and Composition as eliminators with a unified introduction rule.

Introduction

The proposal to build a Simplicial Homotopy Type Theory (HoTT) extension into existing type systems such as CCHM, CHM, and HTS represents an ambitious yet transformative endeavor. The goal is to introduce both Simplex and Simplicial types directly into the type checker, and to construct an interoperable foundation that serves as a GAP replacement and supports an infinity-categorical framework, drawing inspiration from the work associated with the Rezk prover and the insights of Riehl and Shulman.

Such an extension would fundamentally enable the modeling of higher-dimensional and homotopy-theoretic phenomena within type theory. This would not only empower researchers by providing a richer language for synthetic ∞-category theory but also streamline the process of formalizing advanced algebraic and categorical structures such as Groups, Monoids, Categories, Chains, Rings, and Fields.

Core Components and Design Principles

1. Fundamental Simplicial and Simplex Types

Central to this extension is the integration of Simplex and Simplicial types as foundational constructs within the type checker. In traditional homotopy type theory, types are interpreted homotopically, and the addition of simplicial structures enables one to capture higher-categorical constructs in a more natural and geometrically meaningful way. The primary tasks include:

Defining the Simplex: A basic simplex form, which acts as the building block for further construction. The simplex encapsulates a standard n-dimensional structure whose faces are recursively defined.
Constructing Simplicial Types: Using extension types, these layers of simplices can be built up so that each dimension retains specific homotopic or combinatorial properties necessary for proving results in synthetic infinity-category theory.

2. Incorporating a GAP Replacement

Historically, systems like GAP (Groups, Algorithms, and Programming) have been pivotal in computational group theory. In the proposed extension, the idea is to incorporate a GAP replacement directly into the type system. This integration promises significant advantages:

Enhanced Computational Capabilities: Algorithms inherent to computational group theory would become first-class citizens, thereby enhancing the type checker's reasoning power over algebraic structures.
Simplified Interface: Integrating computational group operations directly into the type system would reduce the need for external packages or toolkits, streamlining the verification and formalization process.

3. Infinity-Categorical Framework

An essential part of the design is incorporating an infinity-categorical framework reminiscent of the methods utilized by the Rezk prover. This involves:

Segal and Rezk Types: The extension will have the capability to define Segal types that satisfy the unique existence of composites up to homotopy. By enforcing additional completeness conditions, Rezk types model complete Segal spaces, which can serve as the basis for (∞,1)-categories.
Higher Inductive Structures: The type system must support higher inductive types (HITs), allowing simultaneous introduction of points, paths, and higher-dimensional cells.

Eliminators and Introduction Rules

Eliminators: Face, Degeneracies, and Composition

In simplicial homotopy theory, it is vital to have operations that allow for the manipulation of simplicial objects. The proposed eliminators include:

Face Maps

Face maps extract the boundaries of simplicial objects. They serve to capture the notion of "faces" in each simplex, allowing the type-checker to reason about lower-dimensional constructs derived from higher-dimensional ones.

Degeneracies

Degeneracy maps insert redundancies, converting a simplex into a degenerate higher-dimensional simplex. This is crucial for ensuring that repeated vertices or degenerate cases are correctly represented within the type theory.

Composition

Composition permits the coherent gluing together of simplices along shared boundaries. This operation must adhere to strict associativity and identity conditions defined within the homotopy type framework.

Introduction Rule: Simplicial Object Syntax

The introduction rule for defining simplicial objects in the type system leverages the following common syntax:


-- Define a simplicial object with context and conditions
def <name> : <type> := Π (context), conditions ⊢ <n> (elements | constraints)

This syntax enables users to create definitions that encapsulate both the structure and the constraints of a simplicial object. For example, one may define a Möbius strip simplicially as:


def Möbius : Simplex
 := Π (a b c : Simplex),
      (bc ac : Simplex), ab = bc ∘ ac
    ⊢ 2 (a b c | bc ac ab)

This example elucidates a simplicial object where the vertices (a, b, c) and edges (bc, ac) come together under a constraint that forces the composition (ab) to equal the natural composite of the two provided edges, thereby graphically representing a two-dimensional object similar to a Möbius strip.

Extending Type Inference Rules for Algebraic Structures

Algebraic Structures in a Simplicial Framework

A natural progression from simplicial types involves enriching the type inference system to support algebraic structures. Traditional algebraic constructs, when integrated with simplicial objects, benefit from the inherent geometric intuition. The target structures include:

Group: Define groups with standard operations (multiplication, identity, inverse) along with corresponding axioms ensuring closure under these operations.
Monoid: Similar to groups but without the need for inverses, focusing on the associativity and identity elements.
Category: Implement categorical structures where objects and morphisms abide by composition and identity laws, often conceptualized using Segal or Rezk type models.
Chain Complex: Structurally, chains are sequences of objects with boundary maps that satisfy specific conditions (e.g., the composition of consecutive maps being zero).
Ring: Introduce an additional algebraic operation for multiplication combined with the structure of a group (or monoid) for addition, and force adherence to distributivity axioms.
Field: Extend rings with the existence of multiplicative inverses (for non-zero elements) while preserving all other ring properties.

Implementation Strategy for Type Inference

The gradual extension of type inference rules is a multifaceted challenge. It involves:

Stepwise Integration: Begin by defining the basic operations and properties associated with algebraic constructs. Once these are securely implemented, the extension rules can be defined to check and propagate these properties.
Custom Inference Rules: The type checker must be modified to recognize the new inference patterns. For each algebraic structure, specific elimination and introduction rules must be recursively defined.
Modularity and Consistency: Each extension—be it for groups, monoids, or categories—should be modular. The design should allow for separate verification steps that ensure the consistency of the overall type system while integrating new rules.

Table: Mapping Algebraic Structures to Simplicial Inference Rules

Algebraic Structure	Core Operations	Simplicial Integration
Group	Multiplication, Inverse, Identity	Simplicial object with face maps enforcing associativity and identity constraints
Monoid	Multiplication, Identity	Face and degeneracy maps used to guarantee unital and associative composition
Category	Morphisms, Composition, Identity	Segal/Rezk types ensuring uniquely defined composites up to homotopy
Chain Complex	Boundary maps, Differential operations	Simplicial models representing sequences with vanishing composite boundaries
Ring	Addition, Multiplication, Distributivity	Dual simplicial objects capturing both additive and multiplicative structure
Field	Addition, Multiplication, Inverse (non-zero)	Extended ring structure with extra constraints for field axioms via higher-dimensional simplicial eliminators

Each algebraic structure can be encoded as a simplicial object where the operations and axioms are enforced via mapping the standard properties to the corresponding simplicial eliminators such as face maps and composition. These mappings ensure that the inferential process respects both the geometric intuition of the simplicial framework and the algebraic rigor required by the underlying theory.

Integration into the Type Checker and Implementation Challenges

Integrating Core Concepts

The successful integration of Simplicial HoTT into existing type systems requires both theoretical and practical adjustments to the type checker. Among the challenges are:

Extending the Type Checker: The type checker must be enhanced to understand and process the new syntax and constructions. This involves modifying the parser, the inference engine, and the normalization routines to account for the additional dimensions introduced by simplicial objects.
Ensuring Soundness and Consistency: Every new rule—whether it is a face, degeneracy, or composition—must be proved to preserve consistency. The extension should maintain soundness so that every valid derivation in the extended system corresponds to a true homotopical interpretation.
Computational Efficiency: Adding highly nuanced algebraic and categorical constructs may slow down the type inference process. Thus, careful optimization of time-critical portions of the type-checker is necessary, potentially including memoization strategies or optimized evaluation of simplicial eliminators.

Practical Implementation Approaches

Several practical pathways can be taken to implement this complex extension:

Extension of Existing Provers: One approach is to begin with a well-established proof assistant like Agda, Coq, or Anders. By extending the underlying type system with added simplicial and infinity-categorical rules, one leverages established normalization techniques and existing libraries.
Modular Prototyping: Develop a modular prototype where the simplicial core (i.e., Simplex and Simplicial types) is isolated and gradually interconnected with the algebraic extension modules. This provides a controlled environment to benchmark and verify the correctness of each component.
Rigorous Formalization: Prior to full implementation, the theoretical underpinnings—especially those related to the homologous properties of Segal and Rezk types—should be formalized on paper or using a lightweight proof assistant. This reduces the risk of foundational inconsistencies.

Example Walkthrough: Defining and Inferring a Möbius Strip

Let us examine the Möbius strip example more carefully to appreciate its implications within this extension.

The definition given is:


def Möbius : Simplex
 := Π (a b c : Simplex),
      (bc ac : Simplex), ab = bc ∘ ac
    ⊢ 2 (a b c | bc ac ab)

Here, the context introduces simplices a, b, and c as vertices. The next element specifies edges bc and ac with a constraint that the composite edge ab must equal the composition of bc and ac. The numeral “2” indicates that this definition constructs a 2-dimensional simplicial object. Not only does this serve as a vivid illustration of the introduction rule, but it also demonstrates how even topologically nontrivial objects like the Möbius strip can be encoded with simplicial precision. This approach can be generalized to define more sophisticated algebraic and categorical structures.

Conclusion

The development of a Simplicial HoTT extension to existing type systems (CCHM/CHM/HTS) marks a significant step towards integrating higher-dimensional homotopy theory into computational logic frameworks. By introducing Simplex and Simplicial types directly into the type checker and designing robust eliminators (Face, Degeneracies, Composition) paired with a generalized introduction syntax, we create a platform capable of representing complex algebraic and categorical structures in a natural and geometrically intuitive way.

As we extend the type inference rules gradually to encompass Groups, Monoids, Categories, Chains, Rings, and Fields, the system will evolve into an expressive, infinity-categorical framework reminiscent of the Rezk prover. While implementing such a system poses considerable challenges associated with extension, performance, and consistency, the proposed modular and rigorous approaches provide a promising pathway forward.

In conclusion, this integrated extension not only represents a leap forward in type theoretic frameworks but also paves the way for more intuitive and practical formalizations of higher algebraic and topological structures. Researchers and developers alike will find that the rich interplay of simplicial geometry and algebraic inference opens up new frontiers in both mathematics and computer-assisted proof verification.