Unbalancing #
theorem
pow_inner_nonneg'
{G : Type u_1}
[Fintype G]
[DecidableEq G]
[AddCommGroup G]
{ν : G → NNReal}
{g h f : G → ℂ}
(hf : g ○ g = f)
(hν : h ○ h = (fun (x : NNReal) => ↑↑x) ∘ ν)
(k : ℕ)
:
Note that we do the physical proof in order to avoid the Fourier transform.
theorem
pow_inner_nonneg
{G : Type u_1}
[Fintype G]
[DecidableEq G]
[AddCommGroup G]
{ν : G → NNReal}
{g h : G → ℂ}
{f : G → ℝ}
(hf : g ○ g = Complex.ofReal ∘ f)
(hν : h ○ h = (fun (x : NNReal) => ↑↑x) ∘ ν)
(k : ℕ)
:
Note that we do the physical proof in order to avoid the Fourier transform.
theorem
unbalancing'
{G : Type u_1}
[Fintype G]
[DecidableEq G]
[AddCommGroup G]
[MeasurableSpace G]
[DiscreteMeasurableSpace G]
(p : ℕ)
(hp : p ≠ 0)
(ε : ℝ)
(hε₀ : 0 < ε)
(hε₁ : ε ≤ 1)
(ν : G → NNReal)
(f : G → ℝ)
(g h : G → ℂ)
(hf : g ○ g = Complex.ofReal ∘ f)
(hν : h ○ h = (fun (x : NNReal) => ↑↑x) ∘ ν)
(hν₁ : ∑ x : G, ν x = 1)
(hε : ε ≤ ‖f‖_[↑p, ν])
:
The unbalancing step. Note that we do the physical proof in order to avoid the Fourier transform.
theorem
unbalancing
{G : Type u_1}
[Fintype G]
[DecidableEq G]
[AddCommGroup G]
[MeasurableSpace G]
[DiscreteMeasurableSpace G]
(p : ℕ)
(hp : p ≠ 0)
(ε : ℝ)
(hε₀ : 0 < ε)
(hε₁ : ε ≤ 1)
(f : G → ℝ)
(g h : G → ℂ)
(hf : g ○ g = Complex.ofReal ∘ f)
(hh : h ○ h = mu Finset.univ)
(hε : ε ≤ ‖f‖_[↑p, mu Finset.univ])
:
The unbalancing step. Note that we do the physical proof in order to avoid the Fourier transform.