To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
A vexing question in Bayesian epistemology is how an agent should update on evidence which she assigned zero prior credence. Some theorists have suggested that, in such cases, the agent should update by Kolmogorov conditionalization, a norm based on Kolmogorov’s theory of regular conditional distributions. However, it turns out that in some situations, a Kolmogorov conditionalizer will plan to always assign a posterior credence of zero to the evidence she learns. Intuitively, such a plan is irrational and easily Dutch bookable. In this paper, we propose a revised norm, Kolmogorov–Blackwell conditionalization, which avoids this problem. We prove a Dutch book theorem and converse Dutch book theorem for this revised norm, and relate our results to those of Rescorla (2018).
In his Tractatus, Wittgenstein maintained that arithmetic consists of equations arrived at by the practice of calculating outcomes of operations $\Omega ^{n}(\bar {\xi })$ defined with the help of numeral exponents. Since $Num$(x) and quantification over numbers seem ill-formed, Ramsey wrote that the approach is faced with “insuperable difficulties.” This paper takes Wittgenstein to have assumed that his audience would have an understanding of the implicit general rules governing his operations. By employing the Tractarian logicist interpretation that the N-operator $N(\bar {\xi })$ and recursively defined arithmetic operators $\Omega ^{n}(\bar {\xi })$ are not different in kind, we can address Ramsey’s problem. Moreover, we can take important steps toward better understanding how Wittgenstein might have imagined emulating proof by mathematical induction.
This paper puts forward a new account of rigorous mathematical proof and its epistemology. One novel feature is a focus on how the skill of reading and writing valid proofs is learnt, as a way of understanding what validity itself amounts to. The account is used to address two current questions in the literature: that of how mathematicians are so good at resolving disputes about validity, and that of whether rigorous proofs are necessarily formalizable.
Several authors have investigated the question of whether canonical logic-based accounts of belief revision, and especially the theory of AGM revision operators, are compatible with the dynamics of Bayesian conditioning. Here we show that Leitgeb’s stability rule for acceptance, which has been offered as a possible solution to the Lottery paradox, allows to bridge AGM revision and Bayesian update: using the stability rule, we prove that AGM revision operators emerge from Bayesian conditioning by an application of the principle of maximum entropy. In situations of information loss, or whenever the agent relies on a qualitative description of her information state—such as a plausibility ranking over hypotheses, or a belief set—the dynamics of AGM belief revision are compatible with Bayesian conditioning; indeed, through the maximum entropy principle, conditioning naturally generates AGM revision operators. This mitigates an impossibility theorem of Lin and Kelly for tracking Bayesian conditioning with AGM revision, and suggests an approach to the compatibility problem that highlights the information loss incurred by acceptance rules in passing from probabilistic to qualitative representations of belief.
This chapter contains a survey of known results and open problems connected to the combinatorics of (type A) Macdonald polynomials. Macdonald polynomials are symmetric functions in a set of variables which depend on two extra parameters q,t. They include most of the commonly studied bases for the ring of symmetric functions, such as Schur functions and Hall-Littlewood polynomials, as special cases. Macdonald polynomials have geometric interpretations which make them important to algebraic geometry and mathematical physics, and are also fundamental to the study of special functions. Their combinatorial properties are rather mysterious, although a lot of progress has been made on the type A case in the past 20 years, in conjunction with the study of the representation theory of the ring of diagonal coinvariants. This survey shows how to express Macdonald polynomials, and other important objects such as the bigraded Hilbert series of the diagonal coinvariant ring, in terms of popular combinatorial structures including tableaux, Dyck paths, and parking functions.
The A-hypergeometric or GKZ hypergeometric system of differential equations in the present form were introduced by Gel'fand, Zelevinsky, and Kapranov about 30 years ago. Series solutions are multivariable hypergeometric series defined by a matrix A. They found that affine toric ideals and their algebraic and combinatorial properties describe solution spaces of the A-hypergeometric differential equations, which also opened new research areas in commutative algebra, combinatorics, polyhedral geometry, and algebraic statistics. This chapter describes fundamental facts about the system and its solutions, and also gives pointers to recent advances. Applications of A-hypergeometric functions are getting broader. Early applications were mainly to period maps and algebraic geometry. The interplay with commutative algebra and combinatorics has been a source of new ideas for these two fields and for the theory of hypergeometric functions. Recent new applications are to multivariate analysis in statistics.
By introducing weight functions on Euclidean space which are products of powers of linear functions vanishing on the mirrors of a finite reflection group one can construct generalizations of classical harmonic and Fourier analysis. There is a commutative algebra of differential-difference operators (the Dunkl operators) which generalize the partial derivatives and which are equipped with parameters. This chapter gives an introduction to the requisite properties of finite reflection (Coxeter) groups, which are associated to root systems. This is followed by the construction and commutativity proofs for the Dunkl operators. By their use one defines a concept of harmonic polynomials which serve as orthogonal bases for functions on the surface of the standard unit sphere with respect to the group-invariant weight function. There is an analog of the exponential function, the Dunkl kernel, which is used to define a generalized Fourier transform. The one-variable version of the transform is related to the classical Hankel transform. The two-dimensional examples of harmonic polynomials include the Gegenbauer and Jacobi polynomials. The general theory includes a natural extension of the classical orthogonal polynomials and of the Bessel functions.
This chapter provides an overview of some of the main results from the theories of hypergeometric and basic hypergeometric series and integrals associated with root systems. In particular, a number of summations, transformations, and explicit evaluations for such multiple series and integrals is listed. The focus is on those results that do not directly extend to the elliptic level. The featured results include multivariate versions of the terminating q-binomial theorem, the q-Pfaff-Saalschütz summation, the Jackson summation, some multilateral summations including multivariate versions of Dougall's 2H2 summation, Ramanujan's 1psi1 summation, Bailey's 6psi6 summation, multivariate Watson and Bailey transformations, dimension changing transformations, and multidimensional generalizations of the Askey-Wilson integral evaluation. A survey on the theory of basic hypergeometric series with Macdonald polynomial argument is provided as well.
The KZ equations are a fundamental mathematical structure related to hypergeometric functions. Solutions of all versions of KZ equations are given by multidimensional hypergeometric integrals. The semi-classical limit of KZ equations leads to basic quantum chain models of mathematical physics and representation theory. In this chapter we describe the main examples of the KZ equations (rational, trigonometric, elliptic, differential or difference) with integral hypergeometric solutions. We also describe the semi-classical limit of KZ equations and associated Bethe ansatz method as the semi-classical limit of the hypergeometric solutions.
The su(2) 3j-coefficients (or symbols) and higher ones as 6j and 9j play a crucial role in various physical applications dealing with the quantization of angular momentum. In this chapter, the hypergeometric expressions for these coefficients and their relations to discrete orthogonal polynomials are emphasized. We give a short summary of the relevant class of representations of the Lie algebra su(2), and discuss their tensor product. In the tensor product decomposition, the important Clebsch-Gordan coefficients appear. 3j-Coefficients are proportional to these Clebsch-Gordan coefficients. We give some useful expressions (as hypergeometric series) and their relation to Hahn polynomials. Next, the tensor product of three representations is considered, and the relevant Racah coefficients (or 6j-coefficients) are defined. The explicit expression of a Racah coefficient as a hypergeometric series of type 4F3 and the connection with Racah polynomials and their orthogonality is given.9j-Coefficients are then defined in the context of the tensor product of four representations. They are related to a discrete orthogonal polynomial in two variables. Finally, we consider the tensor product of (n+1) representations and generalized recoupling coefficients or 3nj-coefficients, determined by two binary coupling schemes.
We give a survey of elliptic hypergeometric functions associated with root systems, comprised of three main parts. The first two in essence form an annotated table of the main evaluation and transformation formulas for elliptic hypergeometric integrals and series on root systems. The third and final part gives an introduction to Rains' elliptic Macdonald-Koornwinder theory (in part also developed by Coskun and Gustafson). We survey the main properties of elliptic BC_n interpolation functions and BC_n-symmetric biorthogonal functions, which generalize Okounkov's BC_n interpolation Macdonald polynomials and the Koornwinder polynomials, respectively.
Appell introduced four kinds of hypergeometric series in two variables as extensions of the hypergeometric series F(a,b,c;x), and Lauricella generalized them to hypergeometric series in m variables, and they considered systems of partial differential equations satisfied by them. In this chapter, we give definitions of Appell’s and Lauricella’s hypergeometric series and state their fundamental properties such as domains of convergence, integral representations, systems of partial differential equations, fundamental systems of solutions, and transformation formulas. We define the rank and the singular locus of a system of partial differential equations, and list them for Appell’s and Lauricella’s systems. We describe Pfaffian systems, contiguity relations, monodromy representations and twisted period relations for the systems. We give their explicit forms for Lauricella’s E_D, which is the simplest among Lauricella’s systems. We also mention the uniformization of the complement of the singular locus of E_D by the projectivization of its fundamental system of solutions.
This chapter gives an overview of the theory of nonsymmetric and symmetric Macdonald-Koornwinder polynomials. The setup of the theory is new, allowing for a uniform treatment of all known cases, including a new rank two case. Among the basic properties of the Macdonald-Koornwinder polynomials discussed in the chapter are the (bi)orthogonality relations, the quadratic norm formulas, duality, and evaluation formulas. The chapter also gives an introduction to the associated theory of double affine Hecke algebras.
In this chapter the basic theory of hypergeometric functions for root systems is discussed, together with some of its applications. These functions arise in various contexts such as the representation theory of reductive groups, multivariate orthogonal polynomials, harmonic analysis on symmetric spaces, integrable models in mathematical physics, Dunkl operators, Knizhnik-Zamolodchikov connections, affine Hecke algebras, algebraic combinatorics (e.g. the Macdonald conjectures), the determination of certain Bernstein-Sato polynomials and period integrals for moduli of Del Pezzo surfaces.
This chapter gives an introduction to the book. It surveys multivariable hypergeometric series and integrals, with comparison of the classical, basic and elliptic case, and multivariable (bi)orthogonal polynomials and functions, where root system generalizations of classical orthogonal polynomials get special emphasis. The chapter also provides a global description of the other chapters.
This chapter presents the theory of orthogonal polynomials in several variables. Serving as a reference to the subject, it provides modern treatment and results on the subject as well as historical references. It covers the general theory and emphasizes the classical type of orthogonal polynomials whose weight functions are supported on regular domains. Orthogonal polynomials of two variables are treated separately. The cases of continuous weight functions and of discrete weights are both discussed. Formulas of orthogonal polynomials and their structural constraints are given explicitly whenever feasible.