Bourbaki

Proposition 1

Tag 03BZ, permanent. Cite it as [Bourbaki, Tag 03BZ].

Théories spectrales, chapter V, § 3. Fonctions de type positif

Let ff be a universally positive kernel on X. Let (E1,g1)(E_1, g_1) and (E2,g2)(E_2, g_2) be Hilbert realizations of ff. Suppose that (E1,g1)(E_1, g_1) is a cyclic Hilbert realization. There then exists a unique continuous linear mapping u:E1→E2u: E_1\rightarrow E_2 such that g2=u∘g1g_2=u\circ g_1. This mapping is isometric. If (E2,g2)(E_2, g_2) is also cyclic, then uu is an isomorphism.

The uniqueness of uu results from the fact that the image of g1g_1 is total in E1E_1. Let F=C(X)F =\mathbf{C}^{(X)} and let (ex)x∈X(e_x)_{x\in X} be the canonical basis of F. For j=1j= 1 and j=2j= 2, denote by uju_j the linear mapping from F into EjE_j determined by uj(ex)=gj(x)u_j(e_x) =g_j(x), and denote by FjF_j its image; the space F1F_1 is dense in E1E_1.

Let t=∑txext=\sum t_xe_x be an element of F. One has

∥u1(t)∥2=∑x,yt‾xty⟨g1(x)∣g1(y)⟩=∑x,yt‾xtyf(x,y) \|u_1(t)\|^2=\sum_{x,y}\overline{t}_xt_y\langle g_1(x)|g_1(y)\rangle =\sum_{x,y}\overline{t}_xt_yf(x, y)
=∑x,yt‾xty⟨g2(x)∣g2(y)⟩=∥u2(t)∥2 =\sum_{x,y}\overline{t}_xt_y\langle g_2(x)|g_2(y)\rangle =\|u_2(t)\|^2

Consequently, there exists an isometric linear mapping vv from F1F_1 into F2F_2 such that u2=v∘u1u_2=v\circ u_1, and in particular g2(x)=v(g1(x))g_2(x) =v(g_1(x)) for all x∈Xx\in X. Since the image of g1g_1 is total in E1E_1, this mapping extends to an isometric linear mapping uu from E1E_1 into E2E_2 such that g2=u∘g1g_2=u\circ g_1.

By Lemma 8 of I, p. 107, the image of uu is closed in E2E_2. If (E2,g2)(E_2, g_2) is a cyclic Hilbertian realization, the image of uu is also dense in E2E_2 and uu is therefore an isomorphism.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5.4, gpt-5-6-mini, against glossary version 34. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.