trureturingGitHub MATHEMATICAL ATLAS

ConceptDynamics / CONCEPT

Inductive Sufficiency

A finite history determines a prediction exactly when the prediction factors through its image.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH2
DOCUMENT LINKS1
THEOREM

Finite-history factorization is the inductive sufficiency criterion

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Concept Join Universal PropertyConcept Join Universal PropertyInductive SufficiencyInductive SufficiencyFinite Cover and CountingFinite Cover and CountingSufficiency-Escape EquivalenceSufficiency-Escape EquivalenceCausal State FactorizationCausal State Factorization
Proof dependencyStructural affinityDocument link

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

Lean sourceResearch workspace
Status
Closed
Depth
2
Layer
D5/S3
Domain
ConceptDynamics
Node ID
D5/S3/ConceptDynamics/Refinement/InductiveSufficiency
Repository path
D5/S3/ConceptDynamics/Refinement/InductiveSufficiency.lean
Truth release
sha256:c0d04258d27972c1cf58485e21d64dbcbe336405346ba95133913c64ba2856aa
Source commit
745bf90812f7175f83e1235688249f9495f23bfc
Source tree
143bc6c9ab9054c406f0cdd7f3b296eb38768b5c

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.