Constructive convex programming

Research output: Chapter in book/report/conference proceedingContribution to book/anthologyResearchpeer review

Authors

  • Josef Berger
  • G. Svindland

External Research Organisations

  • Ludwig-Maximilians-Universität München (LMU)
View graph of relations

Details

Original languageEnglish
Title of host publicationProof and Computation
Subtitle of host publicationDigitization in Mathematics, Computer Science and Philosophy
Pages53-82
Number of pages30
ISBN (electronic)9789813270947
Publication statusPublished - 2018
Externally publishedYes

Abstract

Working within Bishop-style constructive mathematics, we show that positive-valued, uniformly continuous, convex functions defined on convex and compact subsets of Rn have positive infimum. This gives rise to a separation theorem for convex sets. Based on these results, we show that the fundamental theorem of asset pricing is constructively equivalent to Markov’s principle. The philosophical background behind all this is a constructively valid convex version of Brouwer’s fan theorem. The emerging comprehensive yet concise overall picture of assets, infima of functions, separation of convex sets, and the fan theorem indicates that mathematics in convex environments has some innate constructive nature.

ASJC Scopus subject areas

Cite this

Constructive convex programming. / Berger, Josef; Svindland, G.
Proof and Computation: Digitization in Mathematics, Computer Science and Philosophy. 2018. p. 53-82.

Research output: Chapter in book/report/conference proceedingContribution to book/anthologyResearchpeer review

Berger, J & Svindland, G 2018, Constructive convex programming. in Proof and Computation: Digitization in Mathematics, Computer Science and Philosophy. pp. 53-82. https://doi.org/10.1142/9789813270947_0002
Berger, J., & Svindland, G. (2018). Constructive convex programming. In Proof and Computation: Digitization in Mathematics, Computer Science and Philosophy (pp. 53-82) https://doi.org/10.1142/9789813270947_0002
Berger J, Svindland G. Constructive convex programming. In Proof and Computation: Digitization in Mathematics, Computer Science and Philosophy. 2018. p. 53-82 doi: 10.1142/9789813270947_0002
Berger, Josef ; Svindland, G. / Constructive convex programming. Proof and Computation: Digitization in Mathematics, Computer Science and Philosophy. 2018. pp. 53-82
Download
@inbook{4e15c74f1bc54f9ab1b0501c9ef999f9,
title = "Constructive convex programming",
abstract = "Working within Bishop-style constructive mathematics, we show that positive-valued, uniformly continuous, convex functions defined on convex and compact subsets of Rn have positive infimum. This gives rise to a separation theorem for convex sets. Based on these results, we show that the fundamental theorem of asset pricing is constructively equivalent to Markov{\textquoteright}s principle. The philosophical background behind all this is a constructively valid convex version of Brouwer{\textquoteright}s fan theorem. The emerging comprehensive yet concise overall picture of assets, infima of functions, separation of convex sets, and the fan theorem indicates that mathematics in convex environments has some innate constructive nature.",
author = "Josef Berger and G. Svindland",
note = "Publisher Copyright: {\textcopyright} 2018 by World Scientific Publishing Co. Pte. Ltd.",
year = "2018",
doi = "10.1142/9789813270947_0002",
language = "English",
isbn = "9789813270930",
pages = "53--82",
booktitle = "Proof and Computation",

}

Download

TY - CHAP

T1 - Constructive convex programming

AU - Berger, Josef

AU - Svindland, G.

N1 - Publisher Copyright: © 2018 by World Scientific Publishing Co. Pte. Ltd.

PY - 2018

Y1 - 2018

N2 - Working within Bishop-style constructive mathematics, we show that positive-valued, uniformly continuous, convex functions defined on convex and compact subsets of Rn have positive infimum. This gives rise to a separation theorem for convex sets. Based on these results, we show that the fundamental theorem of asset pricing is constructively equivalent to Markov’s principle. The philosophical background behind all this is a constructively valid convex version of Brouwer’s fan theorem. The emerging comprehensive yet concise overall picture of assets, infima of functions, separation of convex sets, and the fan theorem indicates that mathematics in convex environments has some innate constructive nature.

AB - Working within Bishop-style constructive mathematics, we show that positive-valued, uniformly continuous, convex functions defined on convex and compact subsets of Rn have positive infimum. This gives rise to a separation theorem for convex sets. Based on these results, we show that the fundamental theorem of asset pricing is constructively equivalent to Markov’s principle. The philosophical background behind all this is a constructively valid convex version of Brouwer’s fan theorem. The emerging comprehensive yet concise overall picture of assets, infima of functions, separation of convex sets, and the fan theorem indicates that mathematics in convex environments has some innate constructive nature.

UR - http://www.scopus.com/inward/record.url?scp=85051620242&partnerID=8YFLogxK

U2 - 10.1142/9789813270947_0002

DO - 10.1142/9789813270947_0002

M3 - Contribution to book/anthology

SN - 9789813270930

SP - 53

EP - 82

BT - Proof and Computation

ER -