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.
Expander walk sampled and moving sets
Statement
For a stationary walk in a finite regular graph, take times , gaps , and fixed sets of densities . Then For the empty product is one, giving the exact probability .
Facts & Assumptions
Given: the objects and hypotheses in the statement above.
Let have density in a finite regular graph and let project onto functions supported in . Then For a stationary length- walk, , its confinement probability is , where the inner product is unnormalized. (Expander walk restricted operator).
Proof
Let be the constant projection. On the mean-zero subspace has norm , and for . The rank-one operator has norm , by the norms of its two indicator vectors. The remaining term has norm at most , since projections are contractions. Thus . This is the same supported-operator framework as confinement.
Expand the finite path sum with the successive projections, using stationarity to start at uniformly. It is the normalized inner product of the endpoint indicators with the product of the intermediate restricted operators. Bound each operator by the first step and the endpoint norms by and . If this is simply ; an empty target makes the actual probability zero and the inequality remains valid. No independence of successive visits is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
2 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
- Hoory–Linial–Wigderson, Expander Graphs and Their Applications, May 2006 draft; §3.2 Theorems3.10–3.11, p29. (standard reference, not scraped)