Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Positive definite functions on an abelian group

Definition

Let G be an abelian group written additively (Group and abelian group) and let ϕ:G→C be a function (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i). Then ϕ is positive definite when for every integer n≥0, every finite family x1,…,xn∈G and all coefficients c1,…,cn∈C one has ∑j=1n∑k=1ncjck‾ ϕ(xj−xk) ≥ 0. The sum for n=0 is the empty sum 0, so the convention covers it; repeated points xj=xk are allowed, so the finite matrices tested are the Hermitian matrices [ϕ(xj−xk)]j,k. No continuity, boundedness or measurability is part of the definition.

Elementary consequences. The claims below are immediate from the defining inequality and are recorded here for later use. Taking n=1, x1=0 and c1=1 gives ϕ(0)≥0. Taking n=2, x1=0, x2=x and c1=1, c2=t gives (1+∣t∣2)ϕ(0)+t‾ ϕ(−x)+t ϕ(x) ≥ 0for every t∈C. The left side is real and equal to its own conjugate for every t, so comparing coefficients at t=1 and t=i gives ϕ(−x)=ϕ(x)‾ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); hence every tested matrix is Hermitian. If ϕ(x)≠0, choose t=−ϕ(x)‾/∣ϕ(x)∣, so ∣t∣=1 and tϕ(x)=−∣ϕ(x)∣. The inequality becomes 2ϕ(0)−2∣ϕ(x)∣≥0, hence ∣ϕ(x)∣≤ϕ(0); if ϕ(x)=0, the same bound follows from ϕ(0)≥0. Thus a positive definite ϕ satisfies ϕ(0)≥0, ϕ(x)=ϕ(−x)‾ and ∣ϕ(x)∣≤ϕ(0) for all x∈G.

Depends on

Used by

Dependency tree · two levels

17 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