Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

BY and BH thresholds for independent valid p-values

Example

Let S={1/100,1/25,13/100,29/100,1} and put masses 1/100,3/100,9/100,16/100,71/100 on these five values. On the finite sample space Ω=S4 equipped with its power-set sigma-algebra F=P(S4) (equivalently, the finite product of the discrete sigma-algebras), use the product probability law. Let the four coordinate projections be p-values and make all four null hypotheses true in the one-point parameter experiment. Each p-value is measurable and valid, and the coordinates are independent. For q=1/5, the observed ordered vector

(1100,125,13100,29100)

has positive probability. BH rejects three hypotheses on this outcome, whereas BY rejects two. The independent model supplies the PRDS premise for BH, and BY's theorem needs only validity.

Facts & Assumptions

Given: The finite sample space and product law described in the Example, four true null hypotheses, and q=1/5.

[F1]

Statistical experiments: a statistical experiment is a measurable sample space, a parameter-label set, and a family of probability laws.

[F2]

Null-valid p-values and familywise and false-discovery error rates: p-value validity is the superuniform bound P(pi≤u)≤u at every u∈[0,1] under a true null.

[F3]

Positive regression dependence on true-null coordinates (PRDS): PRDS requires each true-null coordinate's conditional probabilities of increasing Borel sets to be nondecreasing on its support.

[F4]

Conditional law given a random element: a conditional-law kernel satisfies the joint-probability identity for every conditioning event and target event.

[F5]

Benjamini–Hochberg step-up procedure: BH uses critical values kq/m and rejects the first R ordered hypotheses, where R is the largest passing rank.

[F6]

Benjamini–Yekutieli step-up procedure: BY uses critical values kq/(mHm) and rejects the first R ordered hypotheses.

[F7]

Harmonic numbers for set-cover analysis: H4=1+1/2+1/3+1/4=25/12.

[F8]

BY controls FDR under arbitrary dependence: valid p-values under arbitrary dependence give BY FDR at most (m0/m)q.

[F9]

BH controls FDR under PRDS: valid p-values with PRDS on the true-null set give BH FDR at most (m0/m)q.

[A1]

The sample space is Ω=S4 with F=P(S4); equivalently, F is the finite product of the discrete sigma-algebras on S. The four coordinates have the specified independent common marginal law, and all four null hypotheses are true.

[A2]

Assume the Axiom of Choice (The Axiom of Choice) when invoking the general PRDS theorem's conditional-law convention; the finite kernel constructed below is explicit.

Verification

technique · direct finite calculation

Given: The product experiment, the marginal distribution, all four true nulls, and q=1/5.

1.1A1F1F2algebra

The five masses sum to one, and the sum of the product point masses on S4 is (∑s∈Sμ({s}))4=1, so these masses define a probability law on the finite sample space. For any subsets B1,…,B4⊆S, summing the product masses over B1×⋯×B4 factors as ∏iμ(Bi); thus the coordinate p-values are mutually independent. Each coordinate has support 1/100,1/25,13/100,29/100,1 and cumulative probabilities 1/100,4/100,13/100,29/100,1, respectively. At each support value the cumulative probability equals that value; between successive support values it stays at the preceding value, and below 1/100 it is zero. Thus P(pi≤u)≤u for every u∈[0,1], so all four p-values are valid by [F2].

1.2A1F3F4givenconstruct

Fix a coordinate i. For x∈S, define Ki(x,⋅) as the law of the four-vector obtained by fixing coordinate i at x and drawing the other three coordinates independently from the specified marginal; for x∉S, use a fixed point mass. Since S is finite, each evaluation is Borel measurable and each section is a probability measure. For Borel A⊆[0,1] and D⊆[0,1]4, product-mass factorization gives ∫AKi(x,D) Ppi(dx)=P(pi∈A, p∈D), so this is a conditional law by [F4]. If D is coordinatewise increasing and x≤x′ in S, then fixing any same remaining triple makes the vector at x coordinatewise at most the vector at x′, so its indicator of D is no larger. Averaging over the same three-coordinate product law yields Ki(x,D)≤Ki(x′,D). This holds for every i, and [F3] gives PRDS on the all-true-null set.

1.3A1F5F6F7givenalgebra

The event that the four coordinates take the four distinct values 1/100,1/25,13/100,29/100 in any order has probability 4!(1/100)(3/100)(9/100)(16/100)>0. On this event H4=25/12. BH's critical values are 1/20,1/10,3/20,1/5, so the first three ordered p-values pass and the fourth does not, giving RBH=3. BY's critical values are 3/125,6/125,9/125,12/125, so ranks one and two pass and rank three does not, giving RBY=2.

2.1A1A2F8F9step 1.3algebra∎

Here m0=m=4. By [F8] and [F9], each rule has FDR at most q=1/5 under this model; step 1.3 gives a positive-probability event on which their rejection counts differ.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.