IndisputableMonolith.Algebra.RecognitionCategory
RecognitionCategory defines the category RecAlg whose objects are cost algebra data bundles assembled from four imported algebras. Algebraists working on Recognition Science foundations cite it when constructing morphisms or initial objects in this setting. It is a definition module that organizes imported structures into categorical form without internal proofs.
claimThe category $\mathrm{RecAlg}$ whose objects are cost algebra data bundles, equipped with morphisms $\mathrm{RecAlgHom}$, identities, and composition satisfying associativity.
background
This module introduces the category RecAlg in the algebra domain. It imports CostAlgebra for underlying cost structures, PhiRing for phi-ladder operations, LedgerAlgebra for defect and cost tracking, and OctaveAlgebra for eight-tick periodicity. The module doc comment states that objects in RecAlg are cost algebra data bundles.
Sibling declarations define RecAlgObj, RecAlgHom, recAlg_id, recAlg_comp, recAlg_comp_assoc, initialObject, and costFamily, indicating the module assembles a complete category on the imported components.
proof idea
this is a definition module, no proofs
why it matters in Recognition Science
The module supplies the categorical infrastructure for Recognition Algebra, enabling sibling constructions such as initial morphisms and cost families. It organizes data bundles to support the Recognition Composition Law and related identities from the upstream CostAlgebra, PhiRing, LedgerAlgebra, and OctaveAlgebra modules.
scope and limits
- Does not contain theorem statements or proofs.
- Does not define numerical constants such as phi or alpha.
- Does not provide concrete instances of RecAlg objects.
- Does not connect objects to physical forcing chain steps T0-T8.
depends on (4)
declarations in this module (65)
-
abbrev
RecAlgObj -
abbrev
RecAlgHom -
def
recAlg_id -
def
recAlg_comp -
theorem
recAlg_comp_assoc -
theorem
recAlg_id_left -
theorem
recAlg_id_right -
def
initialObject -
def
initial_morphism_exists -
def
costFamily -
theorem
costFamily_one_eq_J -
theorem
costFamily_unit -
def
powerMap -
theorem
powerMap_pos -
theorem
powerMap_mul -
theorem
costFamily_comp_powerMap -
theorem
costFamily_neg_param -
structure
CostAlgObjKappa -
structure
CostAlgHomKappa -
def
costAlgKappaInitial -
theorem
costAlgKappaInitial_cost_eq_J -
structure
CostAlgPlusObj -
structure
CostAlgPlusHom -
def
costAlgPlusInitial -
theorem
costAlgPlusInitial_cost_eq_J -
theorem
costAlgPlus_initiality -
structure
PhiRingObj -
structure
PhiRingHom -
def
phiRing_id -
def
phiRing_comp -
def
canonicalPhiRingObj -
theorem
phiRing_comp_assoc -
theorem
phiRing_id_left -
theorem
phiRing_id_right -
abbrev
FlowSpace -
def
IsAntisymmetricFlow -
def
IsConservedFlow -
structure
LedgerAlgObj -
structure
LedgerAlgHom -
def
admissibleFlows -
def
canonicalLedgerAlgObj -
def
ledgerAlg_id -
def
ledgerAlg_comp -
theorem
ledgerAlg_comp_assoc -
theorem
ledgerAlg_id_left -
theorem
ledgerAlg_id_right -
structure
OctaveAlgObj -
structure
OctaveAlgHom -
def
canonicalOctaveAlgObj -
def
octaveAlg_id -
def
octaveAlg_comp -
theorem
octaveAlg_comp_assoc -
theorem
octaveAlg_id_left -
theorem
octaveAlg_id_right -
structure
LayerSysPlusObj -
structure
LayerSysPlusHom -
def
layerSysPlus_id -
def
layerSysPlus_comp -
def
canonicalLayerSysPlus -
structure
DomainInstance -
def
qualiaDomain -
def
ethicsDomain -
def
semanticsDomain -
theorem
monotone_preserves_argmin -
theorem
category_certificate