Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28
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.

Boxes in Z^n are Folner sets

Example

For (Zd,+) and any finite subset S⊆Zd, the boxes

Qn=[−n,n]d∩Zd

form a Folner family.

Facts & Assumptions

Given: A finite set S⊆Zd and a real ε>0.

[L1]

Folner sets are measured by relative symmetric-difference boundary (Folner sets and the Folner condition).

[L2]

Under the ultrafilter lemma, such Folner families witness amenability through the Folner criterion (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).

Verification

technique · direct
1.1givenalgebra

Let M=max⁡s∈S∥s∥∞. For each s∈S, the translate s+Qn differs from Qn only inside the M-thick boundary layers of the cube, so ∣(s+Qn)△Qn∣=O(nd−1).

2.1L1L2step 1.1∎

Because ∣Qn∣=(2n+1)d, the ratio ∣(s+Qn)△Qn∣/∣Qn∣ tends to 0 as n→∞ uniformly in s∈S. Hence the boxes are eventually (S,ε)-Folner by [L1], illustrating [L2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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.