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.
Summability and convolution control for lattice weights
Statement
Let , , and be the max-coordinate metric. For , with , and with , each weight is summable on . Its convolution constant
where uses this same formula with the base weight . Each such constant is finite and positive. In particular, for all ,
The constant may be taken to be the convolution constant of , independently of .
Statement references
Facts & Assumptions
Given: , , the metric , and the weights as stated.
Local spin matrix algebras and their factor inclusions: , and the site set is .
Proof
Given: [F1], [F2], , and .
For , the -shell of radius has sites, by factoring the difference of powers; the radius-zero shell has one site. Therefore , and . The bounds are independent of by translation invariance.
Write . For , the triangle inequality places every in at least one of the sets or . On the first set, ; summing the other factor over all is bounded by the finite shell sum in step 1.1. The second set gives the same bound with exchanged. Hence . For , the triangle inequality gives ; the same splitting argument applied to , for which , yields , and then . Positivity of each weight and the summand show .