For congruence classes in , define
These operations are independent of representatives. If and , then and . Thus changing representatives leaves both results in the same congruence class. The usual integer laws descend to make this a commutative ring with zero and identity .
The decimal expansion gives . In modular arithmetic, , and hence
An integer is divisible by eleven exactly when its congruence class is zero, proving both directions of the alternating-digit test.
The Baire category theorem says that a countable intersection of open dense sets in a nonempty complete metric space is dense. Write . Each singleton is closed in a metric space and has empty interior because there are no isolated points. Therefore every is open and dense. Applying the theorem also to yields
which is dense in . Thus every nonempty open subset meets the required difference, not merely the original dense set .
No. Take the complete metric space with its usual metric, , and . This is uncountable and dense, whereas
misses, for example, the nonempty open interval . Uncountability does not replace the open-dense hypothesis in the Baire category theorem.
A plane plane crystallographic group is a discrete subgroup of the Euclidean isometry group with compact quotient. Its translations form a normal rank-two Euclidean lattice ; this is the standard translation-lattice structure of a plane crystallographic group. Its point group is the finite group of linear parts, equivalently the quotient by those translations. Conjugating a translation by an isometry sends its translation vector to its image under the linear part, so every point-group element preserves .
Choose a Euclidean lattice basis. A rotational linear part is then represented by an integer matrix , since it sends the basis to Euclidean lattice vectors. In an orthonormal basis the same map has eigenvalues , and its trace is independent of basis. Thus
These possibilities give rotation angles, modulo a full turn, , , , , and , respectively. Consequently the crystallographic restriction theorem is
The restriction comes from integrality of the Euclidean lattice action, not simply from finiteness of the point group.
A binary uniquely decodable code assigns a finite binary word to each source symbol, so that no two distinct finite sequences of source symbols have the same concatenated encoding. This does not require the stronger prefix property. All codeword lengths are positive.
Put and let count sequences of source symbols whose encoded total length is . Expanding the product gives
Unique decodability makes these encodings distinct, so , the number of binary strings of that length. There are at most possible lengths. Therefore
Taking th roots and letting proves the McMillan inequality:
Independence in the Bernoulli logistic-regression model gives the log-likelihood
Writing , the score function and curvature are
Thus a finite maximum-likelihood estimate solves . If at least one , the curvature is strictly negative for finite , so any such solution is the unique maximizer.
Use the Newton method, which here coincides with Fisher scoring because the second derivative does not depend on the observed responses:
Step damping or a bracket for the monotone score provides reliable numerical convergence. If all covariates are zero the parameter is unidentifiable; if the outcomes are separated in the direction of the covariates, the likelihood supremum may occur at or rather than at a finite estimate.
The positive steady state satisfies , so
With , the linearization is
Its characteristic polynomial is , where . The roots are inside the unit disk precisely when : when they are real they are positive with sum one, and when complex conjugate their common modulus is . Therefore the fixed point is linearly asymptotically stable for and unstable for . At ,
This proves period six for the neutral linearized oscillations. The stronger printed claim of a nonlinear period-six branch is not valid for the stated recurrence. It is important to distinguish these two assertions.
Here is a local obstruction, which also checks that the qualification is not merely absence of a proof. Normalize by the moving fixed point, let , , and define
Put , , and for . The quadratic and cubic terms of 's second component are . Composing six times gives
In particular the quadratic terms cancel, while the cubic components are and . If a small nonzero were a period-six point, invertibility of and the norm of this equation would imply . Taking its determinant with then gives
Since , this is impossible for sufficiently small nonzero . Thus no nontrivial nonlinear six-cycle bifurcates locally at . At the threshold the same expansion gives , so the fixed point is actually locally asymptotically stable nonlinearly, with slow decay. The valid intended linear-stability conclusion is the period-six neutral oscillation above; a literal nonlinear assertion requires a changed model or wording. This is an example of the distinction between linear resonance and nonlinear periodic bifurcation.
The nullclines are and . At a nonzero fixed point, cancellation of yields . The latter function attains its maximum at . Hence
For , and .
The Jacobian matrix is
At the distinct eigenvalues are , so the origin is a stable node. At a nonzero fixed point its trace is and
The discriminant is . Thus is a saddle and is a stable node, never a focus.
Above the straight nullcline ; below it . Below the curved nullcline ; above it . At the saddle, an eigenvector can be chosen as : the stable eigenvalue gives negative slope, and the unstable eigenvalue gives positive slope. The stable manifold is the basin boundary. The two branches of the unstable manifold lead respectively to the origin and the positive stable node, as illustrated for representative parameters.
The nonnegative quadrant is forward invariant. Since , stays bounded, and then also bounds . Moreover the divergence is the negative constant , excluding periodic or homoclinic loops by the Bendixson-Dulac criterion. The Poincaré-Bendixson theorem then leaves convergence to a fixed point. Initial data on the saddle's stable manifold approach the saddle; data in the two open basins approach extinction at or persistence at , respectively.
The real part of a holomorphic function is real analytic and has a local complexification in its two real coordinates. Define . On real ,
and the same identity holds after analytic continuation to complex . Substituting and gives and , hence
The conjugation on the final constant is present in the PDF but was lost in the converted TeX. Without it the formula already fails when and is not real.
Now has the specified real part. Thus the complete family is
Any two such holomorphic functions differ by a holomorphic function with zero real part; the Cauchy-Riemann equations make its imaginary part constant on a connected neighborhood.
In Lagrangian mechanics, the energy balance for an autonomous Lagrangian uses . For the stationary vector potential the velocity-linear magnetic term cancels in this expression, leaving kinetic energy. In cylindrical coordinates,
Time independence and the cyclic angular coordinate give two constants:
The three Euler-Lagrange equations are
The supplied angular velocity is . Set , and use this constant angular velocity. The radial right-hand side is , the angular momentum is constant, and the vertical equation vanishes when . These equations and the initial data therefore give
For nonzero radius and charge this is the requested circular orbit.
The Hubble time is the instantaneous inverse expansion rate , where . A radial light ray covers comoving distance . Since , the present proper radius of the particle horizon is
For the power-law scale factor, requires . The integral converges only when , in which case
At the divergence is logarithmic, and at it is a power divergence. The familiar flat-universe epochs have for radiation and for pressureless matter, obtained from or and the Friedmann equation. Both have , so their ages are less than the present Hubble time. These power laws describe idealized single-component epochs rather than the full late-time expansion history.
Inversion in a circle of center and radius is on the extended plane. It sends infinity to , so it interchanges zero and infinity exactly when .
For the unit-circle inversion , both and are involutions. If , applying gives . Writing , we have and , and therefore . This proves both assertions about the fixed points.
We now show that one fixed point is inside the disk and use it as the hyperbolic center. Rotate coordinates to make the Euclidean center . The hypothesis is . If the conclusion follows immediately from the radial hyperbolic distance. If , then
for its fixed points. Since , this quadratic has two positive roots with product one, one and the other .
The disk automorphism is a Poincare disc automorphism. It sends the two fixed points to zero and infinity and commutes with on the extended plane. Consequently interchanges zero and infinity. Conjugation takes circle inversion to inversion in the image circle, so the first part says that is centered at zero. Its Euclidean radius is some .
In the Poincaré disk metric, integrating the radial length element gives
Since preserves distance, the original circle is exactly
Undoing the preliminary rotation gives the center for arbitrary complex .
This identifies the hyperbolic circle in the Poincare disc intrinsically.
A binary symmetric channel flips each transmitted bit independently with probability . A length- channel code specifies input words and a decoding rule; its rate is , and its error probability is the probability of a wrongly decoded message. The channel capacity is the supremum of asymptotically achievable rates with vanishing error. For , put , with . The Shannon second coding theorem here states
We prove achievability and the converse rather than using the formula as a substitute for a coding argument. Output complementation reduces to , so first assume .
Fix . Choose such that and . Independently choose uniformly random input words. Decode a received word to the unique codeword within Hamming distance , declaring error if there is none or more than one. The weak law of large numbers says the empirical fraction of independent Bernoulli- errors tends in probability to , so exceeding this distance has probability tending to zero.
For any independently chosen competing codeword, its probability of lying in this ball is , where
Indeed follows by bounding the probability of exactly successes in a binomial experiment with parameter by one, and increases on . A union bound therefore bounds the ensemble-average decoding error by
Some deterministic code is at least as good as this average. Expurgating the half of messages with greatest individual error makes the maximum message error at most twice the original average, and changes the rate by at most . This proves achievability even for maximum-error probability.
For the converse, take uniform messages and any deterministic code/decoder. The independent noise word has probability . Its normalized negative log-probability tends in probability to by the same law. Thus, outside an event of probability tending to zero, each noise word has probability at most . The decoder's disjoint decision regions contain at most received words in total. Hence
At rates bounded above capacity by a positive amount, choose smaller and obtain success probability tending to zero. This establishes the strong converse as well as the ordinary impossibility of reliable transmission above .
When the output is independent of the input, so success probability for uniform messages is at most and . At or the channel is noiseless or deterministically inverted; all words can be distinguished, so . These endpoints complete the theorem.
Let denote the maximized log-likelihood in the saturated model, with one fitted mean per observation. With known dispersion, define the deviance of a fitted model as ; for an exponential-dispersion convention that scales deviance by the dispersion , divide that scaled quantity by in the following test.
Let be the fitted deviances under the null and full models. Their difference is the likelihood-ratio test statistic
Under the regular identifiable interior null hypothesis, Wilks theorem gives the limiting distribution. Reject for an observed difference above its chosen upper-tail critical value. This concerns the difference of fitted model deviances, not simply the full-model deviance compared with zero.
For a Poisson regression, the means are and . Saturation sets , taking the limiting value at . Consequently the Poisson deviance is
with . The intercept score implies at a finite fit, although retaining that term makes the individual deviance contributions clear.
For with small, expand . The linear term cancels and the result is . Therefore
the Pearson chi-squared statistic. The approximation requires adequately large fitted counts and small relative residuals; it is not an identity for sparse observations.
Set and . Differentiation gives , while
The two sides are equal precisely by the stated advection-diffusion equation. This supplies its divergence form in the plane.
Rapid decay allows two integrations by parts in the half-line Fourier transform. They give
Solving this scalar inhomogeneous equation by an integrating factor yields
The initial transform is holomorphic for and continuous on the real axis under the given decay. The time integrals are entire functions of for fixed and smooth boundary data.
For , . The upper contour is therefore the graph
oriented from left to right. Between the real axis and , and . Hence is bounded by for . The boundary transforms are entire in ; with the standard smooth, compatible boundary data, integration by parts in the time integral gives the required polynomial bounds. Closing the intervening sectors and using exponential decay for deforms their real-line integrals onto . Small endpoint truncations, followed by dominated limits, handle the sector boundaries.
For , and on . Thus the already valid transformed equation at says
It eliminates the unknown boundary derivative through
Write and retain the left-to-right orientation of . Substituting the previous relation into the deformed inverse Fourier transform gives the data-only representation
The formally remaining integral is . Above , its reflected argument lies strictly in the lower half-plane, where the transform is analytic. At large radius, approaches the rays of angles and . Close it by the upper arc between these rays. Along that arc is bounded below by a positive multiple of its radius, whereas the reflected transform is bounded by . Thus the arc integral is bounded by a constant times and tends to zero for . There are no enclosed singularities, so Cauchy integral theorem proves
This is the needed closure argument; it does not assume the unknown transform vanishes. The representation holds for smooth decaying compatible data, and extends to weaker data by the usual limiting heat-kernel interpretation.
Let the stellar radius be and assume zero external surface pressure. A spherical shell has mass and contributes to the gravitational potential energy. Using hydrostatic pressure support,
The center boundary term vanishes and eliminates the outer term. Nonzero external pressure would add .
The total energy is , so energetic gravitational binding requires . For an isotropic gas, kinetic theory gives . Nonrelativistic kinetic energy is , giving and . Ultrarelativistic energy is , giving and : the ultrarelativistic limit is marginal in this Newtonian virial balance.
For a white dwarf, electron degeneracy pressure becomes ultrarelativistic as density increases. Its equation of state then scales as . Pressure support and gravitational stress have the same radius scaling, leaving a limiting mass of order rather than allowing arbitrary mass to be supported by contraction. The Chandrasekhar limit is this maximum mass for a cold electron-degenerate star at specified composition, of order .
The virial calculation by itself does not establish a universal numerical maximum mass for every stellar composition and equation of state; its precise consequence is loss of binding/support as the pressure-bearing particles become ultrarelativistic. An accreting carbon-oxygen white dwarf approaching its limiting mass typically undergoes runaway carbon burning and thermonuclear disruption, a Type Ia supernova. For other compositions or evolution, electron captures can instead lead to collapse into a neutron star. The subsequent evolution needs that physical distinction.
Work with well-ordered cardinals, as usual with the axiom of choice. We first prove the infinite cardinal arithmetic identity . If a least infinite counterexample existed, order pairs of ordinals below first by their maximum coordinate, then lexicographically within each level. Every initial segment ending at lies inside . Its cardinal is less than , by the smaller-cardinal identity or finite counting. This well-order cannot have an element with predecessors, so its order type is at most the initial ordinal . Thus , contrary to its being a counterexample; the reverse injection is . Hence
A sum of finitely many finite cardinals is finite, so is regular. A sum of fewer than smaller cardinals is a countable union of countable sets and has size at most , so is regular.
Likewise fewer than summands means at most summands, each of size at most . Their sum is at most . Thus is regular. In contrast,
is a countable sum of smaller cardinals, with . Therefore is singular, of cofinality .
The diagonal diagonal Ramsey number is the least such that every red-blue edge coloring of contains a monochromatic . More generally let require a red or blue . The base cases are . Given vertices, select one vertex. Either it has at least red neighbors or at least blue neighbors. Applying the corresponding smaller problem and, when needed, adjoining that selected vertex gives
Induction and Pascal's identity now prove existence and
A graph with vertices is a subgraph of . A monochromatic therefore contains a monochromatic copy of ; the copy need not be induced. Thus the preceding finite Ramsey theorem gives
At any vertex of there are incident edges. The pigeonhole principle ensures at least of one color. Those edges and their other endpoints form a monochromatic star , regardless of the colors between the endpoints. Hence .
For odd , place vertices cyclically. Color red the edges of cyclic differences , and blue every other edge. Each red degree is , and each blue degree is also . There is no monochromatic . For the same lower bound is the single-vertex graph. Together with the previous upper bound, this proves
For even , suppose had no monochromatic star with leaves. Both color degrees would be at most and their sum is , so both must equal . The red graph would have odd degree at every one of an odd number of vertices, contradicting the handshaking lemma. Thus vertices suffice.
On vertices, split the vertices into two sets of size , coloring inside each set red and across the sets blue. Red degrees are and blue degrees are , so this avoids the star. Therefore
Take
It is a nonzero polynomial, but every element of the finite field satisfies . Thus it vanishes on every point of . Formal nonzero polynomials and nonzero polynomial functions need not coincide over a finite field.
First make the irreducible polynomial monic; for a nonmonic polynomial restore its leading coefficient in front of the product below. If is one root, has degree and cardinality . Thus every element satisfies . The Frobenius automorphism fixes and permutes the roots. If the orbit of had size , its orbit product would be a degree- polynomial fixed by Frobenius, hence with coefficients in , contradicting irreducibility. Therefore
The roots are distinct, since has derivative . They all lie in and include its generator , so the splitting field is . Frobenius has order there; a degree- extension has at most automorphisms, so
For , the reduction of the cyclotomic polynomial has precisely the primitive th roots as its roots. If , the residue class of has multiplicative order in , so Lagrange's theorem gives . Conversely, if , cyclicity of the multiplicative group supplies an element of order , which is a root of ; any integer representative supplies . Hence
Three explicit examples are with ; with ; and with . Each prime is coprime to the relevant and has the stated congruence.
For a representation of , its inflation of a group representation to is , with character . Inflation preserves irreducibility because the invariant subspaces do not change.
For irreducible complex characters , the row character orthogonality are
The column relations are for nonconjugate , and when are conjugate. Class sizes convert the row sum into its usual weighted character-table form.
Directly tracking the supplied permutations gives
Thus every group element reduces to or , . These are twelve distinct elements: has order six, while is not a power of because it exchanges the two six-element supports that every power of preserves. Therefore . This is the dicyclic group with parameter three; the calculations give its order-twelve dicyclic character table.
Conjugation by inverts powers of , while conjugation by changes the exponent in by two modulo six. Conjugation by preserves that exponent's parity. The complete conjugacy classes are
Their sizes are .
The normal subgroup has order three. The quotient is cyclic of order four, generated by , since . Inflating its characters gives , , for . These are all the linear characters: in any one-dimensional representation, the relation forces the image of to have square one, so is in the kernel.
In the displayed class order, the full character table is
To construct the last two rows, put and, for , set
The matrices obey all three relations. The distinct eigenlines of are exchanged by , so the representation is irreducible. Its traces on are and on are zero, producing the rows above. Their weighted inner products are orthonormal, and the degree-square sum proves completeness.
Use the final printed restriction that is even. Square-freeness then gives , and the integer ring is . An integer solution has . If were even, would have 2-adic valuation one, impossible for a cube; hence are odd. For an odd prime , would similarly give valuation one. Thus .
The ideals generated by and are coprime. Any common prime ideal divides their sum and difference and therefore lies above a rational prime dividing and . The odd possibilities have just been excluded; above two, is zero modulo the ramified prime while is odd, so neither factor is divisible by it. Unique factorization of ideals in a number field in
now yields . Since the class number is coprime to three, the ideal class of is trivial. The ideal is principal, and the only units for this imaginary quadratic field with are , which can be absorbed into a cube. Hence
Comparing coefficients of gives
Thus with , or with . Both alternatives cannot occur, since and cannot both be divisible by three. The eligible alternative permits at most the two choices , and then
Consequently there are at most two integer solutions , which, when present, have the same and opposite . The proof uses the evenness assumption; it does not silently claim the same coprimality argument for every odd .
The path lifting theorem says that a path has a unique lift through a covering map once its initial point in the fiber is chosen. The homotopy lifting lemma says that a homotopy , with a continuous lift specified at time zero, has a unique continuous lifted homotopy. In particular a homotopy of paths with fixed endpoints preserves the endpoint of a chosen lift, since that endpoint varies continuously in a discrete fiber.
Choose and . For , choose a path in from to , and let be the endpoint of the lift of to starting at . Two choices of are homotopic relative endpoints because is simply connected. Project that homotopy and apply homotopy lifting: the lifted endpoint remains fixed. Thus is well-defined and .
To prove continuity without invoking covering-space classification, choose a path-connected open neighborhood of evenly covered by both maps. Local path connectedness of permits this choice. On the sheet of containing , append paths within that sheet to the chosen path to . Path-lift uniqueness gives
there, for the sheet containing . Hence is a local homeomorphism and is continuous. Construct in the same way with the basepoints reversed. Lifting the very same projected paths proves and fix every point. Therefore
The Banach-Steinhaus theorem, or Uniform boundedness principle, states that for a family of bounded linear operators from a Banach space to a normed space , pointwise boundedness for every implies .
For its proof let . These are closed and their union is . The Baire category theorem gives an with nonempty interior, containing a ball . For , both and belong to , so for every . Scaling and taking a limit at the ball boundary gives , proving the theorem. The target need not be complete.
For the asserted bounded-set criterion, use the Banach space , which is complete even if is not. Each defines the bounded linear evaluation functional on . The given hypothesis says this family is pointwise bounded. The Hahn-Banach theorem consequence in the question gives , and uniform boundedness yields
This proves that weak boundedness implies norm boundedness; the two forms of boundedness coincide for a subset of a normed space.
Finally suppose the two continuous duals for and were equal as sets. The unit ball for norm two is bounded under every common continuous functional, using its norm-two continuity. Applying the preceding criterion in norm one bounds that ball in norm one; scaling gives . Reversing the roles gives . The norms would be equivalent. Contrapositively, inequivalent norms have different continuous duals, supplying a linear functional continuous for one and discontinuous for the other.
Put and . At , the first column has and , whereas the third has . Expanding the determinant, the coefficient multiplying is , so the apparent cubic pole reduces to order at most two. The only other possible pole is at , and gives the same bound there. Thus, if is nonconstant, its total pole order and valency are at most four. A constant case is handled by finding a zero below.
Column coincidences give zeros at , at , and at the four solutions of on . The latter are distinct because has four elements. If , the first two points are distinct from each other and from these four solutions.
One exceptional pole issue needs care: when , the first two prospective zeros are and , the possible pole locations. They are actually removable zeros. Here , and, with , evenness about this half-period gives
The determinant becomes . Its two contributions cancel and it is ; reflection transfers this conclusion to . Thus there really are six distinct zeros also in this case.
If but , then is one of the four solutions of . All three columns coincide there, with no pole. Both the determinant and its first derivative vanish, since each term in the derivative still has two identical columns. Hence there are four distinct zeros, at least one multiple, giving at least five zeros counted with multiplicity.
For a nonconstant elliptic function, zeros and poles in a period parallelogram have equal total multiplicity, by the argument principle. Either count contradicts total pole order at most four. A constant with a zero is zero, so
This is the elliptic collinearity determinant. Consequently, when , the three vectors have zero determinant. The three points on the Weierstrass equation of an elliptic curve are therefore collinear in .
The parametrization maps to the cusp. Off the origin its inverse is , since and on with . This is an isomorphism between dense open subsets, so the cusp is birational to .
At the origin the differential of the defining polynomial is zero, giving a two-dimensional Zariski tangent space. The tangent space of at every point is one-dimensional. An isomorphism induces tangent-space isomorphisms, so the cusp is not isomorphic to . The rational inverse cannot extend regularly through the singular point.
For an irreducible affine variety, its dimension is the minimum of its Zariski tangent space dimensions:
The minimum is attained on the smooth locus. Equivalently is the dual of , or the simultaneous kernel of the differentials of the defining equations at . If “variety” permits reducible sets, apply this definition to each irreducible component and take the maximum; taking the minimum over an arbitrary reducible set with components of unequal dimension would be incorrect.
The ideal is prime, since an irreducible element of the polynomial ring is prime. By the Hilbert Nullstellensatz, it is the full vanishing ideal of . Its Zariski tangent space at a point is therefore the kernel of the single linear form , and has dimension or .
At least one partial derivative is nonzero. In characteristic zero this is immediate for a nonconstant polynomial. In characteristic , if all partial derivatives vanished, all exponents would be multiples of . Since an algebraically closed field is perfect, would be a th power of a nonconstant polynomial, contradicting irreducibility.
The nonzero cannot vanish everywhere on : the Nullstellensatz would give , hence , contradicting . Thus some point has , and the minimum tangent-space dimension is
A smooth -dimensional manifold with boundary has charts onto relatively open subsets of the half-space , with smooth transition maps extending smoothly locally across the boundary. A point is a boundary point when its last coordinate in such a chart is zero; this condition is independent of chart. One way to see the independence is that a local diffeomorphism between half-spaces preserves their interior and hence their topological boundary.
Restrict each boundary chart to and drop the last coordinate. It maps the boundary onto an open subset of , and the restricted transitions are smooth diffeomorphisms. These charts, with the inherited Hausdorff and countability properties, make a smooth manifold without boundary. Therefore
Subtract the sphere equation from the last equality to obtain . Thus the equality locus is the disjoint union of two spheres
each a smooth two-dimensional manifold. The two equality gradients are independent there: and at least one of is nonzero.
On this locus the inequality becomes , or
Since , this cuts out two closed caps on each sphere. At the cap boundary, , so the restricted differential of is nonzero. The regular level set theorem for a sublevel set therefore gives a manifold with boundary. Explicitly it consists of four disks, with four boundary circles, and
All three assertions are false. For the transversality assertion, use , , and . At the preimage point the derivative is zero, so is not transverse to , yet is a codimension-one submanifold. Transversality is sufficient, not necessary.
For openness of regular values, the smooth function gives a connected-domain counterexample. Every zero has and derivative , so zero is a regular value. Critical points solve . Choose any such point ; its value is nonzero, since simultaneous vanishing would force and . The critical points have nonzero critical values . Thus no neighborhood of the regular value zero consists entirely of regular values. Properness would supply the missing compactness needed for the usual open-regular-value conclusion.
For the measure assertion, a constant map has every point critical. Its critical-point set has positive, indeed infinite, measure. Sard theorem concerns the measure of the set of critical values in the target, not the measure of critical points in the domain.
A ring of sets is closed under finite unions and differences. A premeasure on it is a nonnegative set function with value zero on the empty set that is countably additive whenever a disjoint union remains in the ring. Caratheodory extension theorem extends a premeasure to a measure on the generated sigma-algebra; this extension is unique there when the premeasure is sigma-finite. It is obtained from the outer measure
whose measurable sets satisfy for every . The resulting complete measurable sigma-algebra contains the sigma-algebra generated by the ring.
For the required continuity, let in the bounded-interval ring and fix . From each component of , remove a sufficiently short initial piece and retain the compact interval . The union is a compact set , and is covered by a ring set of total length less than ; one can take unions of . We do not incorrectly assume the compact sets themselves belong to the half-open interval ring.
Since and is compact, the finite intersection property supplies with . For , membership in all earlier means some failure of membership in puts in . Thus
Finite additivity gives the finite subadditivity used here. Monotonicity now proves .
If a disjoint union lies in the ring, its remainders decrease to the empty set. The proved continuity and finite additivity imply countable additivity, so the length function is a premeasure. The ring generates the Borel sigma-algebra and covers the line by bounded intervals of finite measure. Its unique sigma-finite extension is Borel length measure; its completion is Lebesgue measure.
An equilibrium distribution of a continuous-time Markov chain is a probability row vector invariant under the transition semigroup: for every . Differentiating gives , or for each , when the generator sums are defined. Reducible chains may have several closed classes supporting different equilibrium distributions; convex mixtures are then also equilibria. Irreducibility and positive recurrence give uniqueness for a conservative nonexplosive chain.
For an irreducible, nonexplosive, positive recurrent continuous-time Markov chain on a countable state space, there is a unique equilibrium distribution and
In particular every finite irreducible chain has this convergence. Continuous time removes the discrete-time periodicity obstruction. Reducible finite chains instead converge according to absorption probabilities into their closed classes.
Articles were limited to the first 100 out of 553 total.

Articles by others on the same topic (0)

There are currently no matching articles.