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

Evidential Support and Confirmation Formalization

College Depth 105 in the knowledge graph ☐ I know this ☆ Set as goal
717prerequisites beneath it
See this on the map →
Conditionalization and Bayesian UpdatingBayesian Approaches to Confirmation+1 more→
evidence confirmation support hypothesis

Core Idea

Evidential support can be formalized in Bayesian terms: evidence e supports hypothesis h if P(h|e) > P(h), i.e., learning e raises the probability of h. The degree of support is captured by the likelihood ratio P(e|h) / P(e|¬h): how much more probable the evidence is given h versus not-h. This framework unifies intuitions about confirmation, explains why evidence can be misleading (when prior probabilities are skewed), and reveals logical relationships between different kinds of supporting evidence.

Explainer

From conditionalization and Bayesian updating, you know the core mechanics: you start with a prior probability P(h), observe evidence e, and update to a posterior P(h|e) using Bayes' theorem: P(h|e) = P(e|h) × P(h) / P(e). What evidential support formalization adds is a principled way to measure *how much* evidence matters — not just "did my belief change?" but "how strongly does this evidence favor this hypothesis over its alternatives?"

The basic confirmation relation is simple: e confirms h if and only if P(h|e) > P(h). Observing e raises your credence in h, so e is evidence for h. Conversely, e *disconfirms* h if P(h|e) < P(h). This fits the intuitive notion that a positive test result for a disease is evidence you have it, while a negative result is evidence against. The Bayesian framework turns this intuition into a precise inequality and connects it directly to the updating rule you already know.

The richer measure is the likelihood ratio: P(e|h) / P(e|¬h). This ratio asks how much more probable the evidence is under h than under its negation. A likelihood ratio of 10 means the evidence is ten times more expected if h is true than if h is false — strong support. A ratio near 1 means the evidence is roughly as probable either way — weak or no support. The power of this measure is that it isolates the *discriminating force* of the evidence, independent of your priors. Two investigators with different prior beliefs about h will update differently from the same evidence, but they will agree on the likelihood ratio — it is an objective feature of the evidence's relationship to the competing hypotheses.

This framework also illuminates when evidence can be misleading — the case where your posterior is high but you are nonetheless wrong. Suppose h is very improbable a priori (say, P(h) = 0.001), and you observe e with a likelihood ratio of 100. A ratio of 100 is substantial — but starting from 0.001, even multiplying by 100 leaves P(h|e) well below 50%. The evidence genuinely supports h (it moved the probability up), but the posterior is still low because the prior was so extreme. This shows why strong evidence is not sufficient for justified belief if the hypothesis was implausible to begin with. Misleading evidence can also occur in the other direction: a single confirming observation against a flood of disconfirming prior evidence may not produce a credence worth acting on.

A key application is understanding how multiple pieces of evidence combine. If observations are conditionally independent given h (knowing one tells you nothing about the others, beyond what h already tells you), their likelihood ratios multiply. Observing both e1 and e2, each with a likelihood ratio of 10, gives a combined ratio of 100. But if e1 and e2 are not independent — if they both measure the same underlying thing — their combined force is less than their product. Formalizing evidential support forces you to be explicit about these dependence assumptions, which are often hidden in informal reasoning. This is one of the ways Bayesian epistemology makes implicit inferential commitments visible and assessable.

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 → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → The Sensitivity Condition and Tracking Truth → Anti-Luck Conditions and Sensitivity → Epistemic Luck → Responses to the Gettier Problem → Process Reliabilism → Bayesian Epistemology → Bayesian Confirmation Theory → Bayesian Approaches to Confirmation → Evidential Support and Confirmation Formalization

Longest path: 106 steps · 717 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.