Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A finite sample can miss a predicted outcome with positive probability: an elementary product-model counterexample

Physical scope

A counterexample to a stated inference rule for finite samples: it exhibits a finite probability model, of the product form used for independent repetitions, in which a designated outcome occurs with probability p in (0,1) at every trial while a finite sample avoids it with probability (1-p)^n in (0,1). The item refutes only the implication from a finite sample without the outcome to the falsehood of the declared sampling model; it asserts no experiment, no observed sequence and nothing about the truth or falsity of any physical model.

Statement refuted

Let a repeated-observation protocol of Repeated-observation protocols of the force branch: adopted IID and second-moment sampling hypotheses and the sample mean satisfy its IID sampling hypothesis and its second-moment hypothesis, and let A be an event of a single observation with 0<P(A)=p<1. Then every finite sample (Y1,…,Yn) of the protocol contains at least one outcome in A for every n≥1; equivalently, if a finite sample contains no outcome in A, the declared sampling model is refuted.

Facts & Assumptions

[L1]

Finite probability spaces: a finite set Ωi with weights wi≥0 summing to 1, every subset an event, and event probability the sum of the weights of its outcomes; for events A⊆B one has P(Ac)=1−P(A) (Finite probability spaces, outcome weights, events, and event probabilities, Normalization, nonnegativity, monotonicity, complements, and differences in a finite probability space).

[L2]

Products: the product probability space of a finite family ((Ωi,wi))i≤n has outcome set ∏iΩi and weights w(ω)=∏iwi(ωi); coordinate events are mutually independent and P(⋂i∈JCi)=∏i∈JPi(Ai) for every J⊆{1,…,n} (The finite product of finite probability spaces, Product weights normalize, and coordinate events are mutually independent).

[L3]

Bernoulli variables: a Bernoulli(p) random variable takes the value 1 with probability p and 0 with probability 1−p (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials).

[L4]

An operational instance is the one-label zero-force model on I0=R, Q=R3, with mass m>0, singleton parameter and preparation sets, datum (t0,x0,v0)=(0,0,0) and observation time t1=1. Its motion is x(t)=0, satisfying mx′′=0, and is the unique maximal motion by Local existence and uniqueness for the Newtonian initial-value problem, with the quantitative Picard-Lindelöf cylinder. Choose the scalar readout to be the constant zero map, so Φ=0, with dimensionless readout/error coordinates and open error domain V=(−1/2,3/2). This is an admissible operational observable model of Operational observable model of the force branch: parameters, preparations, observation times, readout, units and additive error; the finite Bernoulli errors used below take values in V.

Counterexample

Proof technique: direct; build the finite product model of n independent trials, apply the product probability law to the event that no trial takes the designated value, and interpret the result as a probability statement about finite samples.

1.1givenL1L3

Let p∈(0,1) and let Ω0:={0,1} with weights w0(1):=p and w0(0):=1−p; these weights are nonnegative and sum to 1, so (Ω0,w0) is a finite probability space in the sense of [L1], and the event A0:={1} has P(A0)=p by [L3], with A0≠∅ and P(A0)∈(0,1).

1.2givenL2L3L4

For n≥1 form the finite product of n copies of (Ω0,w0): the outcome set is Ω:={0,1}n with weights w(ω)=∏k=1nw0(ωk), a finite probability space by [L2]; the single-observation event of the refuted statement corresponds to the coordinate event Ck:={ωk=1} in the k-th coordinate, with coordinate probability p by mutual independence of the coordinates in [L2], and setting εk(ω):=ωk in the operational model of [L4] gives Yk=Φ+εk=ωk as the k-th observation. The family (Yk)k≤n identically distributed by construction and mutually independent by [L2], so it satisfies the IID sampling hypothesis of Repeated-observation protocols of the force branch: adopted IID and second-moment sampling hypotheses and the sample mean; each Yk is bounded, so the second-moment hypothesis holds as well.

2.1step 1.2L2algebra

The event "no outcome in A occurs in the finite sample" is E:={ω∈Ω:ωk=0 for every k≤n}=⋂k=1n{ωk=0}; by the product formula of [L2] applied to the coordinate events {ωk=0}, whose coordinate probabilities are 1−p, one has P(E)=∏k=1n(1−p)=(1−p)n.

3.1step 2.1L1algebra

Since 0<p<1 one has 0<1−p<1 and therefore 0<(1−p)n<1 for every n≥1; the event E of a finite sample with no outcome in A has strictly positive probability.

4.1step 1.2step 2.1step 3.1

Under the product model of steps 1.2 and 2.1 the single observation lies in the designated event with probability p∈(0,1), the coordinates are mutually independent, and yet the finite sample avoids the event with positive probability (1−p)n by step 3.1; therefore the implication asserted in the refuted statement is false: a finite sample with no outcome in A can occur with positive probability under the declared sampling model, so its occurrence does not refute that model.

5.1step 3.1step 4.1algebra∎

The probability that at least one outcome in A is seen in the finite sample is 1−(1−p)n, which tends to 1 as n grows but equals 1 for no finite n when 0<p<1; the failure to exhibit the feature in a finite sample is a positive-probability event of the model, not a refutation of it.

Remarks

The construction is a finite probability computation; it contains no actual apparatus, no performed preparation, no data and no observed sequence; [L4] supplies only declared operational model data. Its physical reading is the elementary consistency statement of Repeated-observation protocols of the force branch: adopted IID and second-moment sampling hypotheses and the sample mean: a model assigning probability p per trial to an outcome class is compatible with a finite sample that misses it, and the probability of the miss is (1−p)n when the trials are independent.

What the counterexample does not show is that the declared model is true, or that some other model is false: consistency of one finite sample with a model is not evidence for it, and comparing models requires a specified test — data space, model family, null set, rejection region and size — as in Model testing for the force branch: what a test specifies, what rejection and retention establish, and what is not claimed in its role as a scope item of the companion page.

Depends on

Dependency tree · 2 levels

Sources