{"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":23538,"passages":[{"absence":null,"basis":"e9d59d4b5a5c0481c486d91254cd0e32588e57253c2e05831b3e35fb9363c9a6","coverage":null,"id":"enwiki-23538-1372945804::In-text #2f2424c8","item":"In-text #2f2424c8","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MeasureTheory.Measure.uniformOfFinset","end_line":206,"library":"mathlib","line":205,"location_key":"e9d59d4b5a5c0481c486d91254cd0e32588e57253c2e05831b3e35fb9363c9a6","module":"Mathlib.Probability.Distributions.Uniform","note":"Lean's object is the distribution that gives each element of the chosen finset the same non-zero mass; the empty finset is a default Lean admits and the passage's mathematics never calls on.","pair_key":"74b29afa7d43e79aec347b4fd8fef0fdb3f307d54a6d375c4d1ae75a7bd31d44","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":"high","declaration":"ProbabilityTheory.uniformOn","end_line":60,"library":"mathlib","line":58,"location_key":"9c593c08a261d0d7548428b8421083db27ebc353aede1020a5f27f0cfd0c9b39","module":"Mathlib.Probability.UniformOn","note":"Lean builds the assignment as the counting measure conditioned on the set of possible outcomes, so its value on an outcome is the reciprocal of how many there are.","pair_key":"2e533fd10f36ce41c899f5e2677181791c9c39c5d9a66e25939781967e80ffdd","path":"Mathlib/Probability/UniformOn.lean","proof_status":"definition","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ProbabilityTheory.uniformOn {Ω : Type*} [MeasurableSpace Ω] : Set Ω → MeasureTheory.Measure Ω"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MeasureTheory.Measure.uniformOfFinset_apply_singleton_of_mem","end_line":228,"library":"mathlib","line":226,"location_key":"8acecb93253db54752d4fb66ba0f02f481d5348e4eae8cc7cf1d3c143f5432b4","module":"Mathlib.Probability.Distributions.Uniform","note":"Lean writes out the mass of one outcome under the equal-share distribution as the reciprocal of how many possible outcomes there are.","pair_key":"b5f194cfc4b59a16928a58e0dc2201bff677c2edd840f7102cb39de50e95b181","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"proved","rank":3,"relation":"closeMatch","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":"72dc3042624c60ea122dc6c054d15d3ae733358f7445dbb008744664995eed40","prominence":"central","quote":{"exact":"Developed from studies of games of chance (such as rolling dice) it"},"quote_capped":true,"section":["Classical definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"Developed from studies of games of chance (such as rolling dice) it states that probability is shared equally between all the possible outcomes, provided these outcomes can be deemed equally likely.[1] (3.1)","segments":[{"text":"Developed from studies of games of chance (such as rolling dice) it states that probability is shared equally between all the possible outcomes, provided these outcomes can be deemed equally likely."},{"ref":"[1]"},{"text":" (3.1)"}]},"unresolved":null},{"absence":null,"basis":"d03b8356565a103ebfb77f9ecee0987d44a50b7d96ceb5682a6ce787399173bb","coverage":null,"id":"enwiki-23538-1372945804::In-text #dd736c08","item":"In-text #dd736c08","kind":"definition","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.uniformOn_apply_finset","end_line":109,"library":"mathlib","line":107,"location_key":"d03b8356565a103ebfb77f9ecee0987d44a50b7d96ceb5682a6ce787399173bb","module":"Mathlib.Probability.UniformOn","note":"Lean names the favourable cases as the intersection of the two finsets and divides the counts; with no possible cases at all the quotient takes Lean's zero default, a situation the passage's reduction to equally possible cases never produces.","pair_key":"7eb3e42a31dee71a9fb185c832e05fba8d853de033ebedfeac8a958cea8af7b6","path":"Mathlib/Probability/UniformOn.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.uniformOn_apply_finset {Ω : Type*} [MeasurableSpace Ω] [MeasurableSingletonClass Ω] [DecidableEq Ω] {s t : Finset Ω} : (ProbabilityTheory.uniformOn ↑s) ↑t = ↑(s ∩ t).card / ↑s.card"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MeasureTheory.Measure.uniformOfFinset_apply","end_line":258,"library":"mathlib","line":250,"location_key":"8c53c22022a2d5df92932d37566847d14af9cb70d81076beaae3213e56be5adc","module":"Mathlib.Probability.Distributions.Uniform","note":"Lean selects the favourable cases by filtering the finset of possible cases against the event and divides the two counts.","pair_key":"5db20d8d6e48129ee6b13e12482489bce52e61f8aa8a854fa71a7f257891217e","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 {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (t : Set α) : (MeasureTheory.Measure.uniformOfFinset s) t = ↑{x ∈ s | x ∈ t}.card / ↑s.card"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.uniformOn_toReal","end_line":120,"library":"tauceti","line":103,"location_key":"b9387fd21b2d0456e1666c04a9c6b52ee1bed0cd4aaf7323094635b0a67e8cd2","module":"TauCeti.Probability.UniformSampling","note":"Lean reads the quotient as an ordinary real number through toReal and counts the two collections with Nat.card of the corresponding subtypes.","pair_key":"2c1735b1c568f0d43085ea3e539c2e9c29219584aa45315a176235b3df560c74","path":"TauCeti/Probability/UniformSampling.lean","proof_status":"proved","rank":3,"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}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bab57b14066ebb71cce287418f3b8a38bc214bcba2eb2bad0c8e48e2222ffc66","prominence":"central","quote":{"exact":"The theory of chance consists in reducing all the events of the"},"quote_capped":true,"section":["Classical definition"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"The theory of chance consists in reducing all the events of the same kind to a certain number of cases equally possible, that is to say, to such as we may be equally undecided about in regard to their existence, and in determining the number of cases favorable to the event whose probability is sought. The ratio of this number to that of all the cases possible is the measure of this probability, which is thus simply a fraction whose numerator is the number of favorable cases and whose denominator is the number of all the cases possible.","segments":[{"text":"The theory of chance consists in reducing all the events of the same kind to a certain number of cases equally possible, that is to say, to such as we may be equally undecided about in regard to their existence, and in determining the number of cases favorable to the event whose probability is sought. The ratio of this number to that of all the cases possible is the measure of this probability, which is thus simply a fraction whose numerator is the number of favorable cases and whose denominator is the number of all the cases possible."}]},"unresolved":null},{"absence":null,"basis":"0be8cc7f4f71a2ee77544ffc628a4cd772e510b11e128ae0c174af8fbd5595b4","coverage":null,"id":"enwiki-23538-1372945804::In-text #2e047baa","item":"In-text #2e047baa","kind":"definition","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.uniformOn_univ","end_line":83,"library":"mathlib","line":81,"location_key":"0be8cc7f4f71a2ee77544ffc628a4cd772e510b11e128ae0c174af8fbd5595b4","module":"Mathlib.Probability.UniformOn","note":"Lean writes the numerator as the counting measure of the event and the denominator as the cardinality of the outcome type, matching the two counts of the passage's formula.","pair_key":"edb0822ac13c8ca58b9d60c561accef00e887b2c3c67bf070657cccc7ad968a7","path":"Mathlib/Probability/UniformOn.lean","proof_status":"proved","rank":1,"relation":"closeMatch","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},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.uniformOn_apply_finset","end_line":109,"library":"mathlib","line":107,"location_key":"a2ffc91d1a3f3c531a4e13065ab382bc26fde258ae51896ba8f3ffa4dd6517f0","module":"Mathlib.Probability.UniformOn","note":"Lean writes the favourable outcomes as the intersection of the two finsets and divides the counts.","pair_key":"7cf352e72925c22853db8050335baafa339e0c8ea603e741c324c9778596963a","path":"Mathlib/Probability/UniformOn.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.uniformOn_apply_finset {Ω : Type*} [MeasurableSpace Ω] [MeasurableSingletonClass Ω] [DecidableEq Ω] {s t : Finset Ω} : (ProbabilityTheory.uniformOn ↑s) ↑t = ↑(s ∩ t).card / ↑s.card"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"MeasureTheory.Measure.uniformOfFinset_apply","end_line":258,"library":"mathlib","line":250,"location_key":"c66ea00bac01c0838151d9bc453cd1e8f18cc5e6c7fa89f5fd014ef5c787c363","module":"Mathlib.Probability.Distributions.Uniform","note":"Lean picks out the favourable outcomes by filtering the finset of all outcomes against the event and divides the counts.","pair_key":"4b157d3db3fd26df749bf4ad362def17833dc72e2f73c4f7195db08a4baad7cd","path":"Mathlib/Probability/Distributions/Uniform.lean","proof_status":"proved","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MeasureTheory.Measure.uniformOfFinset_apply {α : Type*} [MeasurableSpace α] [MeasurableSingletonClass α] {s : Finset α} (t : Set α) : (MeasureTheory.Measure.uniformOfFinset s) t = ↑{x ∈ s | x ∈ t}.card / ↑s.card"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4c74afd6b555e80291b24cf5d1dc42786ffe31bf55cab388910e3709a79e0f83","prominence":"central","quote":{"exact":"This can be represented mathematically as follows: If a random experiment can"},"quote_capped":true,"section":["Classical definition"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"This can be represented mathematically as follows: If a random experiment can result in N mutually exclusive and equally likely outcomes and if NA of these outcomes result in the occurrence of the event A, the probability of A is defined by P ( A ) = N A N . {\\displaystyle P(A)={N_{A} \\over N}.}","segments":[{"text":"This can be represented mathematically as follows: If a random experiment can result in N mutually exclusive and equally likely outcomes and if NA of these outcomes result in the occurrence of the event A, the probability of A is defined by "},{"tex":"P(A)={N_{A} \\over N}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"837895b97bb0a45ff3003a43285cefba6ee5d511da4e5f2354e84549800316c9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #12adcad4","item":"In-text #12adcad4","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.geometricMeasure","end_line":56,"library":"mathlib","line":52,"location_key":"df53b673588d28690e38c2a6ffb2a384c0d4308db2280d715ef27930216089c1","module":"Mathlib.Probability.Distributions.Geometric","note":"Lean builds the waiting-time law of the experiment the passage names, on an outcome type that happens to be infinite, but the claim that the outcome set is infinite is nowhere made.","pair_key":"80d00887456b114121b3d0ee2fe815b83f74d5a3b69203979d40294846e97158","path":"Mathlib/Probability/Distributions/Geometric.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ProbabilityTheory.geometricMeasure : ↑unitInterval → MeasureTheory.Measure ℕ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d6629cafcc307c5b3fdb7f66307da79788eea7a4a4e45095044feb90afce4725","prominence":"supporting","quote":{"exact":"But some important random experiments, such as tossing a coin until it"},"quote_capped":true,"section":["Classical definition"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"But some important random experiments, such as tossing a coin until it shows heads, give rise to an infinite set of outcomes.","segments":[{"text":"But some important random experiments, such as tossing a coin until it shows heads, give rise to an infinite set of outcomes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"2d93573fb5a0088b4e2e39b1af991da6373ed27c6f71d2704e402541cc8cc049"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #555e661b","item":"In-text #555e661b","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.ConditionallyIIDWith.tendsto_empiricalMeasure_apply_ae","end_line":182,"library":"tauceti","line":172,"location_key":"bfa5cd6b9461913696126676596022b1f0fde9b0f2413e5a0fc633ba05425fdb","module":"TauCeti.Probability.Exchangeability.ConditionallyIID.StrongLaw","note":"Lean proves that the frequency of an event among the first repetitions tends to the mass its law already gives the event, so the probability is given in advance rather than defined by the limit.","pair_key":"be8a805f7543363d21a90090eb059318f2d56cdd15047e4d756ae9a5b8a483a6","path":"TauCeti/Probability/Exchangeability/ConditionallyIID/StrongLaw.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.ConditionallyIIDWith.tendsto_empiricalMeasure_apply_ae {Ω : Type*} {α : Type*} [MeasurableSpace Ω] [MeasurableSpace α] {μ : MeasureTheory.Measure Ω} {X : ℕ → Ω → α} {ν : Ω → MeasureTheory.ProbabilityMeasure α} [MeasureTheory.IsFiniteMeasure μ] : TauCeti.Probability.ConditionallyIIDWith μ X ν → ∀ {B : Set α}, MeasurableSet B → ∀ᵐ (ω : Ω) ∂μ, Filter.Tendsto (fun n ↦ (↑(TauCeti.Probability.empiricalMeasure (fun i ↦ X i ω) n) B).toReal) Filter.atTop (𝓝 (↑(ν ω) B).toReal)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasure","end_line":146,"library":"tauceti","line":145,"location_key":"b091d9e0a74a3fd761eddbd3d3f45504539f89be6f8111e2310ba65e64445418","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Lean defines the relative frequency of events in a finite run, which is the quantity the frequentist definition takes a limit of, but it fixes no probability.","pair_key":"e07ac91b30e664c925d1af29ebb758e1f7318af273e9814a2bade9387f97f685","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Probability.empiricalMeasure {α : Type*} [MeasurableSpace α] : (ℕ → α) → ℕ → MeasureTheory.ProbabilityMeasure α"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2a0674f4bff3c34f130786d31fbbe0c9e3907ff72574bf97949aa2c44bd28d8b","prominence":"central","quote":{"exact":"Frequentists posit that the probability of an event is its relative frequency"},"quote_capped":true,"section":["Frequentism"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"Frequentists posit that the probability of an event is its relative frequency over time,[1] (3.4) i.e., its relative frequency of occurrence after repeating a process a large number of times under similar conditions.","segments":[{"text":"Frequentists posit that the probability of an event is its relative frequency over time,"},{"ref":"[1]"},{"text":" (3.4) i.e., its relative frequency of occurrence after repeating a process a large number of times under similar conditions."}]},"unresolved":null},{"absence":null,"basis":"1a95ec149ceb7130c6253cae4f57d2b70d7ef2925c44ebfbe4e23a2745ce0d29","coverage":null,"id":"enwiki-23538-1372945804::In-text #ca2975ca","item":"In-text #ca2975ca","kind":"example","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos521.fairCoin_apply","end_line":45,"library":"formal-conjectures","line":44,"location_key":"1a95ec149ceb7130c6253cae4f57d2b70d7ef2925c44ebfbe4e23a2745ce0d29","module":"FormalConjectures.ErdosProblems.«521»","note":"Lean states the value for each of the two faces of the coin, and the passage asks about one of them.","pair_key":"0be6caefcf851012b51ba595ca8c9487bb67792b121396b2de573fabe76e8264","path":"FormalConjectures/ErdosProblems/521.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"theorem Erdos521.fairCoin_apply (b : Bool) : Erdos521.fairCoin {b} = 2⁻¹"},"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":"ce9b1d7987bd5aaac0c632a3bfebf730b676dba00c520c63446095c2bfed072b","module":"Mathlib.Probability.Distributions.Uniform","note":"Lean states the mass of one outcome under the equal-share distribution on a finite set of outcomes, which for the two faces of a coin is one half.","pair_key":"0953e706c1817deee972025361b151488c8a1a3a362e55437e89dbe240ae20fd","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},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"high","declaration":"Erdos521.fairCoin","end_line":38,"library":"formal-conjectures","line":37,"location_key":"b578c9f9bbb411362fb0eaafca495826d6f10ca7755d9eb14531edf7b16da2d1","module":"FormalConjectures.ErdosProblems.«521»","note":"Lean defines the fair coin as the equal-share measure on the two faces; the numerical value the passage states is recorded in the companion result.","pair_key":"c1c7d11fb5454d08631a4b9c6c24e9df9a7b4205250ce41fadd94d9cd77c2509","path":"FormalConjectures/ErdosProblems/521.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos521.fairCoin : MeasureTheory.Measure Bool"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9d2d692ce8d71b25e23e417350f882e5ead7f80dc0d3a111d386fde1596d9836","prominence":"supporting","quote":{"exact":"In the case of tossing a fair coin, frequentists say that the"},"quote_capped":true,"section":["Frequentism"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"after":{"layer":", not because there are two equally likely outcomes but because repeated series of large numbers of trials demonstrate that the empirical frequency converges to the limit 1/2 as the number of trials goes to infinity.","segments":[{"text":", not because there are two equally likely outcomes but because repeated series of large numbers of trials demonstrate that the empirical frequency converges to the limit 1/2 as the number of trials goes to infinity."}]},"layer":"In the case of tossing a fair coin, frequentists say that the probability of getting a heads is 1/2","segments":[{"text":"In the case of tossing a fair coin, frequentists say that the probability of getting a heads is 1/2"}]},"unresolved":null},{"absence":null,"basis":"d3a8c94b40f90f21dba4f11b54dca116b860a938f7eeef0b130cf6b57e06735a","coverage":null,"id":"enwiki-23538-1372945804::In-text #c29d706a","item":"In-text #c29d706a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.strong_law_ae_real","end_line":631,"library":"mathlib","line":598,"location_key":"d3a8c94b40f90f21dba4f11b54dca116b860a938f7eeef0b130cf6b57e06735a","module":"Mathlib.Probability.StrongLaw","note":"Lean gives the limit as the common mean of the tosses rather than writing the number one half; for the indicator of heads under a fair coin that mean is the chance of heads. Lean's conclusion also holds only outside a null set of runs, a refinement of the passage's claim about long series.","pair_key":"4fa1748f2d994042396d954e7d72c82ba6a0586eb5f204d37016c9745a1e4b54","path":"Mathlib/Probability/StrongLaw.lean","proof_status":"proved","rank":1,"relation":"broadMatch","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},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.strong_law_ae_infinitePi","end_line":100,"library":"tauceti","line":75,"location_key":"62b69ee9b27b0deb8c1cc70981639334edd082e20e4bfbc3dd56f45e1276ab6e","module":"TauCeti.Probability.StrongLaw","note":"Lean works on the canonical model of repeated independent trials, the infinite product of one law, which is precisely the series of tosses the passage describes, and its conclusion holds outside a null set of runs.","pair_key":"dd92087973d1dce9a2ab503242b315e8fecbe6c844c9e9e880248e11ce778a7e","path":"TauCeti/Probability/StrongLaw.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.strong_law_ae_infinitePi {α : Type*} [MeasurableSpace α] {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] [MeasurableSpace E] [BorelSpace E] (Q : MeasureTheory.Measure α) [MeasureTheory.IsProbabilityMeasure Q] {f : α → E} : Measurable f → MeasureTheory.Integrable f Q → ∀ᵐ (x : ℕ → α) ∂MeasureTheory.Measure.infinitePi fun x ↦ Q, Filter.Tendsto (fun n ↦ (↑n)⁻¹ • ∑ i ∈ Finset.range n, f (x i)) Filter.atTop (𝓝 (∫ (y : α), f y ∂Q))"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.ConditionallyIIDWith.tendsto_empiricalMeasure_apply_ae","end_line":182,"library":"tauceti","line":172,"location_key":"3358bb065e61c86fab66c8545b944db3381957ef8a636c9866a6f7334297310e","module":"TauCeti.Probability.Exchangeability.ConditionallyIID.StrongLaw","note":"Lean states the convergence of empirical frequencies under a conditionally independent and identically distributed hypothesis, which a run of fair tosses meets only once that structure has been established for it.","pair_key":"d4316ebadf1722d8ed86c5c321d0909529af2bfcbe2f30a647a1b7653676874d","path":"TauCeti/Probability/Exchangeability/ConditionallyIID/StrongLaw.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.ConditionallyIIDWith.tendsto_empiricalMeasure_apply_ae {Ω : Type*} {α : Type*} [MeasurableSpace Ω] [MeasurableSpace α] {μ : MeasureTheory.Measure Ω} {X : ℕ → Ω → α} {ν : Ω → MeasureTheory.ProbabilityMeasure α} [MeasureTheory.IsFiniteMeasure μ] : TauCeti.Probability.ConditionallyIIDWith μ X ν → ∀ {B : Set α}, MeasurableSet B → ∀ᵐ (ω : Ω) ∂μ, Filter.Tendsto (fun n ↦ (↑(TauCeti.Probability.empiricalMeasure (fun i ↦ X i ω) n) B).toReal) Filter.atTop (𝓝 (↑(ν ω) B).toReal)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0e98445c7695e5cc7bc88afe06e8aa91fa49c77446240fb29b73b348505f0e11","prominence":"supporting","quote":{"exact":"repeated series of large numbers of trials demonstrate that the empirical frequency"},"quote_capped":true,"section":["Frequentism"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"before":{"layer":"In the case of tossing a fair coin, frequentists say that the probability of getting a heads is 1/2, not because there are two equally likely outcomes but because ","segments":[{"text":"In the case of tossing a fair coin, frequentists say that the probability of getting a heads is 1/2, not because there are two equally likely outcomes but because "}]},"layer":"repeated series of large numbers of trials demonstrate that the empirical frequency converges to the limit 1/2 as the number of trials goes to infinity.","segments":[{"text":"repeated series of large numbers of trials demonstrate that the empirical frequency converges to the limit 1/2 as the number of trials goes to infinity."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"d3a4fa0282496f567baad79a770e94832f4118c6c76ce35c7d63dab9a1d3d742"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #0eca286e","item":"In-text #0eca286e","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasure_apply","end_line":169,"library":"tauceti","line":164,"location_key":"b3ec6f723d54fffaf950351b2a5ff6a2322251f4f6e711d9888729a5c277a87e","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Lean computes the ratio of occurrences to trials that the passage writes, but it attaches no limit and declares no probability.","pair_key":"53f2a9eaae358c6f4659d7d59d2cce657e562f655fb4d9164801d7af6c2c858a","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"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)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.ConditionallyIIDWith.tendsto_empiricalMeasure_apply_ae","end_line":182,"library":"tauceti","line":172,"location_key":"cc135d490c79d43b7ca5342fda7965286e23661ba4602743ad08ec7f834b6fa0","module":"TauCeti.Probability.Exchangeability.ConditionallyIID.StrongLaw","note":"Lean proves that the ratio of occurrences to trials tends to the mass the law already gives the event, which is the converse of the passage's move from the limit to the probability.","pair_key":"8ec3e737fa7b1d9ac1d1e2d2f17a432e56ad6d61a3a2035beaaf4cfba340db0c","path":"TauCeti/Probability/Exchangeability/ConditionallyIID/StrongLaw.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.ConditionallyIIDWith.tendsto_empiricalMeasure_apply_ae {Ω : Type*} {α : Type*} [MeasurableSpace Ω] [MeasurableSpace α] {μ : MeasureTheory.Measure Ω} {X : ℕ → Ω → α} {ν : Ω → MeasureTheory.ProbabilityMeasure α} [MeasureTheory.IsFiniteMeasure μ] : TauCeti.Probability.ConditionallyIIDWith μ X ν → ∀ {B : Set α}, MeasurableSet B → ∀ᵐ (ω : Ω) ∂μ, Filter.Tendsto (fun n ↦ (↑(TauCeti.Probability.empiricalMeasure (fun i ↦ X i ω) n) B).toReal) Filter.atTop (𝓝 (↑(ν ω) B).toReal)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b50d5e17efc0ee1c2a417a87db388063d19764a9321acec757f6f79751d248da","prominence":"central","quote":{"exact":"If we denote by n a {\\displaystyle \\textstyle n_{a}} the number of"},"quote_capped":true,"section":["Frequentism"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"If we denote by n a {\\displaystyle \\textstyle n_{a}} the number of occurrences of an event A {\\displaystyle {\\mathcal {A}}} in n {\\displaystyle \\textstyle n} trials, then if lim n → + ∞ n a n = p {\\displaystyle \\lim _{n\\to +\\infty }{n_{a} \\over n}=p} we say that P ( A ) = p {\\displaystyle \\textstyle P({\\mathcal {A}})=p} .","segments":[{"text":"If we denote by "},{"tex":"\\textstyle n_{a}"},{"text":" the number of occurrences of an event "},{"tex":"\\mathcal {A}"},{"text":" in "},{"tex":"\\textstyle n"},{"text":" trials, then if "},{"tex":"\\lim _{n\\to +\\infty }{n_{a} \\over n}=p"},{"text":" we say that "},{"tex":"\\textstyle P({\\mathcal {A}})=p"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"4340c731b62f69ffa47d30e497c63566965e74a68c353f6dcf7175a622d6c184"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #cfc92177","item":"In-text #cfc92177","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Probability.Finance.FundamentalTheoremAssetPricing.one_period_fundamental_theorem_asset_pricing_general","library":"atlas","line":31,"location_key":"4c88957306703ab39c1b08b7d9d9e2b9212403469641f81c1f4543da9b2dbee2","module":"MathlibExt.Probability.Finance.FundamentalTheoremAssetPricing","note":null,"pair_key":"34e3260d6e6481fc37871663bf95b3f5a2e877c2a388dd860c1f124bfa35f4b0","path":"MathlibExt/Probability/Finance/FundamentalTheoremAssetPricing.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Probability.Finance.FundamentalTheoremAssetPricing.one_period_fundamental_theorem_asset_pricing_general {Ω : Type*} [Fintype Ω] [Nonempty Ω] {A : Type*} [Fintype A] (g : A → Ω → ℝ) : (¬∃ h, (∀ (ω : Ω), 0 ≤ ∑ a, h a * g a ω) ∧ ∃ ω, 0 < ∑ a, h a * g a ω) ↔ ∃ q, (∀ (ω : Ω), 0 < q ω) ∧ ∑ ω, q ω = 1 ∧ ∀ (a : A), ∑ ω, q ω * g a ω = 0"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6deee94daba4eb4248f37d71ab62c188a0a56b5f298b9b2a1a095db5c3d6d41f","prominence":"central","quote":{"exact":"Bayesians point to the work of Ramsey[10] (p 182) and de Finetti[8]"},"quote_capped":true,"section":["Subjectivism"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"Bayesians point to the work of Ramsey[10] (p 182) and de Finetti[8] (p 103) as proving that subjective beliefs must follow the laws of probability if they are to be coherent (rational).","segments":[{"text":"Bayesians point to the work of Ramsey"},{"ref":"[10]"},{"text":" (p 182) and de Finetti"},{"ref":"[8]"},{"text":" (p 103) as proving that subjective beliefs must follow the laws of probability if they are to be coherent (rational)."}]},"unresolved":null},{"absence":null,"basis":"a3306a213cd0ea53f25cce4b13b00faf99488825fb576c725237d7ad76ed7c78","coverage":null,"id":"enwiki-23538-1372945804::In-text #7dba4f2e","item":"In-text #7dba4f2e","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Probability.strong_law_ae_infinitePi","end_line":100,"library":"tauceti","line":75,"location_key":"a3306a213cd0ea53f25cce4b13b00faf99488825fb576c725237d7ad76ed7c78","module":"TauCeti.Probability.StrongLaw","note":"It gives almost-sure convergence of the frequency; it does not say where the law itself comes from.","pair_key":"6fc202c1d3fd9cbcdb1aec98fbbb80bb3702c5e96583eeab80e5ada4401f5add","path":"TauCeti/Probability/StrongLaw.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.strong_law_ae_infinitePi {α : Type*} [MeasurableSpace α] {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] [MeasurableSpace E] [BorelSpace E] (Q : MeasureTheory.Measure α) [MeasureTheory.IsProbabilityMeasure Q] {f : α → E} : Measurable f → MeasureTheory.Integrable f Q → ∀ᵐ (x : ℕ → α) ∂MeasureTheory.Measure.infinitePi fun x ↦ Q, Filter.Tendsto (fun n ↦ (↑n)⁻¹ • ∑ i ∈ Finset.range n, f (x i)) Filter.atTop (𝓝 (∫ (y : α), f y ∂Q))"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ProbabilityTheory.strong_law_ae_real","end_line":631,"library":"mathlib","line":598,"location_key":"35ec8d1c2179b04ea3d311e9fc69890d9be8eea72b3cb5594f2c43a226f24839","module":"Mathlib.Probability.StrongLaw","note":null,"pair_key":"3637a2864599d4466103605ec17d412c74fc022f89ddcd37e1f91b924b9a7ec1","path":"Mathlib/Probability/StrongLaw.lean","proof_status":"proved","rank":2,"relation":"hasPart","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":"83576a30254131158d92c8e3007419d16334c4a50f799e095b31a0da1e1925fa","prominence":"central","quote":{"exact":"This law, which is a consequence of the axioms of probability, says"},"quote_capped":true,"section":["Propensity"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"This law, which is a consequence of the axioms of probability, says that if (for example) a coin is tossed repeatedly many times, in such a way that its probability of landing heads is the same on each toss, and the outcomes are probabilistically independent, then the relative frequency of heads will be close to the probability of heads on each single toss.","segments":[{"text":"This law, which is a consequence of the axioms of probability, says that if (for example) a coin is tossed repeatedly many times, in such a way that its probability of landing heads is the same on each toss, and the outcomes are probabilistically independent, then the relative frequency of heads will be close to the probability of heads on each single toss."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"a0f25900a7bddd6ac64240ed158d457c97ad1b9ce5930137d71d56feeb2cce4e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #9d10c3f2","item":"In-text #9d10c3f2","kind":"definition","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasure","end_line":146,"library":"tauceti","line":145,"location_key":"7a670f485a48f6064878eeea2706422e0c445d2eed4108d50c923d76663fb026","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":null,"pair_key":"6e0c08dfd9e8b93dac58a7adfd1e0dc9acb5e71b2f77f81bfb2d1552e07fdfa3","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Probability.empiricalMeasure {α : Type*} [MeasurableSpace α] : (ℕ → α) → ℕ → MeasureTheory.ProbabilityMeasure α"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"99eb1b46b52347a06f3f68e6ff3aba7fe52d15bc6c87719bf2bbb2501578674a","prominence":"supporting","quote":{"exact":"To say that a set of generating conditions has propensity p of"},"quote_capped":true,"section":["Propensity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"To say that a set of generating conditions has propensity p of producing the outcome E means that those exact conditions, if repeated indefinitely, would produce an outcome sequence in which E occurred with limiting relative frequency p.","segments":[{"text":"To say that a set of generating conditions has propensity p of producing the outcome E means that those exact conditions, if repeated indefinitely, would produce an outcome sequence in which E occurred with limiting relative frequency p."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"27266138a9f8abd1c97f540cf6eebfafb1c02b3ec90e511f401787083216cf32"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #d72fe7dc","item":"In-text #d72fe7dc","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.dirac_apply_eq_zero_or_one","end_line":47,"library":"mathlib","line":42,"location_key":"192a70a724b56c998d47ea710ec204129ce07eb654cc343d26d16c1db2e926a0","module":"Mathlib.MeasureTheory.Measure.Dirac.Def","note":null,"pair_key":"979b7a765cfa9735a545f371cab5a5798fa6322063cbd3b2e7c5529acee01bfa","path":"Mathlib/MeasureTheory/Measure/Dirac/Def.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MeasureTheory.Measure.dirac_apply_eq_zero_or_one {α : Type*} [MeasurableSpace α] {s : Set α} {a : α} : (MeasureTheory.Measure.dirac a) s = 0 ∨ (MeasureTheory.Measure.dirac a) s = 1"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1ac74d276b6ff11d19e982254868c9a266fdb6b85e5a4fe08afa910ea3affe71","prominence":"supporting","quote":{"exact":"For Popper then, a deterministic experiment would have propensity 0 or 1"},"quote_capped":true,"section":["Propensity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"For Popper then, a deterministic experiment would have propensity 0 or 1 for each outcome, since those generating conditions would have same outcome on each trial. In other words, non-trivial propensities (those that differ from 0 and 1) only exist for genuinely nondeterministic experiments.","segments":[{"text":"For Popper then, a deterministic experiment would have propensity 0 or 1 for each outcome, since those generating conditions would have same outcome on each trial. In other words, non-trivial propensities (those that differ from 0 and 1) only exist for genuinely nondeterministic experiments."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"627116b3f9ec7b998ad4a892186487e9a8b71ee471433639ac1960832df4597c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #26cf7625","item":"In-text #26cf7625","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"641b8d23e0e0ea469ffaa44d970d1a5c79de92034f06c653cd8d01d9abe460ff","prominence":"supporting","quote":{"exact":"One central property of chance is that, when known, it constrains rational"},"quote_capped":true,"section":["Propensity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"One central property of chance is that, when known, it constrains rational belief to take the same numerical value. David Lewis called this the Principal Principle,[1] (3.3 & 3.5) a term that philosophers have mostly adopted. For example, suppose you are certain that a particular biased coin has propensity 0.32 to land heads every time it is tossed. What is then the correct price for a gamble that pays $1 if the coin lands heads, and nothing otherwise?","segments":[{"text":"One central property of chance is that, when known, it constrains rational belief to take the same numerical value. David Lewis called this the Principal Principle,"},{"ref":"[1]"},{"text":" (3.3 & 3.5) a term that philosophers have mostly adopted. For example, suppose you are certain that a particular biased coin has propensity 0.32 to land heads every time it is tossed. What is then the correct price for a gamble that pays $1 if the coin lands heads, and nothing otherwise?"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"8e9da5b04ecd77d51043c3f1b335d0de34fa40f6e1641c19a6bf0e0a41d7e495"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-23538-1372945804::In-text #4498f779","item":"In-text #4498f779","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.integral_of_hasLaw_bernoulliMeasure","end_line":76,"library":"tauceti","line":74,"location_key":"e6e761036d18b079077f8f04a71fb8b334e02ff64a3815ed0fcfcda80b86ae14","module":"TauCeti.Probability.Distributions.Bernoulli.Basic","note":null,"pair_key":"b72ce08ca6a67b69ebc7fcbdb2fda1e20d8ef0964efa338520fa6af178dd24a7","path":"TauCeti/Probability/Distributions/Bernoulli/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.integral_of_hasLaw_bernoulliMeasure {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω} {X : Ω → ℝ} {p : ↑unitInterval} : ProbabilityTheory.HasLaw X (ProbabilityTheory.bernoulliMeasure 1 0 p) P → ∫ (x : Ω), X x ∂P = ↑p"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.integral_indicator_one","end_line":531,"library":"mathlib","line":529,"location_key":"8321badc3869fa57ab8f76bc93fdd6f2b37f3b5be93caa97e163f4e6f0e1a7d9","module":"Mathlib.MeasureTheory.Integral.Bochner.Set","note":null,"pair_key":"8f4facc35f8833f81af53974669ee1472a836313a6463dcdfa258270916cfb28","path":"Mathlib/MeasureTheory/Integral/Bochner/Set.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MeasureTheory.integral_indicator_one {X : Type*} {mX : MeasurableSpace X} {μ : MeasureTheory.Measure X} ⦃s : Set X⦄ : MeasurableSet s → ∫ (x : X), s.indicator 1 x ∂μ = μ.real s"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cc1251d21ce3432d19e2a304f437269d8afb05b13820cdb1b68be990d91c8bc4","prominence":"supporting","quote":{"exact":"According to the Principal Principle, the fair price is 32 cents."},"quote_capped":false,"section":["Propensity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=23538&oldid=1372945804","text":{"layer":"According to the Principal Principle, the fair price is 32 cents.","segments":[{"text":"According to the Principal Principle, the fair price is 32 cents."}]},"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":123614,"images":[{"author":"Gaz at English Wikipedia","file":"Dice.jpg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.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":"Tkgd2007","file":"Question_book-new.svg","licence":"Cc-by-sa-3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"en"},{"author":"Toni Lozano","file":"Roulette_wheel.jpg","licence":"CC BY 2.0","licence_url":"https://creativecommons.org/licenses/by/2.0","project":"commons"}],"marks":66,"passages":14,"sha256":"9851862d553f3ea286a0d0497472c99972f436f00099ce6c494da541f409b20b","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"ad8d6237d4169e214be834e89d11bcb10c71180f492b36f21a09cc2fb09c36e6","revision":1372945804,"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":"7e621ef95e16c4db2cdbfd706dd49fd24771c816d438829a2c929243f9a4c571","layer_sha256":"5c40fe78a533033762112212cbe6e81deba6a7f664f6e6f215a914eb25ca0a1d","renderer":"web-html/3"},"source_id":"enwiki-23538-1372945804","summary":{"by_library":{"atlas":{"complete":0,"incomplete":0,"locations":0,"passages":0,"related":1},"formal-conjectures":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":1},"mathlib":{"complete":11,"incomplete":0,"locations":11,"passages":6,"related":3},"tauceti":{"complete":3,"incomplete":0,"locations":3,"passages":3,"related":7}},"by_prominence":{"central":{"by_status":{"formalized":1,"not_formalized":3,"partial":3,"statement_only":0,"unresolved":0},"passages":7},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":0},"supporting":{"by_status":{"formalized":2,"not_formalized":5,"partial":0,"statement_only":0,"unresolved":0},"passages":7}},"by_proof_status":{"definition":6,"proved":21},"by_relation":{"broadMatch":4,"closeMatch":7,"exactMatch":2,"hasPart":2,"relatedMatch":12},"by_status":{"formalized":3,"not_formalized":8,"partial":3,"statement_only":0,"unresolved":0},"locations":15,"passages":14,"related":12},"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":"Probability interpretations","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q7246880"}
