The first condition is that is Markov with transition semigroup
. The second is that, for every function
,
is a martingale.
The first condition implies the second by conditioning over a short time interval, using
, summing increments, and passing to the limit. This is Dynkin's formula.
Conversely assume the martingale problem for a continuous-time Markov chain. Fix and a function , and put
The backward equation gives . Applying the martingale identity to this time-dependent function shows that is a martingale. Therefore, for ,
Taking indicator functions proves both the Markov property and the transition semigroup .
Since , the functions
are nonnegative and increase to . The monotone convergence theorem gives
. Because is integrable, adding the finite number
yields
Integrability of is essential. On with Lebesgue measure, let
Then pointwise, but every integral is , so
does not increase to .
The monotone convergence theorem states that if
pointwise, then
allowing the value .
Monotonicity of the integral shows that the increasing limit of the left side is at most . Conversely, let be a nonnegative simple function with , and fix . The sets
increase to the support of . Hence
Let and take the supremum over all simple . This gives
, proving equality.
Lift to a doubly periodic meromorphic function on . Integrate it around a fundamental parallelogram whose boundary avoids all poles. Integrals over opposite edges cancel by periodicity, while the residue theorem gives
Thus the principal-part map from part (b) takes values in the codimension-one hyperplane on which the sum of residue coefficients is zero. The Mittag--Leffler existence criterion on a compact Riemann surface says that prescribed principal parts occur precisely when their residues pair trivially with every holomorphic one-form. On a complex torus the holomorphic one-forms are the scalar multiples of , so the single condition is exactly the displayed residue sum. Hence the image has dimension
, and the kernel of constants has dimension one. For ,
Equivalently, this is the genus-one case of the Riemann-Roch theorem for a positive divisor.
Choose a local coordinate at each and map to all coefficients of the negative-power terms in its Laurent expansions:
The kernel consists of globally holomorphic functions on the compact Riemann surface . By the maximum modulus principle, every such function is constant, so the kernel has dimension one. Rank--nullity gives
For , this simply says .
The sum of two meromorphic functions has no poles away from the union of their pole sets, and at each its pole order is at most the larger of the two orders, hence at most . Scalar multiplication cannot increase a pole order. The zero function belongs to the set, so is a complex vector space.
For , Cauchy-Schwarz inequality gives
Thus every is bounded and
. The truncations
have finite rank and satisfy
Hence every such Hilbert-Schmidt operator is compact.
Define
This is an inner product inducing . If is Cauchy in this norm, then each converges to some , and the usual Fatou/tail argument gives
and
. Defining
produces a bounded operator by the preceding estimate and gives
in . Thus is a Hilbert space.
The norms are not equivalent in infinite dimension. The rank- orthogonal projection has
Although , no uniform reverse inequality can hold.
If is compact and does not tend to zero, some subsequence has
. The vectors
are pairwise separated by at least , so they have no convergent subsequence, a contradiction.
Conversely, if , define the finite-rank operator
Then
An operator-norm limit of compact operators is compact, so is compact.
Let be a Cauchy sequence in the operator norm. For each ,
so is a Cauchy sequence. Completeness of the Banach space permits the definition
. Pointwise passage to the limit proves that is a linear. A norm-Cauchy sequence is a bounded sequence, say , and therefore
, so is bounded. Finally, letting in
gives
. Thus in operator norm and
is Banach.
The Dedekind factorization theorem says that, when a rational prime does not divide the index of an order , a factorization
of the minimal polynomial modulo gives
Let with square-free , and let be odd. The resulting splitting of rational primes in a quadratic field is:
Finally suppose and
has norm , with integers
chosen coprime. Then
If an odd ramified, then . Reduction modulo gives
. Since is not a square modulo such a prime, . Dividing the equation's divisibility shows as well (use that square-free has -adic valuation one), contradicting coprimality. Hence no prime ramifies.
Distinct prime-power ideals are pairwise comaximal. For comaximal ideals, product equals intersection, so induction gives
The Chinese remainder theorem therefore gives the ring isomorphism
The ideal approximation theorem, proved by applying this Chinese-remainder map one prime power deeper, supplies
Equivalently, at every prime dividing .
Since , the fractional ideal
is an integral ideal and is a principal ideal. At every ,
, so .
Choose and with . Then
. For any ,
Thus
so every ideal of has a generating set of two elements.
An element is separable over when its minimal polynomial has distinct roots in a splitting field. A polynomial has a repeated root exactly when it has a common root with its formal derivative. Hence
implies that has no repeated root and is separable.
Let be the minimal polynomial of . Repeatedly factor through the Frobenius until
where . Irreducibility of makes irreducible, and
has separable minimal polynomial . Put
Then is separable and
Every is a polynomial in of degree below . The freshman's-dream identity gives
so is purely inseparable.
Finally, any intermediate field satisfying the stated conditions consists of elements separable over , so it lies in the maximal separable subextension just constructed. Conversely, the condition that all relevant th powers lie in that field puts , and hence , inside it. The two inclusions prove uniqueness.
If the minimal polynomial of has degree , then
has elements and is an intermediate field of
. The tower law for field extensions gives
so .
The multiplicative group of a finite field is cyclic. Choose a generator
of , of order . If lay in a proper intermediate field of degree , its order would divide , a contradiction. Thus
and its minimal polynomial has degree .
For arbitrary , let be the splitting field of
over . Its roots form a field: the Frobenius endomorphism shows they are closed under addition, subtraction, multiplication, and inversion. The derivative is , so there are exactly distinct roots. Thus this root field has order . Applying the preceding generator argument supplies an element whose minimal polynomial over has degree , proving that an irreducible polynomial of every positive degree exists.
Form the graph whose vertices are the points , joining two when their Euclidean distance is one. Two distinct points have at most two common unit-distance neighbours, because two unit circles intersect in at most two points. The graph is therefore -free. Part (c) bounds its unordered edges by , so the number of ordered unit-distance pairs is at most
If contains no , every pair of vertices has at most two common neighbours. Double-counting a vertex together with an unordered pair of its neighbours gives
Consequently
By Cauchy--Schwarz,
This quadratic inequality implies for an absolute constant ; for example works for every . Thus
Let be the number of triangles. Each edge has at least
common neighbours, and summing common-neighbour counts over edges counts every triangle three times. Hence
If , this is greater than
. Therefore
so one may take .
The extremal number is the maximum number of edges in an -vertex graph containing no subgraph isomorphic to .
Let be triangle-free with edges. For every edge , the neighbourhoods of and are disjoint apart from their endpoints, so
. Summing over edges and applying Cauchy-Schwarz inequality gives
while
Thus , proving the required Mantel theorem bound.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact