{"assessment":{"class":"B","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":19196523,"passages":[{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"3ac2c06aa85f99694f2c518ae76eeb1d9d0889e1995969d46bd044084690c3c5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #592f7c4f","item":"In-text #592f7c4f","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f34e4a865ba4377e7113d8d4ab6d150dadaaa8f0af36940cee5e1bc70afb7cd3","prominence":"subject","quote":{"exact":"In common usage, randomness is the apparent or actual lack of definite"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"In common usage, randomness is the apparent or actual lack of definite patterns or predictability in information.[1][2]","segments":[{"text":"In common usage, randomness is the apparent or actual lack of definite patterns or predictability in information."},{"ref":"[1][2]"}]},"unresolved":null},{"absence":null,"basis":"bbe04576859c06e5f55851100ecc9709681f4dc5e5b2fd4bfabd808e82806069","coverage":null,"id":"enwiki-19196523-1380359759::In-text #6475477a","item":"In-text #6475477a","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Probability.Statistics.GlivenkoCantelliWanted.glivenko_cantelli","library":"atlas","line":318,"location_key":"bbe04576859c06e5f55851100ecc9709681f4dc5e5b2fd4bfabd808e82806069","module":"MathlibExt.Probability.Statistics.GlivenkoCantelli","note":"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.","pair_key":"ebc90731efc6cc0dc73e1941171f497ed33fad210023576d1d95b31222fdde33","path":"MathlibExt/Probability/Statistics/GlivenkoCantelli.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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| < ε"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.strong_law_ae_real","end_line":631,"library":"mathlib","line":598,"location_key":"dc5f693e673d88f11e34e89c15ba658385843871d85a08e2b30fcd73f02f501c","module":"Mathlib.Probability.StrongLaw","note":"It gives the limit of the running averages of the repeated variables; turning that into a statement about how often an outcome shows up needs the further identification of an indicator's integral with the chance of its event.","pair_key":"08105205cc9823ec2fcdb1f414c60035313101885d12af9c602f0dde41ca3fc1","path":"Mathlib/Probability/StrongLaw.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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 ∂μ))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b5e4720ff5a5878af41bbbe528043ff21852f01ce17361a6eed11183e2c5f636","prominence":"central","quote":{"exact":"Individual random events are, by definition, unpredictable, but if there is a"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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]","segments":[{"text":"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."},{"ref":"[note 1]"}]},"unresolved":null},{"absence":null,"basis":"d23d35613aee38949cd1a9d9966285916420b2f6aa1529b8f328866d10f8f937","coverage":null,"id":"enwiki-19196523-1380359759::In-text #7128aad8","item":"In-text #7128aad8","kind":"example","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.uniformOn_toReal","end_line":120,"library":"tauceti","line":103,"location_key":"d23d35613aee38949cd1a9d9966285916420b2f6aa1529b8f328866d10f8f937","module":"TauCeti.Probability.UniformSampling","note":"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.","pair_key":"af7e02b32fe0962e119dfcc534a2fabf05ed6bf01660b8bae52868d41bf62b1d","path":"TauCeti/Probability/UniformSampling.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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 })"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.uniformOn_univ","end_line":83,"library":"mathlib","line":81,"location_key":"fa3ee3dbdfae6049095196f327ab8d4965cdf793815af438b2c36db0f39ec103","module":"Mathlib.Probability.UniformOn","note":"Mathlib writes the chance with the counting measure over the number of possible rolls, so the two totals are compared by their counts.","pair_key":"8d5ca04d1407d9c0b42bd57e459bf906838bb133f83bda5eb94d456012bb0976","path":"Mathlib/Probability/UniformOn.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.uniformOn_univ {Ω : Type*} [MeasurableSpace Ω] [Fintype Ω] {s : Set Ω} : (ProbabilityTheory.uniformOn Set.univ) s = MeasureTheory.Measure.count s / ↑(Fintype.card Ω)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"44714002d8bbd2b343667003d98b79dc9400d903a9b5f920f87d1a7d96129f03","prominence":"supporting","quote":{"exact":"For example, when throwing two dice, the outcome of any particular roll"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"bcd3611892b875589a8e9cd6188a37f0180a5a70cf28376cf2fb6e9f7ab03510","coverage":null,"id":"enwiki-19196523-1380359759::In-text #6e475b9a","item":"In-text #6e475b9a","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.SimpleFunc","end_line":51,"library":"mathlib","line":47,"location_key":"bcd3611892b875589a8e9cd6188a37f0180a5a70cf28376cf2fb6e9f7ab03510","module":"Mathlib.MeasureTheory.Function.SimpleFunc","note":"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.","pair_key":"6bb1840cbfbc7add8fa73f53d7e52e0d4346e6971f4af8580be548a57c7d9532","path":"Mathlib/MeasureTheory/Function/SimpleFunc.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure MeasureTheory.SimpleFunc (α : Type u) [MeasurableSpace α] : Type v → Type (max u v)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b77bf77ed9da5de39cad4e19e5fac860beb29d33333efbf87957b0911275b21b","prominence":"central","quote":{"exact":"In statistics, a random variable is an assignment of a numerical value"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"In statistics, a random variable is an assignment of a numerical value to each possible outcome of an event space.","segments":[{"text":"In statistics, a random variable is an assignment of a numerical value to each possible outcome of an event space."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"3dfb600c3b2458ec42b68c629f003a8c3da2cfeefb84e529e3d001cbc644cd91"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #9148cc8c","item":"In-text #9148cc8c","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"93632bc2584aab2c2125aa463b7f76f29058b3e89edd719f4626a269a3cbc509","prominence":"central","quote":{"exact":"A random process is a sequence of random variables whose outcomes do"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"7382c8b9c5b79f78427aab8da699848e00a820b681f29c94e1daf2ea5949f4a0","coverage":null,"id":"enwiki-19196523-1380359759::In-text #e01be869","item":"In-text #e01be869","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Probability.uniformOn_toReal","end_line":120,"library":"tauceti","line":103,"location_key":"ddbfad43af5d44486b020f79d192f180947e5ed1284fd7682d958062244bd239","module":"TauCeti.Probability.UniformSampling","note":"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.","pair_key":"47b1a24ef64c91cd76f793364b5885620816a719f93cfd75b77ee780e8da1a00","path":"TauCeti/Probability/UniformSampling.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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 })"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.uniformOn","end_line":60,"library":"mathlib","line":58,"location_key":"7382c8b9c5b79f78427aab8da699848e00a820b681f29c94e1daf2ea5949f4a0","module":"Mathlib.Probability.UniformOn","note":"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.","pair_key":"c1caed54fc823dcf3dd92ab7b2fed255c4c8afa6df4b78305d9bf04d2b028288","path":"Mathlib/Probability/UniformOn.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ProbabilityTheory.uniformOn {Ω : Type*} [MeasurableSpace Ω] : Set Ω → MeasureTheory.Measure Ω"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d96a92ea371eca774f4159137aa9a13fcdb12fef40fbcf97e2d69767f3097f30","prominence":"central","quote":{"exact":"Random selection, when narrowly associated with a simple random sample, is a"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"131007515571294599e6e3abf53333a130cfbe78fb10519e59fa786dca9cf783","coverage":null,"id":"enwiki-19196523-1380359759::In-text #990f0bb7","item":"In-text #990f0bb7","kind":"example","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Probability.uniformOn_toReal","end_line":120,"library":"tauceti","line":103,"location_key":"131007515571294599e6e3abf53333a130cfbe78fb10519e59fa786dca9cf783","module":"TauCeti.Probability.UniformSampling","note":"The two counts, ten red marbles and a hundred marbles in all, are the only inputs the equation takes.","pair_key":"5649d8e67f676eb97dfef7cf8ae2869b6a6553f4871bbb3d7735b0b81e346cc6","path":"TauCeti/Probability/UniformSampling.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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 })"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.uniformOn_univ","end_line":83,"library":"mathlib","line":81,"location_key":"a12191f35f1cf3037240c8705e1fdcbaa0edaa1fde7455ca035c611309c73d6e","module":"Mathlib.Probability.UniformOn","note":"Mathlib states the mass with the counting measure divided by the number of marbles in the bowl.","pair_key":"f26848ddde0cbe1315fe1436007e8728615e066909fc62bc0ed14728065f15b1","path":"Mathlib/Probability/UniformOn.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.uniformOn_univ {Ω : Type*} [MeasurableSpace Ω] [Fintype Ω] {s : Set Ω} : (ProbabilityTheory.uniformOn Set.univ) s = MeasureTheory.Measure.count s / ↑(Fintype.card Ω)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"56fa5de6d4019425e10c42b2f37e6075b5087499fb9b38883c0008d8e8896b2b","prominence":"supporting","quote":{"exact":"For example, with a bowl containing just 10 red marbles and 90"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"1f76a551765c26531000023360dfad4d0878f5336528f7e764f604c334603dce"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #50942a18","item":"In-text #50942a18","kind":"theorem","locations":[{"challenge":"downgraded","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.hypergeometricMeasure_singleton_ne_zero_iff","end_line":196,"library":"tauceti","line":193,"location_key":"7a58457e5d01733075ef0e3af321b4df54cc01d91fffeef0191e16535a3394ca","module":"TauCeti.Probability.Distributions.Hypergeometric.Basic","note":"The count of red marbles in a draw of ten taken without replacement from the bowl follows the hypergeometric law with population a hundred, marked ten and sample ten, and this lemma says which counts carry mass.","pair_key":"903835082f6cf70e3cf06cacfe1efa5d28896f76898391be54b06fc6fa79e8ce","path":"TauCeti/Probability/Distributions/Hypergeometric/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.hypergeometricMeasure_singleton_ne_zero_iff {K N n : ℕ} : K ≤ N → n ≤ N → ∀ (k : ℕ), (TauCeti.Probability.hypergeometricMeasure N K n) {k} ≠ 0 ↔ k ≤ K ∧ k ≤ n ∧ n - k ≤ N - K"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"badec726649be87fbe28ca7fde9401e29c0c9595ecee084261d2b449903761b1","prominence":"supporting","quote":{"exact":"A random selection mechanism that selected 10 marbles from this bowl would"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"A random selection mechanism that selected 10 marbles from this bowl would not necessarily result in 1 red and 9 blue.","segments":[{"text":"A random selection mechanism that selected 10 marbles from this bowl would not necessarily result in 1 red and 9 blue."}]},"unresolved":null},{"absence":null,"basis":"3e0daf327ade9ddae9ad11a8ea88d88f00eb833abdb4dedff6384de678efdce5","coverage":null,"id":"enwiki-19196523-1380359759::In-text #50c5aae2","item":"In-text #50c5aae2","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.uniformOfFinset","end_line":206,"library":"mathlib","line":205,"location_key":"3e0daf327ade9ddae9ad11a8ea88d88f00eb833abdb4dedff6384de678efdce5","module":"Mathlib.Probability.Distributions.Uniform","note":"Mathlib's construction also gives weight zero to anything not listed in the population, and returns a default on an empty finset; neither case bears on what the passage asserts.","pair_key":"eecf4ace8751d308f59dfa97c261f502a661758bb19c0fc5ab5a71872c0f8ae3","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MeasureTheory.Measure.uniformOfFinset {α : Type*} [MeasurableSpace α] : Finset α → MeasureTheory.Measure α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.uniformOfFinset_apply_singleton","end_line":221,"library":"mathlib","line":212,"location_key":"cbab98a902e1167d1f0d4a3631d4735673546676951671c1d759c61bd3ef1db2","module":"Mathlib.Probability.Distributions.Uniform","note":"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.","pair_key":"6c381f3f12db57b758d0aeb8146aded8298f9c07308af3e82f5da81a5d8701cd","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.uniformOn","end_line":60,"library":"mathlib","line":58,"location_key":"f1863ec9012ea6c3a7c694307003e1b78945b8f9bdb413456f442b1049fc02ac","module":"Mathlib.Probability.UniformOn","note":"Mathlib conditions the counting measure on an arbitrary set, so the construction reaches populations of any size, the passage's finite one among them.","pair_key":"f8f4986751083fc0ebbae5c39412122d0a75c0a9e3de58eb9ced399e5d1a6329","path":"Mathlib/Probability/UniformOn.lean","proof_status":"definition","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ProbabilityTheory.uniformOn {Ω : Type*} [MeasurableSpace Ω] : Set Ω → MeasureTheory.Measure Ω"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7898a773fa81178c1f8681be6ed1fdb1a98d97b9e9d8b299b840401b986569c0","prominence":"supporting","quote":{"exact":"In situations where a population consists of items that are distinguishable, a"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"In situations where a population consists of items that are distinguishable, a random selection mechanism requires equal probabilities for any item to be chosen.","segments":[{"text":"In situations where a population consists of items that are distinguishable, a random selection mechanism requires equal probabilities for any item to be chosen."}]},"unresolved":null},{"absence":null,"basis":"8ee43ef572eac15521e5a7fc950cc42915daf7ab701cbb05217719526a9f2f17","coverage":null,"id":"enwiki-19196523-1380359759::In-text #afee1dee","item":"In-text #afee1dee","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.uniformOfFinset","end_line":206,"library":"mathlib","line":205,"location_key":"8ee43ef572eac15521e5a7fc950cc42915daf7ab701cbb05217719526a9f2f17","module":"Mathlib.Probability.Distributions.Uniform","note":"Mathlib's measure also answers for elements that are not members of the population, giving them weight zero, and returns a default on an empty finset; the passage's wording depends on neither.","pair_key":"36c39a1fe69aebf72d44f774a550811227657a07fb5f41be366902454bd9328c","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MeasureTheory.Measure.uniformOfFinset {α : Type*} [MeasurableSpace α] : Finset α → MeasureTheory.Measure α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.uniformOfFinset_apply_singleton","end_line":221,"library":"mathlib","line":212,"location_key":"10b92941b0fac54e413e4b116dcc8c056d3ed0097129cd524f597ee3219e43ab","module":"Mathlib.Probability.Distributions.Uniform","note":"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.","pair_key":"43ea466d024a8ae6f9e0ffa438abec0eb37a5ea7609b17463ede46fe716d0eb8","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.uniformOn","end_line":60,"library":"mathlib","line":58,"location_key":"b1d5a123152d0105930e90f1d609cdfdb8c71f6161c75b2aab4feab9f54164b6","module":"Mathlib.Probability.UniformOn","note":"Mathlib defines this by conditioning the counting measure on an arbitrary set, so it reaches populations of every size.","pair_key":"15b046f860fc7b3b5aad9efe088327d3cf51f5601764ce297fec3be241db7374","path":"Mathlib/Probability/UniformOn.lean","proof_status":"definition","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ProbabilityTheory.uniformOn {Ω : Type*} [MeasurableSpace Ω] : Set Ω → MeasureTheory.Measure Ω"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"033534843b6b6f648b3e2ff77bfa254096cb135a0635e13333d92504d1e1f74d","prominence":"supporting","quote":{"exact":"That is, if the selection process is such that each member of"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"1a63340f1672f8e7dae55be96ab06600c53adf9ed4bcda8d5ef5f2917d1b4eb3","coverage":null,"id":"enwiki-19196523-1380359759::In-text #c6afbfee","item":"In-text #c6afbfee","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Combinatorics.Ramsey.ramsey_two_uniform","library":"atlas","line":298,"location_key":"1a63340f1672f8e7dae55be96ab06600c53adf9ed4bcda8d5ef5f2917d1b4eb3","module":"MathlibExt.Combinatorics.Ramsey","note":"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.","pair_key":"885600a473c9118bb6e726a38ebb7711cc687a96b4e3d92e9d283ed7f45ca38e","path":"MathlibExt/Combinatorics/Ramsey.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"low","declaration":"MetaMathlibExt.schur_ramsey","library":"atlas","line":40,"location_key":"6b51bbca58107a8d793c80dc7e5de43623f0c3aac90f4776a4fb8b54adc3b162","module":"MathlibExt.Combinatorics.SchurRamsey","note":"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.","pair_key":"2796376d3fea3d3cb3ff7d91219934c82030be6b50e17cfc641fc7971b42367c","path":"MathlibExt/Combinatorics/SchurRamsey.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"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"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ae2163e608cb39e06435c552eac5eed0f7b141c960736a00c5ad5fd72c507e53","prominence":"central","quote":{"exact":"According to Ramsey theory, pure randomness (in the sense of there being"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"According to Ramsey theory, pure randomness (in the sense of there being no discernible pattern) is impossible, especially for large structures.","segments":[{"text":"According to Ramsey theory, pure randomness (in the sense of there being no discernible pattern) is impossible, especially for large structures."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"cf18bdd635b53f6023c27089f67dfcbcc2ab71031d69613e648b3d0c6ba3fa91"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #55932d64","item":"In-text #55932d64","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a9842416d2f34ec74439f653691b2413e7df8746e92e9e3c0c5ab3b04dabd6e9","prominence":"central","quote":{"exact":"It can be proven that there is infinite hierarchy (in terms of"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"It can be proven that there is infinite hierarchy (in terms of quality or strength) of forms of randomness.","segments":[{"text":"It can be proven that there is infinite hierarchy (in terms of quality or strength) of forms of randomness."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"2641dcb2fd3b3f5bcb1703a8d232195ec3b028e16235ba740e329b06635ed599"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #036a1d65","item":"In-text #036a1d65","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"39cef8a45896f069a4db90fb1899b713ad1bd8ed218c2a09f4ac503309b9aa2a","prominence":"central","quote":{"exact":"The central idea is that a string of bits is random if"},"quote_capped":true,"section":["In science","In mathematics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"45c421b589f5ab744ae8f232cfd4c89c8beb87acda169f0fff24335cf6f018c4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #2daac342","item":"In-text #2daac342","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0e41f4eaae9a65f1a0c9dc9af7d32c504ee8e4c0c9921b35086fc0eb8b20538f","prominence":"central","quote":{"exact":"For the notion of infinite sequence, mathematicians generally accept Per Martin-Löf's semi-eponymous"},"quote_capped":true,"section":["In science","In mathematics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"64c2cb810e05a46e5229b9c832fa29df4adbf3fffbbb4fbbe3d78817b6172f28"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #7395d1e7","item":"In-text #7395d1e7","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"76487e2b3db6152f5c30f5c5dbc2471bb372a0c0d6e29259e855596f0c499bd9","prominence":"supporting","quote":{"exact":"recursive randomness and"},"quote_capped":false,"section":["In science","In mathematics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"after":{"layer":" Schnorr randomness, which are based on recursively computable martingales.","segments":[{"text":" Schnorr randomness, which are based on recursively computable martingales."}]},"before":{"layer":"The other notions of random sequences include, among others, ","segments":[{"text":"The other notions of random sequences include, among others, "}]},"layer":"recursive randomness and","segments":[{"text":"recursive randomness and"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"3ff24aed94691e6849ae11d6e42f2ebdf38ea0d946337f4ab32bfbf7241f9a8b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #49826ec7","item":"In-text #49826ec7","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"db38b01c2284c39be22ef60b9288fdcf37ca5a684b8fd88de46d073543cac714","prominence":"supporting","quote":{"exact":"Schnorr randomness, which are based on recursively computable martingales."},"quote_capped":false,"section":["In science","In mathematics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"before":{"layer":"The other notions of random sequences include, among others, recursive randomness and ","segments":[{"text":"The other notions of random sequences include, among others, recursive randomness and "}]},"layer":"Schnorr randomness, which are based on recursively computable martingales.","segments":[{"text":"Schnorr randomness, which are based on recursively computable martingales."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"e05cfa54221ca9ca4a6cd3d96117a871ba98ebaf7194552817a19662dd6360fa"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #447b7719","item":"In-text #447b7719","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b7a723f3467f5be41d03b4bba46087611d7b1cac7816d79cd17dcc75bacdb2cd","prominence":"central","quote":{"exact":"It was shown by Yongge Wang that these randomness notions are generally"},"quote_capped":true,"section":["In science","In mathematics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"It was shown by Yongge Wang that these randomness notions are generally different.","segments":[{"text":"It was shown by Yongge Wang that these randomness notions are generally different."}]},"unresolved":null},{"absence":null,"basis":"c5463961f5b6c9e5604a75be3ba7c7aeeb5b4372f5c6e0b6bd4a43f324187c98","coverage":null,"id":"enwiki-19196523-1380359759::In-text #eef5091e","item":"In-text #eef5091e","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"irrational_pi","end_line":310,"library":"mathlib","line":282,"location_key":"c5463961f5b6c9e5604a75be3ba7c7aeeb5b4372f5c6e0b6bd4a43f324187c98","module":"Mathlib.Analysis.Real.Pi.Irrational","note":"Mathlib records the fact through the standard predicate Irrational on a real number, where the passage writes the same property of pi in terms of its base-ten digits.","pair_key":"ba38de439f4d7020708f819b456664e9ef35e712981746bd8ee63816b0ffdfab","path":"Mathlib/Analysis/Real/Pi/Irrational.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem irrational_pi : Irrational π"},"statement":false},{"challenge":"sampled_out","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"NormalNumber.digitSeq","end_line":60,"library":"formal-conjectures","line":59,"location_key":"2443939b9686d4226d7c52b34034419860cb29f4bac9188aaf9ce1c08e199531","module":"FormalConjecturesForMathlib.NumberTheory.NormalNumber","note":"This builds the base-b digit sequence of an arbitrary real, so it supplies the object the passage talks about but asserts nothing about pi.","pair_key":"9a109f4e4b4cd7182eed4e6fa93c9e31e1a593247420e78ac165426dd155f92b","path":"FormalConjecturesForMathlib/NumberTheory/NormalNumber.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def NormalNumber.digitSeq : ℕ → ℝ → ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ecb1c744adfcaf17194362b61fb40b0b3a430ce0807a2abf7406979ba83ca65b","prominence":"supporting","quote":{"exact":"The decimal digits of pi constitute an infinite sequence and \"never repeat"},"quote_capped":true,"section":["In science","In mathematics"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"after":{"layer":" Numbers like pi are also considered likely to be normal:","segments":[{"text":" Numbers like pi are also considered likely to be normal:"}]},"layer":"The decimal digits of pi constitute an infinite sequence and \"never repeat in a cyclical fashion.\"","segments":[{"text":"The decimal digits of pi constitute an infinite sequence and \"never repeat in a cyclical fashion.\""}]},"unresolved":null},{"absence":null,"basis":"d9b2202f9d6faa55125b825030f987cb3a4e1bd0e7e8b00206130ab4bea914ba","coverage":null,"id":"enwiki-19196523-1380359759::In-text #90ae21c9","item":"In-text #90ae21c9","kind":"conjecture","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"NormalNumber.pi_normal_base_ten","end_line":44,"library":"formal-conjectures","line":43,"location_key":"d9b2202f9d6faa55125b825030f987cb3a4e1bd0e7e8b00206130ab4bea914ba","module":"FormalConjectures.Wikipedia.NormalityOfPi","note":"The library fixes the base at ten, where the passage speaks of normality without naming a base.","pair_key":"b9e6212e6c8027cea21dce5022e7a07f4c0532c6fee609721b236e1551d6ffc9","path":"FormalConjectures/Wikipedia/NormalityOfPi.lean","proof_status":"statement_only","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem NormalNumber.pi_normal_base_ten : NormalNumber.IsNormalInBase 10 π"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"NormalNumber.IsAbsolutelyNormal","end_line":94,"library":"formal-conjectures","line":93,"location_key":"fd0b87fb3dbdd83cad7a9fe4e7fccb6c464e615e3780e1ceb73c5b95b1f4740f","module":"FormalConjecturesForMathlib.NumberTheory.NormalNumber","note":"This defines normality in every base at least two, but it is a predicate on reals and claims nothing of pi.","pair_key":"c0ca33cafacef127caf4a94ed20a9d323b91a10bfa7461744519eed5c09fd344","path":"FormalConjecturesForMathlib/NumberTheory/NormalNumber.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def NormalNumber.IsAbsolutelyNormal : ℝ → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6c7b120c1cf6fbffe3833aafa400b28550febacf342a524ef01970fa537ac4d0","prominence":"central","quote":{"exact":"Numbers like pi are also considered likely to be normal:"},"quote_capped":false,"section":["In science","In mathematics"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"before":{"layer":"The decimal digits of pi constitute an infinite sequence and \"never repeat in a cyclical fashion.\" ","segments":[{"text":"The decimal digits of pi constitute an infinite sequence and \"never repeat in a cyclical fashion.\" "}]},"layer":"Numbers like pi are also considered likely to be normal:","segments":[{"text":"Numbers like pi are also considered likely to be normal:"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"110122a0311d424e07e9a14635c22370b2df1c8ca44a8a74113e4ad12ae4b22f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #976cf223","item":"In-text #976cf223","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"57bd1d82237174c16ebeaef39a5901313c6e1284521c86115b7bdcf688cafa21","prominence":"supporting","quote":{"exact":"In the first six billion decimal places of pi, each of the"},"quote_capped":true,"section":["In science","In mathematics"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"In the first six billion decimal places of pi, each of the digits from 0 through 9 shows up about six hundred million times.","segments":[{"text":"In the first six billion decimal places of pi, each of the digits from 0 through 9 shows up about six hundred million times."}]},"unresolved":null},{"absence":null,"basis":"00f2b132ccfa47012f62f2cc7125de5a31e5cbbbfeea5c7da6155879e7f9fb3c","coverage":null,"id":"enwiki-19196523-1380359759::In-text #658b3280","item":"In-text #658b3280","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"SimpleGraph.binomialRandom","end_line":48,"library":"mathlib","line":47,"location_key":"00f2b132ccfa47012f62f2cc7125de5a31e5cbbbfeea5c7da6155879e7f9fb3c","module":"Mathlib.Probability.Combinatorics.BinomialRandomGraph.Defs","note":"The library builds the law over an arbitrary node type and an arbitrary link probability, where the passage fixes one node set and one network; the node set is a single type carrying no evolution, and every pair of nodes is treated alike with its link drawn independently.","pair_key":"929355f054bd766b7a111660df5e6e13e4669b33cdccd2a12c171b32e9582a2f","path":"Mathlib/Probability/Combinatorics/BinomialRandomGraph/Defs.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def SimpleGraph.binomialRandom (V : Type*) : ↑unitInterval → MeasureTheory.Measure (SimpleGraph V)"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"ShelahSpencerZeroOneLaw.sparseRandomGraph","end_line":54,"library":"formal-conjectures","line":52,"location_key":"bb031659791a7f6b7fb8083b373a2534ae73f35274096aebc029de298c2174de","module":"FormalConjectures.Paper.ShelahSpencerZeroOneLaw","note":"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.","pair_key":"191e015efd17f3c23bea7117e0dfd847c9d87e955d89a1e091dd679534786e3b","path":"FormalConjectures/Paper/ShelahSpencerZeroOneLaw.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def ShelahSpencerZeroOneLaw.sparseRandomGraph (n : ℕ) (α : ℝ) : 0 < α → MeasureTheory.Measure (SimpleGraph (Fin n))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0b48c1ca62a0bba383f21476100b2c20ade3cdecb2ac3ac3325d5248d117d995","prominence":"central","quote":{"exact":"In terms of the development of random networks, for communication randomness rests"},"quote_capped":true,"section":["In science","In information science"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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]","segments":[{"text":"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]"}]},"unresolved":null},{"absence":null,"basis":"c2b69f2d4073af2da8c9b55a34bce2448d3597206635929e87ef9cb7c54ba6b7","coverage":null,"id":"enwiki-19196523-1380359759::In-text #7aac1a7a","item":"In-text #7aac1a7a","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Martingale","end_line":54,"library":"mathlib","line":53,"location_key":"c2b69f2d4073af2da8c9b55a34bce2448d3597206635929e87ef9cb7c54ba6b7","module":"Mathlib.Probability.Martingale.Basic","note":"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.","pair_key":"6dd499bf87dad4ffcd50029ecd507f3ee5607d52b925d10d55855c07673c5505","path":"Mathlib/Probability/Martingale/Basic.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MeasureTheory.Martingale {Ω : Type*} {E : Type*} {ι : Type*} [Preorder ι] {m0 : MeasurableSpace Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] : (ι → Ω → E) → MeasureTheory.Filtration ι m0 → MeasureTheory.Measure Ω → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e7d684cd65cd39198301d2afea879f92eab0ab759068f96a743bda954dc1678b","prominence":"central","quote":{"exact":"The random walk hypothesis considers that asset prices in an organized market"},"quote_capped":true,"section":["In science","In finance"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"f1ea2ca930b9c36c259345ca524fda5b08167aaea5476cfe398aeb9e173c38e9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #25c212e9","item":"In-text #25c212e9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c46b28b0de059f280b831610ae1b18b32da0f0f435097db7ccc2e630f4bc97d5","prominence":"central","quote":{"exact":"This logic is only correct if applied to a system where numbers"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"due\""],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"before":{"layer":"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.\" ","segments":[{"text":"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.\" "}]},"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"5a59e2fdf614fc6f0b8c04e588a37be794d0d450105e8d138ba3e8b572f37813"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #3b4e33d8","item":"In-text #3b4e33d8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"988488fae63977b74b9e021a0f75847e10f0028f73df5d257561385af0b67934","prominence":"supporting","quote":{"exact":"In this case, once a jack is removed from the deck, the"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"due\""],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"81eacff7278e205ffb5f3f9aa82424adf09cdf9af9299102bde861f96a3ac8b1","coverage":null,"id":"enwiki-19196523-1380359759::In-text #eb215933","item":"In-text #eb215933","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.uniformOfFinset_apply_singleton","end_line":221,"library":"mathlib","line":212,"location_key":"81eacff7278e205ffb5f3f9aa82424adf09cdf9af9299102bde861f96a3ac8b1","module":"Mathlib.Probability.Distributions.Uniform","note":"It is stated for an arbitrary finite outcome set, so a deck of cards is one of many uniform draws it answers for.","pair_key":"5da74b641ba8f0293f4a77d4a2f783303ecca4d1cdf2c382f2fe0f61332cad25","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem","end_line":228,"library":"mathlib","line":226,"location_key":"90dfd25c0e542452a1032cc35bd3291881fc6f9ac4d381dc3450dfc72ed2786b","module":"Mathlib.Probability.Distributions.Uniform","note":"This is the membership form of the same uniform mass, stated for any finite outcome set rather than for playing cards.","pair_key":"c43e39cff8395be638067df9475dff87285443dbf511fee380c50d53ee94d8bd","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} {a : α} : a ∈ s → (MeasureTheory.Measure.uniformOfFinset s) {a} = (↑s.card)⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cad6f5e05ae843471335dcb8b32bcb7073ed5bfcdb2715832646d22a04f38bb8","prominence":"supporting","quote":{"exact":"However, if the jack is returned to the deck, and the deck"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"due\""],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"e39bcc6b7d39d92e4eba52e87a29fa7fd59324e309ee1cb5b95c0d38df3050d8","coverage":null,"id":"enwiki-19196523-1380359759::In-text #6c861015","item":"In-text #6c861015","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq","end_line":64,"library":"mathlib","line":58,"location_key":"e39bcc6b7d39d92e4eba52e87a29fa7fd59324e309ee1cb5b95c0d38df3050d8","module":"Mathlib.Probability.BorelCantelli","note":"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.","pair_key":"9515da0f79d21c71401049e65e06d40f9543a51c325fb3a9706948eb83b1b649","path":"Mathlib/Probability/BorelCantelli.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.condExp_indep_eq","end_line":71,"library":"mathlib","line":41,"location_key":"09dc3b465871e82a2573bfac02d24fd5d70224878621ce39c2b7ecd5bbeb8512","module":"Mathlib.Probability.ConditionalExpectation","note":"It covers any pair of independent sub-algebras and any integrable target, of which one later draw against the earlier draws is a case.","pair_key":"63333f23c59fe7b416b5ef391f98937eb46814d94ba2570d3618f0a97eb2a7d9","path":"Mathlib/Probability/ConditionalExpectation.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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 ∂μ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"04a9a2c6d04d2acd90bb42189631745fb0d86c0cde139275950adea4d70ef444","prominence":"supporting","quote":{"exact":"The same applies in any other process where objects are selected independently,"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"due\""],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"2fff642757ba2928a946bcdbe29ddb6ac3d8754602fbc0fba90ca9e968b3c6c8","coverage":null,"id":"enwiki-19196523-1380359759::In-text #e60b31bd","item":"In-text #e60b31bd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq","end_line":64,"library":"mathlib","line":58,"location_key":"2fff642757ba2928a946bcdbe29ddb6ac3d8754602fbc0fba90ca9e968b3c6c8","module":"Mathlib.Probability.BorelCantelli","note":"Stated for any independent family over any linear index order, so it answers for the repeated draws the passage has in mind among others.","pair_key":"7e446958e0790140c51c697e912f110711279765caa9a9bd7dbaa06a7674d4de","path":"Mathlib/Probability/BorelCantelli.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.condExp_indep_eq","end_line":71,"library":"mathlib","line":41,"location_key":"124659bff85d61c28c6c1f199ccdba72b54c98dc7719fefcbe638d9987788e8c","module":"Mathlib.Probability.ConditionalExpectation","note":"It is a statement about any two independent sub-algebras, with past against future as one reading.","pair_key":"e1240fe6ce221b462cbd4e1fdb0b54413b0b9ea6660d1f528ce4844addc5673b","path":"Mathlib/Probability/ConditionalExpectation.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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 ∂μ"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.geometricMeasure_memoryless","end_line":188,"library":"tauceti","line":180,"location_key":"2704c5535c458778b145cab614a243c145634b2ae3a610bba8566ece761e5fdc","module":"TauCeti.Probability.Distributions.Geometric.Basic","note":"It states the lack-of-memory identity for the waiting time of a run of trials, a consequence of independence rather than the passage's claim that earlier outcomes leave later ones untouched.","pair_key":"666ea0ebd23cb918d3a1559ff6d0fda6beced8e69a8eff7bf7232a96ff11bfc7","path":"TauCeti/Probability/Distributions/Geometric/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.geometricMeasure_memoryless (p : ↑unitInterval) (n m : ℕ) : (ProbabilityTheory.geometricMeasure p).real {k | n + m ≤ k} = (ProbabilityTheory.geometricMeasure p).real {k | n ≤ k} * (ProbabilityTheory.geometricMeasure p).real {k | m ≤ k}"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1744fc88c75cf0f3ba9962e378c62c1ec2aa77e299cfaa7540f5ee92d83fa639","prominence":"central","quote":{"exact":"Truly random processes such as these do not have memory, which makes"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"due\""],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"Truly random processes such as these do not have memory, which makes it impossible for past outcomes to affect future outcomes.","segments":[{"text":"Truly random processes such as these do not have memory, which makes it impossible for past outcomes to affect future outcomes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"8cf26670aae613a2c05670512efcade4ff4a29b348aa035b71deafafa7796b4b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #83af2b01","item":"In-text #83af2b01","kind":"theorem","locations":[{"challenge":"downgraded","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.geometricMeasure_real_Ici","end_line":176,"library":"tauceti","line":161,"location_key":"2999b7d7af26019bbec20779c3b951f81cacb5cfa16ebe6268ed90ad23fdedfb","module":"TauCeti.Probability.Distributions.Geometric.Basic","note":"The declaration pins the exact tail mass, and the passage reads off only that the mass stays away from zero for each count of trials.","pair_key":"2bb8fa8ca79583ea181e9c67d9d90f3be9430dbc704f185f3004e32713f1ce3e","path":"TauCeti/Probability/Distributions/Geometric/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.geometricMeasure_real_Ici {p : ↑unitInterval} : p ≠ 0 → ∀ (n : ℕ), (ProbabilityTheory.geometricMeasure p).real {k | n ≤ k} = (1 - ↑p) ^ n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.geometricMeasure_pos","end_line":69,"library":"mathlib","line":68,"location_key":"c3f17a330ab72131932f77894a1a7ee2a6f3c53b644bc76588a772c6f0e43fe6","module":"Mathlib.Probability.Distributions.Geometric","note":"It says each single waiting time carries positive mass; turning that into the passage's claim about a whole stretch of trials would need monotonicity of the measure as a further step.","pair_key":"c7c681e3e45e424f0d36b7f109a82b5013f2e79668ac649e854a8a0f5b9095d3","path":"Mathlib/Probability/Distributions/Geometric.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.geometricMeasure_pos {p : ↑unitInterval} : p ≠ 0 → p ≠ 1 → ∀ (n : ℕ), 0 < (1 - ↑p) ^ n * ↑p"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"11d914410ff43c271dbc7735c370eb53659c41e9da7c8757dba1f0de387dd4a3","prominence":"supporting","quote":{"exact":"In fact, there is no finite number of trials that can guarantee"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"due\""],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"In fact, there is no finite number of trials that can guarantee success.","segments":[{"text":"In fact, there is no finite number of trials that can guarantee success."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"24814b72ec2bca91779025acc390e82850f88d5fa99861ab2a1890e72331b687"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #e00ee2c3","item":"In-text #e00ee2c3","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.exists_map_eq_dirac_of_iIndepFun_iidMixtureLaw","end_line":152,"library":"tauceti","line":132,"location_key":"a57f48d2c2add495334a3be14eb0becdaa7051ccfd5e6aeaf221a9e4fe1e3b31","module":"TauCeti.Probability.Exchangeability.ConditionallyIID.Construct","note":"It states the converse of the passage: if the rolls come out independent then the loading is pinned down, whereas the passage claims that inference from past frequencies is sound only where a loading is possible.","pair_key":"875ab22329602c2b4d00527da2783cf96b0363f7a36929687a85448bec81a23b","path":"TauCeti/Probability/Exchangeability/ConditionallyIID/Construct.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.exists_map_eq_dirac_of_iIndepFun_iidMixtureLaw {T : Type*} {α : Type*} [MeasurableSpace T] [MeasurableSpace α] {π : MeasureTheory.Measure T} {P : T → MeasureTheory.ProbabilityMeasure α} [MeasureTheory.IsProbabilityMeasure π] : Measurable P → ProbabilityTheory.iIndepFun (fun n ω ↦ ω.2 n) (TauCeti.Probability.iidMixtureLaw π P) → ∃ Q, MeasureTheory.Measure.map P π = MeasureTheory.Measure.dirac Q"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9e442bce6a30e388a6c102ca55ecf6fe7bf063ff5bf3fdd3120de8e51da27188","prominence":"central","quote":{"exact":"This logic is valid only if the randomisation might be biased, for"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"cursed\" or \"blessed\""],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"3965aa320ea7f53e92e053b2dfdb3a26a694692dd971560e66352dcab4ed5b7b","coverage":null,"id":"enwiki-19196523-1380359759::In-text #a9a83684","item":"In-text #a9a83684","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.iIndepSet.condExp_indicator_filtrationOfSet_ae_eq","end_line":64,"library":"mathlib","line":58,"location_key":"3965aa320ea7f53e92e053b2dfdb3a26a694692dd971560e66352dcab4ed5b7b","module":"Mathlib.Probability.BorelCantelli","note":"The lemma speaks of any independent family over a linear index order, and rolls of a known fair die are one such family.","pair_key":"bb845ecae0371f461029d46e04bbadcfff4a50cbc92348766fbef30a38dbea4b","path":"Mathlib/Probability/BorelCantelli.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.condExp_indep_eq","end_line":71,"library":"mathlib","line":41,"location_key":"7d93f2d229be913b7436d0c1ece97b945d25f242b96a8ed321f54de834a33955","module":"Mathlib.Probability.ConditionalExpectation","note":"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.","pair_key":"ba8a42a76f9d397be7e98fd95688868c8c0b0c4aaaf9b3d313f6e85d91af1753","path":"Mathlib/Probability/ConditionalExpectation.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"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 ∂μ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"801e8937bc7ea0c099d9f6d6c866fa4a480e2e495f5f831c9a7deb91cd1d8d77","prominence":"supporting","quote":{"exact":"If the die is known to be fair, then previous rolls can"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: a number is \"cursed\" or \"blessed\""],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"If the die is known to be fair, then previous rolls can give no indication of future events.","segments":[{"text":"If the die is known to be fair, then previous rolls can give no indication of future events."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"8945d81f03a010dff3b898bdfdc0904f651e8a67bfeb1b29d2cedb5e68d1e4dd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #45d3d4c3","item":"In-text #45d3d4c3","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c90e9c4a20977e31e68a225d41a8413f9424cfb83da08a9b6917590e3c3851bc","prominence":"central","quote":{"exact":"For example, when being told that a woman has two children, one"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: odds are never dynamic"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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%).","segments":[{"text":"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%)."}]},"unresolved":null},{"absence":null,"basis":"9a0f1ee2d6386f205f51fb5e50f9832357fb8d9ec57083f26a12a115efeacf54","coverage":null,"id":"enwiki-19196523-1380359759::In-text #f5f3dfd0","item":"In-text #f5f3dfd0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Fintype.card_prod","end_line":58,"library":"mathlib","line":56,"location_key":"9a0f1ee2d6386f205f51fb5e50f9832357fb8d9ec57083f26a12a115efeacf54","module":"Mathlib.Data.Fintype.Prod","note":"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.","pair_key":"0b1cdced973731258c10814da2758d9c5757362582b9399547fdd8d565b0cab0","path":"Mathlib/Data/Fintype/Prod.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.card_prod (α : Type*) (β : Type*) [Fintype α] [Fintype β] : Fintype.card (α × β) = Fintype.card α * Fintype.card β"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0d5f35231475fe1ab8818f539cc43c807eac6534c3d94c89e461fcbe5b8cf887","prominence":"supporting","quote":{"exact":"To be sure, the probability space does illustrate four ways of having"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: odds are never dynamic"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"To be sure, the probability space does illustrate four ways of having these two children: boy-boy, girl-boy, boy-girl, and girl-girl.","segments":[{"text":"To be sure, the probability space does illustrate four ways of having these two children: boy-boy, girl-boy, boy-girl, and girl-girl."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"12331154d0ac6a04c90a681506013d8002651729c375d7abe5073c9611154426"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #b1537d0c","item":"In-text #b1537d0c","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0b3eb4bdc50534f7d22c93e19b38ca5c4bb22ec7a7b8c0674aa90ab3ab81ce0d","prominence":"supporting","quote":{"exact":"But once it is known that at least one of the children"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: odds are never dynamic"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"85c418e539dd86a81ad49cc4d56da87d3e7cb53191de984c379e376481723840"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #dfb33b63","item":"In-text #dfb33b63","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"564aadb0635c562e44b02222c735ab138cb79b459f43641482dc44d9f69c2081","prominence":"supporting","quote":{"exact":"From this, it can be seen only ⅓ of these scenarios would"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: odds are never dynamic"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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).","segments":[{"text":"From this, it can be seen only ⅓ of these scenarios would have the other child also be a girl"},{"ref":"[28]"},{"text":" (see Boy or girl paradox for more)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"a32ec35203e1974b46de475cff7492bea2dfa18ab50fe420e7f52a7ec1ff245f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-19196523-1380359759::In-text #33372630","item":"In-text #33372630","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7cc487463a7a0825ff91d22a0e812f2c54094b176a93ef72978d94bb2077c129","prominence":"central","quote":{"exact":"However, an analysis of the probability spaces would reveal that the contestant"},"quote_capped":true,"section":["Misconceptions and logical fallacies","Fallacy: odds are never dynamic"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=19196523&oldid=1380359759","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":248385,"images":[{"author":"User:Linas","file":"Circle_map_poincare_recurrence.jpeg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Didier Descouens","file":"Cône_textileII.png","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Pittigrilli","file":"Fast_erroneous_self_switching_of_audio_amp_inputs.webm","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"https://phabricator.wikimedia.org/diffusion/GOJU/browse/master/AUTHORS.txt","file":"OOjs_UI_icon_edit-ltr-progressive.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"OpenClipart","file":"People_icon.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"WolfgangRieger","file":"Pompeii_-_Osteria_della_Via_di_Mercurio_-_Dice_Players.jpg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"IndiePhunq","file":"RandomBitmap.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Toni Lozano","file":"Roulette_wheel.jpg","licence":"CC BY 2.0","licence_url":"https://creativecommons.org/licenses/by/2.0","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"Ainali","file":"Standard_deviation_diagram_micro.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"PC78, based on work by Julian Herzog, Zscout370, Ed g2s and Erin Silversmith","file":"Symbol_category_class.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Future Perfect at Sunrise","file":"Symbol_template_class_pink.svg","licence":"Public domain","licence_url":null,"project":"commons"}],"marks":95,"passages":35,"sha256":"b4fc6d1d2327f08efd9d7fa4d06bd6d9843774f79f059ab739e82a8d3546a760","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"c16d95698cbe86f684674828cff1658c7b2a612e2d35124b6ffb8c3b0005bd42","revision":1380359759,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"d05f57caa48159789c75df8f2b8e0ddeec0b1ea93830fb611d9bc17ab3e11048","layer_sha256":"4ebafa66f88e6f094dbbda3a122c27909b71834382e6a897efabed6f880f2cdd","renderer":"web-html/3"},"source_id":"enwiki-19196523-1380359759","summary":{"by_library":{"atlas":{"complete":3,"incomplete":0,"locations":3,"passages":2,"related":0},"formal-conjectures":{"complete":1,"incomplete":1,"locations":2,"passages":2,"related":2},"mathlib":{"complete":22,"incomplete":0,"locations":22,"passages":14,"related":2},"tauceti":{"complete":3,"incomplete":0,"locations":3,"passages":3,"related":4}},"by_prominence":{"central":{"by_status":{"formalized":3,"not_formalized":9,"partial":5,"statement_only":0,"unresolved":0},"passages":17},"subject":{"by_status":{"formalized":0,"not_formalized":1,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":7,"not_formalized":8,"partial":2,"statement_only":0,"unresolved":0},"passages":17}},"by_proof_status":{"definition":11,"proved":26,"statement_only":1},"by_relation":{"broadMatch":15,"closeMatch":3,"exactMatch":2,"hasPart":5,"narrowMatch":5,"relatedMatch":8},"by_status":{"formalized":10,"not_formalized":18,"partial":7,"statement_only":0,"unresolved":0},"locations":30,"passages":35,"related":8},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Randomness","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q176640"}
