trureturingGitHub MATHEMATICAL ATLAS

ConceptDynamics / CONCEPT

Concept Fiber Decomposition

Every concept readout decomposes its source into dependent fibers.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES39
PROOF DEPTH0
DOCUMENT LINKS1
THEOREM

Concept fiber decomposition

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Concept Fiber DecompositionConcept Fiber DecompositionNegative and Positive RightsNegative and Positive RightsBinary Identification within Concept FibersBinary Identification withinConcept FibersCommon-Rule Information ConvergenceCommon-Rule InformationConvergenceHeterogeneous Fiber MisclassificationHeterogeneous FiberMisclassificationLanguage Postprocessing ObstructionLanguage PostprocessingObstructionConcept Join Universal PropertyConcept Join Universal PropertyFuture Obligation IncompletenessFuture ObligationIncompletenessFiber-Internal PathsFiber-Internal PathsComplete Inputs Exclude Deterministic DisagreementComplete Inputs ExcludeDeterministic DisagreementFinite-Horizon Optimal-Action DescentFinite-Horizon Optimal-ActionDescentNonnegative Value of Free InformationNonnegative Value of FreeInformationPartition Knowledge Negative IntrospectionPartition Knowledge NegativeIntrospectionThe Four-Phase Law for Finite EvidenceThe Four-Phase Law for FiniteEvidenceCanonical Dependent Fiber EquivalenceCanonical Dependent FiberEquivalenceCoordinate Residue Bilayer Is Not a ProductCoordinate Residue Bilayer IsNot a ProductObserver and Concept Readout CorrespondenceObserver and Concept ReadoutCorrespondenceWhole Dependent Fiber FormWhole Dependent Fiber FormZero Conditional Logical ImpurityZero Conditional LogicalImpurityCommon-Source Capture CollapseCommon-Source Capture CollapseInteraction Witness from Noncommuting InterventionsInteraction Witness fromNoncommuting InterventionsCommuting Target ExchangeCommuting Target ExchangeAuthorization and Factual CorrectnessAuthorization and FactualCorrectnessDoob-Dynkin FactorizationDoob-Dynkin FactorizationDescriptive and Normative Structure SeparationDescriptive and NormativeStructure SeparationHistory-Sensitive Outcome Reduction ObstructionHistory-Sensitive OutcomeReduction ObstructionInvolution DescentInvolution DescentAction Expansion and IndistinguishabilityAction Expansion andIndistinguishabilityFinite Strict Refinement BoundFinite Strict Refinement BoundDominance Nontransitivity CountermodelDominance NontransitivityCountermodelAtoms of the Pullback AlgebraAtoms of the Pullback AlgebraInverse Limit CompletionInverse Limit CompletionRefinement UltrametricRefinement UltrametricAdditive Descent Defect Chain LawAdditive Descent Defect ChainLawMaximum Factor-Compatible SubdomainMaximum Factor-CompatibleSubdomainValidity Preservation by Admissible TransportValidity Preservation byAdmissible TransportEffective-Image NaturalityEffective-Image NaturalityTransport Licensing and Scope OverreachTransport Licensing and ScopeOverreachZero Vulnerability RadiusZero Vulnerability RadiusRefinement Factorization CategoryRefinement FactorizationCategory
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

None recorded in this release.

Certified topology / DOWNSTREAM

Consequences

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.