Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Moments of a uniformly sampled fixed-size client set

Statement

Let v1,…,vN∈Rd, let 1≤S≤N, and choose S uniformly from the S-element subsets of {1,…,N}. Put vˉ=N−1∑ivi and vˉS=S−1∑i∈Svi. If N>1, then E[vˉS]=vˉ,E∥vˉS−vˉ∥22=(1−SN)1S(N−1)∑i=1N∥vi−vˉ∥22. In particular, E∥vˉS−vˉ∥22≤2(1−SN)1S1N∑i=1N∥vi∥22. If N=1, necessarily S=1 and vˉS=vˉ.

Facts & Assumptions

Given: The finite client set, fixed vectors, and uniform subset law in the Statement.

[F1]

Federated objectives and client sampling: all S-element subsets have equal probability.

[F2]

Expectation of a nonnegative or integrable random variable: expectation on this finite probability space is the integral; finite-valued expectations are the corresponding finite weighted sums by Expectation agrees with the published finite weighted sum.

[F3]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: the squared Euclidean norm expands as the sum of squared coordinates and the inner product is bilinear.

Proof

1.1F1F2givenalgebra

Assume N>1 and define Ii=1{i∈S} and [given] p=S/N. Counting equally likely subsets gives E[Ii]=(N−1S−1)/(NS)=p. For distinct i,j, E[IiIj]=S(S−1)/(N(N−1)): this is zero for S=1, and for S≥2 it is (N−2S−2)/(NS). Thus E[(Ii−p)2]=S(N−S)N2,E[(Ii−p)(Ij−p)]=−S(N−S)N2(N−1)(i≠j). These expectations are finite weighted sums by [F2].

1.2F2F3step 1.1givenalgebra

Since ∑iIi=S, we have [given] vˉS−vˉ=S−1∑i(Ii−p)(vi−vˉ). Also ∑i(vi−vˉ)=0, so ∑i≠j⟨vi−vˉ,vj−vˉ⟩=−∑i∥vi−vˉ∥22. Expanding the squared norm [F3] and using step 1.1 yields E∥vˉS−vˉ∥22=1S2[S(N−S)N2∑i∥vi−vˉ∥22−S(N−S)N2(N−1)∑i≠j⟨vi−vˉ,vj−vˉ⟩]=N−SSN(N−1)∑i∥vi−vˉ∥22. The first-moment identity follows from E[Ii]=S/N in step 1.1.

2.1F3step 1.2givenalgebra∎

The identity N−1∑i∥vi−vˉ∥22=N−1∑i∥vi∥22−∥vˉ∥22 and N/(N−1)≤2 give the stated upper bound. If N=1, the only size-one subset is the full set, so its sample mean equals vˉ and its variance is zero.

Depends on

Used by

Dependency tree · two levels

25 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