Abstract
In functional analysis it is not uncommon for a proof to proceed by contradiction coupled with an invocation of Zorn’s lemma. Any object produced by such an application of Zorn’s lemma does not in fact exist, and it is likely that the use of Zorn’s lemma is artificial. It has turned out that many proofs of this sort can be simplified, both in form and complexity, with the principle of open induction isolated by Raoult as a substitute for Zorn’s lemma. If moreover the theorem under consideration is sufficiently concrete, then a far weaker instance of induction suffices and, with some massaging, one may obtain a fully constructive proof. In the present note we apply this method to Gelfand’s proof of Wiener’s theorem, producing first a simple direct proof of Wiener’s theorem, and then an even simpler constructive proof. With this example in mind we look toward developing a more generally applicable technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aczel, P., Rathjen, M.: Notes on Constructive Set Theory. Report No. 40, Institut Mittag-Leffler, Royal Swedish Academy of Sciences (2001)
de Bruijn, N.G., van der Meiden, W.: Notes on Gelfand’s theory. Indag. Math. 29, 467–474 (1967)
Bridges, D.S.: Constructive Functional Analysis. Research Notes in Mathematics, vol. 28. Pitman, London (1979)
Bishop, E.A., Bridges, D.S.: Constructive Analysis. Grundlehren der Math. Wiss, vol. 279. Springer, Heidelberg (1985)
Bridges, D., Richman, F., Schuster, P.: A weak countable choice principle. Proc. Amer. Math. Soc. 128, 2749–2752 (2000)
Cohen, P.: A note on constructive methods in Banach algebras. Proc. Amer. Math. Soc. 12, 159–163 (1961)
Coquand, T., Spitters, B.: Constructive theory of Banach algebras. Journal of Logic and Analysis 2(11), 1–15 (2010)
Coquand, T., Stolzenberg, G.: The Wiener lemma and certain of its generalizations. Bull. Amer. Math. Soc. (N.S.) 24, 1–9 (1991)
Gelfand, I.M., Raikov, D.A., Chilov, G.E.: Les anneaux normés commutatifs. Gauthier-Villars, Paris (1964)
Lombardi, H., Quitté, C.: Algèbre commutative. Méthodes constructives. Modules projectifs de type fini, Mathématiques en devenir, vol. 107. Calvage & Mounet, Paris (2012)
Newman, D.: A simple proof of Wiener’s 1/f theorem. Proc. Amer. Math. Soc. 48, 264–265 (1975)
Raoult, J.: Proving open properties by induction. Inform. Process. Letters 29, 19–23 (1988)
Schuster, P.: Induction in algebra: a first case study. In: Twenty-Seventh Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012 (2012)
Troelstra, A.S., van Dalen, D.: Constructivism in mathematics: An introduction, Volume II. Studies in Logic and the Foundations of Mathematics, vol. 123. North-Holland (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hendtlass, M., Schuster, P. (2012). A Direct Proof of Wiener’s Theorem. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-30870-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30869-7
Online ISBN: 978-3-642-30870-3
eBook Packages: Computer ScienceComputer Science (R0)