Documentation

Studies.Thomas2026

Thomas (2026): A Probabilistic, Question-Based Approach to Additivity #

This file formalizes [Tho26]'s felicity conditions for additive too, which unify its canonical use, a second answer to a salient question, (2), with the argument-building use in which the antecedent and the prejacent together argue for a conclusion, (1) and (18). The account is stated in an inquisitive question semantics with a listener's probability measure over worlds. A proposition is relevant to a question if it shifts the probability of one of the question's alternatives, (61); it answers the question if it raises the probability of some resolution, a nonempty set of alternatives, by a factor exceeding that of every resolution not entailed by it, (62); and one proposition evidences a resolution more strongly than another if it gives it the higher conditional probability, (63). Too requires an antecedent proposition and a question relevant to the discourse such that the antecedent answers the question, the conjunction of antecedent and prejacent answers it and evidences its resolution more strongly than the antecedent alone, and the prejacent neither entails that resolution nor could be weakened without weakening the evidence, (64).

The definitions are Relevant, IsResolutionOf, Answers, EvidencesMore and TooFelicitous. Answering needs a positive prior on the evidence, IsResolutionOf.ne_zero, and trivial evidence answers nothing, not_answers_univ; the resolutions a proposition evidences are nested, IsResolutionOf.subset_or_subset, and a singleton resolution makes the proposition relevant to the question, IsResolutionOf.relevant. The paper's arguments for its examples reduce to three patterns: an antecedent entailing a resolution gives it probability one, cond_eq_one_of_subset, so a conjunction entailing what the antecedent leaves uncertain evidences it more strongly, evidencesMore_of_subset, as in (68); a prejacent that leaves every resolution's conditional probability unchanged fails the conjunction condition, not_tooFelicitous_of_cond_eq, as in (25) and (72); a prejacent entailing the evidenced resolution fails the first prejacent condition, not_tooFelicitous_of_subset, as in (11) and (29); and evidence raising every candidate resolution by the same factor answers no question, not_answers_of_impact_eq, as in (71).

Implementation notes #

The listener's belief state is a probability measure, and conditioning is mathlib's ProbabilityTheory.cond, so the paper's statements hold at every prior. The resolution evidenced by a proposition, which the paper calls unique, is only unique up to nesting: the dominance clause of (62) waives resolutions containing the candidate, so the felicity condition quantifies existentially over the resolution that the conjunction evidences and the prejacent conditions constrain. Bayesian belief revision through a speaker model, (57)–(59), is not formalized: the antecedent is the proposition the listener learns. The examples are the rows of Data.Examples.Thomas2026, with the paper's diagnosis of each too recorded as a feature.

References #

Relevance and answerhood (section 5.1.3) #

def Thomas2026.Relevant {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (R S : Question W) :

Relevance (61a): a question is relevant to a question if some alternative of the first shifts the probability of some alternative of the second.

Equations
Instances For
    noncomputable def Thomas2026.impact {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (R A : Set W) :
    ENNReal

    The impact of a proposition on a proposition: the factor by which learning the first raises the probability of the second.

    Equations
    Instances For
      structure Thomas2026.IsResolutionOf {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (Q : Question W) (𝒜 : Set (Set W)) (R : Set W) :

      Answerhood (62): a nonempty set of alternatives is the resolution of a question evidenced by a proposition when the proposition raises the probability of its conjunction and impacts it more than the conjunction of any set of alternatives not entailed by it.

      • subset_alt : 𝒜 ⊆ Q.alt
      • nonempty : 𝒜.Nonempty
      • raises : μ (⋂₀ 𝒜) < μ[⋂₀ 𝒜 | R]
      • dominates (𝒜' : Set (Set W)) : 𝒜' ⊆ Q.alt → 𝒜'.Nonempty → ¬⋂₀ 𝒜 ⊆ ⋂₀ 𝒜' → impact μ R (⋂₀ 𝒜') < impact μ R (⋂₀ 𝒜)
      Instances For
        def Thomas2026.Answers {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (R : Set W) (Q : Question W) :

        A proposition answers a question when it evidences some resolution of it.

        Equations
        Instances For
          def Thomas2026.EvidencesMore {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (A R R' : Set W) :

          (63): a proposition evidences a resolution more strongly than another proposition.

          Equations
          Instances For

            The felicity conditions of too (section 5.2) #

            def Thomas2026.TooFelicitous {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (π ant : Set W) (rq : Question W) :

            (64a)–(64c): the antecedent answers the question; the conjunction of antecedent and prejacent answers it and evidences its resolution more strongly than the antecedent; the prejacent does not entail that resolution, and any weaker prejacent would evidence it less strongly.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              def Thomas2026.Too {W : Type u_1} [MeasurableSpace W] (μ : MeasureTheory.Measure W) (π ant : Set W) (rq dq : Question W) :

              (64): too is licensed by an antecedent and a question relevant to a question in the discourse tree.

              Equations
              Instances For

                Consequences #

                theorem Thomas2026.IsResolutionOf.ne_zero {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {Q : Question W} {𝒜 : Set (Set W)} {R : Set W} (h : IsResolutionOf μ Q 𝒜 R) :
                μ R ≠ 0

                Evidence for a resolution has positive prior probability.

                theorem Thomas2026.Answers.ne_zero {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {Q : Question W} {R : Set W} (h : Answers μ R Q) :
                μ R ≠ 0
                theorem Thomas2026.IsResolutionOf.subset_or_subset {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {Q : Question W} {𝒜 : Set (Set W)} {R : Set W} {𝒜' : Set (Set W)} (h : IsResolutionOf μ Q 𝒜 R) (h' : IsResolutionOf μ Q 𝒜' R) :
                ⋂₀ 𝒜 ⊆ ⋂₀ 𝒜' ∨ ⋂₀ 𝒜' ⊆ ⋂₀ 𝒜

                Two resolutions evidenced by the same proposition are nested: the dominance clause waives only resolutions containing the candidate.

                theorem Thomas2026.IsResolutionOf.relevant {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {Q : Question W} {A R : Set W} (h : IsResolutionOf μ Q {A} R) :

                An answer through a single alternative is relevant to the question (section 5.1.3).

                theorem Thomas2026.not_tooFelicitous_of_cond_eq {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {rq : Question W} {π ant : Set W} (h : ∀ 𝒜 ⊆ rq.alt, μ[⋂₀ 𝒜 | ant ∩ π] = μ[⋂₀ 𝒜 | ant]) :
                ¬TooFelicitous μ π ant rq

                A prejacent that leaves the conditional probability of every resolution unchanged fails the conjunction condition: dogs are mammals, (72), and I had pancakes for breakfast, (25).

                theorem Thomas2026.not_tooFelicitous_of_subset {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {rq : Question W} {π ant : Set W} (h : ∀ (𝒜 : Set (Set W)), IsResolutionOf μ rq 𝒜 (ant ∩ π) → π ⊆ ⋂₀ 𝒜) :
                ¬TooFelicitous μ π ant rq

                A prejacent entailing every resolution the conjunction evidences fails the first prejacent condition: he's ecstatic, (11), and he stole the cookies, (29b).

                theorem Thomas2026.not_answers_of_impact_eq {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {Q : Question W} {R : Set W} {c : ENNReal} (hc : ∀ 𝒜 ⊆ Q.alt, 𝒜.Nonempty → impact μ R (⋂₀ 𝒜) = c) (hcomp : ∀ 𝒜 ⊆ Q.alt, 𝒜.Nonempty → ∃ 𝒜' ⊆ Q.alt, 𝒜'.Nonempty ∧ ¬⋂₀ 𝒜 ⊆ ⋂₀ 𝒜') :
                ¬Answers μ R Q

                Evidence raising every candidate resolution by the same factor answers no question whose candidates are not all nested: she invited Bailey and the mention-two question, (71).

                theorem Thomas2026.TooFelicitous.answers_inter {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {rq : Question W} {π ant : Set W} (h : TooFelicitous μ π ant rq) :
                Answers μ (ant ∩ π) rq ∧ μ (ant ∩ π) ≠ 0

                The conjunction of a felicitous too answers the question and has positive prior probability.

                theorem Thomas2026.cond_univ_apply {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {A : Set W} [MeasureTheory.IsProbabilityMeasure μ] :
                μ[A | Set.univ] = μ A
                theorem Thomas2026.not_answers_univ {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {Q : Question W} [MeasureTheory.IsProbabilityMeasure μ] :
                ¬Answers μ Set.univ Q

                Trivial evidence raises nothing and so answers no question.

                theorem Thomas2026.cond_eq_one_of_subset {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {A R : Set W} [MeasureTheory.IsProbabilityMeasure μ] [DiscreteMeasurableSpace W] (h : R ⊆ A) (h0 : μ R ≠ 0) :
                μ[A | R] = 1

                A proposition entailing another gives it probability one.

                theorem Thomas2026.evidencesMore_of_subset {W : Type u_1} [MeasurableSpace W] {μ : MeasureTheory.Measure W} {A R R' : Set W} [MeasureTheory.IsProbabilityMeasure μ] [DiscreteMeasurableSpace W] (hR : R ⊆ A) (h0 : μ R ≠ 0) (h : μ[A | R'] < 1) :
                EvidencesMore μ A R R'

                A conjunction entailing a resolution that the antecedent leaves uncertain evidences it more strongly, the conjunction condition in (68).