Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Bounded finite-range lattice model

Definition

Fix integers d≥1, L≥1, a finite alphabet A of cardinality q≥1, and a finite, possibly empty, list of interaction shapes Sa⊂Zd, each nonempty and contained in [−R,R]d for some integer R≥0. ∥Φa∥∞ is finite because its domain is finite. For each shape let Φa:ASa→R be a bounded interaction function. Set J0:=∑a∥Φa∥∞. On ΛL:={1,…,L}d, define the free-boundary energy HL(s):=∑a∑x:x+Sa⊆ΛLΦa((sx+u)u∈Sa), for configurations s∈AΛL. For β>0, define the finite partition sum ZL(β):=∑s∈AΛLe−βHL(s) and normalized log-partition density pL(β):=L−dlog⁡ZL(β).

Scope

The alphabet, interaction list, shapes and functions are mathematical data. The formula uses the same interaction function at every translated anchor. This definition includes free boundary conditions only; other boundary energies are introduced by an explicit bound in Finite-range lattice log-partition limit.

Depends on

Dependency tree · 2 levels

Sources