The height of a prime ideal is the supremum of the lengths of strict chains of prime ideals ending at :
The last equality follows from the prime ideal correspondence for localization. Here is a length-growth proof of the Krull height theorem that makes the bound explicit.
We first establish a prime-chain lower bound for local length. For a Noetherian local ring admitting a prime chain of length , put . Then
for some . For , use . For , quotient by the first prime ideal of the chain; this only decreases and reduces us to a local integral domain with
Take and put . It has a prime chain of length , so induction bounds below by a positive multiple of .
The Artin-Rees lemma applied to gives, for a fixed integer ,
Because is a non-zero-divisor, the first term in the exact sequence
has length at least . Hence
Iterate this inequality about times, while its arguments remain at least . This gives the desired positive multiple of . The particular Artin-Rees lemma inclusion used here follows directly from finite generation: the Rees algebra is Noetherian, by the Hilbert basis theorem, and its graded submodule has finitely many homogeneous generators. A bound on their degrees gives .
Now localize at the given minimal prime ideal . Write , , and . The only prime ideal of containing is , so . Since is finitely generated, some . Thus has finite module length, say . The ideal is generated by at most elements.
For , products of these generators give a surjection from copies of onto . Summing the lengths gives the generator bound for primary-ideal length
Since , we have , and therefore
The prime-chain lower bound for local length now excludes any chain of length greater than . Consequently
For , minimality over the zero ideal says that is a minimal prime ideal, so its height is zero. This also handles that boundary case.
A Noetherian ring is a ring whose ideals satisfy the ascending chain condition; equivalently every ideal is finitely generated. For the surjective ring endomorphism, put . The ascending chain of ideals stabilizes, say . If , surjectivity of gives with . Then , so and . The endomorphism is therefore injective, hence a ring automorphism.
The nilradical is the ideal
For example, if , the binomial expansion gives ; multiplication by any ring element also preserves nilpotence. Every prime ideal contains each nilpotent element, since implies . Conversely, if is not nilpotent, the multiplicative subset avoids . By Zorn's lemma, choose an ideal maximal among those disjoint from this subset. It is a prime ideal: if but neither factor is in , then and both meet the subset, and multiplying their two witnesses puts a power of in , a contradiction. This prime ideal excludes . Hence
For the zero ring the empty intersection is the whole ring, as required.
Here is a finite prime-intersection representation of a radical argument that does not assume the result. In a Noetherian ring, suppose some ideal has ideal radical not expressible as a finite intersection of prime ideals, and choose such a maximal by the ascending chain condition. It is proper and cannot be prime. Choose with . The two larger ideals and have finite prime-intersection radicals, and
Indeed, if and , then . This contradicts the choice of . Applying the result to proves that is the intersection of finitely many prime ideals. Empty intersections handle the unit ideal.
For reducedness of a formal power series ring, the inclusion of constants gives one implication: a nonzero nilpotent element of remains nonzero and nilpotent in . For the other, let be a reduced ring and take a nonzero formal power series with . The coefficient of in is , because is reduced. Thus is not nilpotent. Therefore
No Noetherian ring hypothesis is needed for this argument.
For a nilradical that is not nilpotent, take
Every element of this ideal uses finitely many variables and is nilpotent: an element using variables lies in an ideal whose st power is zero. The quotient by this ideal is the field , so it is exactly the nilradical. Nevertheless for every , because the square-free monomials form a vector space basis. Thus for all .
Write for the infinite subsets of an infinite . A Ramsey set of infinite subsets has an infinite homogeneous set : either or . The proof below actually supplies homogeneous refinements within every infinite reservoir, and with any fixed initial finite stem; this stronger property is that of a completely Ramsey set.
For a non-Ramsey example, identify two infinite sets when their symmetric difference is finite, and choose one representative for each equivalence class. Define a two-colouring by
where is the representative of 's class. Removing one point changes this parity. Thus, for every infinite , the two subsets and have opposite colours. The zero-colour family meets every and so does its complement. Hence the zero-colour family is not Ramsey. This finite-symmetric-difference parity colouring uses a choice of representatives; no definability or regularity is being claimed for that first example.
To prove the open-set assertion, for a finite increasing set and an infinite tail above define
The star topology, or Ellentuck topology, has these sets as basic open sets. For an empty stem there is no lower-bound restriction. More generally always uses only the points of above . The ordinary topology on infinite subsets, denoted , has cylinders as a basis. The two topologies must not be confused.
Fix any family , initially without any openness assumption. An infinite accepts a stem if , and rejects it if no infinite subset of its tail accepts . Every infinite reservoir has an infinite refinement deciding : take an accepting refinement if one exists, and otherwise the reservoir itself rejects. Acceptance and rejection are both inherited by infinite refinements. These facts follow from the definitions, giving acceptance and rejection of finite stems.
First refine the initial reservoir to decide the empty stem. If it accepts, its infinite subsets already lie in . Otherwise start from an infinite reservoir rejecting the empty stem. Choose an increasing point , then thin its remaining tail finitely many times to decide all subsets of . Having chosen , choose from the current tail and refine the remaining tail to decide all subsets of . Each stage has only finitely many stems to handle. Let .
For every finite , at the stage of its largest point the reservoir was made to decide , and all later chosen points remain inside that reservoir. Heredity therefore makes the tail of decide . Moreover still rejects the empty stem. This proves deciding all finite stems by fusion without assuming a separate fusion theorem.
Suppose rejects a finite . There are only finitely many above for which 's tail above accepts . For if there were infinitely many, collect them into . Every infinite has least point of this kind, and its remaining tail lies in the accepting tail of . Hence for every such , so would accept , contradicting rejection. This proves finitely many accepting extensions of a rejected stem.
Now choose increasing from so that every subset of the chosen finite prefix is rejected by the appropriate tail of . The empty prefix is rejected. At the next step, for each of the finitely many already chosen subsets , avoid the finitely many accepting successors just identified. All other successors are rejected, since the previous fusion made every finite stem in decided. Thus one can choose the next point beyond the finite forbidden union. With , every finite is rejected.
Now assume is star-open. If some infinite lay in , there would be a basic neighbourhood containing . Here is a finite initial segment of , and its infinite tail lies in and in the relevant tail of . Then , so accepts , contradicting rejection. Therefore . In the earlier acceptance case, . We have proved
The construction works with any infinite starting reservoir. Keeping an initial finite stem fixed and applying the same acceptance/rejection argument to its tails proves the completely Ramsey set conclusion as well. This supplies the full fusion proof for open Ellentuck sets; no unproved course combinatorial lemma has been used.
For the final request, a family has the Baire property in the ordinary infinite-subset topology if it differs from a -open family by a -meagre set. We construct a non-Ramsey family which is already -nowhere dense. Let
The gap-doubling closed family of infinite subsets is -closed: a violation is witnessed by a finite initial segment, whose whole cylinder lies outside . It is nowhere dense: inside any cylinder, extend the stem by two sufficiently large consecutive integers ; the resulting smaller cylinder violates the gap inequality and is disjoint from .
For every infinite , the set has cardinality . To prove the lower bound, build a binary tree of finite gap-doubling sequences using points of , choosing two distinct next points above twice the previous point at every node. Distinct infinite binary branches give distinct increasing sets. The upper bound follows because all these sets are subsets of the countable set .
Well-order all infinite subsets as , using the initial ordinal of that cardinality. At stage , choose two previously unused sets
and reserve both permanently. There are fewer than previously reserved sets but candidates, so this recursion always continues. This argument does not assume that the continuum is a regular cardinal. Set . Every cone contains its red choice in and its blue choice outside ; the blue choices can never become later red choices. Therefore is not Ramsey.
But , and is closed nowhere dense, so the closure of also has empty interior. Thus is nowhere dense, hence meagre, and proves its ordinary Baire property. We have obtained a meagre set meeting every Ramsey cone in both colours:
This explains why ordinary Baire regularity cannot replace the star-topology regularity in the open-set theorem. A family supported only on the infinite subsets of a fixed sparse set would not suffice for this counterexample: another infinite set could give an entirely disjoint cone. The gap-doubling family used here instead meets every cone in continuum many candidates.
A rational matrix is partition regular over the positive integers if every finite colouring of admits a vector whose coordinates all have the same colour and satisfy . Equal coordinates are allowed. Rado's theorem says that this holds exactly when the columns can be partitioned into nonempty blocks with
This is the columns condition. Clearing an overall denominator lets us prove necessity for an integer matrix.
Suppose the columns condition fails. There are only finitely many ordered partitions of the finite column index set. For each ordered partition, choose a failing block: its sum is outside the rational span of preceding columns, with that span interpreted as zero for the first block. Finite-dimensional linear algebra gives a rational linear functional vanishing on that span but not on . For completeness, take a basis of the span, append , extend to a basis of the column space, and prescribe values zero on the first basis vectors and one on . Clearing the functional's denominators gives an integer row functional with .
Choose one prime larger than the absolute values of all these finitely many nonzero integers . Colour each positive integer by its first nonzero base- digit:
Assume a monochromatic solution exists, and partition its coordinates into blocks of equal p-adic valuation, ordered by increasing valuations . Their first nonzero digit is a common . For this ordered partition take its chosen failing block and functional . Apply to . All preceding-block terms disappear exactly. Divide the remaining integer equation by and reduce modulo . Later blocks disappear, while the current block gives
This contradicts the prime's choice. Thus the colouring has no monochromatic solution, proving necessity. This is the finite separating-functional proof of the columns condition; it needs neither a limiting argument nor a bound on the valuations themselves.
For sufficiency, suppose the blocks satisfy the columns condition. Choose rational coefficients , for in preceding blocks, such that
Let be a positive integer clearing their denominators, and choose an integer bounding all . Use the allowed monochromatic m-p-c set theorem with generators. We use the triangular convention in which the resulting positive integer set contains every number
in one colour. This is an m-p-c set, with the generator indices reversed if the alternative lower-triangular convention is used. The permitted theorem applies to either convention, since it applies to every finite number of generators. Its set lies in , so all of the displayed combinations are positive.
For , define
Each coordinate belongs to that monochromatic set. Summing the column contributions and collecting coefficients of gives
For the inner sum is empty and . This proves sufficiency by a Rado solution inside an m-p-c set, and completes the theorem.
For the requested application, choose
The matrix, in the coordinate order , has columns
The block has zero sum. The remaining column satisfies , so it is in the span of the first block. By Rado's theorem, positive monochromatic satisfy the system. In particular,
One can see the positivity directly in the same triangular construction: a monochromatic set containing for , together with , gives
All four are positive because they belong to that positive m-p-c set. This is a partition-regular system forcing an ordered Schur relation.

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