Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 0t0<<tr, gaps gi=titi11, and fixed sets Si of densities βi. Then Pr[XtiSi for all 0ir]β0βri=1r(βi1βi+αgi). For r=0 the empty product is one, giving the exact probability β0.

Facts & Assumptions

Given: the objects and hypotheses in the statement above.

[F1]

Let S have density β=S/n in a finite regular graph and let PS project onto functions supported in S. Then PSMPSα+(1α)β. For a stationary length-t walk, t0, its confinement probability is n11S,(PSMPS)t1S0, where the inner product is unnormalized. (Expander walk restricted operator).

Proof

1.1

Let J be the constant projection. On the mean-zero subspace MJ has norm α, and Mg=J+(MJ)g for g1. The rank-one operator PTJPS has norm βTβS, by the norms of its two indicator vectors. The remaining term has norm at most αg, since projections are contractions. Thus PTMgPSβTβS+αg. This is the same supported-operator framework as confinement.

F1algebra
2.1

Expand the finite path sum with the successive projections, using stationarity to start at t0 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 β0 and βr. If r=0 this is simply β0; an empty target makes the actual probability zero and the inequality remains valid. No independence of successive visits is used.

step 1.1algebra

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