Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

The GNS null space is invariant under left translation

Statement

Let Bφ be the GNS form on the finitely supported functions C(G), and let Nφ={f:Bφ(f,f)=0}. Then Nφ is a complex linear subspace, and every left translation Lgf(x)=f(g−1x) maps Nφ onto itself. Consequently it induces an invertible map [f]↦[Lgf] on C(G)/Nφ.

Facts & Assumptions

[A1]

The GNS form is positive semidefinite and sesquilinear, and every null vector is orthogonal to all finitely supported functions (Positive-type functions define the GNS pre-Hilbert form).

[A2]

For finitely supported f,h, Bφ(f,h)=∑x,y∈Gf(x)h(y)‾φ(y−1x) (Positive-type functions define the GNS pre-Hilbert form).

[A3]

G is a group, so its multiplication and inversion obey the group laws (Topological group: multiplication and inversion are continuous).

Proof

technique · direct

Given: A topological group G, a continuous positive-type function φ, and its GNS form Bφ and null set Nφ.

1.1A1A3algebra

For fixed g∈G, the support of Lgf is gsupp⁡(f), so Lg preserves finite support and is complex-linear. The group law gives Le=I, LgLh=Lgh, and Lg−1=Lg−1.

2.1A2A3step 1.1algebra

For finitely supported f,h, [A2] gives Bφ(Lgf,Lgh)=∑a,b∈Gf(g−1a)h(g−1b)‾φ(b−1a). Only finitely many terms are nonzero. Substitute a=gx and b=gy; then b−1a=(gy)−1(gx)=y−1x, so the sum becomes ∑x,y∈Gf(x)h(y)‾φ(y−1x)=Bφ(f,h). Thus left translation preserves the whole form.

3.1A1A3step 1.1step 2.1algebra∎

If f,h∈Nφ, [A1] makes all four terms in Bφ(f+h,f+h) vanish, and sesquilinearity gives Bφ(λf,λf)=∣λ∣2Bφ(f,f)=0 for every λ∈C. Hence Nφ is a complex linear subspace. Step 2.1 implies LgNφ⊆Nφ; applying it to g−1 and using step 1.1 gives LgNφ=Nφ. Therefore if f−h∈Nφ, then Lgf−Lgh=Lg(f−h)∈Nφ, so [f]↦[Lgf] is well-defined on the quotient. Its inverse is induced by Lg−1, and the identities in step 1.1 descend to the quotient.

Depends on

Used by

Dependency tree · two levels

7 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