Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Classical marked-set hitting bound from a spectral gap

Statement

Under the hypotheses of Spectral bound for a symmetric lazy walk killed on a marked set, suppose ∅≠M≠X and start uniformly on U=X∖M. Then

Pr⁡(τM>t)≤(1−δε)t(t∈N0),

so EτM≤1/(δε) and O(1/(δε)) steps give constant success probability. If M=X, the hitting time is 0.

Facts & Assumptions

Given: The finite symmetric lazy chain and marked set from Spectral bound for a symmetric lazy walk killed on a marked set, and the survival-law definition of Finite-chain hitting time and survival law.

[F1]

Spectral bound for a symmetric lazy walk killed on a marked set: ∥PUU∥≤1−δε, and the compression is positive semidefinite.

[F2]

Finite-chain hitting time and survival law: Pr⁡μ(τM>t)=μUPUU t1U.

[F3]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: ∣⟨v,w⟩∣≤∥v∥∥w∥ in a finite-dimensional inner-product space.

Proof

1.1F1F2F3algebra

Let uU=∣U∣−1/21U. For the uniform initial law on U, [F2] gives Pr⁡(τM>t)=⟨uU,PUU tuU⟩. Since PUU is positive semidefinite, it has eigenvalues in [0,1−δε] by [F1]; its tth power therefore has operator norm at most (1−δε)t. [F3] and ∥uU∥=1 prove the survival bound, including t=0.

2.1F1F2step 1.1algebra∎

Put a=δε. For 0<a<1, the nonnegative-integer tail formula in [F2] and the finite geometric partial sums give EτM=∑t≥0Pr⁡(τM>t)≤∑t≥0(1−a)t=1/a. For the constant-success bound choose t=⌈1/a⌉. Since (1−a)(1+a)=1−a2≤1, we have 1−a≤(1+a)−1; the finite binomial expansion gives (1+a)t≥1+ta≥2. Hence (1−a)t≤(1+a)−t≤1/2. If a=1, step 1.1 gives zero no-hit probability for every t≥1, so one step suffices. The case M=X is immediate from the definition.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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