controlArchitecturesCert
plain-language theorem explainer
The declaration supplies a concrete certificate that exactly five canonical robot control architectures exist for configuration dimension five. Robotics engineers and formal verification teams would cite this as the Lean witness for the standard five-architecture taxonomy. The definition is a direct instantiation of the certifying structure using the decidable cardinality result.
Claim. Let $C$ be the finite type of robot control architectures. The certificate $cert$ is the structure satisfying $five_architectures(cert) = 5$, i.e., the cardinality of $C$ equals five.
background
In the Recognition Science treatment of robotics, control architectures are classified by the configuration dimension D. For D = 5 the module asserts exactly five canonical forms: reactive, deliberative, hybrid, behavior-based, and learning-based. The structure ControlArchitecturesCert packages the claim that the finite type ControlArchitecture has cardinality five. The upstream theorem controlArchitecture_count establishes this cardinality by direct decision.
proof idea
The definition is a one-line wrapper that constructs an element of ControlArchitecturesCert by setting its five_architectures field to the value of the theorem controlArchitecture_count.
why it matters
This definition closes the robotics control architecture claim for configuration dimension five inside the Recognition Science framework. It supplies the Lean witness required by the module's taxonomy of five architectures. No downstream uses are recorded, so the declaration stands as a self-contained certificate rather than a lemma feeding further theorems.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.