Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Finite Causal Query Hierarchy

Abstract

One finite Boolean SCM class carries genuine observational, interventional, and counterfactual query profiles with both hierarchy links strict.

Theorem 1.1 (The finite causal query hierarchy is strict).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Causal/FiniteCausalQueryHierarchy.finite_causal_query_hierarchy (✓ std3). ∎

Source. Repository-derived.

Commentary.

The common carrier is a two-node recursive Boolean structural model. Its exogenous state has two coordinates, so the same class includes both reverse causal direction and independent outcome noise.

The interventional profile contains the empty intervention. Its empty component is the passive joint law, while the counterfactual profile retains the response of each exogenous state under every regime.

The forward and reverse direction models have the same passive law but different intervention laws. The stable and flip coupling models have the same complete single-world profile but different unit-preserving response profiles.

References