WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Probability interpretations

14 passages3 formalized3 partial8 not formalized

Statement only

More ways to filter
Library
ATLAS related only
About this page

This page

  • Wikipedia revision 1372945804, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: B-class, High importance
  • Annotated article on WikiLean.
  • 14 passages checked, 15 Lean locations (and 12 related declarations).

Central statements: 7 of the 14 passages state the article's subject or a named result or definition; the other 7 are supporting (examples, setup). Of these 7: 1 formalized, 3 partial, 3 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (11 locations and 3 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 4 of 4 locations and 0 of 5 absences. In all, 15 of 15 Lean locations (100%) and 3 of 8 absences (38%) were re-checked.
  • Passage text: 14 of 14 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1372945804 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. Definition · main statement · Classical definition

    Formalized

    Formalized: Mathlib states this exactly (a definition).

    Developed from studies of games of chance (such as rolling dice) it states that probability is shared equally between all the possible outcomes, provided these outcomes can be deemed equally likely.[1] (3.1)

    Show in article · Read it in context on Wikipedia

    MeasureTheory.Measure.uniformOfFinset exact match

    def MeasureTheory.Measure.uniformOfFinset {α : Type*} [MeasurableSpace α] : Finset α → MeasureTheory.Measure α

    Mathlib.Probability.Distributions.Uniform · lines 205–206

    Note: Lean's object is the distribution that gives each element of the chosen finset the same non-zero mass; the empty finset is a default Lean admits and the passage's mathematics never calls on.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e9d59d4b5a5c · pair key 74b29afa7d43.

    ProbabilityTheory.uniformOn exact match

    def ProbabilityTheory.uniformOn {Ω : Type*} [MeasurableSpace Ω] : Set Ω → MeasureTheory.Measure Ω

    Mathlib.Probability.UniformOn · lines 58–60

    Note: Lean builds the assignment as the counting measure conditioned on the set of possible outcomes, so its value on an outcome is the reciprocal of how many there are.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9c593c08a261 · pair key 2e533fd10f36.

    MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem close match

    theorem MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} {a : α} : a ∈ s → (MeasureTheory.Measure.uniformOfFinset s) {a} = (↑s.card)⁻¹

    Mathlib.Probability.Distributions.Uniform · lines 226–228

    Why close, not exact: Lean writes out the mass of one outcome under the equal-share distribution as the reciprocal of how many possible outcomes there are.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8acecb93253d · pair key b5f194cfc4b5.
  2. Definition · main statement · Classical definition

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    The theory of chance consists in reducing all the events of the same kind to a certain number of cases equally possible, that is to say, to such as we may be equally undecided about in regard to their existence, and in determining the number of cases favorable to the event whose probability is sought. The ratio of this number to that of all the cases possible is the measure of this probability, which is thus simply a fraction whose numerator is the number of favorable cases and whose denominator is the number of all the cases possible.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.uniformOn_apply_finset close match

    theorem ProbabilityTheory.uniformOn_apply_finset {Ω : Type*} [MeasurableSpace Ω] [MeasurableSingletonClass Ω] [DecidableEq Ω] {s t : Finset Ω} : (ProbabilityTheory.uniformOn ↑s) ↑t = ↑(s ∩ t).card / ↑s.card

    Mathlib.Probability.UniformOn · lines 107–109

    Why close, not exact: Lean names the favourable cases as the intersection of the two finsets and divides the counts; with no possible cases at all the quotient takes Lean's zero default, a situation the passage's reduction to equally possible cases never produces.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d03b8356565a · pair key 7eb3e42a31de.

    MeasureTheory.Measure.uniformOfFinset_apply close match

    theorem MeasureTheory.Measure.uniformOfFinset_apply {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (t : Set α) : (MeasureTheory.Measure.uniformOfFinset s) t = ↑{x ∈ s | x ∈ t}.card / ↑s.card

    Mathlib.Probability.Distributions.Uniform · lines 250–258

    Why close, not exact: Lean selects the favourable cases by filtering the finset of possible cases against the event and divides the two counts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8c53c22022a2 · pair key 5db20d8d6e48.

    TauCeti.Probability.uniformOn_toReal close match

    theorem TauCeti.Probability.uniformOn_toReal {Ω : Type*} [Finite Ω] [MeasurableSpace Ω] [MeasurableSingletonClass Ω] (S T : Set Ω) : ((ProbabilityTheory.uniformOn S) T).toReal = ↑(Nat.card { x // x ∈ S ∩ T }) / ↑(Nat.card { x // x ∈ S })

    TauCeti.Probability.UniformSampling · lines 103–120

    Why close, not exact: Lean reads the quotient as an ordinary real number through toReal and counts the two collections with Nat.card of the corresponding subtypes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key b9387fd21b2d · pair key 2c1735b1c568.
  3. Definition · main statement · Classical definition

    Partial

    Partial: Mathlib states this up to a convention difference, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.

    This can be represented mathematically as follows: If a random experiment can result in N mutually exclusive and equally likely outcomes and if NA of these outcomes result in the occurrence of the event A, the probability of A is defined by P(A) = NA/N.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.uniformOn_univ close match

    theorem ProbabilityTheory.uniformOn_univ {Ω : Type*} [MeasurableSpace Ω] [Fintype Ω] {s : Set Ω} : (ProbabilityTheory.uniformOn Set.univ) s = MeasureTheory.Measure.count s / ↑(Fintype.card Ω)

    Mathlib.Probability.UniformOn · lines 81–83

    Why close, not exact: Lean writes the numerator as the counting measure of the event and the denominator as the cardinality of the outcome type, matching the two counts of the passage's formula.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0be8cc7f4f71 · pair key edb0822ac13c.

    ProbabilityTheory.uniformOn_apply_finset close match

    theorem ProbabilityTheory.uniformOn_apply_finset {Ω : Type*} [MeasurableSpace Ω] [MeasurableSingletonClass Ω] [DecidableEq Ω] {s t : Finset Ω} : (ProbabilityTheory.uniformOn ↑s) ↑t = ↑(s ∩ t).card / ↑s.card

    Mathlib.Probability.UniformOn · lines 107–109

    Why close, not exact: Lean writes the favourable outcomes as the intersection of the two finsets and divides the counts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a2ffc91d1a3f · pair key 7cf352e72925.

    MeasureTheory.Measure.uniformOfFinset_apply close match

    theorem MeasureTheory.Measure.uniformOfFinset_apply {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (t : Set α) : (MeasureTheory.Measure.uniformOfFinset s) t = ↑{x ∈ s | x ∈ t}.card / ↑s.card

    Mathlib.Probability.Distributions.Uniform · lines 250–258

    Why close, not exact: Lean picks out the favourable outcomes by filtering the finset of all outcomes against the event and divides the counts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c66ea00bac01 · pair key 4b157d3db3fd.
  4. Theorem · supporting · Classical definition

    Not formalized
    But some important random experiments, such as tossing a coin until it shows heads, give rise to an infinite set of outcomes.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 837895b97bb0).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  5. Definition · main statement · Frequentism

    Not formalized
    Frequentists posit that the probability of an event is its relative frequency over time,[1] (3.4) i.e., its relative frequency of occurrence after repeating a process a large number of times under similar conditions.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 2d93573fb5a0).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  6. Example · supporting · Frequentism

    Formalized

    Formalized: Formal Conjectures states a more general result (proved).

    In the case of tossing a fair coin, frequentists say that the probability of getting a heads is 1/2, not because there are two equally likely outcomes but because repeated series of large numbers of trials demonstrate that the empirical frequency converges to the limit 1/2 as the number of trials goes to infinity.

    Show in article · Read it in context on Wikipedia

    Erdos521.fairCoin_apply more general

    theorem Erdos521.fairCoin_apply (b : Bool) : Erdos521.fairCoin {b} = 2⁻¹

    FormalConjectures.ErdosProblems.«521» · lines 44–45

    Why more general: Lean states the value for each of the two faces of the coin, and the passage asks about one of them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key 1a95ec149ceb · pair key 0be6caefcf85.

    MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem more general

    theorem MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} {a : α} : a ∈ s → (MeasureTheory.Measure.uniformOfFinset s) {a} = (↑s.card)⁻¹

    Mathlib.Probability.Distributions.Uniform · lines 226–228

    Why more general: Lean states the mass of one outcome under the equal-share distribution on a finite set of outcomes, which for the two faces of a coin is one half.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ce9b1d7987bd · pair key 0953e706c181.
  7. Theorem · supporting · Frequentism

    Formalized

    Formalized: Mathlib states a more general result (proved).

    In the case of tossing a fair coin, frequentists say that the probability of getting a heads is 1/2, not because there are two equally likely outcomes but because repeated series of large numbers of trials demonstrate that the empirical frequency converges to the limit 1/2 as the number of trials goes to infinity.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.strong_law_ae_real more general

    theorem ProbabilityTheory.strong_law_ae_real {Ω : Type*} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} (X : ℕ → Ω → ℝ) : MeasureTheory.Integrable (X 0) μ → Pairwise (Function.onFun (fun x1 x2 ↦ ProbabilityTheory.IndepFun x1 x2 μ) X) → (∀ (i : ℕ), ProbabilityTheory.IdentDistrib (X i) (X 0) μ μ) → ∀ᵐ (ω : Ω) ∂μ, Filter.Tendsto (fun n ↦ (∑ i ∈ Finset.range n, X i ω) / ↑n) Filter.atTop (𝓝 (∫ (x : Ω), X 0 x ∂μ))

    Mathlib.Probability.StrongLaw · lines 598–631

    Why more general: Lean gives the limit as the common mean of the tosses rather than writing the number one half; for the indicator of heads under a fair coin that mean is the chance of heads. Lean's conclusion also holds only outside a null set of runs, a refinement of the passage's claim about long series.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d3a8c94b40f9 · pair key 4fa1748f2d99.

    TauCeti.Probability.strong_law_ae_infinitePi more general

    theorem TauCeti.Probability.strong_law_ae_infinitePi {α : Type*} [MeasurableSpace α] {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] [MeasurableSpace E] [BorelSpace E] (Q : MeasureTheory.Measure α) [MeasureTheory.IsProbabilityMeasure Q] {f : α → E} : Measurable f → MeasureTheory.Integrable f Q → ∀ᵐ (x : ℕ → α) ∂MeasureTheory.Measure.infinitePi fun x ↦ Q, Filter.Tendsto (fun n ↦ (↑n)⁻¹ • ∑ i ∈ Finset.range n, f (x i)) Filter.atTop (𝓝 (∫ (y : α), f y ∂Q))

    TauCeti.Probability.StrongLaw · lines 75–100

    Why more general: Lean works on the canonical model of repeated independent trials, the infinite product of one law, which is precisely the series of tosses the passage describes, and its conclusion holds outside a null set of runs.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 62b69ee9b27b · pair key dd92087973d1.
  8. Definition · main statement · Frequentism

    Not formalized
    If we denote by na the number of occurrences of an event 𝒜 in n trials, then if limn → +∞ na/n = p we say that P(𝒜) = p.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt d3a4fa028249).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  9. Theorem · main statement · Subjectivism

    Not formalized
    Bayesians point to the work of Ramsey[10] (p 182) and de Finetti[8] (p 103) as proving that subjective beliefs must follow the laws of probability if they are to be coherent (rational).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt 4340c731b62f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  10. Theorem · main statement · Propensity

    Partial

    Partial: TauCeti states part of this (proved).

    This law, which is a consequence of the axioms of probability, says that if (for example) a coin is tossed repeatedly many times, in such a way that its probability of landing heads is the same on each toss, and the outcomes are probabilistically independent, then the relative frequency of heads will be close to the probability of heads on each single toss.

    Show in article · Read it in context on Wikipedia

    TauCeti.Probability.strong_law_ae_infinitePi states part

    theorem TauCeti.Probability.strong_law_ae_infinitePi {α : Type*} [MeasurableSpace α] {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] [MeasurableSpace E] [BorelSpace E] (Q : MeasureTheory.Measure α) [MeasureTheory.IsProbabilityMeasure Q] {f : α → E} : Measurable f → MeasureTheory.Integrable f Q → ∀ᵐ (x : ℕ → α) ∂MeasureTheory.Measure.infinitePi fun x ↦ Q, Filter.Tendsto (fun n ↦ (↑n)⁻¹ • ∑ i ∈ Finset.range n, f (x i)) Filter.atTop (𝓝 (∫ (y : α), f y ∂Q))

    TauCeti.Probability.StrongLaw · lines 75–100

    Why only part: It gives almost-sure convergence of the frequency; it does not say where the law itself comes from.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key a3306a213cd0 · pair key 6fc202c1d3fd.

    ProbabilityTheory.strong_law_ae_real states part

    theorem ProbabilityTheory.strong_law_ae_real {Ω : Type*} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} (X : ℕ → Ω → ℝ) : MeasureTheory.Integrable (X 0) μ → Pairwise (Function.onFun (fun x1 x2 ↦ ProbabilityTheory.IndepFun x1 x2 μ) X) → (∀ (i : ℕ), ProbabilityTheory.IdentDistrib (X i) (X 0) μ μ) → ∀ᵐ (ω : Ω) ∂μ, Filter.Tendsto (fun n ↦ (∑ i ∈ Finset.range n, X i ω) / ↑n) Filter.atTop (𝓝 (∫ (x : Ω), X 0 x ∂μ))

    Mathlib.Probability.StrongLaw · lines 598–631

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 35ec8d1c2179 · pair key 3637a2864599.
  11. Definition · supporting · Propensity

    Not formalized
    To say that a set of generating conditions has propensity p of producing the outcome E means that those exact conditions, if repeated indefinitely, would produce an outcome sequence in which E occurred with limiting relative frequency p.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt a0f25900a7bd).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  12. Theorem · supporting · Propensity

    Not formalized
    For Popper then, a deterministic experiment would have propensity 0 or 1 for each outcome, since those generating conditions would have same outcome on each trial. In other words, non-trivial propensities (those that differ from 0 and 1) only exist for genuinely nondeterministic experiments.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 27266138a9f8).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  13. Theorem · supporting · Propensity

    Not formalized
    One central property of chance is that, when known, it constrains rational belief to take the same numerical value. David Lewis called this the Principal Principle,[1] (3.3 & 3.5) a term that philosophers have mostly adopted. For example, suppose you are certain that a particular biased coin has propensity 0.32 to land heads every time it is tossed. What is then the correct price for a gamble that pays $1 if the coin lands heads, and nothing otherwise?

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 627116b3f9ec).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  14. Theorem · supporting · Propensity

    Not formalized
    According to the Principal Principle, the fair price is 32 cents.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 8e9da5b04ecd).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).

Data: view model (JSON) · Literature Links records (JSONL)