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 , let , and choose uniformly from the -element subsets of . Put and . If , then In particular, If , necessarily and .
Facts & Assumptions
Given: The finite client set, fixed vectors, and uniform subset law in the Statement.
Federated objectives and client sampling: all -element subsets have equal probability.
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.
The Euclidean inner product on : the squared Euclidean norm expands as the sum of squared coordinates and the inner product is bilinear.
Proof
Assume and define and [given] . Counting equally likely subsets gives . For distinct , : this is zero for , and for it is . Thus These expectations are finite weighted sums by [F2].
Since , we have [given] . Also , so . Expanding the squared norm [F3] and using step 1.1 yields The first-moment identity follows from in step 1.1.
The identity and give the stated upper bound. If , the only size-one subset is the full set, so its sample mean equals and its variance is zero.
Depends on
Used by
- Convex SCAFFOLD control-lag recursion Lemma
- Convex SCAFFOLD server-update second moment Lemma
- Nonconvex SCAFFOLD control-anchor tracking recursion Lemma
- Nonconvex SCAFFOLD server-update moments Lemma
- One-round progress of strongly convex FedAvg Lemma
- Strongly convex FedAvg under bounded gradient dissimilarity Theorem
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
- Sai Praneeth Karimireddy et al., SCAFFOLD, Appendix D.2 (standard reference, not scraped)