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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicThe Sensitivity Condition and Tracking TruthAnti-Luck Conditions and SensitivityEpistemic LuckResponses to the Gettier ProblemProcess ReliabilismBayesian EpistemologyBayesian Confirmation TheoryBayesian Approaches to ConfirmationEvidential Support and Confirmation Formalization

Longest path: 106 steps · 717 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.