Library / First Principles Framework (FPF) - Core Conceptual Specification
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 14:36:52 UTC · snapshot created 2026-10-03 14:38:14 UTC · last check 2026-10-03 15:25:20 UTC

E.18.2:4.5 - Archetypal Grounding (Worked Slices)

Refrigerator principle scheme. A vapor-compression diagram can be a publication face. The cooling cycle can be a selected TransformationFlowStructure. The thermodynamic laws are mechanism or formal-substrate claims. The graph or equation set that describes the cycle is an E.18.2 mathematical description. It may preserve transformation order, heat-transfer constraints, and cycle closure while losing maintenance work, sensor uncertainty, and installation context. It does not prove the refrigerator works or authorize a repair.

Two descriptions of one build-the-builder network. A nested wiring description can preserve finite member paths and exposed positions while hiding an n-ary relation’s qualification. A hypergraph description of the same exact E.18.NET value can preserve relation arity and endpoints while flattening recursive member boundaries. Both E.18.2 records cite the same network ref and state different preserved and lost structure; neither graph creates or reidentifies the network. A rendered diagram is a further E.17 publication value.

P2W carry-through. A P2W source expression or publication may draw a graph-shaped path from formal substrate to principle frame, mechanism position, method selection, work planning, work, and evaluation. The graph-shaped expression can be an E.18.2 description of the selected carry-through structure. The P2W move itself remains E.18.1; work planning remains A.15; dated work remains U.Work.

Neural-network dataflow. A transformer architecture diagram may describe layers, attention blocks, residual connections, and graph-like connection structure. If the current claim selects one TFS, use E.18; if it selects independently identified TFS or nested-network members plus exact cross-member relation occurrences, use E.18.NET; if it is an architecture claim, use C.30. If the current claim is the mathematical graph, tensor-shape relation, or wiring expression that describes one such already selected subject, use E.18.2. For benchmark superiority, apply the relevant comparison test. For training Work, apply A.15.1’s occurrence and identity rules; for an evidence claim, state the A.10 evidence-use relation; for release, test the release action as Work and any separate subject-release predicate; for causality, apply the exact causal predicate and test. The diagram supplies none of those project results.

Circuit and algorithm. A logic-circuit schematic can describe a transformation-flow structure realizing a Boolean relation. The netlist, wiring graph, algebraic normal form, and truth table are different mathematical or formal descriptions. They do not by themselves decide whether the selected method exists, whether the CMOS mechanism is valid under voltage and timing conditions, or whether a dated powered run occurred.