Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Canonical free-cube limit at every interior attainable density

Statement

Let ϕ be stable and regular as in Superstable regular pair interactions and configurational ensemble notation, fix β>0, and define Z(L,N;β) as in that definition. For sequences Lj→∞ and integers Nj≥0 with Nj/Ljd→ρ, define b(ρ)=sup⁡{lim sup⁡j→∞Lj−dlog⁡Z(Lj,Nj;β):NjLjd→ρ}. Let F be the concave envelope of b on [0,∞), namely the supremum of ∑i=1mθib(ρi) over finite lists with θi≥0, ∑iθi=1, ρi≥0, and ∑iθiρi=ρ; the empty supremum is −∞. On the interior of {ρ:F(ρ)>−∞}, F is finite and continuous. For every ρ>0 in that interior and every such sequence (Lj,Nj), lim⁡j→∞Lj−dlog⁡Z(Lj,Nj;β)=F(ρ). No claim is made at a close-packing endpoint or at any other excluded endpoint.

Facts & Assumptions

Given: Stability with constant B, a regular even pair potential, fixed β>0, and the free-cube canonical convention in Superstable regular pair interactions and configurational ensemble notation.

[F1]

Stability gives UN≥−BN for every finite configuration. Regularity supplies R0<∞ and a nonnegative nonincreasing ψ:[R0,∞)→[0,∞) with ∣ϕ(x)∣≤ψ(∣x∣∞) for ∣x∣∞≥R0 and ∫R0∞rd−1ψ(r) dr<∞ (Superstable regular pair interactions and configurational ensemble notation).

[F2]

For every sufficiently large gap g, the lattice-shell interaction tail is bounded by Diagonal gap for a decreasing integrable interaction tail, with a diagonal choice g(ℓ)/ℓ→0 and vanishing cross-energy density.

[F4]

The factorial and logarithm suppliers give the integral bounds ∫1mlog⁡x dx≤log⁡(m!)≤∫1m+1log⁡x dx and log⁡(1+u)≤u for u>−1 (The factorial n! and the falling factorial nk‾, defined by recursion in N, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

Proof

Given: The hypotheses and suppliers in Facts & Assumptions.

1.1F1F3F4algebra

Stability and [F3] give Z(L,N;β)≤eβBNLdN/N!. If N/Ld→ρ>0, the factorial integral bounds [F4] imply lim sup⁡L−dlog⁡Z(L,N;β)≤ρ(1+βB−log⁡ρ), so b(ρ) and F(ρ) are bounded above on every compact positive-density interval. The vacuum term gives b(0)=0: Z(L,0)=1 is a lower bound, and the same stability estimate with N/Ld→0 gives a nonpositive upper limit.

1.2F1F2F3algebraconstruct

The effective domain of F has nonempty interior. Fix a core cube of side s>0 and a gap g>2R0; place one particle in each selected core of a lattice of spacing s+g inside a large box. The absolute interaction from any one occupied core to all others is bounded by C∑m≥1md−1ψ(mg)<∞ by [F1]–[F2], with the gap satisfying the stated hypothesis of the diagonal-gap estimate. Restricting each particle to a subcube of volume v0>0 therefore gives Z(L,N;β)≥v0Ne−C0N for every density strictly below (s+g)−d, after omitting unused lattice cells. Thus F is finite on a nonempty interval of positive densities; by its definition as a finite-mixture envelope it is concave.

2.1F2F3step 1.2algebra

Fix a finite list of core preparations (si,ni) with 0<Z(si,ni;β)<∞. For each i, choose a gap gi=g(si) from [F2] along a sequence si→∞ so that gi/si→0 and the positive interaction between distinct cores in the same lattice packing, divided by core volume, tends to zero. Set tile side ai=si+gi and effective density ri=ni/aid. If Mi such tiles carry exactly ni particles in their central si-cubes, the same shell count as in the proof of Free-cube grand-pressure limit for decreasing integrable tails gives cross-energy penalty per occupied volume at most C(ni/sid)2(si/gi)dη(gi), which tends to zero by [F2]. Exact factorization over disjoint core cubes follows because assigning the labeled coordinates to their cores contributes N!/∏i(ni!)Mi, cancelling the global N!.

3.1F1F2step 2.1construct

For any finite convex combination in the definition of F(ρ), choose core preparations with densities tending to its ρi and rates tending to b(ρi). If their effective densities do not strictly bracket the target ρ, add arbitrarily small weights at one attainable density below and one above ρ; such densities exist because ρ is interior. Their mixture coefficients can then be perturbed by quantities tending to zero so the effective mean is exactly ρ. Place the fixed core types in finitely many macroscopic slabs with these volume fractions, inserting fixed empty layers wider than R0 between slabs. For fixed core sizes and gaps, the distinct-slab cross energy divided by total volume tends to zero: for interaction distances at most R, only O(RLd−1) particles lie in the interface strips, while the remaining contribution is bounded by a constant times Ld∑∣j∣∞>RΨj; take L→∞ and then R→∞.

4.1F1F2F3step 2.1step 3.1construct

First reserve an outer layer of fixed width W. For each large L, put ρL=NL/Ld and choose the slab fractions in the remaining volume to match the count NL at density ρLLd/(Ld−O(WLd−1)). This target tends to ρ, so the strict bracketing in step 3.1 applies uniformly for large L and absorbs the reserved layer without assuming its one-particle capacity replaces a bulk density. Rounding the finitely many slab and core counts then leaves at most C1Ld−1 particles unplaced, with C1 depending on the fixed preparations but not on W; the error comes only from the finitely many slab faces and incomplete boundary tiles. Choose W large enough to contain at least C1Ld−1 small cells separated from each other and every core by more than R0. Put each missing particle in one such cell. Its interaction with the fixed preparations is bounded by the same summable tail, so the correction changes log weight by only O(Ld−1). This constructs exactly NL particles for every sequence NL/Ld→ρ, and gives lim inf⁡L→∞L−dlog⁡Z(L,NL;β)≥∑iθilog⁡Z(si,ni;β)−crossiaid, where crossi/aid→0 by step 2.1. Taking preparations approaching the selected convex combination and then the supremum gives lim inf⁡≥F(ρ).

5.1F4step 1.1step 1.2step 4.1algebra∎

By the definition of b, every sequence with density tending ρ has limsup rate at most b(ρ)≤F(ρ). Together with step 4.1 this proves the asserted limit. A finite concave function on an open interval is continuous: fix a<ρ<b in the interval; the chord slopes from a and b bound the difference quotients on a smaller interval around ρ, yielding a finite local Lipschitz bound. This establishes finiteness and continuity of F on its effective interior while leaving excluded endpoints undecided.

Depends on

Dependency tree · 2 levels

Sources