WikiLean · Articles Articles Brain Contribute About

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

Randomness

35 passages10 formalized7 partial18 not formalized

Statement only

More ways to filter
Library
About this page

This page

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

Central statements: 18 of the 35 passages state the article's subject or a named result or definition; the other 17 are supporting (examples, setup). Of these 18: 2 formalized, 6 partial, 10 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 (12 locations and 10 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): 13 of 18 locations and 2 of 8 absences. In all, 25 of 30 Lean locations (83%) and 12 of 18 absences (67%) were re-checked.
  • Passage text: 35 of 35 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 1380359759 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 · Subject of the article

    Not formalized
    In common usage, randomness is the apparent or actual lack of definite patterns or predictability in information.[1][2]

    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 3ac2c06aa85f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  2. Theorem · main statement

    Partial

    Partial: ATLAS (atlas-lean) states part of this (proved).

    Individual random events are, by definition, unpredictable, but if there is a known probability distribution, the frequency of different outcomes over repeated events (or "trials") is predictable.[note 1]

    Show in article · Read it in context on Wikipedia

    MathlibExt.Probability.Statistics.GlivenkoCantelliWanted.glivenko_cantelli states part

    theorem MathlibExt.Probability.Statistics.GlivenkoCantelliWanted.glivenko_cantelli {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure P] (X : ℕ → Ω → ℝ) : (∀ (n : ℕ), Measurable (X n)) → ProbabilityTheory.iIndepFun X P → (∀ (i : ℕ), ProbabilityTheory.IdentDistrib (X i) (X 0) P P) → ∀ᵐ (ω : Ω) ∂P, ∀ ε > 0, ∃ N, ∀ n ≥ N, ∀ (x : ℝ), |↑(MathlibExt.Probability.Statistics.GlivenkoCantelliWanted.empiricalCount X n ω x) / ↑(n + 1) - (P (X 0 ⁻¹' Set.Iic x)).toReal| < ε

    MathlibExt.Probability.Statistics.GlivenkoCantelli · line 318

    Why only part: The declaration is set for real-valued trials and for the events below a threshold, and it delivers closeness of the observed shares to the known values that holds at every threshold at once.

    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 64c2773.
    • Location key bbe04576859c · pair key ebc90731efc6.
  3. Example · supporting

    Partial

    Partial: TauCeti states part of this (proved).

    For example, when throwing two dice, the outcome of any particular roll is unpredictable, but a sum of 7 will tend to occur twice as often as 4.

    Show in article · Read it in context on Wikipedia

    TauCeti.Probability.uniformOn_toReal states part

    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 only part: Six of the thirty-six ordered rolls total seven and three of them total four, so the first total comes up at twice the rate of the second.

    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.
    • 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).
    • 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 d23d35613aee · pair key af7e02b32fe0.
  4. Definition · main statement

    Partial

    Partial: Mathlib states a special case (a definition).

    In statistics, a random variable is an assignment of a numerical value to each possible outcome of an event space.

    Show in article · Read it in context on Wikipedia

    MeasureTheory.SimpleFunc special case

    structure MeasureTheory.SimpleFunc (α : Type u) [MeasurableSpace α] : Type v → Type (max u v)

    Mathlib.MeasureTheory.Function.SimpleFunc · lines 47–51

    Why a special case: The universe carries no bundled notion of a random variable in general, since variables there are plain functions on the outcome space; this structure is that data confined to finitely many values with measurable fibres.

    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 bcd3611892b8 · pair key 6bb1840cbfbc.
  5. Definition · main statement

    Not formalized
    A random process is a sequence of random variables whose outcomes do not follow a deterministic pattern, but follow an evolution described by probability distributions.

    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 3dfb600c3b24).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  6. Definition · main statement

    Formalized

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

    Random selection, when narrowly associated with a simple random sample, is a method of selecting items (often called units) from a population where the probability of choosing a specific item is the proportion of those items in the population.

    Show in article · Read it in context on Wikipedia

    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: The library writes the chance as a real-valued ratio of the number of selected items to the size of the population, the share the passage names.

    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 ddbfad43af5d · pair key 47b1a24ef64c.

    ProbabilityTheory.uniformOn more general

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

    Mathlib.Probability.UniformOn · lines 58–60

    Why more general: Mathlib defines this for an arbitrary set in an arbitrary measurable space, so it also covers populations that are infinite, where the passage's shares make no sense.

    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 7382c8b9c5b7 · pair key c1caed54fc82.
  7. Example · supporting

    Formalized

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

    For example, with a bowl containing just 10 red marbles and 90 blue marbles, a random selection mechanism would choose a red marble with probability 1/10.

    Show in article · Read it in context on Wikipedia

    TauCeti.Probability.uniformOn_toReal more general

    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 more general: The two counts, ten red marbles and a hundred marbles in all, are the only inputs the equation takes.

    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 131007515571 · pair key 5649d8e67f67.

    ProbabilityTheory.uniformOn_univ more general

    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 more general: Mathlib states the mass with the counting measure divided by the number of marbles in the bowl.

    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 a12191f35f1c · pair key f26848ddde0c.
  8. Theorem · supporting

    Not formalized
    A random selection mechanism that selected 10 marbles from this bowl would not necessarily result in 1 red and 9 blue.

    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 3 queries and 0 candidates examined (receipt 1f76a551765c).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  9. Definition · supporting

    Formalized

    Formalized, by a community edit: Mathlib states this up to a convention difference (a definition).

    In situations where a population consists of items that are distinguishable, a random selection mechanism requires equal probabilities for any item to be chosen.

    Show in article · Read it in context on Wikipedia

    MeasureTheory.Measure.uniformOfFinset close match

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

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

    Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why close, not exact: The passage calls a selection random when every item of the population has the same probability. Mathlib's uniformOfFinset builds that law on a finite population, giving each listed item weight one over the number of items. Differences: Mathlib constructs the one equal-probability measure instead of stating a property of a selection process, gives weight zero outside the population, and is the zero measure on an empty finset.

    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 3e0daf327ade · pair key eecf4ace8751.

    MeasureTheory.Measure.uniformOfFinset_apply_singleton close match

    theorem MeasureTheory.Measure.uniformOfFinset_apply_singleton {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (a : α) : (MeasureTheory.Measure.uniformOfFinset s) {a} = if a ∈ s then (↑s.card)⁻¹ else 0

    Mathlib.Probability.Distributions.Uniform · lines 212–221

    Why close, not exact: The lemma writes out the value the selection law takes on one item as the reciprocal of the number of items, which is the defining formula behind the passage's wording.

    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 cbab98a902e1 · pair key 6c381f3f12db.

    ProbabilityTheory.uniformOn more general

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

    Mathlib.Probability.UniformOn · lines 58–60

    Why more general: Mathlib conditions the counting measure on an arbitrary set, so the construction reaches populations of any size, the passage's finite one among 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 3 for this passage, medium confidence.
    • 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).
    • 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 f1863ec9012e · pair key f8f498675108.
  10. Definition · supporting

    Formalized

    Formalized, by a community edit: Mathlib states this up to a convention difference (a definition).

    That is, if the selection process is such that each member of a population, say research subjects, has the same probability of being chosen, then we can say the selection process is random.

    Show in article · Read it in context on Wikipedia

    MeasureTheory.Measure.uniformOfFinset close match

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

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

    Community Agent The pipeline said exact match; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why close, not exact: The passage calls a selection process random when each member of the population, such as research subjects, has the same probability of being chosen. Mathlib's uniformOfFinset builds that law, giving each member weight one over the population size. Differences: it constructs the one equal-probability measure instead of stating a property of a process, gives weight zero to non-members, and is the zero measure on an empty finset.

    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 8ee43ef572ea · pair key 36c39a1fe69a.

    MeasureTheory.Measure.uniformOfFinset_apply_singleton close match

    theorem MeasureTheory.Measure.uniformOfFinset_apply_singleton {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (a : α) : (MeasureTheory.Measure.uniformOfFinset s) {a} = if a ∈ s then (↑s.card)⁻¹ else 0

    Mathlib.Probability.Distributions.Uniform · lines 212–221

    Why close, not exact: The lemma unfolds the value of the selection law at a single member into the reciprocal of the member count, the formula behind the passage's phrase.

    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 10b92941b0fa · pair key 43ea466d024a.

    ProbabilityTheory.uniformOn more general

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

    Mathlib.Probability.UniformOn · lines 58–60

    Why more general: Mathlib defines this by conditioning the counting measure on an arbitrary set, so it reaches populations of every size.

    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.
    • 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).
    • 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 b1d5a123152d · pair key 15b046f860fc.
  11. Theorem · main statement

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    According to Ramsey theory, pure randomness (in the sense of there being no discernible pattern) is impossible, especially for large structures.

    Show in article · Read it in context on Wikipedia

    MathlibExt.Combinatorics.Ramsey.ramsey_two_uniform special case

    theorem MathlibExt.Combinatorics.Ramsey.ramsey_two_uniform {r k : ℕ} : 0 < r → ∃ N, ∀ (φ : Finset (Fin N) → Fin r), ∃ S, S.card = k ∧ ∃ c, ∀ T ∈ Finset.powersetCard 2 S, φ T = c

    MathlibExt.Combinatorics.Ramsey · line 298

    Why a special case: This is the finite theorem of Ramsey for pairs, the result the passage is appealing to, stated for one family of structures rather than for structures at large.

    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 64c2773.
    • Location key 1a63340f1672 · pair key 885600a473c9.

    MetaMathlibExt.schur_ramsey special case

    theorem MetaMathlibExt.schur_ramsey (r : ℕ) : 1 ≤ r → ∃ S, ∀ (c : ℕ → Fin r), ∃ x y z, x ∈ Finset.Icc 1 S ∧ y ∈ Finset.Icc 1 S ∧ z ∈ Finset.Icc 1 S ∧ c x = c y ∧ c x = c z ∧ x + y = z

    MathlibExt.Combinatorics.SchurRamsey · line 40

    Why a special case: Schur's theorem is a second instance of the same phenomenon, stated for additive structure on a stretch of integers rather than for structures at large.

    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, low 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 64c2773.
    • Location key 6b51bbca5810 · pair key 2796376d3fea.
  12. Theorem · main statement

    Not formalized
    It can be proven that there is infinite hierarchy (in terms of quality or strength) of forms of randomness.

    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 cf18bdd635b5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  13. Definition · main statement · In science › In mathematics

    Not formalized
    The central idea is that a string of bits is random if and only if it is shorter than any computer program that can produce that string (Kolmogorov randomness), which means that random strings are those that cannot be compressed.

    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 2641dcb2fd3b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  14. Definition · main statement · In science › In mathematics

    Not formalized
    For the notion of infinite sequence, mathematicians generally accept Per Martin-Löf's semi-eponymous definition: An infinite sequence is random if and only if it withstands all recursively enumerable null sets.

    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 45c421b589f5).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  15. Definition · supporting · In science › In mathematics

    Not formalized
    The other notions of random sequences include, among others, recursive randomness and Schnorr randomness, which are based on recursively computable martingales.

    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 64c2cb810e05).
    • 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).
  16. Definition · supporting · In science › In mathematics

    Not formalized
    The other notions of random sequences include, among others, recursive randomness and Schnorr randomness, which are based on recursively computable martingales.

    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 3ff24aed9469).
    • 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).
  17. Theorem · main statement · In science › In mathematics

    Not formalized
    It was shown by Yongge Wang that these randomness notions are generally different.

    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 e05cfa54221c).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  18. Theorem · supporting · In science › In mathematics

    Formalized

    With community edits: Formalized. As published it is Partial.

    Formalized, by a community edit: Mathlib states this up to a convention difference (proved).

    The decimal digits of pi constitute an infinite sequence and "never repeat in a cyclical fashion." Numbers like pi are also considered likely to be normal:

    Show in article · Read it in context on Wikipedia

    irrational_pi close match

    theorem irrational_pi : Irrational π

    Mathlib.Analysis.Real.Pi.Irrational · lines 282–310

    Community Agent The pipeline said states part; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why close, not exact: irrational_pi states that pi is irrational. The passage states the equivalent claim in terms of digits: pi's decimal expansion is infinite and never settles into a repeating cycle. The difference is one of encoding: a real number is rational exactly when its decimal expansion terminates or is eventually periodic. Mathlib states the property with the predicate Irrational, not with digits.

    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.
    • 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).
    • 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 c5463961f5b6 · pair key ba38de439f4d.
  19. Conjecture · main statement · In science › In mathematics

    Partial

    Partial: Formal Conjectures states a special case (statement only: the proof is not finished).

    The decimal digits of pi constitute an infinite sequence and "never repeat in a cyclical fashion." Numbers like pi are also considered likely to be normal:

    Show in article · Read it in context on Wikipedia

    NormalNumber.pi_normal_base_ten special case

    theorem NormalNumber.pi_normal_base_ten : NormalNumber.IsNormalInBase 10 π

    FormalConjectures.Wikipedia.NormalityOfPi · lines 43–44

    Why a special case: The library fixes the base at ten, where the passage speaks of normality without naming a base.

    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 d9b2202f9d6f · pair key b9e6212e6c80.
  20. Theorem · supporting · In science › In mathematics

    Not formalized
    In the first six billion decimal places of pi, each of the digits from 0 through 9 shows up about six hundred million times.

    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 3 queries and 2 candidates examined (receipt 110122a0311d).
    • 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).
  21. Definition · main statement · In science › In information science

    Partial

    With community edits: Partial. As published it is Formalized.

    Partial, by a community edit: Mathlib states a special case (a definition).

    In terms of the development of random networks, for communication randomness rests on the two simple assumptions of Paul Erdős and Alfréd Rényi, who said that there were a fixed number of nodes and this number remained fixed for the life of the network, and that all nodes were equal and linked randomly to each other.[clarification needed]

    Show in article · Read it in context on Wikipedia

    SimpleGraph.binomialRandom special case

    def SimpleGraph.binomialRandom (V : Type*) : ↑unitInterval → MeasureTheory.Measure (SimpleGraph V)

    Mathlib.Probability.Combinatorics.BinomialRandomGraph.Defs · lines 47–48

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why a special case: binomialRandom is the binomial random graph G(V, p): each pair of nodes is linked independently with one fixed probability p. That is one random network meeting the passage's two assumptions (a fixed node set, all nodes alike and randomly linked), not a generalization of them. The Mathlib docstring also says Erdős and Rényi's own model was a different one, so this is a special case of the passage.

    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 00f2b132ccfa · pair key 929355f054bd.

    ShelahSpencerZeroOneLaw.sparseRandomGraph special case

    def ShelahSpencerZeroOneLaw.sparseRandomGraph (n : ℕ) (α : ℝ) : 0 < α → MeasureTheory.Measure (SimpleGraph (Fin n))

    FormalConjectures.Paper.ShelahSpencerZeroOneLaw · lines 52–54

    Why a special case: The node set is the finite type of size n, so the number of nodes is fixed, and the link chance is tied to n rather than left free.

    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 e754a78.
    • Location key bb031659791a · pair key 191e015efd17.
  22. Definition · main statement · In science › In finance

    Partial

    Partial: Mathlib states part of this (a Prop-valued definition: it states the claim without proving it).

    The random walk hypothesis considers that asset prices in an organized market evolve at random, in the sense that the expected value of their change is zero but the actual value may turn out to be positive or negative.

    Show in article · Read it in context on Wikipedia

    MeasureTheory.Martingale states part

    def MeasureTheory.Martingale {Ω : Type*} {E : Type*} {ι : Type*} [Preorder ι] {m0 : MeasurableSpace Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] : (ι → Ω → E) → MeasureTheory.Filtration ι m0 → MeasureTheory.Measure Ω → Prop

    Mathlib.Probability.Martingale.Basic · lines 53–54

    Why only part: The library states the condition for a family valued in any real normed space over an arbitrary ordered index, where the passage has one real price moving over trading dates.

    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 c2b69f2d4073 · pair key 6dd499bf87da.
  23. Theorem · main statement · Misconceptions and logical fallacies › Fallacy: a number is "due"

    Not formalized
    This argument is, "In a random selection of numbers, since all numbers eventually appear, those that have not come up yet are 'due', and thus more likely to come up soon." This logic is only correct if applied to a system where numbers that come up are removed from the system, such as when playing cards are drawn and not returned to the deck.

    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 3 queries and 2 candidates examined (receipt f1ea2ca930b9).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  24. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: a number is "due"

    Not formalized
    In this case, once a jack is removed from the deck, the next draw is less likely to be a jack and more likely to be some other card.

    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 3 queries and 2 candidates examined (receipt 5a59e2fdf614).
    • 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).
  25. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: a number is "due"

    Formalized

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

    However, if the jack is returned to the deck, and the deck is thoroughly reshuffled, a jack is as likely to be drawn as any other card.

    Show in article · Read it in context on Wikipedia

    MeasureTheory.Measure.uniformOfFinset_apply_singleton more general

    theorem MeasureTheory.Measure.uniformOfFinset_apply_singleton {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (a : α) : (MeasureTheory.Measure.uniformOfFinset s) {a} = if a ∈ s then (↑s.card)⁻¹ else 0

    Mathlib.Probability.Distributions.Uniform · lines 212–221

    Why more general: It is stated for an arbitrary finite outcome set, so a deck of cards is one of many uniform draws it answers for.

    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 81eacff7278e · pair key 5da74b641ba8.

    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: This is the membership form of the same uniform mass, stated for any finite outcome set rather than for playing cards.

    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 90dfd25c0e54 · pair key c43e39cff839.
  26. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: a number is "due"

    Formalized

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

    The same applies in any other process where objects are selected independently, and none are removed after each event, such as the roll of a die, a coin toss, or most lottery number selection schemes.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq more general

    theorem ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq {Ω : Type*} {m0 : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {ι : Type*} [LinearOrder ι] {i j : ι} {s : ι → Set Ω} (hsm : ∀ (n : ι), MeasurableSet (s n)) : ProbabilityTheory.iIndepSet s μ → i < j → μ[(s j).indicator fun x ↦ 1 | ↑(MeasureTheory.filtrationOfSet hsm) i] =ᵐ[μ] fun x ↦ μ.real (s j)

    Mathlib.Probability.BorelCantelli · lines 58–64

    Why more general: The lemma is stated for an arbitrary independent family over any linear index order, and repeated dice, coins and lottery draws are instances of that.

    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 e39bcc6b7d39 · pair key 9515da0f79d2.

    MeasureTheory.condExp_indep_eq more general

    theorem MeasureTheory.condExp_indep_eq {Ω : Type*} {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {m₁ m₂ m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {f : Ω → E} : m₁ ≤ m → ∀ (hle₂ : m₂ ≤ m) [MeasureTheory.SigmaFinite (μ.trim hle₂)], MeasureTheory.StronglyMeasurable f → ProbabilityTheory.Indep m₁ m₂ μ → μ[f | m₂] =ᵐ[μ] fun x ↦ ∫ (x : Ω), f x ∂μ

    Mathlib.Probability.ConditionalExpectation · lines 41–71

    Why more general: It covers any pair of independent sub-algebras and any integrable target, of which one later draw against the earlier draws is a case.

    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 09dc3b465871 · pair key 63333f23c59f.
  27. Theorem · main statement · Misconceptions and logical fallacies › Fallacy: a number is "due"

    Formalized

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

    Truly random processes such as these do not have memory, which makes it impossible for past outcomes to affect future outcomes.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq more general

    theorem ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq {Ω : Type*} {m0 : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {ι : Type*} [LinearOrder ι] {i j : ι} {s : ι → Set Ω} (hsm : ∀ (n : ι), MeasurableSet (s n)) : ProbabilityTheory.iIndepSet s μ → i < j → μ[(s j).indicator fun x ↦ 1 | ↑(MeasureTheory.filtrationOfSet hsm) i] =ᵐ[μ] fun x ↦ μ.real (s j)

    Mathlib.Probability.BorelCantelli · lines 58–64

    Why more general: Stated for any independent family over any linear index order, so it answers for the repeated draws the passage has in mind among others.

    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 2fff642757ba · pair key 7e446958e079.

    MeasureTheory.condExp_indep_eq more general

    theorem MeasureTheory.condExp_indep_eq {Ω : Type*} {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {m₁ m₂ m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {f : Ω → E} : m₁ ≤ m → ∀ (hle₂ : m₂ ≤ m) [MeasureTheory.SigmaFinite (μ.trim hle₂)], MeasureTheory.StronglyMeasurable f → ProbabilityTheory.Indep m₁ m₂ μ → μ[f | m₂] =ᵐ[μ] fun x ↦ ∫ (x : Ω), f x ∂μ

    Mathlib.Probability.ConditionalExpectation · lines 41–71

    Why more general: It is a statement about any two independent sub-algebras, with past against future as one reading.

    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 124659bff85d · pair key e1240fe6ce22.
  28. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: a number is "due"

    Not formalized
    In fact, there is no finite number of trials that can guarantee success.

    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 8cf26670aae6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  29. Theorem · main statement · Misconceptions and logical fallacies › Fallacy: a number is "cursed" or "blessed"

    Not formalized
    This logic is valid only if the randomisation might be biased, for example if a die is suspected to be loaded then its failure to roll enough sixes would be evidence of that loading.

    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 24814b72ec2b).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  30. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: a number is "cursed" or "blessed"

    Formalized

    Formalized, by a community edit: Mathlib states a special case (proved).

    If the die is known to be fair, then previous rolls can give no indication of future events.

    Show in article · Read it in context on Wikipedia

    ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq special case

    theorem ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq {Ω : Type*} {m0 : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {ι : Type*} [LinearOrder ι] {i j : ι} {s : ι → Set Ω} (hsm : ∀ (n : ι), MeasurableSet (s n)) : ProbabilityTheory.iIndepSet s μ → i < j → μ[(s j).indicator fun x ↦ 1 | ↑(MeasureTheory.filtrationOfSet hsm) i] =ᵐ[μ] fun x ↦ μ.real (s j)

    Mathlib.Probability.BorelCantelli · lines 58–64

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why a special case: This lemma conditions only on whether one chosen event happened at each earlier step (the filtration generated by single sets), for example whether each earlier roll was a six. It does not condition on the full values of earlier rolls, so it is a special case of the passage. Mathlib's random-variable form is iIndepFun.condExp_natural_ae_eq_of_lt.

    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 3965aa320ea7 · pair key bb845ecae037.

    MeasureTheory.condExp_indep_eq more general

    theorem MeasureTheory.condExp_indep_eq {Ω : Type*} {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {m₁ m₂ m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {f : Ω → E} : m₁ ≤ m → ∀ (hle₂ : m₂ ≤ m) [MeasureTheory.SigmaFinite (μ.trim hle₂)], MeasureTheory.StronglyMeasurable f → ProbabilityTheory.Indep m₁ m₂ μ → μ[f | m₂] =ᵐ[μ] fun x ↦ ∫ (x : Ω), f x ∂μ

    Mathlib.Probability.ConditionalExpectation · lines 41–71

    Why more general: It is stated for any independent pair of sub-algebras and any integrable target, with the rolls already made against the rolls to come as one reading.

    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 7d93f2d229be · pair key ba8a42a76f9d.
  31. Theorem · main statement · Misconceptions and logical fallacies › Fallacy: odds are never dynamic

    Not formalized
    For example, when being told that a woman has two children, one might be interested in knowing if either of them is a girl, and if yes, the probability that the other child is also a girl. Considering the two events independently, one might expect that the probability that the other child is female is ½ (50%), but by building a probability space illustrating all possible outcomes, one would notice that the probability is actually only ⅓ (33%).

    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 8945d81f03a0).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  32. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: odds are never dynamic

    Formalized

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

    To be sure, the probability space does illustrate four ways of having these two children: boy-boy, girl-boy, boy-girl, and girl-girl.

    Show in article · Read it in context on Wikipedia

    Fintype.card_prod more general

    theorem Fintype.card_prod (α : Type*) (β : Type*) [Fintype α] [Fintype β] : Fintype.card (α × β) = Fintype.card α * Fintype.card β

    Mathlib.Data.Fintype.Prod · lines 56–58

    Why more general: The lemma counts the pairs drawn from any two finite outcome sets, the two-children space being the case where each side has two values.

    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, low 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 9a0f1ee2d638 · pair key 0b1cdced9737.
  33. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: odds are never dynamic

    Not formalized
    But once it is known that at least one of the children is female, this rules out the boy-boy scenario, leaving only three ways of having the two children: boy-girl, girl-boy, girl-girl.

    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 12331154d0ac).
    • 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).
  34. Theorem · supporting · Misconceptions and logical fallacies › Fallacy: odds are never dynamic

    Not formalized
    From this, it can be seen only ⅓ of these scenarios would have the other child also be a girl[28] (see Boy or girl paradox for more).

    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 85c418e539dd).
    • 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).
  35. Theorem · main statement · Misconceptions and logical fallacies › Fallacy: odds are never dynamic

    Not formalized
    However, an analysis of the probability spaces would reveal that the contestant has received new information, and that changing to the other door would increase their chances of winning.

    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 3 candidates examined (receipt a32ec35203e1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.

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