-
Definition · Subject of the article
✓Formalized
Formalized: TauCeti states this up to a convention difference (a definition).
In statistics, the frequency or absolute frequency of an event i is the number ni of times the observation has occurred or been recorded in an experiment or study.[1]: 12–19
Show in article · Read it in context on Wikipedia ↗
Function.occCount close match
def Function.occCount {X : Type*} {S : Type*} : (X → S) → S → ℕ
TauCeti.Data.Fintype.Fiber · line 44
Why close, not exact: Lean counts the fibre of the record map, so the data are written as a family of trials rather than as a running tally.
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
7b1e9ce12327 · pair key 2809ac49a6d5.
Multiset.count close match
def Multiset.count {α : Type*} [DecidableEq α] : α → Multiset α → ℕ
Mathlib.Data.Multiset.Count · lines 123–124
Why close, not exact: Lean writes the recorded data as a multiset and the frequency as the multiplicity of the event inside it.
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
4d7e9e71d0d2 · pair key 261fc3f6cfdb.
List.count close match
def List.count {α : Type u} [BEq α] : α → List α → Nat
Init.Data.List.Basic · line 1812
Why close, not exact: Lean takes the record as a list and compares entries with a boolean equality test.
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
c9afcdd. - Location key
e0fc47a342e2 · pair key 8c0c03f42159.
Sign in to tag this passage
-
Definition · main statement
✓Formalized
Formalized: TauCeti states this up to a convention difference (a definition).
The relative frequency is the ratio of absolute frequency to the sample size.
Show in article · Read it in context on Wikipedia ↗
TauCeti.Probability.empiricalMeasureOfFintype close match
def TauCeti.Probability.empiricalMeasureOfFintype {α : Type*} [MeasurableSpace α] {κ : Type*} [Fintype κ] [Nonempty κ] : (κ → α) → MeasureTheory.ProbabilityMeasure α
TauCeti.Probability.Process.EmpiricalMeasure · lines 55–60
Why close, not exact: Lean packages the ratio as a probability measure, carrying its additivity and unit total mass along with the value.
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
83245ab. - Location key
096b4e0d67f2 · pair key d88ae69b50d5.
TauCeti.Probability.empiricalMeasure_apply close match
theorem TauCeti.Probability.empiricalMeasure_apply {α : Type*} [MeasurableSpace α] {x : ℕ → α} {n : ℕ} {s : Set α} : MeasurableSet s → ↑(TauCeti.Probability.empiricalMeasure x n) s = (↑(n + 1))⁻¹ * ∑ i ∈ Finset.range (n + 1), s.indicator 1 (x i)
TauCeti.Probability.Process.EmpiricalMeasure · lines 164–169
Why close, not exact: Lean spells the value out as a sum of indicators over the first n+1 recordings, scaled by the reciprocal of that sample 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 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
42b7b252acd7 · pair key 12d683e7f772.
Sign in to tag this passage
-
Definition · main statement
✓Formalized
Formalized: Mathlib states a more general result (a definition).
The cumulative frequency is the total of the absolute frequencies of all events at or below a certain point in an ordered list of events.[1]: 17–19
Show in article · Read it in context on Wikipedia ↗
Multiset.countP more general
def Multiset.countP {α : Type*} (p : α → Prop) [DecidablePred p] : Multiset α → ℕ
Mathlib.Data.Multiset.Count · lines 39–40
Why more general: Lean counts with any decidable property of the entries, and lying at or below a point is one such property.
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
df7494400873 · pair key b850512057b2.
List.countP more general
def List.countP {α : Type u} : (α → Bool) → List α → Nat
Init.Data.List.Basic · lines 1796–1800
Why more general: Lean counts the list entries passing a boolean test, of which the comparison against a cut point is one.
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
c9afcdd. - Location key
909f3698ba1c · pair key 5ed3b398d441.
Sign in to tag this passage
-
Definition · main statement · Formulation
✓Formalized
Formalized: TauCeti states this up to a convention difference (a definition).
The relative frequency of an event is the absolute frequency normalized by the total number of events: fi = niN = ni∑j nj.
Show in article · Read it in context on Wikipedia ↗
TauCeti.Probability.empiricalMeasure_apply close match
theorem TauCeti.Probability.empiricalMeasure_apply {α : Type*} [MeasurableSpace α] {x : ℕ → α} {n : ℕ} {s : Set α} : MeasurableSet s → ↑(TauCeti.Probability.empiricalMeasure x n) s = (↑(n + 1))⁻¹ * ∑ i ∈ Finset.range (n + 1), s.indicator 1 (x i)
TauCeti.Probability.Process.EmpiricalMeasure · lines 164–169
Why close, not exact: Lean writes the numerator as a sum of indicators over the recordings and the denominator as their number, which the passage also writes as the sum of all the frequencies.
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
83245ab. - Location key
c136449811ea · pair key c1d20553f30c.
TauCeti.Probability.empiricalMeasureOfFintype close match
def TauCeti.Probability.empiricalMeasureOfFintype {α : Type*} [MeasurableSpace α] {κ : Type*} [Fintype κ] [Nonempty κ] : (κ → α) → MeasureTheory.ProbabilityMeasure α
TauCeti.Probability.Process.EmpiricalMeasure · lines 55–60
Why close, not exact: Lean carries the ratio as a probability measure, so the additivity and the unit total mass travel with the value.
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
02c5d366621a · pair key 1a1ab8b7e4cc.
Related, but states something else
Function.sum_occCount_eq_card related
theorem Function.sum_occCount_eq_card {X : Type*} {S : Type*} [Finite X] (f : X → S) {T : Finset S} : (∀ (x : X), f x ∈ T) → ∑ y ∈ T, Function.occCount f y = Nat.card X
TauCeti.Data.Fintype.Fiber · lines 136–140
How it differs: It supports the passage's second denominator by equating the sum of the frequencies with the number of recordings.
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
83245ab. - Location key
ff0fb08da188 · pair key 23878daf43ba.
Sign in to tag this passage
-
Definition · main statement · Visualization
✓Formalized
Formalized: TauCeti states this up to a convention difference (a definition).
A frequency distribution shows a summarized grouping of data divided into mutually exclusive classes and the number of occurrences in a class.
Show in article · Read it in context on Wikipedia ↗
Function.occCount close match
def Function.occCount {X : Type*} {S : Type*} : (X → S) → S → ℕ
TauCeti.Data.Fintype.Fiber · line 44
Why close, not exact: Lean encodes the division into mutually exclusive classes as the fibres of a classifying map and the distribution as the sizes of those 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
83245ab. - Location key
215cac13c69d · pair key 3119a1f178cf.
Sign in to tag this passage
-
Definition · supporting · Visualization › Construction
✕Not formalized
The ideal number of classes may be determined or estimated by formula: number of classes = C = 1 + 3.3log n (log base 10), or by the square-root choice formula C = √n where n is the total number of observations in the data.
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 6 queries and 2 candidates examined (receipt 15be28e55142). - 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).
Sign in to tag this passage
-
Definition · supporting · Visualization › Construction
◔Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Calculate the range of the data (Range = Max – Min) by finding the minimum and maximum data values.
Show in article · Read it in context on Wikipedia ↗
Real.diam_eq more general
theorem Real.diam_eq {s : Set ℝ} : Bornology.IsBounded s → Metric.diam s = SupSet.sSup s - InfSet.sInf s
Mathlib.Topology.Instances.ENNReal.Lemmas · lines 703–705
Why more general: Lean names the spread the metric diameter and writes the two endpoints as a supremum and an infimum, which a finite nonempty set attains.
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
ae04be59c01a · pair key 0d12a1f0bdfb.
Sign in to tag this passage
-
Definition · supporting · Visualization › Construction
✕Not formalized
Decide the width of the classes, denoted by h and obtained by h = rangenumber of classes (assuming the class intervals are the same for all classes).
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 7c7e989d5e58). - 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).
Sign in to tag this passage
-
Definition · supporting · Visualization › Construction
✕Not formalized
The classes all taken together must cover at least the distance from the lowest value (minimum) in the data to the highest (maximum) value.
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 8982b7949b87). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · main statement · Visualization › Histograms
✕Not formalized
A histogram is a representation of tabulated frequencies, shown as adjacent rectangles or squares (in some of situations), erected over discrete intervals (bins), with an area proportional to the frequency of the observations in the interval.
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 383aa4987e75). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Visualization › Histograms
✕Not formalized
The height of a rectangle is also equal to the frequency density of the interval, i.e., the frequency divided by the width of the interval.
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 7427320a4489). - 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).
Sign in to tag this passage
-
Theorem · supporting · Visualization › Histograms
✕Not formalized
The total area of the histogram is equal to the number of data.
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 5131ded7f69a). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Visualization › Histograms
✕Not formalized
A histogram may also be normalized displaying relative frequencies. It then shows the proportion of cases that fall into each of several categories, with the total area equaling 1.
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 d90325f6ab0f). - 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).
Sign in to tag this passage
-
Definition · supporting · Visualization › Histograms
✕Not formalized
The categories are usually specified as consecutive, non-overlapping intervals of a variable.
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 6b23d691cd98). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · supporting · Visualization › Histograms
✕Not formalized
The categories (intervals) must be adjacent, and often are chosen to be of the same size.[4]
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 7f5a9211f603). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · main statement · Visualization › Bar graphs
✕Not formalized
A bar chart or bar graph is a chart with rectangular bars with lengths proportional to the values that they represent.
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 7389f15dc375). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · main statement · Visualization › Frequency distribution table
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
A frequency distribution table is an arrangement of the values that one or more variables take in a sample.
Show in article · Read it in context on Wikipedia ↗
Multiset.toFinsupp close match
def Multiset.toFinsupp {α : Type*} [DecidableEq α] : Multiset α ≃+ (α →₀ ℕ)
Mathlib.Data.Finsupp.Multiset · lines 135–146
Why close, not exact: The library packages the sample-to-counts correspondence as an additive equivalence whose forward direction assigns each observed value its multiplicity; the inverse and the additivity field are packaging.
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
f313c80884a2 · pair key 18796422625e.
TauCeti.Probability.empiricalMeasureOfFintype close match
def TauCeti.Probability.empiricalMeasureOfFintype {α : Type*} [MeasurableSpace α] {κ : Type*} [Fintype κ] [Nonempty κ] : (κ → α) → MeasureTheory.ProbabilityMeasure α
TauCeti.Probability.Process.EmpiricalMeasure · lines 55–60
Why close, not exact: The library object records each value's share of the sample rather than its raw occurrence count, and reads the sample as a family indexed by a finite type.
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
83245ab. - Location key
e18d9b4d359c · pair key fb58645e3519.
TauCeti.Probability.empiricalMeasure special case
def TauCeti.Probability.empiricalMeasure {α : Type*} [MeasurableSpace α] : (ℕ → α) → ℕ → MeasureTheory.ProbabilityMeasure α
TauCeti.Probability.Process.EmpiricalMeasure · lines 145–146
Why a special case: Its sample is a prefix of an indexed sequence of observations rather than an arbitrary finite collection.
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, 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
83245ab. - Location key
c1000f491317 · pair key 0f51d1377021.
Sign in to tag this passage
-
Definition · supporting · Visualization › Frequency distribution table
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Each entry in the table contains the frequency or count of the occurrences of values within a particular group or interval, and in this way, the table summarizes the distribution of values in the sample.
Show in article · Read it in context on Wikipedia ↗
Multiset.countP close match
def Multiset.countP {α : Type*} (p : α → Prop) [DecidablePred p] : Multiset α → ℕ
Mathlib.Data.Multiset.Count · lines 39–40
Why close, not exact: The library encodes the sample as a multiset of observations and the group as a decidable predicate on values, returning how many observations, counted with repetition, fall in it.
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
ae7a4273a1fd · pair key 05dbfe851625.
Multiset.count special case
def Multiset.count {α : Type*} [DecidableEq α] : α → Multiset α → ℕ
Mathlib.Data.Multiset.Count · lines 123–124
Why a special case: Its group is a single value rather than a group or an interval of 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 2 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
74d2d05c70ce · pair key 5484ad096c82.
Sign in to tag this passage
-
Definition · supporting · Visualization › Frequency distribution table
✓Formalized
Formalized: Mathlib states a more general result (a definition).
A different tabulation scheme aggregates values into bins such that each bin encompasses a range of values.
Show in article · Read it in context on Wikipedia ↗
Multiset.countP more general
def Multiset.countP {α : Type*} (p : α → Prop) [DecidablePred p] : Multiset α → ℕ
Mathlib.Data.Multiset.Count · lines 39–40
Why more general: The library counts the members of a sample satisfying any decidable predicate; a bin's range is one such predicate, and the same count at an equality predicate is the unbinned scheme the passage contrasts with.
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
58f673a4e432 · pair key 7004f6596849.
Cslib.Algorithms.Lean.RangeTree.count special case
def Cslib.Algorithms.Lean.RangeTree.count : Cslib.Algorithms.Lean.RangeTree → ℤ → ℤ → ℕ
CSLibExt.Algorithms.Lean.DataStructures.RangeTree · line 299
Why a special case: Its readings are integers kept in one search structure, so it is the passage's binned count at those particular objects.
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. - 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
64c2773. - Location key
9311f585cb04 · pair key 25c44355fabc.
Sign in to tag this passage
-
Definition · main statement · Visualization › Joint frequency distributions
◔Partial
Partial: Mathlib states part of this (proved).
The total row and total column report the marginal frequencies or marginal distribution, while the body of the table reports the joint frequencies.
Show in article · Read it in context on Wikipedia ↗
MeasureTheory.measure_preimage_fst_singleton_eq_sum states part
theorem MeasureTheory.measure_preimage_fst_singleton_eq_sum {α : Type*} {β : Type*} {m0 : MeasurableSpace α} [MeasurableSingletonClass α] {mβ : MeasurableSpace β} [MeasurableSingletonClass β] [Fintype β] (μ : MeasureTheory.Measure (α × β)) (x : α) : μ (Prod.fst ⁻¹' {x}) = ∑ y, μ {(x, y)}
Mathlib.MeasureTheory.Measure.NullMeasurable · lines 373–375
Why only part: The declaration is stated for an arbitrary measure on a product of two category sets, of which the counted cases of the passage are one; the weight of a fibre is the pushforward along the projection at that value, the marginal frequency under another name.
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
7ff05b1f95f4 · pair key 4f51f32f6ec5.
Related, but states something else
MeasureTheory.Measure.fst related
def MeasureTheory.Measure.fst {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] : MeasureTheory.Measure (α × β) → MeasureTheory.Measure α
Mathlib.MeasureTheory.Measure.Prod · lines 1144–1145
How it differs: It defines the marginal measure of a joint measure as the pushforward along the first projection, the notion the totals of the passage record, but it asserts nothing about the cells of a cross-classification.
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
ab4b3ca37e6c · pair key 80a218c055fb.
Sign in to tag this passage
-
Definition · main statement · Interpretation
◔Partial
Partial: ATLAS (atlas-lean) states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
Under the frequency interpretation of probability, it is assumed that the source is ergodic, i.e., as the length of a series of trials increases without bound, the fraction of experiments in which a given event occurs will approach a fixed value, known as the limiting relative frequency.
Show in article · Read it in context on Wikipedia ↗
MathlibExt.Dynamics.Ergodic.BirkhoffWanted.birkhoff_pointwise_ergodic more general
theorem MathlibExt.Dynamics.Ergodic.BirkhoffWanted.birkhoff_pointwise_ergodic {α : Type*} [MeasurableSpace α] {μ : MeasureTheory.Measure α} [MeasureTheory.IsProbabilityMeasure μ] {T : α → α} : Ergodic T μ → ∀ {g : α → ℝ}, MeasureTheory.Integrable g μ → ∀ᵐ (x : α) ∂μ, Filter.Tendsto (fun n ↦ birkhoffAverage ℝ T g n x) Filter.atTop (𝓝 (∫ (y : α), g y ∂μ))
MathlibExt.Dynamics.Ergodic.Birkhoff · line 508
Why more general: The declaration covers every integrable real observable, the indicator of an event being one of them, and it pins the limit as that observable's integral where the passage speaks of a fixed value being approached.
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
64c2773. - Location key
a86aa13930f9 · pair key aa759f6b6d8d.
ProbabilityTheory.strong_law_ae_real special case
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 a special case: Independence with a common law is assumed of the trials, which is one kind of ergodic source among those the passage allows.
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
10c51fbf1c17 · pair key c7082e2f7a64.
Sign in to tag this passage
-
Definition · main statement · Applications
✕Not formalized
A frequency distribution is said to be skewed when its mean and median are significantly different, or more generally when it is asymmetric.
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 6636367dcad7). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · main statement · Applications
✕Not formalized
The kurtosis of a frequency distribution is a measure of the proportion of extreme values (outliers), which appear at either end of the histogram.
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 542e5297211c). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · supporting · Applications
✕Not formalized
If the distribution is more outlier-prone than the normal distribution it is said to be leptokurtic; if less outlier-prone it is said to be platykurtic.
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 64fdcc61e898). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · supporting · Applications
✕Not formalized
If the distribution is more outlier-prone than the normal distribution it is said to be leptokurtic; if less outlier-prone it is said to be platykurtic.
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 6 queries and 4 candidates examined (receipt bf7ebf70e2c9). - 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).
Sign in to tag this passage