Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-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.

Translation estimates for continuous positive type functions

Statement

Let G be a topological group and let φ be a continuous function of positive type on G with φ(e)≤1 (Continuous positive-type functions and normalization). Let (πφ,Hφ,ξ) be a GNS triple for φ, so that πφ is a strongly continuous unitary representation on the complex Hilbert space Hφ (Hilbert space) and φ(g)=⟨πφ(g)ξ,ξ⟩,∥ξ∥2=φ(e) (Matrix coefficient of a unitary representation). Then for all x,y∈G:

  1. ∣φ(y−1x)−φ(x)∣≤∥ξ∥ ∥πφ(y)ξ−ξ∥≤(2φ(e)(1−Re⁡φ(y)))1/2;
  2. ∣φ(x)−φ(y)∣2≤2φ(e)(φ(e)−Re⁡φ(y−1x));
  3. 2(φ(e)−Re⁡φ(y−1x))=∥πφ(y−1x)ξ−ξ∥2;
  4. if φ(e)=1, then 1−Re⁡φ(xy)≤2(1−Re⁡φ(x))+2(1−Re⁡φ(y)).

Facts & Assumptions

Given: a topological group G; a continuous positive-type function φ with φ(e)≤1; a GNS triple (πφ,Hφ,ξ) with φ(g)=⟨πφ(g)ξ,ξ⟩ and ∥ξ∥2=φ(e).

[A1]

The pairing is linear in the first argument, conjugate-linear in the second, ∥v∥2=⟨v,v⟩, and ⟨v,w⟩=⟨w,v⟩‾ (The induced length is a norm, Hilbert space).

[A2]

Cauchy–Schwarz gives ∣⟨v,w⟩∣≤∥v∥ ∥w∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A3]

Each πφ(g) is unitary, so πφ(g)∗=πφ(g)−1=πφ(g−1), and πφ is a homomorphism (Matrix coefficient of a unitary representation).

Proof

technique · direct

Given: a topological group G, a positive-type function φ with GNS triple (πφ,Hφ,ξ) as in the statement, and x,y∈G.

1.1A1A3

For every g∈G one has ∥πφ(g)ξ−ξ∥2=∥ξ∥2−2Re⁡⟨πφ(g)ξ,ξ⟩+∥ξ∥2=2φ(e)−2Re⁡φ(g): expanding the squared norm with [A1], unitarity gives ∥πφ(g)ξ∥2=∥ξ∥2, and ⟨πφ(g)ξ,ξ⟩=φ(g). This is claim 3 with g=y−1x.

2.1A1A2A3step 1.1

For claim 1, unitarity gives φ(y−1x)=⟨πφ(y−1x)ξ,ξ⟩=⟨πφ(y)∗πφ(x)ξ,ξ⟩=⟨πφ(x)ξ,πφ(y)ξ⟩, so φ(y−1x)−φ(x)=⟨πφ(x)ξ,πφ(y)ξ−ξ⟩; Cauchy–Schwarz and ∥πφ(x)ξ∥=∥ξ∥ give ∣φ(y−1x)−φ(x)∣≤∥ξ∥ ∥πφ(y)ξ−ξ∥, and step 1.1 with g=y turns ∥πφ(y)ξ−ξ∥ into (2(φ(e)−Re⁡φ(y)))1/2, hence the second bound with φ(e) in place of ∥ξ∥.

2.2A1A2A3step 1.1

For claim 2, φ(x)−φ(y)=⟨(πφ(x)−πφ(y))ξ,ξ⟩=⟨πφ(y)(πφ(y−1x)−I)ξ,ξ⟩=⟨(πφ(y−1x)−I)ξ,πφ(y)∗ξ⟩, so Cauchy–Schwarz gives ∣φ(x)−φ(y)∣≤∥πφ(y−1x)ξ−ξ∥ ∥ξ∥; squaring and using step 1.1 with g=y−1x and ∥ξ∥2=φ(e) gives ∣φ(x)−φ(y)∣2≤2φ(e)(φ(e)−Re⁡φ(y−1x)).

3.1A1A3step 1.1∎

For claim 4 assume φ(e)=1. Since πφ(xy)ξ−ξ=πφ(x)(πφ(y)ξ−ξ)+(πφ(x)ξ−ξ), the triangle inequality and ∥a+b∥2≤2∥a∥2+2∥b∥2 give ∥πφ(xy)ξ−ξ∥2≤2∥πφ(y)ξ−ξ∥2+2∥πφ(x)ξ−ξ∥2; substituting 12∥πφ(g)ξ−ξ∥2=1−Re⁡φ(g) from step 1.1 and φ(e)=1 yields 1−Re⁡φ(xy)≤2(1−Re⁡φ(y))+2(1−Re⁡φ(x)), which is claim 4.

Depends on

Used by

Dependency tree · two levels

20 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