C.19.1:7 - Relations

Depends on: G.5 and G.9 (selector and parity), G.11 (refresh telemetry), A.15.1 for dated work, A.15.2 for work plans, B.1.6 for resource and cost aggregation, C.16 for measurement, and A.10 for provenance, C.18 (NQD‑CAL), C.19 (E and E‑LOG), F.7 and F.9 (bridges, CL, Φ, and Ψ). Constrained by: E.5 Guard‑Rails and E.3 precedence.

C.19.1:7.1 - C.32 architecture-synthesis use relation

When using C.32 to generate candidate architectures, C.19.1 applies only if a claim about a candidate asserts scale advantage or invokes a declared local generality policy. For a universal module relation, platform, organization design, evidence arrangement, or selected structure, that branch is a project analogy or policy: the empirical machine-learning literature is not proof. Name the exact bearer and its direct pattern, the holon under change when one is current, the bearer-specific scale predicate, objective vector, comparison basis, feasible evidence, admissibility boundary, and intended receiving use.

BLP neither selects the architecture nor turns method-family, practice, role-side, or culture wording into a holon kind. If the candidate merely removes parts, carries several functions, or is described as reusable, with no recoverable scale claim or declared generality-policy claim, keep the question in C.32 and C.31; return no scale claim yet rather than manufacturing an audit. A TRIZ-style ideality move enters BLP only when the declared comparison actually relies on scale amenability inside a named window.

C.19.1:7.2 - C.29 mathematical-lens use relation

When a mathematical lens is chosen over a general, scale-amenable bearer because it is elegant, specialized, or theoretically prestigious, and a scale-advantage or declared generality-policy claim is current, C.19.1 governs the scale-advantage and preference claim. A C.29 application may state CandidateMathObject, LensMappingMode, PreservedStructure, LostStructure, LensUseBoundaryValue, declaredLensUse, and StopCondition, with optional blockedLensOverread? for an overread that passes F.19’s plausible-reader test; it does not supply BLP compatibility, scale dominance, or waiver evidence.

If scale advantage or a declared generality policy is live, start with the cheap probe and cite the resulting bounded comparison, risk-selected Scale-Audit, or applicable BLP-waiver. If neither is live, keep the mathematical lens local and bounded by its C.29 stop condition.

Memory hook. Test what scales; label policy when evidence does not decide.

When choosing between a general adaptive loop, a specialized object-family cycle, or a mixed operation-family set for an E.23 use, C.19.1 applies only when the decision relies on scale advantage or a declared generality policy. Start with the cheap probe. Compare the declared characteristic values for material resources, tools and instruments, adaptation attempts, skilled attention, rework or delay, risk exposure, and avoided loss on their admitted scales; keep them separate, reject a dominated option, and use the declared project policy to choose or hold when no option dominates. Net-cost arithmetic is permitted only after every term has been converted to one declared unit through an admissible conversion whose basis, uncertainty, and scope remain visible. Repeated automation alone does not satisfy BLP; the record still names the object under improvement, evaluation, protected trade-offs, bounded cost and risk condition, and stop or switch condition. If neither a scale claim nor a declared generality policy is current, E.23 proceeds without a BLP audit or waiver.