Bourbaki

Proposition 11

Tag 02IN, permanent. Cite it as [Bourbaki, Tag 02IN].

Théories spectrales, chapter II, § 1. Transformation de Fourier

Let f∈A(G)f\in A(G). Then F(f)∈L1(G^)\mathscr{F}(f)\in L^1(\widehat{G}) and, for every x∈Gx\in G, one has

f(x)=∫G^⟨x^,x⟩F(f)(x^)dx^(25) f(x) =\int_{\widehat{G}}\langle \widehat{x}, x\rangle \mathscr{F}(f)(\widehat{x})d\widehat{x} \tag{25}

In other words, for f∈A(G)f\in A(G), one has

f=F‾G^(FG(f))∘η(26) f=\overline{\mathscr{F}}_{\widehat{G}}(\mathscr{F}_G(f))\circ \eta \tag{26}

where η\eta denotes the canonical mapping of G into the bidual group G^^\widehat{\widehat{G}}.

By Lemma 4 of II, p. 213 and Proposition 9 of II, p. 214, one has F(f)∈L1(G^)\mathscr{F}(f)\in L^1(\widehat{G}) for every function f∈A(G)f\in A(G). By the Plancherel formula (24), for ff and gg in L2(G)L^2(G), one has

(f∗g~)(e)=∫G^F(f)(χ)F(g)(χ)‾dx^(χ)(27) (f*\widetilde{g})(e) =\int_{\widehat{G}}\mathscr{F}(f)(\chi )\overline{\mathscr{F}(g)(\chi)}d\widehat{x}(\chi ) \tag{27}

Let ff and gg be in L1(G)∩L2(G)L^1(G)\cap L^2(G) and let h=f∗g~∈A(G)h=f*\widetilde{g}\in A(G). Since the Fourier transform is an involutive morphism, formula (27) is assertion (25) for the function hh at the point x=ex=e. By linearity, one deduces that formula (25) is valid at the point x=ex=e for every function h∈A(G)h\in A(G).

Let x∈Gx\in G and h∈A(G)h\in A(G). Let h1=εx−1∗hh_1=\varepsilon_{x^{-1}}*h. Then h1∈A(G)h_1\in A(G) and h1(e)=h(x)h_1(e) =h(x). Since moreover F(h1)(χ)=⟨χ,x⟩‾F(f)(χ)\mathscr{F}(h_1)(\chi ) =\overline{\langle\chi , x\rangle}\mathscr{F}(f)(\chi ) for every χ∈G^(\chi \in \widehat{G}(cf. formula (11) of II, p. 208), formula (25) for the function h1h_1 at the point ee implies formula (25) for hh at the point xx.

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.