A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Downward Causation

College Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
633prerequisites beneath it
See this on the map →
Mental CausationMultiple Realizability+1 more→→The Causal Efficacy of Consciousness
causation levels emergence causal-closure

Core Idea

Downward causation is the idea that higher-level properties and wholes can have causal effects on their physical constituents and lower-level components. An intention (higher level) might cause neurons to fire (lower level). This challenges a strictly bottom-up picture of causation.

How It's Best Learned

Distinguish between metaphysically real downward causation and mere correlation with lower-level causes. Examine whether physical causal closure rules it out.

Common Misconceptions

Explainer

You already know from mental causation that mental states seem to cause physical events — your desire for coffee causes your hand to reach for the cup. But causation in nature is typically conceived as running upward: quarks compose atoms, atoms compose molecules, molecules compose cells, cells compose brains. On a strictly bottom-up picture, every physical event is fully determined by prior physical events at the micro-level. So where does the mental get its causal grip?

Downward causation is the claim that higher-level properties — properties of wholes, systems, or emergent structures — can cause changes in the lower-level physical parts that make them up. The brain state that constitutes your intention doesn't merely correlate with your hand moving; the intention, as a higher-level organization of neural activity, causally shapes which neurons fire next. The key word is "higher-level": the cause is described in terms of the whole system's organization, not just its parts.

The challenge is squaring this with causal closure — the physical principle that every physical effect has a sufficient physical cause. If neuron N fires because of prior neuron activity (a micro-level cause), how can the intention (a higher-level cause) also cause the same firing? Aren't we overdetermining the effect? One response is that macro-level and micro-level descriptions are simply different descriptions of the same causal process — the intention just *is* the neural pattern, described at a different grain. Another response insists on genuine emergent causation: the higher-level organization has causal powers its parts lack separately, the way water's surface tension causes behavior no individual H₂O molecule exhibits.

You also know from multiple realizability that the same mental type can be realized by very different physical substrates. This already suggests that the mental level is doing real explanatory work that can't be read off from any particular physical realization. Downward causation extends this: not only does the higher level matter for explanation, it matters for causation. A selection pressure (biological level) causes genetic drift (molecular level). A social institution (sociological level) causes individual behavior changes (psychological level). Whether these are genuine cases of downward causation or just convenient shorthand for complex upward chains is the live philosophical question — and why this concept builds toward the problem of consciousness's causal efficacy.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Finite State Machines (FSMs) → Deterministic Finite Automata (DFA) → Nondeterministic Finite Automata (NFA) → Two-Way Finite Automata → NFA to DFA Conversion (Subset Construction) → DFA Properties and Minimization Algorithms → Regular Languages: Definition and Characterization → Context-Free Grammars (CFGs) → Pushdown Automata (PDA) → Equivalence of CFGs and Pushdown Automata → Closure Properties of Context-Free Languages → Limitations of Context-Free Languages → Pumping Lemma for Context-Free Languages → Turing Machines → Variants of Turing Machines and Equivalence → Universal Turing Machine and Self-Simulation → Church-Turing Thesis and Computability → Functionalism → Multiple Realizability → Downward Causation

Longest path: 98 steps · 633 total prerequisite topics

Prerequisites (3)

Leads To (1)