Skip to content

Declared Equivalence Mapping

An explicit, authoritative, versioned assertion that two concepts from different vocabularies are interchangeable for stated purposes — collapsing a cross-scheme distinction to zero for consumers who trust the declaration rather than re-verifying at use-time.

Core Idea

A declared equivalence mapping is an explicit, authoritative assertion that two concepts from different controlled vocabularies are interchangeable for stated purposes — the canonical instance being SKOS exactMatch. It is declared (a versioned artifact, not inferred), symmetric, and purpose-bounded (substitutability within a defined context, not ontological identity). Any system respecting it treats the two identifiers as a single atom. Authority is load-bearing: the substitution is valid by the declarer's judgment, making the mapping a governed artifact with an author, purpose, version, and retraction channel.

Scope of Application

It lives across knowledge-organization and interoperability subfields — a governance practice recurring wherever distinct naming authorities must interoperate over the same N-sovereign-scheme integration problem.

  • Library systems — SKOS exactMatch between LCSH and FAST subject headings.
  • Healthcare terminology — ICD-10-to-SNOMED-CT code pairs for routing and reporting.
  • Bioinformatics — Ensembl-to-HGNC gene-identifier crosswalks.
  • Master-data management — CRM-to-ERP customer-entity reconciliation.
  • Regulatory equivalency — a regulator declaring a foreign framework equivalent.
  • Standards harmonisation — ISO bodies declaring two national standards equivalent.

Clarity

Calling a correspondence a declared equivalence locates the source of its authority, separating a recorded judgment from a computed similarity or a metaphysical identity claim. It makes the right question askable — who declared it, for what purpose, is it current — and makes the bounded-purpose qualifier legible, so "they are mapped" stops meaning "the same in every respect."

Manages Complexity

Integrating N sovereign vocabularies is an O(N²) tangle of use-time comparisons. The declaration externalises each substitution into one maintained artifact, collapsing the field to a linear shared table. The integrator tracks four fields per use — declarer, purpose, version, currency — converting an open data question into a closed governance lookup.

Abstract Reasoning

The construct's moves are a source-of-authority diagnosis; coupled boundary (is the use inside the declared purpose?) and trust (relying is delegated trust) inferences; a failure-attribution move relocating a bad substitution to a stale declaration; a weakest-link composition rule for transitive chains; and a boundary-on-options move choosing declaration over common-name or translation-layer to preserve scheme sovereignty.

Knowledge Transfer

Within knowledge organization the construct transfers as mechanism across a wide set of co-instances — SKOS, clinical coding, gene crosswalks, entity resolution, standards recognition — the full governance apparatus porting intact, because all share the N-sovereign-scheme problem. Off that practice the portable core decomposes into parents: the one-to-one pairing is bijectivity, and the validity-by-authority-with-scope-and-revocation is generic trust-bridging carried by certification and naming/authority. Those parents carry any cross-domain lesson; the SKOS grade system stays home-bound.

Relationships to Other Abstractions

Local relationship map for Declared Equivalence MappingParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.DeclaredEquivalence MappingDOMAINPrime abstraction: Equivalence Relation — is a decomposition ofEquivalenceRelationPRIMEDomain-specific abstraction: Schema Mapping Relation — is a kind ofSchema MappingRelationDOMAINPrime abstraction: Record Reconciliation — is a kind ofRecordReconciliationPRIME

Current abstraction Declared Equivalence Mapping Domain-specific

Parents (3) — more general patterns this builds on

  • Declared Equivalence Mapping is a kind of Schema Mapping Relation Domain-specific

    Declared Equivalence Mapping is the exactMatch species of Schema Mapping Relation, fixing the bridge grade at purpose-bounded loss-free substitution.

  • Declared Equivalence Mapping is a kind of Record Reconciliation Prime

    Declared Equivalence Mapping is the equivalent-verdict species of Record Reconciliation, made authoritative and purpose-bounded for controlled schemes.

  • Declared Equivalence Mapping is a decomposition of Equivalence Relation Prime

    Removing declaration governance leaves sameness under a stated criterion, with symmetric substitution and exact-only transitive closure.

Hierarchy paths (13) — routes to 9 parentless roots

Neighborhood in Abstraction Space

Declared Equivalence Mapping sits in a moderately populated region (40th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Trust Infrastructure for Shared Knowledge (6 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12