Use the usual convention that a variety is an irreducible variety. For a quasi-projective algebraic set , its algebraic dimension is the supremum of the lengths of strict chains
of nonempty irreducible closed subsets of . It is the maximum of the algebraic dimensions of its irreducible components. On an affine algebraic set, the correspondence between irreducible closed subsets and prime ideals reverses inclusion, so this is the Krull dimension of the coordinate ring. On a quasi-projective algebraic set, it is the supremum of the Krull dimensions of the coordinate rings of its affine open subsets. At a closed point , the Krull dimension of the local ring measures chains through .
Here is a closed-point dimension lemma for affine domains that avoids transcendence degree. Put . By Noether normalization, there is a integral extension
The number of variables is because integral extensions preserve Krull dimension and . For any maximal ideal of , its contraction to is a maximal ideal. Since is an algebraically closed field, has height of a prime ideal . The going-down theorem applies because is an integrally closed domain and is a integral domain. It lifts a length- chain below to one below . Hence
The opposite inequality follows from .
For the nonempty open subset , choose a nonempty principal open subset and a closed point . Every prime ideal below avoids , so the preceding chain survives in the localization . Consequently . Conversely, any chain of irreducible closed subsets in gives a chain of the same length after taking closures in : intersecting those closures with recovers the original subsets. Therefore
For the principal hypersurface dimension lemma, let be a minimal prime ideal over . Since in the integral domain , . The Krull principal ideal theorem gives . Choose a closed point on lying on none of the other finitely many irreducible components of . Such a point exists because those other components cut out proper closed subsets of the irreducible variety , and closed points are dense. Set . Then and
Write . Choose a system of parameters in and lift it to . The ideal has radical equal to the maximal ideal of . The Krull height theorem yields . On the other hand, any chain of prime ideals containing can be extended strictly at the bottom by the zero prime ideal of the integral domain , giving . Thus . Since is a localization of , . Extending a chain in by also gives . Hence every component has the required dimension:
This argument uses Noether normalization, going-down theorem, and the Krull height theorem, never the dimension from the function field theorem. Irreducibility is essential: if the word variety were instead allowed to mean an arbitrary reducible affine algebraic set, neither assertion would hold without extra hypotheses. For example, a disjoint union of an affine plane and an affine line has an open component of smaller algebraic dimension; a function equal to on the plane and a coordinate on the line has a nonempty zero set of algebraic dimension .
Yes. Use the sequence , . Every nonempty finite sum has only digits and in decimal notation, with leading digit , so none is a power of , including .
We still need an idempotent ultrafilter containing these sums; merely exhibiting an infinite set is insufficient. Put
The nonempty clopen sets are nested, so compactness gives a nonempty compact . This is the tail finite-sums semigroup. To verify closure under addition, take and fix . For any , choose a finite representation of and then an index beyond every index in that representation. Disjointness of supports gives , so . Consequently
and . This holds for every , proving . The Ellis–Numakura lemma now supplies an idempotent ultrafilter in . It contains , a subset of the non-powers of , so by upward closure it contains the whole set of non-powers of .
No. The ten residue classes modulo form a finite partition, so an ultrafilter contains exactly one class . The addition formula shows that contains : for , the translate is and belongs to . If is an idempotent ultrafilter, uniqueness of its selected class gives , hence .
Thus every idempotent ultrafilter contains the multiples of , and cannot also contain their complement. This is the zero-residue constraint for idempotent ultrafilters, valid for every finite modulus.
Again use integer coefficients after clearing denominators and put . If , choose any odd positive integer and take all . This gives a monochromatic solution in any colouring.
For necessity, suppose and choose with . Colour the odd positive integers by their residue classes modulo . In any monochromatic candidate, for a common odd . The equation would imply . Since is coprime to , this forces , impossible for nonzero with . Thus . This is one-equation partition regularity over odd integers; its obstruction concerns the full coefficient sum rather than just a zero-sum subset.
The two versions of partition regularity are equivalent. If the row is partition regular on all positive integers, pull a colouring of the even positive integers back by . A monochromatic solution for this pulled-back colouring gives the even solution in the original colouring, since the equation is homogeneous.
Conversely, restrict any colouring of all positive integers to its even members. A monochromatic solution supplied by regularity on the even integers is already a valid solution in the full domain. This argument is an instance of scaling invariance of homogeneous partition regularity and does not require a new coefficient criterion.
For , let . The presence or absence of is determined by a sufficiently long finite initial segment, so and its complement are open sets in the ordinary topology on infinite subsets. The Ellentuck topology is finer, hence each is star-clopen and in particular star-closed. Their union is
Every basic star-neighborhood of has for some , and its reservoir contains every integer greater than . Choosing gives . Thus is in the star-closure of the union, but not in the union itself. Therefore
Take to be the ordinary topology on infinite subsets, whose basic cylinders fix a finite initial segment. Let
This is a dense countable family of cofinite infinite subsets. It is countable because finite complements form a countable family. Each singleton is -closed: distinct increasing enumerations differ at some finite coordinate, which separates them by cylinders. No singleton has interior, since every cylinder admits more than one infinite continuation. Thus every singleton is -nowhere dense, and is -meagre.
On the other hand, every cylinder contains the cofinite set , with . Hence is -dense, its closure is all of , and
The paper does not define its symbol . If the course instead uses it for the Ramsey cone topology, with basic neighborhoods and no finite stem, use itself as the example. For , its cone-closure is : every cone neighborhood of a set containing contains an infinite subset of minimum , while a cone based on a set omitting misses . This closure has empty interior, because every infinite reservoir can be thinned to omit . Thus every is cone-nowhere dense, and is cone-meagre but is not cone-nowhere dense. This supplies the requested example under either convention, without conflating the two topologies.
The precise conclusion is that finite one-sided limits must agree, so a jump discontinuity is impossible. We prove this using explicit kernels and derive every conjugate-series identity used. The distinction from a removable discontinuity is addressed at the end.
Write the Fourier coefficients as
Translation multiplies each coefficient by a unimodular factor and preserves the hypothesis, so place the proposed discontinuity at zero. Suppose the finite limits are and . For , geometric summation gives the Poisson kernel on the circle and the conjugate Poisson kernel on the circle:
These series converge uniformly and absolutely for each . Therefore they may be integrated term by term against the Lebesgue integrable function . With normalized convolution, has multiplier , while has multiplier for and zero at . More explicitly, at zero,
The assumed vanishing of negative Fourier coefficients thus proves, rather than presupposes, the conjugate relation
We next show that the right-hand side is bounded as . The kernel is positive and even, and its normalized integral is one by its series. Its mass outside any fixed tends to zero; in fact its supremum there is . On , is uniformly close to for sufficiently small , and on it is uniformly close to . Evenness places asymptotically half the mass on each side. The outside contribution tends to zero because is integrable and the outside kernel tends uniformly to zero. Bounding the inside errors by the one-sided approximation errors gives
Hence is bounded by the proved conjugate relation.
On the other hand, oddness of gives
For , differentiating proves the exact identity
Also on and is uniformly bounded on as . Write with as . The integral over is by integrability. Given any , choose so that on . Positivity and the preceding identity show that the near-zero error, divided by , has limiting upper bound at most . Letting proves
Boundedness of the numerator makes the left side tend to zero. Therefore . This proves one-sided Fourier spectrum excludes jumps, and supplies the required conjugate-sum argument in full.
There is a point-value qualification to the phrase “first kind.” If it means finite unequal one-sided limits, the proof establishes exactly the stated result. If the definition also includes removable discontinuities, the literal statement is false for an arbitrary integrable representative: the function that equals zero everywhere except has every Fourier coefficient zero but a removable discontinuity at zero. Integral hypotheses cannot detect a change at one point. Thus no jump is possible; equal one-sided limits need not equal an arbitrarily assigned point value.
The Schwarz lemma states that a holomorphic function with satisfies
If equality holds in the first inequality at any nonzero point, or in the derivative inequality, then for a constant . Conversely those rotations give equality.
To prove it, the function extends holomorphically at zero with value , by the power series of . On , . The maximum modulus principle gives this same bound inside that circle. For each fixed , let to conclude . This proves both inequalities. Equality in either makes attain its maximum modulus at an interior point, so the maximum modulus principle makes a constant of modulus one. This proves the equality cases as well.
For the classification of automorphisms of the unit disk, choose and define
Direct expansion gives
Thus is a biholomorphism of the disk and sends to zero. If is any conformal map of the disk onto itself, take and put . Both and fix zero. The Schwarz lemma gives and, applied to at , . Equality holds, so . Consequently all the holomorphic conformal automorphisms are precisely
Every displayed map is indeed a conformal automorphism by the verified inverse and a rotation. Here conformal maps have the usual holomorphic, orientation-preserving meaning; if orientation reversal is allowed, their complex conjugates give the antiholomorphic alternatives.
In a regular category, interpret existential quantification by the image of the appropriate projection. The relation is the graph of , isomorphic to ; its projection to is itself. Thus the subobject interpreting the existential predicate is . Semantic validity of the sequent means this image is the whole object.
The regular image factorization writes with a regular epimorphism and its monic image inclusion. Its image is all of exactly when is invertible, equivalently when is itself a regular epimorphism. This is precisely the cover condition in a regular category.
The equality predicate on is interpreted by the diagonal monomorphism . The antecedent equality of the two -values is the kernel pair . Semantic validity of the implication says that the kernel-pair subobject is contained in the diagonal; the reverse containment always holds. Hence the sequent is valid exactly when
If is monic, this equality is its cancellation property expressed by the pullback. Conversely, if for , then factors through this kernel pair and therefore through the diagonal, giving . Thus the sequent holds exactly when the map is a monomorphism. This argument uses generalized arrows from arbitrary , not a claim that global elements detect maps.
Let be the equalizer of and the identity. By part (iv), maps correspond exactly to closed subobjects of . Closed subobjects of in turn correspond to subobjects of in : send to , and in the reverse direction pull a fixed subobject back along . Left exactness shows that these operations are inverse; the pulled-back object has reflection , making it closed by the defining formula.
Consequently
Replacing by and using invertible shows that maps into extend uniquely across every unit. The criterion of part (i) therefore proves itself is fixed, so belongs to . Truth factors through it because . For fixed , the displayed bijection becomes
With the factored truth arrow this is precisely the subobject classifier universal property. Thus the closed-subobject classifier supplies the classifier in the reflective subcategory.
Every characteristic map expresses its subobject as . Universality of the closure operation induced by a left-exact reflector gives
By definition, classifies , so the right-hand subobject has characteristic map . The original and its closure agree exactly when their unique characteristic maps agree. Thus
Extensivity, idempotence, preservation of intersections and closure of the whole subobject also give the Lawvere-Tierney topology laws for .
For a subobject , define the closure operation induced by a left-exact reflector by
where the pullback uses and the monomorphism . Naturality of the unit factors through , proving extensivity, and functoriality of proves monotonicity. Applying the left-exact to the defining pullback gives , since is invertible. Repeating the construction therefore changes nothing, proving idempotence.
For , naturality of and preservation of pullbacks identify the closure of with , which is also . Hence
The operation is thus universal: it is stable under every pullback. The same construction preserves finite intersections because is left exact.
Let be fixed objects and form the ambient exponential object . For every , the exponential adjunction identifies maps with maps . Since is left exact and ,
and its unit corresponds to . Because is fixed, every map therefore extends uniquely to . Transposing back gives
The fixed-object criterion from part (i) shows that already belongs to . The ambient evaluation and transpose universal property restrict to the full subcategory, proving the subcategory is cartesian closed. This constructs exponentials in a left-exact reflective subcategory, rather than merely reflecting an exponential and assuming its universal property survives.
Identify the reflective subcategory with its full replete image, writing for the reflection unit. An object is fixed by exactly when precomposition with every gives a bijection . One implication is the reflection adjunction; for the other, take to obtain a retraction of , and uniqueness of maps into the fixed object makes it a two-sided inverse.
An ambient finite limit of fixed objects has this same property: its hom-sets are limits of the hom-sets of the diagram, and a limit of these bijections is a bijection. Thus the ambient terminal object, products and equalizers are fixed and retain their universal properties in the full subcategory. The reflective subcategory is Cartesian, with finite limits computed in the ambient topos.
A geometric embedding means is full and faithful, equivalently that the adjunction counit is invertible for every . At , the explicit right-adjoint formula identifies this counit with
induced by , sending to .
If is full and faithful, every is an isomorphism, making all these counit components bijective and hence making full and faithful. Conversely, if precomposition with is a bijection for every , then is invertible by the Yoneda lemma applied in the presheaf category: taking gives a left inverse, and injectivity for makes it a right inverse too. Evaluating at therefore says that
is bijective for all . This proves the full-faithfulness criterion for presheaf geometric embeddings:
If is a retract in a category of , write , with . For a natural transformation of categorical presheaves, naturality gives
Consequently transformations agreeing at all agree at every retract of such an object. If every is such a retract, restriction is faithful, and the geometric morphism is surjective.
Conversely suppose is faithful. Inside the representable presheaf , define to consist of arrows that factor through some . Precomposition preserves this condition, so is a subpresheaf. At , every arrow factors through that very object, so . A faithful geometric inverse image reflects an inclusion becoming invertible, as proved in Question 4(iii). Hence , and factors as . This is the required retraction. We have proved the retract criterion for surjective presheaf geometric morphisms:
Precomposition defines
It preserves finite limits because presheaf limits are pointwise. Its right adjoint is a Right Kan extension; explicitly, for ,
Precomposition in supplies the restriction maps. To verify the adjunction, a map sends to the natural family taking to the image in of . Conversely evaluate such a family at , ; naturality makes the two constructions inverse. Thus and is left exact, giving the required geometric morphism
Suppose is a surjective geometric morphism, so is faithful. First, if a monomorphism becomes an isomorphism, then its characteristic map and the constantly true map become equal after : by part (i), the pulled-back subobject is the whole object, and equivalently because is epic and these maps agree after precomposition with it. Faithfulness gives , so was already invertible.
Now let satisfy . Adjunction and part (i) identify their pulled-back subobjects . Each inclusion consequently becomes an isomorphism. By the preceding argument it already is an isomorphism, so and . This works for every test object , proving

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