Wiener's 1/f theorem
Wiener's lemma for the circle algebra: if a continuous function f on the additive circle has absolutely summable Fourier coefficients (i.e. lies in the Wiener algebra, `InWienerAlgebra f := Summable (fourierCoeff f)`) a…
Overview
Wiener's 1/f theorem
wiener_inverse_closed — a formalization challenge from the lean-eval benchmark.
Notes
Wiener's lemma for the circle algebra: if a continuous function f on the additive circle has absolutely summable Fourier coefficients (i.e. lies in the Wiener algebra, InWienerAlgebra f := Summable (fourierCoeff f)) and is nowhere zero, then its pointwise reciprocal 1/f again belongs to the Wiener algebra. mathlib has the additive circle, fourier, fourierCoeff, and hasSum_fourier_series_of_summable, but not the Wiener algebra or spectral invariance.
Formal statement
/-- **Wiener's `1/f` theorem.** If a function on the circle belongs to the
Wiener algebra and has no zero on the circle, then its pointwise reciprocal
again belongs to the Wiener algebra. -/
theorem wiener_inverse_closed (f : C(AddCircle T, ℂ))
(hf : InWienerAlgebra f) (hzero : ∀ x, f x ≠ 0) :
∃ g : C(AddCircle T, ℂ),
(∀ x, g x = (f x)⁻¹) ∧ InWienerAlgebra g := by
sorry
Informal solution sketch
The Wiener algebra A(T) is the Banach algebra of absolutely convergent Fourier series with the l¹ norm of the coefficients. Wiener's lemma is the statement that its Gelfand spectrum is exactly the circle (point evaluations), so an element is invertible in A(T) iff it never vanishes. The classical elementary proof (Gelfand's gives it via Banach-algebra theory; Newman's gives a direct localization) covers the circle by short arcs, on each of which f is close to a nonzero constant, inverts a local truncation whose remainder has small Wiener norm, and patches with a smooth partition of unity, using that 1/(1-h) = ∑ hⁿ converges in A(T) when ‖h‖ < 1.
Source
N. Wiener, Tauberian theorems, Ann. of Math. 33 (1932), 1-100. Listed as §226 in O. Knill, Some Fundamental Theorems in Mathematics (https://people.math.harvard.edu/~knill/graphgeometry/papers/fundamental.pdf). Knill, §226.
How to submit
Challenge.lean and Solution.lean are part of the trusted benchmark and must not be modified.
Write your proof in Submission.lean (plus any local modules under Submission/).
Mathlib may be used freely; anything not in Mathlib has to be inlined into the submission.
Comparator configuration
- Solution module:
Solution - Theorems checked:
wiener_inverse_closed - Permitted axioms:
propext,Quot.sound,Classical.choice
Submitted by Kim Morrison.
Problems
1 problemFiles
View on GitHub- Submission
- Helpers.lean53 B
- Challenge.lean354 B
- ChallengeDeps.lean1.0 KB
- config.json236 B
- holes.json711 B
- lakefile.toml491 B
- lean-toolchain25 B
- README.md2.1 KB
- Solution.lean416 B
- Submission.lean418 B
- WorkspaceTest.lean1.6 KB