Identity type¶

A type-theoretic proposition whose inhabitants witness equality between two terms of a type.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4959
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Type Theory → Mathematics

Core Idea¶

For a,b:A, the identity type Id_A(a,b) is generated by reflexivity and eliminated by path induction, distinguishing propositional equality from judgmental definitional equality. Equality evidence becomes first-class and supports substitution; in homotopy type theory its terms behave as paths with higher identities between proofs. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of type theory. It is the domain-specific identity determined by the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules.

How would you explain it like I'm…

No faithful explanation at this level. At this level, equality can only come across as a yes/no check of whether two things are the same. That hides the central idea: a proof of equality is itself a built object, generated by reflexivity and possibly one of many distinct proofs, and it is different from sameness by definition.

Proof-That-They're-Equal Box

In a kind of math called type theory, everything belongs to a 'type,' a bit like a category. If a and b are two things of the same type, the identity type is the collection of proofs that a equals b. Here, a proof of equality is itself something you can hold and use. For example, it lets you swap a for b inside other statements. The most basic proof is the one that says anything equals itself. Every other use of equality is built from that starting point.

Equality as Provable Paths

In type theory, for two terms a and b of the same type A, the identity type Id_A(a, b) is the type whose elements are proofs that a equals b. It is built from one basic rule, reflexivity: every a has a proof that a equals a. It is used through a rule called path induction, which lets you reason about any equality proof by handling the reflexivity case. This makes equality 'first-class.' Proofs of equality are objects you can pass around and use for substitution. This propositional equality differs from judgmental (definitional) equality. Judgmental equality means two expressions are the same simply by definition or computation and needs no proof. In homotopy type theory, these equality proofs behave like paths between points, and there can even be paths between paths.

Given a type A and terms a, b : A, the identity type Id_A(a,b) is the type of evidence that a and b are equal. Its introduction rule is reflexivity, refl_a : Id_A(a,a), and its elimination rule is path induction (the J rule), which reduces proving a property of all equality proofs to proving it for refl. This makes propositional equality, an internal type with first-class proof terms, distinct from judgmental or definitional equality, which holds by computation outside the type system. Because equality proofs are terms, they support substitution: transporting a property from a to b along a proof. In homotopy type theory, terms of identity types are interpreted as paths, and identities between such proofs form higher paths. The concept requires both terms to share the same carrier type and the rules to follow the declared identity-type formation, introduction, and elimination.

Scope of Application¶

Identity type belongs to type theory and is useful where the analyst can specify the typed type theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets, then evaluate the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules. The scope is broad within that domain but bounded by the need for the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Identity type can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Identity type. Identity type compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed type theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of type theory because they reuse the typed type theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets, Equality evidence becomes first-class and supports substitution; in homotopy type theory its terms behave as paths with higher identities between proofs., and type the carrier, state every parameter and convention in the definition, test that the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Identity type Domain-specific

Parents (1) — outgoing typed relations

Identity type is a kind of Equivalence Relation Prime

What makes it its own entry: the domain-specific identity determined by the type is formed over two terms of the same carrier type and its introduction and elimination follow the declared identity-type rules.

Hierarchy path (1) — routes to 1 parentless root

Identity type → is a kind of Equivalence Relation

Neighborhood in Abstraction Space¶

Identity type sits in a crowded region of the domain-specific corpus (2^nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Order, Type & Classification Foundations (49 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25