Apply the reciprocal-and-integer-part algorithm for the continued fraction. The successive complete quotients after the integer part two are , , , and . Their integer parts are , and taking the next reciprocal repeats the first complete quotient. ThereforeThe first four continued fraction convergents are . The last gives . Squaring its unit gives , whose norm is again one. Thus two positive solutions of the Pell equation areDirect verification gives .
The polynomial form of Runge theorem says that a function holomorphic on a neighbourhood of a compact set with connected complement can be approximated uniformly on by polynomials.
For , takeThe complement is connected: the missing angular sector connects the inner disk to the exterior, and removing the single point zero from the inner disk does not disconnect it. On a neighbourhood of the annular sector choose an analytic logarithm with arguments between and . Its exponential agrees with the prescribed function on the sector. On a disjoint small neighbourhood of zero prescribe the analytic function zero. These two neighbourhoods define a holomorphic function near with on .
By Runge theorem, choose a polynomial with . Every fixed nonzero point of the disk eventually belongs to all , including points on the positive real axis; zero belongs to every . ConsequentlyEach polynomial restricts to an analytic function on . The excluded sector lies immediately below the positive axis and shrinks with , so the construction correctly preserves the chosen value on the branch cut. It gives pointwise convergence, not local uniform convergence across that cut. This is pointwise approximation by a Runge exhaustion.
For a plane crystallographic group, the translation subgroup consists of translations by vectors in a rank-two lattice ; the lattice is this additive group of translation vectors. The point group is the image under the linear-part homomorphism , equivalently . Conjugating a translation by an isometry with linear part gives translation by , so every point-group element preserves .
Choose a lattice basis. A point-group rotation is represented in that basis by an integral matrix, because it maps lattice vectors to lattice vectors, and its inverse does likewise. The trace is therefore an integer. In an orthonormal basis the same rotation has trace , which lies between minus two and two. Hence . The value two gives the identity, while the other values give angles , , , or . Thus every nonidentity rotation has orderThis proves the crystallographic restriction theorem from the lattice action rather than assuming the classification of wallpaper groups.
The polynomials are over , and multiplication gives . A cyclic code of length seven generated by a degree-three polynomial has dimension : the multiples with are distinct representatives, so its rank is four.
The root has order seven in : it is neither zero nor one, and the multiplicative group has prime order seven. A weight-one word cannot vanish at . A weight-two word , with distinct indices between zero and six, cannot vanish either, because that would give . Every codeword vanishes at , so its nonzero weight is at least three. Since itself has weight three,From obtain and . Therefore . The one-bit error has precisely this syndrome, so correcting it givesIts distance from the received word is one. The minimum distance three makes this nearest codeword unique: two codewords each at distance one from the received word would be at distance at most two from each other.
Write . Ignoring only terms independent of , the Poisson log-likelihood is . The multinomial model is defined on the constraint , since its probabilities must sum to one. On this constraint its full log-likelihood satisfieswhere both likelihoods include the same terms. Thus they differ by a constant on the admissible multinomial parameter set.
If the Poisson maximum-likelihood estimator has , it is feasible for the multinomial problem, and no feasible parameter can have a larger likelihood than it. Consequently it is also a multinomial maximum. With the usual uniqueness and identifiability assumption,Without uniqueness, the precise conclusion is that is a multinomial maximizer; arbitrary independently chosen maximizers need not be identical. This qualification is necessary for a general unspecified parametrization.
In a log-linear generalized linear model with an unrestricted intercept, differentiation with respect to that intercept gives . Thus the fitted total automatically equals . One can fit independent Poisson cell counts using the usual GLM machinery and recover the multinomial fitted probabilities as . The result is constrained Poisson and multinomial likelihood equivalence, not an assertion that the sampling experiments themselves are identical.
The pair-birth rate here is the constant immigration rate , while deaths occur at total rate . This interpretation is fixed by the requested mean formula. With and for , the master equation isThe Markov jump-process generator acts as . Taking gives , henceFor the second moment , the two jumps give . Differentiating therefore yields . Substitution of the mean and solution of this scalar linear equation giveThus , assuming and finite initial second moment. This is pair immigration with linear deaths; births at rate would be a different model and would not give the printed mean.
A form of the Poincaré-Bendixson theorem states that a nonempty omega-limit set of a forward orbit of a planar autonomous vector field, contained in a compact region and containing no equilibrium, is a periodic orbit.
Set . Direct calculation givesbecause . At the inner boundary the flow points into or along the annulus, and at the outer boundary it does likewise. Smoothness and these inequalities make the compact annulus forward invariant.
For nonzero , write , . Thenthroughout the annulus. Hence it contains no equilibrium. Any orbit starting there remains compactly trapped, has a nonempty omega-limit set, and the Poincaré-Bendixson theorem supplies the required periodic orbit in the stated annulus. For the annulus reduces to itself, and there , giving the periodic orbit directly.
Let be a local fundamental pair at zero, including a logarithmic Frobenius solution if the exponents are resonant. Any other independent pair on a common branch domain has and with constant coefficients and . Bilinearity and antisymmetry of the Wronskian giveThus changing the independent branches multiplies the principal-pair Wronskian by a nonzero constant, once the branches are continued onto the same domain.
For the second-order Fuchsian equation represented by the Papperitz symbol, the coefficient of isThis follows from the sums of local exponents at its two finite regular singular points. Abel's Wronskian identity, obtained by differentiating and using the differential equation, gives . Thus, on every branch domain avoiding zero and one,The normalized expression is locally constant. Its analytic continuation around either singularity is unchanged: the power factors cancel the determinant of the local monodromy, equivalently the integral of around that singularity. It therefore defines a single-valued holomorphic function on the punctured plane, locally constant near both punctures. Those punctures are removable, so the normalized expression extends to an entire function. This argument also covers resonant exponents and avoids assuming two pure power solutions in that case.
Let . The exponent-sum relation gives . Therefore the assumed boundedness of at infinity makes bounded there, up to a fixed nonzero branch factor. By part (ii), is entire and hence bounded also on compact sets. Liouville theorem makes it a constant , givingIndependence forces : if the Wronskian vanished, uniqueness for the second-order linear equation at an ordinary point would make the two solutions dependent. In fact the differential identity in part (ii) already proves constancy; the boundedness hypothesis supplies the requested Liouville route as well.
Put and . The Euler-Lagrange equations are and , where . Adding shows that is conserved. Subtracting gives the equation of a simple pendulumThe relative equilibria are and modulo . The relative energy has a strict minimum at zero, proving stability there. Linearization gives near zero and near , so the latter is unstable. The small-oscillation period is . These are equilibria of the relative angle; a nonzero conserved total angular momentum permits common rotation of both particles.
Chemical equilibrium gives , since the photon chemical potential is zero. Set . The degeneracies and approximate masses give prefactors for protons, neutrons and helium. ThusHere the binding energy uses ; the PDF prints in that mass relation, a dimensional typo.
Baryon conservation gives . In adiabatic expansion without photon-producing entropy release, and , so stays constant. This statement is for that epoch; entropy transfer such as electron-positron annihilation modifies the photon normalization.
Since the density ratio equals , substitution of the given photon density yieldsAt MeV, MeV and MeV, the right side is about . Unity therefore corresponds to , illustrating the stated very rough temperature estimate for a cosmological baryon-to-photon ratio of order to . A numerical value of is necessary; it is not specified in the question. The exponential makes the temperature estimate far less sensitive than the ratio itself to order-one prefactors.
Actual helium synthesis must proceed through light intermediates. The deuterium bottleneck persists because deuterium's much smaller binding energy allows the abundant high-energy photon tail to destroy it. Only at a lower temperature do enough deuterons survive to initiate efficient reactions leading to helium. Direct four-nucleon assembly at the equilibrium temperature is ineffective.
The Chinese remainder theorem says that for pairwise coprime positive moduli , the map is an isomorphism; in particular prescribed residues have a unique solution modulo the product.
Write , with and . Choose and . The Chinese remainder theorem supplies . The binomial theorem gives , since every nonconstant term is divisible by ; also . Thus , whereas . Its multiplicative order is exactly .
For odd define the Jacobi symbol , using the Legendre symbol, with . It is zero if shares a prime factor with . For example , but the square residues modulo nine are , so two is not a square.
For positive odd coprime , Jacobi reciprocity isFactor and and multiply quadratic reciprocity for each prime pair. Its sign exponent is . For odd numbers, , so this exponent has the same parity as . Multiplicativity of the Legendre symbol gives the two Jacobi products, proving the formula. If are not coprime, both sides of the displayed reciprocity equality are zero.
For the previously constructed , every prime divisor of sees residue one, so . But , because and is odd. The order- unit therefore has . This supplies a unit failing the proposed test.
Finally the passing units form the kernel of the homomorphismMultiplicativity makes this a homomorphism, and the failing unit shows its kernel is proper. A proper subgroup has index at least two. Hence the test fails on at least half the units modulo .
The Liouville approximation theorem states that if a real irrational algebraic number has degree , there is such that for every integer and positive integer .
Choose its irreducible polynomial of degree . Since is irrational, ; after multiplication by it is a nonzero integer. Hence . On the polynomial derivative has a finite bound . For , the mean value theorem gives , proving the required bound with . For more distant rationals, the bound holds with . Taking covers every rational and proves the theorem.
Let be the complete quotient. Iterating the fractional-linear formula for a continued fraction givesThe supplied determinant identity and therefore implyThe positive partial quotients ensure increasing denominators tending to infinity; the same determinant identity makes the even and odd convergents nested, giving their common limit . The displayed formula follows by passing to the limit in the finite-tail identity.
An explicit choice is for every . The recurrence gives . For , , so . Consequently andFirst is irrational: if , the nonzero difference from a convergent is at least , contradicting the error bound once . If were algebraic of any fixed degree , the last displayed upper bound would eventually be smaller than for the positive constant in part (i), since . This contradicts the Liouville approximation theorem. Thus this explicit continued fraction is transcendental.
The term is logistic population growth, with carrying density and low-density growth rate . The cell flux is : its first part is diffusion down the density gradient, and its second is chemotaxis toward higher chemical concentration. Taking minus its divergence gives the two transport terms. Chemical production is proportional to cell density at rate , degradation is first order at rate , and the chemical diffuses with coefficient . All the given positive signs correspond to growth, attraction, production, degradation and ordinary diffusion respectively.
The positive homogeneous equilibrium is , . For spatially constant perturbations , linearization gives and . The triangular matrix has eigenvalues and , both negative, proving asymptotic stability to homogeneous perturbations. The other homogeneous equilibrium, zero population and zero chemical, has positive population eigenvalue and is not the desired stable state.
For a Laplacian mode with , the linearized chemotaxis system isIts trace is negative for all . Writing , its determinant isInstability occurs when this determinant is negative, because then one real eigenvalue is positive. A quadratic with positive leading and constant coefficients is negative for some precisely when its middle coefficient is negative and its discriminant positive. These conditions combine toThis proves the printed threshold. In a bounded spatial domain, only its permitted Laplacian eigenmodes are available; the continuous- threshold describes the onset when wavenumbers can vary freely.
At the threshold, the determinant quadratic has a double zero. Its vertex lies at . Substituting the equality case of part (iii) givesThe mode is neutral exactly at onset and grows when the chemotactic coefficient increases beyond that threshold.
Choose in the proposed Lyapunov function. The cubic terms cancel and direct differentiation givesFor this is negative definite, while is positive definite and radially unbounded. Finite-dimensional equivalence of these positive quadratic forms gives for some . Thus , every solution remains bounded and exists for all forward times, and every solution tends to zero. Therefore the origin is globally asymptotically stable, indeed exponentially stable.
The centre manifold theorem says that near an equilibrium of a sufficiently smooth finite-dimensional vector field, there is a locally invariant centre manifold tangent to the generalized eigenspace of eigenvalues with zero real part. It can be represented as a graph over that space, with graph value and derivative zero at the equilibrium; the dynamics on it determine the local centre-direction behaviour. For parameter-dependent systems the parameters may be adjoined as variables with zero derivative, producing an extended centre manifold.
At , the linearization has the block and the independent eigenvalue . Its other eigenvalues are zero and . Hence the equilibrium is nonhyperbolic, the stable subspace has dimension two, and the non-extended centre subspace has dimension one. A centre eigenvector is .
With , substitute , , . The equations becomeThe extended centre variables are . The centre manifold theorem gives smooth graph functions with and all first derivatives zero. Their invariance equations are and , after substitution of the graph.
Count as order . Then on the graph, so the left side of the equation contributes only at higher order. Its quadratic terms give , hence . The cubic terms of the equation similarly give . ThusTerms purely in vanish because the origin remains an equilibrium for every parameter; these expansions describe the weighted scaling , not an unrestricted one-variable Taylor series. Substitution gives the reduced equationIts cubic coefficient is negative. For the origin is attracting in the centre direction; for it loses stability and two attracting branches emerge with . Therefore the bifurcation is a supercritical pitchfork. These branches agree with the exact Lorenz equilibria , .
By the gravitational shell theorem, the inward acceleration at radius is , where . Force balance for a thin fluid shell gives , and henceAssembling shells from infinity gives . Using the pressure equation and integration by parts yieldsFor a star with negligible external pressure, , this is . Nonzero external pressure would add the displayed surface term.
For a nonrelativistic ideal gas, the virial relation is and total energy is negative. Under adiabatic compression its kinetic energy scales as , faster than the magnitude of gravity, providing restoring support; its adiabatic index exceeds . For an ultrarelativistic gas, and both terms scale as , giving marginal stability at adiabatic index in this idealized Newtonian model. Corrections such as general relativity can then destabilize it.
Integrating the kinetic energy over filled momentum states givesSince , the pressure isFinally , whereas . Equating these by the virial theorem givesThis is an order-of-magnitude estimate for nonrelativistic degeneracy support, not a uniform-density exact stellar solution.
The recursive ordinal addition definitions are , , and for a nonzero limit ordinal. Ordinal multiplication is , , and . For , ordinal exponentiation is , , and ; the exceptional zero base has and for .
Transfinite induction gives . At zero this is immediate; at a successor, . At a limit, continuity and the induction hypothesis give . Also is strictly increasing: its successor values strictly increase, and continuity preserves the strict inequality between any two distinct indices.
For , , so there is a least with . It cannot be zero and cannot be a limit: at a limit, a supremum greater than has a term already greater than , contradicting minimality. Thus , andStrict increase proves uniqueness, and proves the requested index bound.
Choose the largest positive integer with . It exists because . The remaining tail of the ordinal interval has an order type with ; maximality implies . If , repeat the construction on it. The leading exponents strictly decrease, and there is no infinite strictly decreasing sequence of ordinals: its set of values would have a least member followed by a smaller one. Hence the process terminates, yielding the Cantor normal formThe first exponent is determined by the preceding band, the first coefficient by maximality, and the tail by the ordinal interval left after that initial segment. Recursion therefore proves uniqueness of every exponent and coefficient. The PDF's second coefficient is printed rather than ; the stated natural-number coefficients and the construction identify the intended expression.
For the final assertion, powers of are additively indecomposable: if , then for . One proves this by induction on . At a successor, bound by a finite multiple of and use the supremum over all such multiples; at a limit, bound by a smaller power and use continuity. For the only possible is zero. Thus a smaller leading exponent is absorbed when a larger-leading ordinal is added on its right. If have unequal leading exponents, either or . If their leading exponents coincide, the leading coefficient of either sum is the sum of their two positive leading coefficients; it exceeds each coefficient, so neither absorption equality holds. Zero is never commensurable with an ordinal. Consequently commensurability is exactly equality of the leading exponent, equivalently membership of both positive ordinals in one of the stated bands.
Hall marriage theorem says that a bipartite graph with equal finite vertex-class sizes has a perfect matching exactly when for every . Necessity follows because distinct matched partners of vertices of belong to .
For sufficiency, induct on , the case being immediate. If a nonempty proper is tight, , the induced graph between and satisfies Hall's condition and has a matching by induction. The remaining graph also satisfies it: for , the condition on gives . Induction gives the second matching, and their union is perfect. Otherwise every nonempty proper subset has strictly more neighbours. Choose an edge and remove its ends. Every remaining nonempty subset loses at most one neighbour and originally had at least one spare neighbour, so Hall's condition survives. Induction matches the remaining graph, and restoring completes the proof.
The last argument also proves flexibility under the strict condition: it works for every selected edge, so every vertex is flexible. The case is again immediate.
Now suppose only that a perfect matching exists. Choose a minimal nonempty tight set ; such a set exists since is tight. Every nonempty proper subset of satisfies the strict condition in the induced graph on . Hence every edge from a vertex of extends to a matching of that induced graph. There are no edges from to the complement of . Restrict the original perfect matching to the complementary vertex classes and append it to this new induced matching. This makes every vertex of flexible in the whole graph, proving that at least one flexible vertex exists.
For the requested counterexample, take and . Join only to , and join each of to all of . There is a perfect matching using and a matching of the remaining complete bipartite graph. The unique minimum-degree vertex is , of degree two, but cannot occur in a perfect matching because has no other neighbour. Thus no minimum-degree vertex is flexible, while the other three vertices are flexible.
Let . The four roots are , so . Eisenstein's criterion at three gives . This field is real, so adjoining doubles the degree and .
Define , , and complex conjugation , . The first automorphism exists because over the minimal polynomial of has degree four and all four roots are in ; the second is immediate. They satisfy and . The eight maps and are distinct and exhaust the eight automorphisms. Thusthe dihedral group of order eight, acting on the four roots as the symmetries of a square. On every element of , the action is determined by the displayed images of , or by extending them linearly to the basis with , .
Let and . The roots are . Since and , we have . Hence the splitting field is . The quartic is Eisenstein at two, so its degree is four.
The automorphism sending to sends to , and therefore sends to . Its successive images of are . Thus has order four and supplies all automorphisms:Complex conjugation is . The images of specify the full action because is generated by that one root.
The permutation representation on the complex vector space with basis has permutation character . The multiplicity of the trivial character is . Count pairs with : each orbit contributes , by the orbit-stabilizer theorem. Hence this multiplicity equals the number of orbits.
For a transitive action the average number of fixed points is one. The identity fixes points, so not every other element can fix at least one; otherwise the average would exceed one. Thus there is a derangement with .
If , evaluating at that derangement gives . Character values are algebraic integers, since a finite-order representation matrix has roots of unity as eigenvalues, and the sum of algebraic integers is integral. A rational algebraic integer is an integer. Therefore is an integer, forcing .
The diagonal action on is . Its permutation character is , since both coordinates must be fixed. The orbit-count result and the real-valued character giveIf any and another nontrivial constituent occurs, this is at least . If just one nontrivial constituent occurs, the previous result forces its multiplicity to one. Thus implies every multiplicity is one, and the formula then gives .
An action assigns each a homeomorphism of , with and . For the covering assertion use a properly discontinuous free action: every has an open neighbourhood such that for every . Then the translates are pairwise disjoint. The quotient map is open because is open. Each restriction is a continuous open bijection and hence a homeomorphism. Thus is evenly covered and is a covering map.
For the surjective homomorphism one additionally needs path connected; choose and its image . Lift a based loop at from . Its endpoint has a unique form . Homotopy lifting makes this assignment well-defined on the fundamental group. With concatenation meaning first the first loop and then the second, the second lift from is times the lift from , so the endpoint is . This proves the homomorphism property. For each , a path in from to projects to a loop realizing . HencePointwise freeness alone is insufficient for a covering: an irrational rotation action of on the circle is free but its orbits are dense. Path connectedness is also essential for the final surjectivity claim as written: the discrete space with left translation is a free properly discontinuous action whose quotient is a point, and its trivial fundamental group cannot surject onto nontrivial . The proof supplies the standard connected covering-space interpretation rather than hiding these hypotheses.
The Arzelà-Ascoli theorem for states that a family has compact closure in the uniform norm exactly when it is uniformly bounded and equicontinuous. To prove sufficiency, choose a countable dense set. From any sequence of functions, successive subsequence extraction at each dense point and a diagonal selection give convergence at all those points. Given , equicontinuity gives a common ; cover the interval by finitely many -balls centered at dense points. On a sufficiently late tail the functions differ by less than at those finitely many centres, and equicontinuity makes each of the other two differences less than . Thus the selected subsequence is uniformly Cauchy. Completeness of gives a continuous uniform limit. In a metric space this proves compactness of the closure. Conversely, a compact family has finite uniform -nets. The finitely many net functions are bounded and uniformly continuous; approximation by them gives a common bound and equicontinuity for the family. This proves both directions.
For , a positive interior maximum would have and , contradicting . A negative interior minimum likewise contradicts . The endpoint bounds therefore give everywhere.
Now put . Differentiating the equation, using the stipulated third derivative, gives . At an interior extremum of , , so . The same maximum/minimum argument and the derivative endpoint bounds imply . Consequently by the mean value theorem. Thus is uniformly bounded and equicontinuous, and the theorem makes it relatively compact, hence totally bounded in . Its closure need not be asserted to remain thrice differentiable.
Choose coordinates at and at vanishing at those points. The local expansion is , . Define the branching order . A change of either coordinate has nonzero linear coefficient, so it preserves the leading exponent, proving well-definedness.
Ramification means , equivalently vanishing of the derivative in local coordinates. These zeros are isolated unless the local derivative is identically zero, which by analytic continuation would make constant. An infinite set of ramification points on a compact surface would have an accumulation point, contradicting isolation. Thus that set is finite.
A nonconstant holomorphic map of compact connected Riemann surfaces is onto, since its image is open by the local form and closed by compactness. It has a finite degree . The Riemann-Hurwitz formula isIf both genera equal , positivity of forces and every ramification term zero. The map is bijective and has nonzero derivative everywhere. The holomorphic inverse function theorem says that a holomorphic function with nonzero derivative has a local holomorphic inverse; these inverses patch, so is biholomorphic. For , multiplication by two on is a degree-four holomorphic map of an elliptic curve to itself and is not biholomorphic.
For a nonsingular plane curve , at a point with the holomorphic implicit function theorem gives and the chart coordinate . Where , use and express . Nonsingularity ensures at least one choice is available, and the coordinate transition functions and both restricted projections are holomorphic.
Here with . A singular point would require , and . But has three distinct roots , so this is impossible. Hence the curve is nonsingular.
If , , so is a local coordinate and the projection to is unramified. At for , use as coordinate. Since , solving gives . ThusThese are all the ramification points on the stated affine curve; no points at infinity belong to .
A point is critical if is not surjective. A critical value is an image of a critical point; a regular value is a point for which every point of is regular, including vacuously values with empty preimage. Sard theorem says that for a smooth map of finite-dimensional manifolds, the critical values have measure zero in every coordinate chart of the target. In particular regular values are dense.
Assume is a compact smooth -manifold without boundary and a connected smooth -manifold without boundary. For a regular value , the inverse function theorem makes discrete, and compactness makes it finite. Define . No orientations are required.
The parity is independent of the regular value: join two regular values by a path and perturb the path in its interior to be transverse to . Its inverse image is a compact one-dimensional manifold with boundary consisting of the two endpoint fibres. Every compact one-manifold has an even number of boundary points, so the two counts have the same parity. The same argument proves homotopy invariance. For noncompact one instead needs a proper map to retain compactness of the relevant inverse images.
If omitted a point of , that point would be a regular value with empty fibre and hence degree zero. Independence on the connected target gives the contradiction. Therefore a nonzero degree modulo two forces surjectivity.
Parametrize the torus by . Its outward Gauss map isThe derivative has unit length, while has length and is perpendicular to . Thus rank drops precisely at or . These are the two circles of height and and radius two, and their images are the north and south poles. Therefore the critical values are .
For any nonpolar target point, its third coordinate determines two values of , one with positive and one with negative . For each, the longitude fixes a unique modulo , with a shift of when changes sign. Thus every regular value has exactly two preimages, one on the outer and one on the inner side of the torus. ConsequentlyThis explicit two-sheet description justifies the count without relying on a sketch.
For , the Lp norm is ; for it is the essential supremum of . The Lp space consists of measurable functions with finite norm, identifying functions equal almost everywhere. This identification makes the quantity a norm rather than only a seminorm. Convergence in means , including the essential-supremum norm when .
The Minkowski inequality states the triangle inequality for every norm with . Apply it to and then to . The two bounds combine toThus norm convergence implies convergence of the norms themselves.
Put and . There is a positive-measure set on which , so and each is positive; boundedness and finite measure make each finite. For , apply Cauchy-Schwarz to and to getTherefore the positive ratios are nondecreasing. Telescoping gives , while almost everywhere gives . HenceFor , the set has positive measure by the definition of essential supremum. Thus , whereas . Letting and then shows . The preceding squeeze yields . This proves the ratio limit rather than assuming it from the moment-root limit.
For a finite-state continuous-time Markov chain with generator matrix , . The exponential solves both Kolmogorov equations, , with initial condition .
Write , with . Then andThus is a stationary probability vector, a left eigenvector for eigenvalue zero. If any probability vector is stationary, the same calculation gives , forcing . Hence the equilibrium is unique, even if some vanish and the chain is not irreducible; those zero-rate states are transient or inaccessible rather than extra stationary classes.
If , then . Induction gives . Summing the matrix-exponential series yieldsThus deviations of total mass zero decay with the single rate .
The vector has component sum zero, so part (c) applies to it. Part (b) gives . Decompose to obtainThis is the full transition-law row, showing how the initial colour survives with exponentially decreasing weight.
Reading the th component givesThe chain has the interpretation of a rate- Poisson clock which independently redraws a colour from , allowing a redraw of the same colour. No redraw by time has probability and retains the initial state; at least one redraw gives distribution .
For a prior and loss , the Bayes risk of a rule is . A Bayes decision rule minimizes this integrated risk. An Extended Bayes rule is a rule whose excess over the optimal Bayes risk can be made arbitrarily small by a suitable proper prior: for every some has , with finite risks.
Condition on the observation and use iterated expectation. A rule is Bayes precisely when it chooses a minimizer of the posterior expected loss almost surely, up to the usual measurability requirement. Under squared Euclidean loss, with a finite posterior second moment, write . The identityshows that the Bayes rule is the posterior mean.
Write , with independent of the prior . Then , soCompleting the square in the joint density gives . Thus the Bayes rule is , with Bayes risk . The rule has integrated risk one for every , so its excess Bayes risk is as . The priors remain proper at every positive . Therefore is extended Bayes, without treating the limiting improper flat prior as a proper Bayes prior.
Articles were limited to the first 100 out of 137 total.
Articles by others on the same topic
There are currently no matching articles.