B.1.4:4 - Admissible Checks

For contextual order aggregation:

• the ordered relation refs are named by value;
• the OrderSpec is declared as total order, partial order, or another named relation;
• independence, branch, or join conditions are named when parallel factors are used;
• the record names its included positions, ClaimScope when needed, and admissible use; any holon-boundary crossing is named by an exact relation;
• method, method-description, work, transformation, and resource claims use the patterns that define or test them.

For temporal phase aggregation:

• the carrier identity is recoverable;
• the time window is declared;
• the declared coverage and overlap policy holds; account for allowed overlaps and gaps without double counting, or narrow the use;
• identity change is not hidden as another phase;
• work-resource claims use B.1.6; temporal claims use C.27, currentness uses G.11, and A.10 recovers provenance and bounded reliance when needed.

B.1 invariant carry-through. Apply a B.1 algebraic law only when the recovered relation and declared operator justify it. Contextual aggregation is deterministic relative to the declared OrderSpec and join or independence conditions. Temporal aggregation depends on carrier identity and the declared coverage and overlap policy. A repeated designation creates no additional phase or relation by itself; retain distinct occurrences and ordered positions when the claim distinguishes them. State any singleton or idempotence law for the actual operator. Weakest-link and monotonicity claims name the characteristic and model being bounded or improved; an aggregation record alone establishes no performance, safety or assurance result.

B.1.4:4.1 - Compact Obligation Rows