Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Estimate an inner product from ℓ2-sampling access

Statement

Let x∈Rn be nonzero with exact norm, ℓ2 sample access, and entry-query access, and let y∈Rn have entry-query access and known norm. For 0<ϵ≤1, a positive integer m≥16/ϵ2, and a positive integer r with 2−r≤δ<1, there is a finite estimator using the lower median of r block means, with mr samples from x and at most mr entry queries to each of x and y, such that P(∣μ^−⟨x,y⟩∣>ϵ∥x∥2∥y∥2)≤δ. If y=0, return 0 without sampling. All sample and entry-query costs are charged.

Facts & Assumptions

Given: The access interfaces, ϵ,m,r,δ and vectors in the Statement.

[F1]

ℓ2 sample/query access to vectors and matrices: sampling index i from nonzero x gives probability xi2/∥x∥22.

[F2]

Chebyshev's inequality on a finite probability space: for a finite real variable Z and t>0, P(∣Z−EZ∣≥t)≤Var⁡(Z)/t2.

[F3]

Pairwise and mutual independence of finite-valued random variables: independent samples give independent copies of any deterministic function of the sampled index.

[F4]

The finite union bound: the probability of a finite union is at most the sum of the event probabilities.

Proof

1.1givenF1algebracases

If y=0, the prescribed output 0 equals ⟨x,y⟩ and has zero error. Suppose henceforth y≠0. For one sample I∼Dx, query xI and yI and define Z=∥x∥22yI/xI when xI≠0 and Z=0 when xI=0. Since a zero coordinate has sampling probability zero, [F1] gives EZ=∑i:xi≠0xiyi=⟨x,y⟩.

2.1step 1.1F1algebra

Directly from the sampling law [F1], E[Z2]=∥x∥22∑i:xi≠0yi2≤∥x∥22∥y∥22. Hence Var⁡(Z)≤E[Z2]≤∥x∥22∥y∥22.

3.1givenstep 1.1step 2.1F2F3constructalgebra

Partition mr independent samples into r disjoint blocks of size m. Let Mb be the mean of Z in block b and define μ^ to be the ⌈r/2⌉-th order statistic of M1,…,Mr (the lower median). Independence gives each block mean variance at most ∥x∥22∥y∥22/m. Apply [F2] with the positive threshold t=ϵ∥x∥2∥y∥2; each block mean is outside the target interval with probability at most 1/(mϵ2)≤1/16.

4.1step 3.1F3F4algebra∎

If the median μ^ lies outside the target interval, at least ⌈r/2⌉ block means lie outside it. For each fixed subset of that size the probability all its blocks fail is at most (1/16)⌈r/2⌉ by [F3]; there are at most 2r such subsets. By [F4], the failure probability is at most 2r(1/16)⌈r/2⌉≤2−r≤δ.

Depends on

Used by

Dependency tree · two levels

22 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.

Sources