Generated Span Closure Design

Declare the primitives and allowed operations, then make the whole generated possibility space explicit and auditable.

Version

v1 · 2026-08-24 · History

Solution archetype #

473

Problem family

Correctness, Conformance & Formal Validity Failure

Problem subfamily

Generator, Basis & Operation Structure

Generated Span Closure Design captures the reusable pattern behind span: a declared set of primitives generates a larger reachable or expressible space under declared operations. The draft keeps this parent pattern distinct from closure-preserving operation, basis selection, linear independence, partitioning, and measure assignment.

Disposition

draft_full_archetype — no existing accepted archetype or prior queue output directly covers span as the complete generated space produced from primitives under admissible operations.

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 claims that a set of primitives, features, moves, axioms, resources, or generators can produce a broader capability or expression space, but the generator set, admissible operations, closure conditions, membership evidence, or approximation bounds are implicit.

Applicability expression7 distinct conditions

Small generative primitive setandTarget reachability questionandGenerator incompleteness or redundancyandApproximate vast spanandGenerator-set span differencesandConstructive coverage evidenceandInvalid primitive compositions

Algebraic1∧2∧3∧4∧5∧6∧7

4=(a∧a′)∨(b∧b′)

′ context guard? connective not recorded∅ no catalog witness yet

groundedpartly groundedopen

7 conditions, all required.

7Required in every casenumbered 1–7

These hold no matter which pattern applies.

1

Small generative primitive set · open

A small primitive set is expected to generate many possible expressions, behaviors, vectors, configurations, plans, or designs. more

and — also required

2

Target reachability question · grounded

A downstream decision depends on whether a target is reachable from the available generators. more

primeSpan— The complete set reachable by combining primitives under admissible operations.

and — also required

3

Generator incompleteness or redundancy · open

A candidate basis, vocabulary, API, move set, feature set, or resource pool may be incomplete or redundant. more

and — also required

4

Approximate vast span · grounded · any one of 2

An infinite or very large generated space must be approximated without claiming completeness. more

a

domainProperty-Based Testing— State an invariant that must hold for all inputs of a class and let a framework generate many samples, check each, and shrink any failure to a minimal counter-example — replacing hand-picked examples with systematic search over an input space.

AND both parts required

context guardThe generator's input class is infinite.

suppliesThe generated space must be represented through approximation. · The generated space is infinite.

or — any one of these establishes this case

b

domainSearch Algorithm— Solve a problem by casting it as a state space explored with a frontier-ordering strategy, so completeness, optimality, and cost are read off the strategy's name — and an admissible heuristic buys a narrower search without sacrificing the optimal answer.

AND both parts required

context guardThe exploration uses the candidate's named local-search escape rather than a completeness-guaranteeing frontier strategy.

suppliesThe generated space must be represented through approximation. · The approximation is not claimed or represented as complete.

How this was matched — 3 shared + 2 branches

An infinite or very large generated space requires an approximation that is not represented as complete.

All of

• roleThe subject is a space produced by generators or generative operations.
• modalityThe generated space must be represented through approximation.
• polarityThe approximation is not claimed or represented as complete.

…and any one of

• quantifierThe generated space is infinite.
• quantifierThe generated space is very large.

and — also required

5

Generator-set span differences · grounded

Different generator sets can produce the same span or materially different reachability envelopes. more

primeSpan— The complete set reachable by combining primitives under admissible operations.

and — also required

6

Constructive coverage evidence · grounded

Membership, expressiveness, completeness, or coverage claims require constructive evidence. more

primeSpan— The complete set reachable by combining primitives under admissible operations.

and — also required

7

Invalid primitive compositions · open

Combining primitives can yield invalid, duplicate, equivalent, or out-of-domain expressions unless closure and normal-form rules are explicit. more

Coverage

4 of 7 conditions grounded · 3 open.

Read the methodology · Download the trigger-logic data

Boundary note

This draft should be reviewed alongside the upcoming vector_space, union, and unity_test targets so the algebraic/set-theoretic family remains coherent rather than over-fragmented.

Common Mechanisms

8 documented mechanisms across 4 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 · 3 mechanisms

• Bounded Depth Generation Template — Generates all expressions up to a fixed operation depth and labels the result a truncated approximation, never a complete span.
• Closure Generation Workflow — Repeatedly applies the admissible operations to generators and their products until no new element appears, constructing the closed reachable set.
• Dependency Elimination Test — Tests whether each generator already lies in the span of the others, dropping the redundant ones down to a minimal generating set.

Assessment, Review & Assurance · 2 mechanisms

• Basis Sensitivity Review — Swaps the generator set and compares the resulting spans, exposing which downstream claims are robust to basis choice and which are not.
• Span Membership Certificate — For a specific target, exhibits an explicit generator combination that produces it — a checkable witness that it really is reachable.

Intervention, Treatment & Transformation · 1 mechanism

• Normal Form Reduction Procedure — Rewrites every expression to a single canonical form so that equivalent derivations are recognized as the same element and counted once.

Representation, Specification & Plan · 2 mechanisms

• Generator Inventory — Declares the primitive generators, the operations allowed on them, and the template that combines them — the frozen input catalog everything downstream builds on.
• Reachability Matrix or Table — Aggregates many membership verdicts into a table of which targets the generators can and cannot reach, making the coverage holes visible.

Compression statement

Generated Span Closure Design is the intervention pattern of turning a small set of generators and operation rules into a governed reachable set: the span. It declares generators, admissible operations, expression forms, closure bounds, membership criteria, redundancy tests, and downstream use limits so claims about what can be produced, expressed, derived, reached, or represented are not merely intuitive.

Canonical formula: Span(G, O) = the smallest closed set S such that G ⊆ S and every admissible operation in O maps applicable elements of S back into S.

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 (4)

• Basis: A minimal independent generating set — the smallest collection from which every element of a space can be produced, with no member derivable from the others.
• Closure: Ensures operations remain within a set.
• Linear Combination: Scale each of several objects by a weight and add them together.
• Span: The complete set reachable by combining primitives under admissible operations.

Also references 20 related abstractions

• Abstraction: Focus on core elements.
• Associativity: Grouping does not affect result.
• Boundedness: Values remain within limits.
• Category: Describe a system by its arrows and their composition, not by what its objects are.
• Completeness: No gaps in structure.
• Composition: Arranges components into a cohesive whole.
• Compositionality: Meaning from parts.
• Constraint: Limits possibilities to guide outcomes.
• Formal System: Symbols, formation rules, axioms, and inference rules closed under mechanical derivation.
• Group: A set with an associative operation, identity, and inverses — reversible composable transformations.

▸ Show 10 more

Editorial Notes

Problem Classification

Classification: Correctness, Conformance & Formal Validity Failure → Generator, Basis & Operation Structure

Problem kernel: claimed primitives do not demonstrably span the target space

Rationale: The generator set and admissible operations lack proven completeness, independence, closure, and membership rules.

Independent corroboration: The earliest necessary condition in the frozen evidence is: A system claims that a set of primitives, features, moves, axioms, resources, or generators can produce a broader capability or expression space, but the generator set, admissible operations, closure conditions, membership evidence, or approximation bounds are implicit. That is a generator basis and operation structure problem because Claimed primitives or operations lack the independence, completeness, closure, identity, or inverse structure needed to generate and manipulate valid states.

Review outcome: Independent reviewer agreement; high confidence.