Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 302 3 Solution Created 2026-10-03 Updated 2026-10-05
The triple bond in the original Dynkin diagram gives the Cartan integerswhere is the long root and the short root. Their product is , and the inner product of distinct simple roots is nonpositive. The ratio of the two integers gives the squared-length ratio. ThereforeIt is convenient to normalize , and . Scaling the inner product does not affect the root system or the fundamental-weight relations.
For nonproportional roots , the root-string theorem states that the root string is consecutive:The endpoints are maximal, and reflection in reverses the string. The Cartan integer determines , not in general the total by itself. This result follows by restricting the Adjoint representation to the sl2 subalgebra associated with a root. If the roots are distinct simple roots, cannot be a root: its simple-root coefficients have opposite signs. Thus andHere length means number of roots; the number of intervals between them is one less. Distinctness matters. If , a reduced root system gives the set , with a missing zero between them, so the consecutive-string theorem and the displayed simple-root formula do not apply.
In the G2 root system, the initial strings areFor , . Since is not a root in a reduced root system, and : this generates . The remaining strings explain why the construction stops. The -strings through and are the same two-element string; the one through is a singleton since subtracting gives , and its Cartan integer is zero; the one through is the string . The -strings through , , and are the initial four-element string. Finally, is orthogonal to ; its -string is a singleton because is not a root. Apply the same reasoning to negatives. Using the permitted completeness of this procedure givesThe short positive roots are , of squared length two; the other three are long, of squared length six. Each root space is one-dimensional and the Cartan subalgebra has dimension two, soHere the dimension refers to the Lie algebra, with one Cartan generator per rank, not just the number of roots.
Write a prospective weight as . The pairings with simple coroots areThe fundamental weights are dual to those coroots. Solving the two linear systems gives, in the long-root-first numbering of this paper,The representation with Dynkin labels has highest weight , a short root. Numbering the short root first, as some references do, would call this the representation instead; the representation itself is unchanged.
The weight set of a finite-dimensional irreducible highest-weight representation is invariant under the Weyl group and lies in the convex hull of the orbit of its highest weight. All weights also differ from the highest weight by an element of the root lattice. The orbit of comprises the six short roots, so all six are weights. The lowering operators give the chainIn particular zero occurs: at weight , its pairing with is two, so the lowering operator is nonzero by the finite-dimensional sl2 Lie algebra representation theory. The -string through it is the usual three-weight string ; higher weight would lie outside the highest-weight convex hull.
There can be no further weights. Every point of that convex hull has squared norm at most , while a root-lattice point hasThe integer solutions of the bound are precisely zero and the six short roots: gives ; gives ; and gives . ThusThe final dimension uses the stipulated nondegeneracy of the weights. It also agrees with the Weyl dimension formula without that stipulation. The zero weight is not in the Weyl orbit of the nonzero weights, so this is not a minuscule representation.
In the diagram above, a coordinate label means . The left panel contains all twelve roots of a root system; the right panel contains the six short-root weights and the zero weight. The long-root-first convention is the same as in the calculations.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 327 1 Solution Created 2026-10-03 Updated 2026-10-06
Use the Fourier transform convention and , so . All distribution pairings use complex bilinearity, and the formal transpose is , without complex conjugation of the coefficients. If instead denotes , the Fourier multiplier is ; the argument below is unchanged after this substitution.
For a nonempty compact convex set , let be its support function. The Paley–Wiener–Schwartz theorem says that the Fourier transform is a bijection between distributions supported in and entire functions on for whichfor some and nonnegative integer . In particular, support in is equivalent to the bound with . Convexity is essential in the precise support formulation: the support function of a set equals that of its convex hull.
Suppose first that is a compactly supported distribution with support in . Define , inserting any cutoff function equal to one near when viewing on test functions. A fixed cutoff and the finite order of a distribution estimate permit differentiation of the pairing in each complex variable, giving . The exponential function's power series converges with every required derivative on a fixed compact set; hence is an entire function. On real frequencies it agrees with the Fourier transform of a compactly supported distribution.
The exact exponential indicator needs a shrinking cutoff function, rather than one fixed outside . Choose near , with support in and for . Such a cutoff is obtained by convolving the indicator of with a mollifier supported in . On one fixed ball containing all these supports, the finite order of a distribution bound isThe Leibniz rule applied to therefore givesTaking proves the required bound, with and a fixed additional factor at most .
Conversely, suppose is an entire function with the displayed bound. Its real restriction has polynomial growth, so its inverse Fourier transform defines a tempered distribution byRapid decay of the Schwartz function makes this integral absolutely convergent and continuous in the Schwartz space topology.
To determine the support of a distribution, take a test function supported in a half-space , where and . The contour-shift proof of the Paley–Wiener–Schwartz theorem gives, for each ,Here is the estimate that justifies both the shift and its limiting use. Since , repeated integration by parts with yieldsFor fixed , the same estimate is uniform over the imaginary strip from to . Rotate coordinates so is the first coordinate direction, apply the Cauchy integral theorem on truncated rectangles, and let their real edges tend to infinity. If , the boundary integrals vanish and the horizontal integrals converge absolutely; thus the claimed shift is valid. Using now bounds the pairing bywhich tends to zero. A separating hyperplane exists at every point outside the compact convex set . A finite partition of unity on the support of any exterior test function reduces it to such half-spaces, so . Fourier inversion gives uniqueness; the entire transform of this agrees with on and hence everywhere, by applying the one-variable identity theorem successively in each coordinate. This completes both directions.
Now apply this theorem to compact support solvability for a constant-coefficient ordinary differential equation. If is a nonzero constant, its kernel is zero and is the unique solution. Otherwise writeThe solution space of isIndeed these exponentials solve the equation, their initial derivative vectors have a nonzero Vandermonde determinant, and uniqueness for the order- ordinary differential equation makes them a basis. Pairing with any such solution proves necessity:
For sufficiency, choose with and let . The assumed annihilation is precisely for every . Since all roots of a polynomial are simple, has removable singularities at every root and is an entire function. Outside one disk, . Inside that disk, the extended is bounded. The polynomial division preservation of exponential type therefore givesThe Paley–Wiener–Schwartz theorem produces a compactly supported distribution with transform , supported in the same interval. Then , so Fourier inversion gives . ThusThe compactly supported solution is unique: forces the entire transform to vanish off the finitely many roots and hence everywhere. With repeated roots, the corresponding condition would also require derivatives , or pairing with , up to one less than each multiplicity.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 106 4 Solution Created 2026-10-03 Updated 2026-10-05
The Mazur theorem states that the weak closure and norm closure of a convex set in a normed vector space coincide:Norm closure is contained in weak closure because the weak topology is coarser. Conversely, if , the Hahn-Banach separation theorem provides a continuous real linear functional strictly separating from that closed convex set. In a complex space this is the real part of a continuous complex linear functional. A weak neighborhood of then misses , so . This proves the equality. It also gives the usual Mazur lemma: if , then lies in the norm closure of the convex hull of each tail, so one can choose tail convex combinations with .
Now let be a weakly compact set in a normed space . Each is bounded on because it is weakly continuous. The family in , where is the canonical embedding into the bidual, is therefore pointwise bounded. The space is Banach even if is not. Apply the Uniform boundedness principle and use to obtainThis proves that a weakly compact set is norm bounded without assuming completeness of the original space.
For the real-valued dual and integral formulas that follow, take to be real, as in the PDF. In a complex space the norming formula uses real parts, and the integral identities use complex-valued functionals instead.
If the separable Banach space is nonzero, choose a norm-dense sequence in its unit sphere. By the Hahn-Banach theorem, choose with and . For any unit vector , arbitrarily close satisfyScaling gives the countable norming family identityFor use the constant sequence of zero functionals. If is norm-Borel measurable, every is measurable, so its countable supremum is measurable. Equivalently, this also follows directly from continuity of the norm.
For any , continuity makes measurable, andThus the assumed integrability of the norm implies scalar integrability, anddefines a bounded linear functional on . Use the granted weak-star continuity of . By the continuous dual of a weak-star topology, is evaluation at a vector of . Indeed, continuity gives finitely many and such that whenever for all . Scaling shows that vanishes on the common kernel of these evaluations. It therefore factors through their finite-dimensional coordinate map, so . The Hahn-Banach theorem makes this representing vector unique. HenceIn this separable setting the vector is the Bochner integral.
Return to a weakly compact set and its inclusion . For each fixed , the identity makes weakly Borel measurable. Norm balls are consequently weakly Borel measurable. Separability gives a countable base of such balls, so every norm-open set is weakly Borel measurable. This proves measurability of , and establishes the equality of the weak and norm Borel sigma-algebras in a separable Banach space.
Put . For every finite signed Borel measure on ,For positive measures this is the integral in the question. For signed measures, the correct integrability condition uses the variation measure; define the integral by taking the difference of the positive and negative integrals. The printed in this clause should be , the domain of the inclusion.
The Riesz-Markov-Kakutani representation theorem now defines the bounded linear mapFor each the restriction is in , andThe right side is weak-star continuous in . The defining property of the weak topology therefore proves that is weak-star-to-weak continuous, for arbitrary nets. For a Dirac measure, .
If , let be its regular probability measures. This is a weak-star closed subset of : its conditions are and for every nonnegative . It is compact by Banach-Alaoglu theorem. Thus is weakly compact and convex, and contains because it contains all . It is weakly closed, hence norm closed, so it contains . By Mazur theorem, is weakly closed. Therefore it is a closed subset of the weakly compact set , provingThe empty case is immediate. In fact : a barycenter of a measure on a Banach space outside would be strictly separated by a functional , contradicting .
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 4 30J b Solution Created 2026-09-24 Updated 2026-09-25
The convex hull of isThus is a convex combination of when it has precisely this form. Equivalently, is the smallest convex set containing . The Caratheodory theorem sharpens the finite-combination description in : every point of is a convex combination of at most points of .
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 4 22F b Solution Created 2026-09-24 Updated 2026-09-25
Put , so . We show that the norm closure of the convex hull of every tailcontains zero. If it did not, the Hahn-Banach separation theorem would give a bounded linear functional , a real number , and, after multiplying by a complex scalar if necessary,for every in that closed convex hull. In particular for all . By the Riesz representation theorem, for some , contradicting .
Consequently, for every there is a finite convex combinationwith . DefineThen every is a convex combination of terms of the original sequence andThis is Mazur lemma in the present Hilbert-space setting.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 339 1 d Solution 2026-09-28
Write for row of , and define affine functionsThenThe pointwise maximum of convex functions is convex, so is a convex function. Moreover,so has Lipschitz continuity. The simpler bound is also valid.
Let be the active set. The subdifferential isthe convex hull of all active slopes. In particular, choosing any active index gives the subgradientAt a tie, every convex combination of the tied slopes is also valid.
Probability simplex 2026-10-05
The probability simplex consists of vectors of nonnegative weights summing to one. It is the convex hull of the coordinate vectors. A linear function has maximum on this simplex; equality holds exactly when the weights are supported on maximizing indices.
Talagrand convex distance 2026-10-06
For an event in a product of finitely many probability spaces with its product measure, take the closed convex hull of the mismatch vectors , . The distance of this hull from zero is . Equivalently it is the supremum, over nonnegative coordinate weights of squared sum at most one, of their minimum mismatch sum. Averaging mismatch patterns is the feature that distinguishes this quantity from ordinary Hamming distance.
Throughput region of an interference graph 2026-10-06
For feasible independent set activation vectors , the throughput region is their convex hull. Its downward closure is the same set because deleting active vertices preserves feasibility. Ideal carrier-sense multiple access can supply strict margins above every vector in its interior by adjusting attempt rates.
