Preimage Set Characterization¶
Given an output condition, identify and bound the complete set of inputs that could produce it before acting as if the output has a unique source.
Summary¶
Given an output condition, identify and bound the complete set of inputs that could produce it before acting as if the output has a unique source.
This archetype treats an output as a doorway back to a set of possible inputs. It is especially useful when a label, alert, status, score, projection, rule result, or decision outcome is compact, but the set of inputs that could produce it is not compact, not unique, or not fully known.
Disposition Rationale¶
The target accepted prime preimage had zero direct, related, variant, and alias coverage in the queue. Existing accepted archetypes cover valid input/output scope, functional contracts, relation mapping, retrieval, causal explanation, and mapping reconciliation, but none directly covers the inverse-set task of defining all inputs that map to a specified output condition. This draft therefore creates a bounded full archetype rather than a component-only record.
Core Pattern¶
A preimage is not a hunch about the likely source of an output. It is a membership set: every input in the declared domain that maps to the output condition belongs, and every input that does not map there is excluded. The archetype forces the user to state the mapping, the output condition, the input domain, the membership test, the construction method, and the completeness claim.
When This Archetype Applies¶
Partial catalog groundingSome structural conditions are represented by existing abstractions, but no sufficient condition set is fully represented.
Diagnostic problem
A system observes or specifies an output but does not know, bound, or preserve the set of all inputs that map to it. Users may infer a unique cause, treat examples as exhaustive, act on a lossy projection, or apply a rule without seeing the full membership set that the output condition implies.
Applicability expression6 distinct conditions
groundedpartly groundedopen
6 conditions, all required.
6Required in every casenumbered 1–6
These hold no matter which pattern applies.
Unavailable inverse mapping · grounded
A mapping is known while the inverse direction is not directly available.
The source archetype describes the situation as follows: A mapping is known or partially known, but the inverse direction is not directly available. The normalized requirement above isolates the load-bearing portion used in this condition set.
primePreimage— The set of all inputs that map to a given output under some mapping.
Many-to-one uncertainty · grounded
Multiple inputs can produce the same output or output uniqueness is uncertain.
The source archetype describes the situation as follows: Multiple distinct inputs can produce the same output, or uniqueness is uncertain. The normalized requirement above isolates the load-bearing portion used in this condition set.
primePreimage— The set of all inputs that map to a given output under some mapping.
State-collapsing mapping · grounded
A projection, aggregate, classifier, hash, display, or model collapses richer states into fewer outputs.
The source archetype describes the situation as follows: A projection, aggregation, classifier, hash, display, or model collapses richer states into fewer output categories. The normalized requirement above isolates the load-bearing portion used in this condition set.
primePreimage— The set of all inputs that map to a given output under some mapping.
False unique-source inference · open
Stakeholders treat one observed output as proof of one unique source state.
The source archetype describes the situation as follows: Stakeholders are using one observed output as if it proves one source state. The normalized requirement above isolates the load-bearing portion used in this condition set.
Incomplete satisfying-set search · open
A search returns examples while the decision requires the complete satisfying set or documented subset.
The source archetype describes the situation as follows: A search or query returns examples but the decision requires the full satisfying set or a documented partial set. The normalized requirement above isolates the load-bearing portion used in this condition set.
Mapping-sensitive membership · open
Threshold or mapping changes alter membership in the output condition.
The source archetype describes the situation as follows: Changing thresholds, codomain categories, or mapping parameters changes which inputs belong to the output condition. The normalized requirement above isolates the load-bearing portion used in this condition set.
Other requirements and context (2)
Why these sit outside the expression
Application gate — it governs whether applying the archetype is appropriate or material, rather than defining the structural problem itself.
Application gateAn output, label, alert, symptom, score, class, status, aggregate, or decision must be traced back to inputs or cases.
A system observes or specifies an output but does not know, bound, or preserve the set of all inputs that map to it. In this archetype, the relevant application gate is: An output, label, alert, symptom, score, class, status, aggregate, or decision must be traced back to inputs or cases. It narrows when choosing or applying the archetype is warranted or decision-relevant.
Application gateEligibility, compliance, retrieval, diagnosis, classification, or explanation depends on identifying every input satisfying a condition.
Coverage
3 of 6 conditions grounded · 3 open.
When to Use¶
Use this when a system needs to reason from output to input: diagnosing an alert, auditing a classifier, querying all records satisfying a rule, checking eligibility, reverse-mapping a projection, or documenting which cases a policy decision covers. The critical sign is that a downstream action depends on knowing the set of inputs compatible with an output, not merely on observing the output itself.
Component Logic¶
The mapping under review and output condition come first. Then the input domain boundary prevents accidental expansion or exclusion. The membership rule makes inclusion testable. Candidate enumeration constructs the set. Collision and multiplicity checks prevent false uniqueness. Completeness evidence distinguishes exhaustive preimage from partial discovery. Boundary cases and action policy keep the result usable without overclaim.
Mechanism Logic¶
Mechanisms such as inverse lookup queries, constraint solvers, predicate filters, collision matrices, witness sets, and completeness audits instantiate the archetype. They are not the archetype itself. The archetype is the disciplined inverse-characterization pattern that tells those mechanisms what they must preserve.
Boundary Notes¶
This is not Domain–Codomain Delimitation: that archetype defines the valid spaces of a function, while this one asks which inputs in the domain land at a particular output. It is not Index-Based Retrieval: an index may speed up finding the set, but retrieval does not by itself define the membership rule or completeness claim. It is not Causal Mechanism Mapping: preimage membership shows compatibility with an output, not proof that an input actually caused it.
Invariants¶
Keep the mapping fixed, the output condition explicit, the input domain visible, the membership rule reviewable, the multiplicity honest, and the completeness claim bounded. The most important invariant is not to collapse a many-to-one output into a single assumed input.
Examples¶
In mathematics, the preimage of a value changes when the input domain changes. In data governance, all records satisfying a predicate form a preimage of the true condition under the rule. In incident response, one alert may have multiple compatible system states. In model auditing, a class label may hide many feature profiles. In dashboards, one status light may collapse several operational realities.
Non-Examples¶
A generic relation map, a ranked search result, a causal proof, an API type signature, or a nearest-neighbor query is not this archetype unless the central object is the set of inputs mapping to a specified output condition.
Common Mechanisms¶
10 documented mechanisms across 5 implementation forms.
The grouping reflects forms represented among the mechanisms currently documented for this archetype; an absent form is not necessarily an impossible implementation.
Analysis, Modeling & Optimization · 6 mechanisms
- Collision Analysis Matrix — Cross-tabulates inputs against outputs to expose where distinct inputs collide on the same output and where the mapping's uniqueness fails.
- Constraint-Solver Backsolve — Encodes the output condition and domain as constraints and derives the complete set of inputs that satisfy them, with a guarantee that none is missed.
- Fiber Cardinality Count — Reports how many inputs map to each output — the size of the fiber — along with how much to trust that number.
- Inverse Lookup Query — Answers an output back to its inputs by querying a reverse index, returning every input already filed under the target value.
- Output-to-Input Traceback Map — Traces an observed output back through the mapping to the input states compatible with it, naming what the forward projection discarded and how to act while the ambiguity stands.
- Sensitivity-to-Mapping-Change Review — Perturbs the mapping, threshold, or parameters and watches which inputs enter or leave the preimage, exposing how fragile the set is and warning downstream users where it will move.
Assessment, Review & Assurance · 1 mechanism
- Coverage Completeness Audit — Maps the union of the patches against the declared domain to prove no in-scope region is left unwitnessed, and logs every gap it finds.
Control, Automation & Runtime · 1 mechanism
- Predicate Satisfaction Filter — Runs a stated membership predicate over the whole input population, keeping exactly the cases that satisfy the output condition and flagging the ones sitting on the threshold.
Record, Log & Register · 1 mechanism
- Witness and Counterexample Set — Collects concrete inputs proven to belong to the preimage (witnesses) and inputs that refute a claimed uniqueness or completeness (counterexamples), building the set from confirmed exhibits rather than sweeps.
Representation, Specification & Plan · 1 mechanism
- Preimage Table — Publishes the finished output-to-input sets as a static reference so downstream users read the preimage off the page instead of re-deriving it, with usage caveats printed alongside.
Compression statement¶
When a mapping, model, rule, projection, or process produces an output that must be explained, queried, governed, or acted on, define the output condition, domain of inputs, membership test, enumeration method, multiplicity, and completeness evidence so the resulting preimage is not confused with a single cause, a sample of examples, or a reversible inverse.
Canonical formula: preimage(output_condition) = { input in declared_domain | mapping_under_review(input) satisfies output_condition } + completeness_evidence + multiplicity_note + downstream_use_policy
Related Abstractions¶
Abstractions this archetype builds on — directly (a source ingredient) or as a related pattern. Links follow the typed catalog namespace.
Built directly on (7)
- Bijectivity: A correspondence that is exactly one-to-one and onto — no collisions, no gaps — so it is reversible and the two collections have equal size and information content.
- Function (Mapping): Relates inputs to outputs.
- Injectivity: A distinctness-preserving mapping in which distinct inputs never collide on one output.
- Predicate: A testable yes-or-no property of an object, returning a truth value.
- Preimage: The set of all inputs that map to a given output under some mapping.
- Projection: Map a richer object onto a lower-dimensional target along a chosen direction, discarding the rest.
- Set and Membership: Groups and categorizes elements.
Also references 19 related abstractions
- Abstraction: Focus on core elements.
- Boundary: Defines system limits.
- Calibration: Aligning a system's output to a trusted reference by measuring deviation, adjusting to reduce it, and monitoring for drift.
- Causality: Cause-effect relationships.
- Classification: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.
- Completeness: No gaps in structure.
- Constraint: Limits possibilities to guide outcomes.
- Counterfactuals: Alternate hypothetical scenarios.
- Embedding: A structure-preserving injection of one system faithfully into a richer one.
- Equivalence Relation: Groups elements into equivalence classes.
Variants¶
Narrower or domain-specific specializations that share this archetype's core structure. Recognized variants are established; candidate variants are provisional.
Diagnostic Preimage Tracing · domain variant · recognized
A variant focused on identifying all possible input states, conditions, or causes that could have produced an observed output.
- Distinct from parent: The parent covers preimage characterization generally; this variant centers diagnostic ambiguity and evidence-based narrowing.
- Use when: An observed effect, alert, state, or symptom could have arisen from multiple upstream inputs; A team is tempted to infer one cause from one outcome; Diagnosis or remediation depends on preserving multiple plausible input explanations until evidence narrows them.
- Typical domains: medicine, operations, software incident response, forensic analysis, policy evaluation
- Common mechanisms: output to input traceback map, witness and counterexample set, sensitivity to mapping change review
Predicate Preimage Query · implementation variant · recognized
A variant where the target output is a Boolean or categorical predicate and the intervention builds the set of all inputs satisfying it.
- Distinct from parent: The parent includes arbitrary mappings and output values; this variant focuses on predicate-defined membership sets.
- Use when: The output condition is expressed as true/false, eligible/ineligible, included/excluded, or label membership; A rule, query, or filter needs to return all satisfying cases rather than a ranked subset; Auditability depends on knowing why a case is inside or outside the satisfying set.
- Typical domains: database querying, eligibility policy, compliance screening, classification audit
- Common mechanisms: predicate satisfaction filter, inverse lookup query, preimage table
Projection-Collision Preimage Audit · risk or failure variant · candidate
A variant focused on auditing how many rich source states collapse to the same simplified output after projection or representation loss.
- Distinct from parent: The parent covers preimage characterization generally; this variant emphasizes many-to-one collapse under a lossy representational view.
- Use when: A simplified display, aggregate, label, score, or category hides multiple distinct source states; Stakeholders read a projected output as if it were uniquely reversible; Intervention requires knowing what differences were lost before acting on the output.
- Typical domains: dashboard design, model explanation, geospatial mapping, statistics, classification
- Common mechanisms: collision analysis matrix, fiber cardinality count, sensitivity to mapping change review
Near names: Inverse-Image Characterization, Output-to-Input Traceback, Solution-Set Characterization, Fiber Analysis, Reverse Lookup Set.
Editorial Notes¶
Problem Classification¶
Classification: Correctness, Conformance & Formal Validity Failure → Coverage, Partition & Set Accounting
Problem kernel: the complete input set producing an output is not accounted
Rationale: Given an output condition, the system does not know or bound the complete membership set of inputs that produce it, so examples are treated as exhaustive and nonunique causes as unique. Mapping preservation concerns whether a transformation retains required correspondence; the immediate formal defect here is incomplete accounting of the output's entire inverse membership region.
Boundary considered: Correctness, Conformance & Formal Validity Failure → Mapping, Rewrite & Structure Preservation
Why this classification prevailed: Set accounting governs exhaustive membership of a preimage; mapping preservation governs meaning and invariants retained while translating, rewriting, replacing, or inverting structures.
Review outcome: Adjudicated after independent review; high confidence.