Inclusion map¶

The canonical injective function from a subset or subobject into its containing object that sends every element to itself viewed in the larger context.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4987
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Canonical Maps → Mathematics

Core Idea¶

The inclusion map sends x in A to the same x considered as an element of B. The map changes only the declared codomain, embedding the smaller carrier into the larger without altering its elements or internal operations. 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 mathematics. It is canonical embedding determined entirely by a containment relation. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that A is literally identified as a subset or specified subobject of B and the map preserves each element's identity fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Same Crayon, Bigger Box

You have a small box of red crayons, and it sits inside the big crayon box. Each red crayon is still the very same crayon, but now you also say it's in the big box. The inclusion map is just that: same thing, now counted as part of the bigger group.

The Stay-the-Same Map

Suppose set A fits entirely inside set B, like the even numbers inside all whole numbers. The inclusion map is a rule that takes each thing in A and sends it to itself, but now treated as a member of B. It doesn't move, rename or change anything. The only change is that we now call the destination B instead of A. It's the simplest way to place a smaller set inside a bigger one.

Canonical Subset Embedding

A function has a domain (where inputs come from) and a codomain (where outputs are said to land). If A is a subset of B, the inclusion map i: A → B is defined by i(x) = x. It is like the identity function on A, except that its codomain is declared to be B instead of A. It embeds A into B without changing any element or any operations A had. It only makes sense when A really is a subset (or a specified subobject) of B. A map that relabels or transforms elements is a different kind of map, even if it is also one-to-one.

Given A ⊆ B, the inclusion map ι: A → B, ι(x) = x, is the canonical embedding determined entirely by the containment relation. It changes only the declared codomain: elements keep their identity, and when A is a substructure (subgroup, subspace, subspace topology), its internal operations are preserved. Therefore ι is injective and is a homomorphism or continuous map, whichever applies. The concept is narrower than an arbitrary embedding or monomorphism. Those may identify A with a copy inside B through some relabeling, whereas the inclusion map requires A to be literally a subset or a specified subobject of B. Keeping track of the codomain matters, because ι and id_A are different maps despite having the same formula.

Scope of Application¶

Inclusion map belongs to mathematics and is useful where the analyst can specify a subset A of B or subobject, elements of A, ambient object B, function i:A→B, identity-on-elements action, injectivity and structural preservation, then evaluate A is literally identified as a subset or specified subobject of B and the map preserves each element's identity. The scope is broad within that domain but bounded by the need for A is literally identified as a subset or specified subobject of B and the map preserves each element's identity. 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 A is literally identified as a subset or specified subobject of B and the map preserves each element's identity 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 Inclusion map 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 Inclusion map. Inclusion map 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: a subset A of B or subobject, elements of A, ambient object B, function i:A→B, identity-on-elements action, injectivity and structural preservation. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express A is literally identified as a subset or specified subobject of B and the map preserves each element's identity independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of mathematics because they reuse a subset A of B or subobject, elements of A, ambient object B, function i:A→B, identity-on-elements action, injectivity and structural preservation, The map changes only the declared codomain, embedding the smaller carrier into the larger without altering its elements or internal operations., and type the carrier, state every parameter and convention in the definition, test that A is literally identified as a subset or specified subobject of B and the map preserves each element's identity, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Inclusion map Domain-specific

Parents (1) — outgoing typed relations

Inclusion map is a kind of Representation Prime

The map represents a subobject inside its ambient object.

Hierarchy path (1) — routes to 1 parentless root

Inclusion map → is a kind of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

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

Family — Sequences, Mappings & Basepoint Structures (10 abstractions)

Nearest neighbors

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