For a Dollar investor, the Euro bank account has Dollar value . After Dollar discounting, it is . Its conditional mean growth exponent is , so the martingale requirement gives
With equal rates, is a martingale under by part (a), whereas has positive drift and is not a martingale when . In the degenerate zero-volatility case, both exchange rates are constant and both are martingales; the asserted nonmartingale conclusion implicitly requires a genuinely risky exchange rate.
The Dollar bank account is a tradable asset whose Euro value is . Under the Euro equivalent martingale measure, discount this value by . The result is a martingale precisely when , giving
When the rates coincide, and part (a) proves that the exchange rate itself is a martingale under .
The independent Gaussian increments of Brownian motion give ; the exponential is integrable at every finite time. Therefore
Similarly , so . This uses actual conditional expectations, not only the local stochastic differential equation.
Combining the eigenvalue cases gives
This agrees with the interior drift: the switching phase spends proportions and in and , giving level drift . The harmonic calculation establishes recurrence even at the zero-drift boundary, rather than inferring it from drift alone.
Here is equivalent to , which gives from its explicit formula. Any nonnegative solution is of the form
since its second component at level zero must be one. Letting forces for nonnegativity. The choice is nonnegative, and subtracting it from any other such solution gives . Therefore minimality selects
In particular the return probability after leaving is , so the irreducible chain is transient. These formulas are the hitting probabilities for a velocity-switching Markov ladder.
If , the general level solution is a constant multiple of plus a multiple of . Boundedness of probabilities removes the growing component, and then fixes the constant to one. If , the nonzero Jordan part produces linear growth unless the initial vector lies in the one-dimensional eigenspace; the same conclusion follows. Thus
Starting at , the chain leaves to and returns with probability one. An irreducible chain with a recurrent state has all states recurrent, so the chain is recurrent in both cases.
Since one eigenvalue is one, the other is the determinant. Direct calculation gives
Indeed the first row requires , and the second row then follows from the characteristic equation. At , and the eigenvectors coincide; the nonidentity matrix has a repeated eigenvalue and a Jordan block.
Condition on the first jump, putting . The hitting probabilities obey
The relevant characterization is that a hitting probability is the minimal nonnegative harmonic extension of its target-boundary value. Thus among nonnegative solutions of these equations with , choose the componentwise least one. Other harmonic solutions need not be probabilities. This also identifies the solution without imposing an unjustified boundary condition at infinity.
The arrows in the PDF give at rate , at rate for , and switches and at rates and . All rates are positive. One can travel upwards in level in the phase and downwards in the phase, switching at either end. Hence any state reaches any other through a finite positive-rate path: the continuous-time Markov chain is irreducible. Its total jump rates are uniformly bounded, so it is also nonexplosive.
Let be the center of the containing disk and take arclength around the closed curve. The periodic function has a maximum. At a maximum ,
By the Cauchy-Schwarz inequality and the containing radius, . Therefore
Closedness provides an interior maximum on the periodic parameter domain. Without it, the straight segment for lies in the disk but has signed curvature identically zero, giving the required counterexample.
The planar planar isoperimetric inequality is , with equality exactly for a disk. For one boundary component of length , take its unit-speed periodic parametrization and subtract its mean position. Green's area formula and the Cauchy-Schwarz inequality give
Apply the periodic Wirtinger inequality to each mean-zero coordinate: . Since unit speed gives the final integral , it follows that . For several boundary components, orient each with the domain on its left. Green's formula, followed by the triangle inequality, gives
This proves the stated inequality, including disconnected domains or holes. Equality permits only one component; equality in the two integral inequalities makes its coordinates first sine-cosine harmonics with the corresponding orthogonal rotation relation. Unit speed then makes the curve a circle, so its domain is a disk. Conversely disks attain equality.
Parametrize the regular curve by arclength . Its unit tangent is , and its curvature is . Where , define the principal normal and binormal . The torsion of a space curve is . Orthonormality and differentiation give the Frenet-Serret formulas
For a general parameter, and . The normal and torsion formulas require nonzero curvature; at zero-curvature points this particular Frenet frame need not be defined.
Units have norm . Norm is impossible modulo three. The least positive unit greater than one is
Indeed its norm is one. A smaller positive norm-one unit would have , forcing , but then . Multiplying an arbitrary positive unit by powers of reduces it to , so minimality proves that all units are .
The equation with right side is impossible modulo three, since it would require . For norm , let , so and . For unit reduction for quadratic norm equations, change the sign of if necessary to make it positive, then multiply by a power of the fundamental unit to place it in . Its conjugate is divided by itself, so
The maximum on this interval occurs at its endpoints. Thus , and ; only lies in the half-open interval. Reversing the reduction gives all solutions:
Every displayed element has norm , and the reduction proves completeness, including both signs of and .
Put . Since , the ring of integers is and its field discriminant is . All three primes ramify:
For example and both ideals have norm , proving equality. The Minkowski bound for ideal classes is . Thus the ideal class group is generated by the classes of these prime ideals; an ideal of norm four contributes only the already principal .
The elements and have norms and . Their ideal factorizations give and . This also explains the printed hint: , a fraction, not the integer . Therefore and , leaving at most two ideal classes. The class of is nontrivial: a principal generator would have norm , but would require or , impossible. Hence
A primitive sixth root of unity satisfies
which is irreducible over because its discriminant is . For the other polynomial choose , so and . Then , so this field already contains all six roots. The Eisenstein criterion at proves irreducible, giving a splitting field of degree six.
Put and . The first automorphism fixes and has order three. The second sends to its negative, so sends to ; hence and . These six distinct transformations exhaust the Galois group. Therefore
The presence of sixth roots of unity inside the splitting field is why this particular binomial has degree six rather than a generic twelve-degree splitting field.
An automorphism of fixing fixes . Because is a normal extension, it preserves , so restriction gives a homomorphism
Its kernel fixes both and , hence every element of their compositum. Therefore restriction is injective, proving the asserted subgroup identification. Normality is the key reason the restriction maps into automorphisms of rather than just embeddings into a larger field.
If , the splitting field is and its Galois group is trivial, hence cyclic. Otherwise choose with . The roots are , so the splitting field is because . The roots are distinct since the characteristic does not divide , making this a Galois extension. Each automorphism satisfies with . Because that root-of-unity group is fixed by all automorphisms, . Thus is an injective homomorphism into a cyclic group. The splitting-field Galois group is cyclic, of order dividing .
The intended closed-term witness property for quantifier-free existential sentences needs at least one closed term. Under this hypothesis, suppose the set were consistent. By the Godel completeness theorem, it has a model . Take the substructure whose elements are the interpretations of closed terms. It is nonempty and closed under every function symbol. Atomic formulas and their negations have the same truth values in as in , and induction extends this to every quantifier-free formula.
The provable sentence is true in by soundness. Its witness is for some closed term , so , contradicting . Hence is inconsistent. The compactness theorem gives a finite inconsistent subset, so completeness and classical propositional reasoning yield
Without a constant or nullary function, the printed assertion is false as written: in the equality-only language there are no closed terms, but is provable. Then is empty and consistent. One may repair the usual theorem by assuming a nonempty set of closed terms or adjoining a fresh constant; the latter proves a witness disjunction in the enlarged language, not the missing closed terms in the original one.
For each , let assert the existence of distinct elements. If a theory has arbitrarily large finite models, every finite subset of has a model. By the compactness theorem, this extended theory has a model, necessarily infinite. Since fields of size are arbitrarily large, no first-order theory can have exactly the finite fields of characteristic two as its models.
Suppose instead a finite conjunction axiomatized exactly the infinite fields of characteristic two. Let be the field axioms with . Then would have exactly the finite characteristic-two fields as models, contradicting the preceding conclusion. Equivalently, compactness of would force some finite size threshold, but arbitrarily large finite fields still fail . The infinite characteristic-two fields are not finitely axiomatizable.
The Godel completeness theorem for first-order logic states that implies ; together with soundness, semantic consequence and derivability coincide. Equivalently, every syntactically consistent first-order theory has a model. The compactness theorem states that a set of first-order sentences has a model if and only if every finite subset has a model. These statements use nonempty first-order structures.

There are unlisted articles, also show them or only show them.