Formal Power Series Representations in Probability and Expected Utility Theory

• URL: http://arxiv.org/abs/2508.00294v1
• Date: Fri, 01 Aug 2025 03:34:39 GMT
• Title: Formal Power Series Representations in Probability and Expected Utility Theory
• Authors: Arthur Paul Pedersen, Samuel Allen Alexander,
• Abstract summary: We advance a theory of coherent preference that surrenders restrictions embodied in orthodox doctrine.<n>Unlike de Finetti's theory, the one we set forth requires neither transitivity nor Archimedeanness nor boundedness nor continuity of preference.<n>Representability by utility is a corollary of this paper's central result, which at once extends H"older's Theorem and strengthens Hahn's Embedding Theorem.
• Score: 0.24578723416255752
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it satisfies a certain coherence requirement analogous to the one de Finetti advanced for his foundations of probability. Unlike de Finetti's theory, the one we set forth requires neither transitivity nor Archimedeanness nor boundedness nor continuity of preference. This theory also enjoys the property that any complete preference system meeting the standard of coherence can be represented by utility in an ordered field extension of the reals. Representability by utility is a corollary of this paper's central result, which at once extends H\"older's Theorem and strengthens Hahn's Embedding Theorem.

Related papers

• From Axioms to Algorithms: Mechanized Proofs of the vNM Utility Theorem [0.0]
  We implement the classical axioms of preference-completeness, transitivity, continuity, and independence.<n>Our formalization captures the mathematical structure of preference relations over lotteries.<n>This formalization provides a rigorous foundation for applications in economic modeling, AI alignment, and management decision systems.
  arXiv  Detail & Related papers  (2025-06-08T10:09:54Z)
• DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning [67.93945726549289]
  DeepTheorem is a comprehensive informal theorem-proving framework exploiting natural language to enhance mathematical reasoning.<n>DeepTheorem includes a large-scale benchmark dataset consisting of 121K high-quality IMO-level informal theorems and proofs.<n>We devise a novel reinforcement learning strategy (RL-Zero) explicitly tailored to informal theorem proving, leveraging the verified theorem variants to incentivize robust mathematical inference.
  arXiv  Detail & Related papers  (2025-05-29T17:59:39Z)
• Function-coherent gambles [0.0]
  This paper introduces function-coherent gambles, a generalization that accommodates non-linear utility.<n>We prove a representation theorem that characterizes acceptable gambles through continuous linear functionals.<n>We demonstrate how these alternatives to constant-rate exponential discounting can be integrated within the function-coherent framework.
  arXiv  Detail & Related papers  (2025-02-22T14:44:54Z)
• Minimal operational theories: classical theories with quantum features [41.94295877935867]
  We introduce a class of probabilistic theories, where system dynamics are constrained to the minimal set of operations.<n>Specifically, the allowed instruments are limited to those derived from compositions of preparations, measurements, swap transformations, and conditional tests.<n>We demonstrate that minimal theories with conditioning and a spanning set of non-separable states satisfy two quantum no-go theorems.
  arXiv  Detail & Related papers  (2024-08-02T16:24:09Z)
• Connecting classical finite exchangeability to quantum theory [45.76759085727843]
  Exchangeability is a fundamental concept in probability theory and statistics.<n>It allows to model situations where the order of observations does not matter.<n>It is well known that both theorems do not hold for finitely exchangeable sequences.
  arXiv  Detail & Related papers  (2023-06-06T17:15:19Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Quantum de Finetti Theorems as Categorical Limits, and Limits of State Spaces of C*-algebras [0.0]
  We show that quantum de Finetti construction has a universal property as a categorical limit. This allows us to pass canonically between categorical treatments of finite dimensional quantum theory and the infinite dimensional. We also show that the same categorical analysis also justifies a continuous de Finetti theorem for classical probability.
  arXiv  Detail & Related papers  (2022-07-12T20:51:23Z)
• Uniqueness of noncontextual models for stabilizer subtheories [0.0]
  We give a complete characterization of the (non)classicality of all stabilizer subtheories. We prove that there is a unique nonnegative and diagram-preserving quasiprobability representation of the stabilizer subtheory in all odd dimensions.
  arXiv  Detail & Related papers  (2021-01-15T18:54:58Z)
• Generalised Lipschitz Regularisation Equals Distributional Robustness [47.44261811369141]
  We give a very general equality result regarding the relationship between distributional robustness and regularisation. We show a new result explicating the connection between adversarial learning and distributional robustness.
  arXiv  Detail & Related papers  (2020-02-11T04:19:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.