Current reading edition · 2026-09-21

Anchor, Tensor, and Skin

A Fixed-Domain Decomposition Theorem for Admissible Description

Amos Jay Maley · 36 pages

Read paperDownload PDFDOI

Decomposes a fixed-domain admissible description into context (Anchor), complete semantic content (Tensor) and identity-preserving realization (Skin), with reconstruction maps; characterizes minimal realization uniqueness up to commuting bijection and finite-use envelopes/substitution.

Earlier versions
About this paper and citation
Imports
States a one-way order: Kernel, AMetric, Structure, fixed-domain exhaustion, then ATS. References name kernel v49, AMetric editorial reference, Structure examples reference 20 September and Exhaustion composition reference 20 September.
Supplies downstream
Supplies a typed organization for assembling/checking admissible descriptions and certificates. It does not serve as a premise for the earlier general exhaustion theorem.
Scope and limits
A complete semantic profile is not merely an admissibility bit and need not identify a unique occupant. Minimal-realization uniqueness does not imply uniqueness among every adequate realization. Sequential substitution requires joint original-domain factorization; a licence alone is not execution.

Optional source references - these jump to sections and theorems in this same PDF.

Formalism and dependencies

Amos Jay Maley. Anchor, Tensor, and Skin: A Fixed-Domain Decomposition Theorem for Admissible Description. Publication reference, 2026-09-21. SHA256 1624eacd530dcdaaedec184414c8a7eab8d5096805aee9ffa5452b6f51638c7b. DOI: 10.5281/zenodo.22875011.

Manuscript cover date: 2026-09-21. Publisher release date: 2026-09-21.

SHA256 1624eacd530dcdaaedec184414c8a7eab8d5096805aee9ffa5452b6f51638c7b

Work record (all versions) · Edition metadata · Reading aid as Markdown

The PDF matches the exact publisher release. A complete manuscript HTML conversion has not been verified. A newer reading edition does not replace the exact edition cited by a downstream theorem.