Metamath Proof Explorer


Theorem fouriercnp

Description: If F is continuous at the point X , then its Fourier series at X , converges to ( FX ) . (Contributed by Glauco Siliprandi, 11-Dec-2019)

Ref Expression
Hypotheses fouriercnp.f ⊢ φ → F : ℝ ⟶ ℝ
fouriercnp.t ⊢ T = 2 ⁢ π
fouriercnp.per ⊢ φ ∧ x ∈ ℝ → F ⁡ x + T = F ⁡ x
fouriercnp.g ⊢ G = F ℝ ′ ↾ − π π
fouriercnp.dmdv ⊢ φ → − π π ∖ dom ⁡ G ∈ Fin
fouriercnp.dvcn ⊢ φ → G : dom ⁡ G ⟶cn ℂ
fouriercnp.rlim ⊢ φ ∧ x ∈ − π π ∖ dom ⁡ G → G ↾ x +∞ lim ℂ x ≠ ∅
fouriercnp.llim ⊢ φ ∧ x ∈ − π π ∖ dom ⁡ G → G ↾ −∞ x lim ℂ x ≠ ∅
fouriercnp.j ⊢ J = topGen ⁡ ran ⁡ .
fouriercnp.cnp ⊢ φ → F ∈ J CnP J ⁡ X
fouriercnp.a ⊢ A = n ∈ ℕ 0 ⟼ ∫ − π π F ⁡ x ⁢ cos ⁡ n ⁢ x dx π
fouriercnp.b ⊢ B = n ∈ ℕ ⟼ ∫ − π π F ⁡ x ⁢ sin ⁡ n ⁢ x dx π
Assertion fouriercnp ⊢ φ → A ⁡ 0 2 + ∑ n ∈ ℕ A ⁡ n ⁢ cos ⁡ n ⁢ X + B ⁡ n ⁢ sin ⁡ n ⁢ X = F ⁡ X

Proof

Step Hyp Ref Expression
1 fouriercnp.f ⊢ φ → F : ℝ ⟶ ℝ
2 fouriercnp.t ⊢ T = 2 ⁢ π
3 fouriercnp.per ⊢ φ ∧ x ∈ ℝ → F ⁡ x + T = F ⁡ x
4 fouriercnp.g ⊢ G = F ℝ ′ ↾ − π π
5 fouriercnp.dmdv ⊢ φ → − π π ∖ dom ⁡ G ∈ Fin
6 fouriercnp.dvcn ⊢ φ → G : dom ⁡ G ⟶cn ℂ
7 fouriercnp.rlim ⊢ φ ∧ x ∈ − π π ∖ dom ⁡ G → G ↾ x +∞ lim ℂ x ≠ ∅
8 fouriercnp.llim ⊢ φ ∧ x ∈ − π π ∖ dom ⁡ G → G ↾ −∞ x lim ℂ x ≠ ∅
9 fouriercnp.j ⊢ J = topGen ⁡ ran ⁡ .
10 fouriercnp.cnp ⊢ φ → F ∈ J CnP J ⁡ X
11 fouriercnp.a ⊢ A = n ∈ ℕ 0 ⟼ ∫ − π π F ⁡ x ⁢ cos ⁡ n ⁢ x dx π
12 fouriercnp.b ⊢ B = n ∈ ℕ ⟼ ∫ − π π F ⁡ x ⁢ sin ⁡ n ⁢ x dx π
13 uniretop ⊢ ℝ = ⋃ topGen ⁡ ran ⁡ .
14 9 unieqi ⊢ ⋃ J = ⋃ topGen ⁡ ran ⁡ .
15 13 14 eqtr4i ⊢ ℝ = ⋃ J
16 15 cnprcl ⊢ F ∈ J CnP J ⁡ X → X ∈ ℝ
17 10 16 syl ⊢ φ → X ∈ ℝ
18 limcresi ⊢ F lim ℂ X ⊆ F ↾ −∞ X lim ℂ X
19 tgioo4 ⊢ topGen ⁡ ran ⁡ . = TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
20 9 19 eqtri ⊢ J = TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
21 20 oveq2i ⊢ J CnP J = J CnP TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
22 21 fveq1i ⊢ J CnP J ⁡ X = J CnP TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ ⁡ X
23 10 22 eleqtrdi ⊢ φ → F ∈ J CnP TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ ⁡ X
24 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
25 24 cnfldtop ⊢ TopOpen ⁡ ℂ fld ∈ Top
26 25 a1i ⊢ φ → TopOpen ⁡ ℂ fld ∈ Top
27 ax-resscn ⊢ ℝ ⊆ ℂ
28 27 a1i ⊢ φ → ℝ ⊆ ℂ
29 unicntop ⊢ ℂ = ⋃ TopOpen ⁡ ℂ fld
30 15 29 cnprest2 ⊢ TopOpen ⁡ ℂ fld ∈ Top ∧ F : ℝ ⟶ ℝ ∧ ℝ ⊆ ℂ → F ∈ J CnP TopOpen ⁡ ℂ fld ⁡ X ↔ F ∈ J CnP TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ ⁡ X
31 26 1 28 30 syl3anc ⊢ φ → F ∈ J CnP TopOpen ⁡ ℂ fld ⁡ X ↔ F ∈ J CnP TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ ⁡ X
32 23 31 mpbird ⊢ φ → F ∈ J CnP TopOpen ⁡ ℂ fld ⁡ X
33 24 20 cnplimc ⊢ ℝ ⊆ ℂ ∧ X ∈ ℝ → F ∈ J CnP TopOpen ⁡ ℂ fld ⁡ X ↔ F : ℝ ⟶ ℂ ∧ F ⁡ X ∈ F lim ℂ X
34 27 17 33 sylancr ⊢ φ → F ∈ J CnP TopOpen ⁡ ℂ fld ⁡ X ↔ F : ℝ ⟶ ℂ ∧ F ⁡ X ∈ F lim ℂ X
35 32 34 mpbid ⊢ φ → F : ℝ ⟶ ℂ ∧ F ⁡ X ∈ F lim ℂ X
36 35 simprd ⊢ φ → F ⁡ X ∈ F lim ℂ X
37 18 36 sselid ⊢ φ → F ⁡ X ∈ F ↾ −∞ X lim ℂ X
38 limcresi ⊢ F lim ℂ X ⊆ F ↾ X +∞ lim ℂ X
39 38 36 sselid ⊢ φ → F ⁡ X ∈ F ↾ X +∞ lim ℂ X
40 1 2 3 4 5 6 7 8 17 37 39 11 12 fourierd ⊢ φ → A ⁡ 0 2 + ∑ n ∈ ℕ A ⁡ n ⁢ cos ⁡ n ⁢ X + B ⁡ n ⁢ sin ⁡ n ⁢ X = F ⁡ X + F ⁡ X 2
41 1 17 ffvelcdmd ⊢ φ → F ⁡ X ∈ ℝ
42 41 recnd ⊢ φ → F ⁡ X ∈ ℂ
43 42 2timesd ⊢ φ → 2 ⁢ F ⁡ X = F ⁡ X + F ⁡ X
44 43 eqcomd ⊢ φ → F ⁡ X + F ⁡ X = 2 ⁢ F ⁡ X
45 44 oveq1d ⊢ φ → F ⁡ X + F ⁡ X 2 = 2 ⁢ F ⁡ X 2
46 2cnd ⊢ φ → 2 ∈ ℂ
47 2ne0 ⊢ 2 ≠ 0
48 47 a1i ⊢ φ → 2 ≠ 0
49 42 46 48 divcan3d ⊢ φ → 2 ⁢ F ⁡ X 2 = F ⁡ X
50 40 45 49 3eqtrd ⊢ φ → A ⁡ 0 2 + ∑ n ∈ ℕ A ⁡ n ⁢ cos ⁡ n ⁢ X + B ⁡ n ⁢ sin ⁡ n ⁢ X = F ⁡ X