Let , and . Cut the Riemann sphere along arcs joining three marked points, say , so the complement is simply connected. Take copies labeled by the elements of and glue the slit banks with monodromies given by left multiplication by . The product relation ensures consistency. The surface is connected because generate . At a puncture with monodromy order , fill each cycle using the local complex coordinate ; use the analogous charts at the other two punctures. This constructs the three-branch-point regular surface cover .
Right multiplication by inverses defines a left action of , commutes with the monodromy gluing and extends holomorphically over the filled points. Average a compatible metric over this finite group to obtain a metric for which acts by Riemannian isometries. When the genus is at least two, the unique compatible curvature-minus-one metric from the uniformization theorem is an invariant choice. Away from the three marked fibers the action is free. The nontrivial stabilizer subgroups are the conjugates of , and , of orders , omitting order-one groups.
There are , , points over the corresponding branch points. The Riemann-Hurwitz formula gives
This construction also covers the spherical and toroidal cases. If one monodromy has order one it is simply an unbranched marked fiber, with no nontrivial stabilizer.
For the supplied coset actions, faithfulness gives . Compose permutations with the rightmost factor acting first. The two products have cycle decompositions
Thus . The index is twelve and each subgroup has order eight, so . Consequently
All cycles of on each coset set have the full orders . No nontrivial power of any of these branch monodromies fixes a coset. The fixed-coset criterion means that each has trivial intersection with every conjugate of each cyclic branch stabilizer. Since these are all stabilizers on , both act freely. Their quotient surfaces are therefore smooth closed surfaces, not cone-point orbifolds. Sunada theorem supplies isospectrality, and the unbranched Euler characteristic formula gives
Choose the hyperbolic metric for these surfaces and their common genus-nine cover.
In this natural construction the two genus-two surfaces are isometric, by an orientation-reversing map. Define the sheet permutation
Direct composition verifies
Complex conjugation of the base sphere fixes its three real branch points and reverses the two chosen generating loops, so their monodromies become the inverses. These identities supply a lift, after relabeling sheets by , to an anticonformal map between the two branched covers. It extends across the branch points by the local power charts. An anticonformal map between closed hyperbolic Riemann surfaces is a Riemannian isometry, by uniqueness of the compatible hyperbolic metric.
Equivalently, take the hyperbolic triangle group of signature . Reflection in the side joining the two order-three vertices conjugates its two vertex rotations to their inverses. The displayed sheet permutation identifies the reflected subgroup for the first covering with the subgroup for the second, up to an irrelevant change of base sheet. This is the orientation-reversing equivalence of branched-cover monodromy. The exhibited isometry is anticonformal, so the conclusion is about Riemannian isometry, without asserting that this map is holomorphic. Merely knowing the subgroups were almost conjugate would not have settled isometry; the explicit inverse-monodromy symmetry does. Nor does the data force this symmetry for every arbitrarily chosen invariant deformation of the cover's metric: it is present for the constructed hyperbolic metric.
First realize the free isometric action. Choose generators of the finitely presented group . In every dimension , the connected sum
has fundamental group the free group . Map its generators onto the and take the connected regular covering corresponding to the kernel. Its deck transformation group is . Lift any Riemannian metric on to . Deck transformations are then Riemannian isometries, and a deck transformation fixing one point is the identity by uniqueness of lifts. This gives the free isometric realization of a finitely generated group. For the trivial group use . If is infinite the covering manifold need not be compact, which is allowed in this first construction. Simple connectivity of is not being asserted here.
The requested nonhomeomorphism conclusion needs an extra hypothesis. For a counterexample even with distinct subgroups, take , and . They are conjugate and therefore Gassman equivalent. For every free isometric action of , the conjugating element induces a Riemannian isometry . These quotients cannot be nonhomeomorphic. Identical subgroups give an even simpler obstruction. Thus the stated equivalence condition alone cannot imply the claimed topology.
A sufficient version is: for a finite with Gassmann equivalent, nonisomorphic subgroups , there are closed isospectral manifolds with fundamental groups , and hence they are not homeomorphic. To prove it, realize as the fundamental group of a closed smooth manifold of dimension four. Here is the needed closed-manifold realization of a finitely presented fundamental group. Start with a four-dimensional zero-handle and one one-handle for each generator. Attach two-handles along disjoint embedded boundary circles representing the relators, with arbitrary framings. The boundary is three-dimensional, so finitely many such loops can be chosen disjoint. The resulting compact handle manifold has by the Seifert-van Kampen theorem.
The inclusion is surjective on fundamental groups: relative to the boundary the dual handle decomposition uses only handles of indices two, three and four, none of which introduces a fundamental-group generator. Double along its boundary. In the amalgamated product for the double, both boundary maps are the same surjection onto , so the two copies of are identified completely and . The double is closed, connected and smooth after smoothing its collar. This construction works in any dimension at least four; it does not claim that every finitely presented group is a closed three-manifold group.
Let now be the universal cover of with the lifted metric. Since is finite, is compact and simply connected, with a free isometric deck action of . By Sunada theorem, are isospectral. Because is their universal cover, . Nonisomorphic fundamental groups rule out a homeomorphism. For an infinite the same qualified argument applies to finite-index subgroups with equal coset characters: divide first by the intersection of their finite-index subgroup cores, producing a compact intermediate cover and a finite isometry group to which Sunada applies.
For explicit nonhomeomorphic examples, let be an odd prime. Let , and let be the Heisenberg group over a prime field, whose elements are triples with multiplication
Both have order , and every nonidentity element has order . For , induction gives
so the assertion follows at , since is odd. But is abelian and is not: and do not commute.
Embed both groups regularly in . Every nonidentity element in either regular representation has cycle type . Hence both embedded subgroups meet the identity class once, the class of that cycle type times, and all other classes zero times. They are nonisomorphic Gassmann equivalent regular subgroups. Taking and using the closed four-manifold construction with gives an explicit pair of isospectral nonhomeomorphic quotients, completing the intended construction under a sufficient hypothesis.
Finally choose distinct odd primes and take
Conjugacy classes in a direct product are products of classes, so their intersection counts factor. Thus all subgroups are Gassmann equivalent. They are pairwise nonisomorphic: the unique Sylow -subgroup of is its th factor, and whether it is abelian records . Realize as the fundamental group of a closed four-manifold and quotient its universal cover by these subgroups. The binary family of nonhomeomorphic Sunada quotients gives
This existence statement is valid; the earlier universal nonhomeomorphism assertion from Gassmann equivalence alone is not.
Take to be a closed compact Riemannian manifold and use the positive Laplace-Beltrami operator. Its Riemannian heat kernel is the integral kernel of :
It solves for and tends to the identity kernel as . For an orthonormal eigenbasis, the spectral expansion of the Riemannian heat kernel is
The bar is required for a complex basis. With boundary, a specified invariant boundary condition must also be included in this definition.
For the quotient formula use the covering-space interpretation: acts freely and properly discontinuously by Riemannian isometries. On compact such a discrete group is finite. Freeness alone, without this covering hypothesis, does not justify the image sum: an infinite dense subgroup of circle rotations, for example, acts freely but has no manifold quotient. Positive-dimensional group actions require a different quotient analysis.
For lifts of , the heat kernel on a finite isometric quotient is
Invariance of under simultaneous Riemannian isometries and reindexing the sum show that this is independent of both lifts. A local isometry commutes with the Laplacian, so the sum satisfies the quotient heat equation. For its initial condition, integrate over a fundamental domain against a lifted function. The terms combine into the integral over all of , whose initial limit is . Uniqueness of the heat evolution proves the formula. There is no factor in this kernel formula.
On the diagonal the sum is -invariant. Its integral over is therefore times its integral over , giving the heat trace
Thus the normalization factor appears in the trace, not the kernel. Put . For any finite isometry group , changing variables proves : it is a class function on .
For Gassmann equivalent subgroups , their intersections with each conjugacy class have equal size, and their orders are equal. If both act freely, the heat traces of their quotients satisfy
so they agree for every . Since , equality determines the spectrum with multiplicities: take to recover the smallest eigenvalue and its multiplicity, subtract that term, and repeat. This proves Sunada theorem. Equivalently, projection onto -invariant functions averages the group action, and the quotient eigenvalue multiplicity is , with the eigenspace character of a representation. Almost conjugacy equalizes these averages.
Consider two finite assemblies of the same number of congruent bounded Euclidean tiles. Label their matching faces so the same prescribed face identifications are used in both assemblies. For each face type , encode the first assembly by a symmetric involution : a paired face exchanges its two tile indices, an exterior Dirichlet boundary condition contributes diagonal , and an exterior Neumann boundary condition contributes diagonal . Let encode the second assembly. Face coordinates are pulled back to the same reference face; if identifications have additional face isometries, these pullbacks must be included in the intertwining operators.
The transplantation theorem says that a constant matrix with for every face type sends the vector of tile restrictions of a Laplacian eigenfunction on the first assembly to one on the second, by . If is invertible, it is a bijection of each eigenspace and the assemblies are isospectral with multiplicities.
To prove it, each component solves the same interior equation , and a constant linear combination solves that equation too. On a face, let be the vector of boundary values and the vector of outward normal derivatives. All matching and exterior conditions are exactly
For an internal face these equations say that values agree and the two outward derivatives sum to zero. For diagonal they impose zero value, and for diagonal zero normal derivative. The intertwining identity gives and , so the transplanted functions match and satisfy the correct boundary conditions. Applying proves the eigenspace bijection. At corners the same reasoning is interpreted in the finite-energy weak domain: no value jump and cancellation of normal flux prevent an extra distributional source. It gives the usual self-adjoint Dirichlet/mixed Laplacians on polygonal assemblies.
Here is an explicit transplantation by reflection parity. Take a rectangle of width and height , with the Dirichlet boundary condition on every exterior side. Cut it at its vertical midline into two congruent half-rectangles, pulling the right-hand half back by reflection. The midline gluing matrix is
Replace the connected assembly by the disjoint union of two width-, height- rectangles: the first has Dirichlet conditions on all sides; the second has Dirichlet on three sides and Neumann on the side representing the cut. Its corresponding matrix is . The invertible, indeed orthogonal, matrix
intertwines the midline conditions. Every other face has matrix on both assemblies, which automatically intertwines. The transplantation theorem proves equality of the complete spectra, although one surface is connected and the other has two components with the required uniform and mixed conditions.
Equivalently, odd reflection eigenfunctions vanish on the cut, while even reflection eigenfunctions have zero normal derivative there. A direct separation-of-variables check gives the connected rectangle's eigenvalues
Even gives the fully Dirichlet half-rectangle spectrum, and odd , , gives the mixed half-rectangle spectrum. The split preserves every multiplicity, including coincidences between different pairs of indices.
Figure 1.
Reflection splits a connected Dirichlet rectangle into a disjoint Dirichlet rectangle and a mixed Dirichlet-Neumann rectangle
. Details.
Use the positive Laplace-Beltrami operator, . A flat torus is the quotient , where is a full-rank Euclidean lattice and the metric descends from the Euclidean metric. Its dual lattice is
If is the covolume of , the functions descend to the torus. Direct differentiation gives the spectrum of a flat torus:
The multiset includes one entry for each dual vector. In particular zero has multiplicity one. Writing identifies the dual vectors with , . Standard Fourier series on the unit cube then prove that these functions are an orthonormal basis of on the torus. If , its Fourier coefficients satisfy . Thus every eigenfunction is a linear combination of the indicated shell of frequencies, with no additional eigenvalues. Compactness gives the discrete self-adjoint realization, whose eigenfunctions are smooth. For real functions the two characters at become cosine and sine, giving the same real multiplicities. The opposite Laplacian sign would negate all displayed eigenvalues without changing the rigidity conclusion.
To prove two-dimensional spectral rigidity, let and recover its Gram matrix from its vector-length multiset. Let be the shortest nonzero length and choose with . This vector is primitive: a proper integer multiple would have a shorter lattice vector. Hence . From the spectral multiset subtract exactly two occurrences of each length , . The remaining multiset consists precisely of the vectors not on this line, including correct multiplicities at coincident lengths. Its least length is the length of a shortest vector independent of .
The pair is a basis of . Otherwise take a lattice point in a nonzero coset of and reduce its two coefficients into . The resulting nonzero lattice vector is not on , by primitivity of . But
with strict inequality: when both coefficients are nonzero the triangle inequality is strict for independent vectors, and when one vanishes its length is at most . This contradicts the definition of . Subtract an integer multiple of from and, if necessary, change its sign to arrange ; minimality of makes this reduction possible without decreasing its length.
The covolume of is also spectral. The count of lattice vectors with length at most obeys
For example, translate a bounded fundamental parallelogram of diameter bound : the union of tiles with centres in contains and lies inside . Comparing their areas proves the leading coefficient. The spectrum supplies this count. Since is a lattice basis, its parallelogram area satisfies . Therefore
All three quantities are determined by the spectrum. Equal Gram matrices give an orthogonal map between the dual lattices; taking duals gives an orthogonal map between the original lattices, descending to a Riemannian isometry of the tori. Isospectral flat two-tori are isometric. This is the two-dimensional lattice reconstruction from vector lengths; it uses lengths with multiplicities, not merely the set of distinct lengths.
The key is to widen the forbidden intersection while controlling a product of densities. We first derive the two ingredients, with constants explicit enough to yield the numerical base in the question.
For two nonempty set families on coordinates, suppose every cross-intersection has size greater than an integer . Their complements are separated from by Hamming distance greater than . Let be the least integer with , where . Iterating Harper inequality, and using , shows that its radius- neighbourhood has at least vertices. The complementary set family is disjoint from that neighbourhood, so
For the needed weaker neighbourhood bound follows simply by taking the ball around its single vertex; define . If a displayed index forces a full neighbourhood, the other set family would be empty, already excluded.
The provided binary entropy function bound gives
Indeed, for this follows from , obtained by integrating ; for larger use . The two nonnegative deficits in the preceding product have sum at least . Their squared sum is at least . Thus the cross-intersection bound from cube separation is
Now suppose a pair of set families forbids every cross-intersection in . Put , and fix . Split both set families by the last coordinate. The following three replacements preserve the indicated forbidden intervals on coordinates:
For example, in the third row the same second set has witnesses in both sections of , so its intersection with a first-section member must avoid both shifted intervals; their union is .
If the first replacement increases the density product by a factor at least , use it. Otherwise interchange the names of the two set families if needed so that
If the second replacement gives a factor at least , use it. If neither does, use the third. To bound its loss, put
We have , , and consequently . The third replacement's product factor is
Since , its minimum on is at an endpoint. There
Thus each step either gains a factor without increasing interval width, or widens the interval by one and loses at most a factor . This is the forbidden-intersection density increment, with its loss proved rather than hidden in an asymptotic error.
Start with and . Stop when or . Dimension drops at every step. The positive lower product factors ensure that a nonempty starting pair stays nonempty; it therefore cannot reach a forbidden interval containing all . Write for the number of widening steps, for the number of gain steps, and put
The terminal density product satisfies . Always , since a widening step lowers by one.
If the procedure stops at , the terminal forbidden interval is . Every cross-intersection is therefore greater than , and the cross-intersection bound from cube separation gives . At least steps were needed to lower to zero, so . Since ,
If instead the procedure stops at , the number of steps is at least , so . Using and gives
These estimates hold for every nonempty pair forbidding the original intersection, with in our application.
For , the two positive exponential decay rates are, respectively,
Both exceed . Hence and
The empty set family is immediate. This proves the numerical bound directly from Harper inequality and the supplied binary entropy function estimate.
For , the identical forbidden-intersection density increment applies. For , use in the first stopping estimate. Its decay rate is at least
For the second stopping estimate, gives the still stronger rate . At the floor is exact and the first rate is .
It remains to handle without silently absorbing a constant into an exponential. Then is zero or one. Fix an -set . The sets containing are paired as and , and each pair intersects in exactly . Since , these are distinct pairs, and at most one member of each belongs to . Therefore
For , the forbidden self-intersection is zero, so the set family is empty. We have proved the claimed base for all dimensions in the second case as well.
Finally, the same base is not forced by a forbidden intersection near . Take and every subset of size at most . Every intersection has size at most , below , including self-intersections. By pairing complementary sets this set family has more than members, whereas
since . Thus it is a large family avoiding a high intersection, and it contradicts the proposed bound.
Use the external external vertex boundary convention
Equivalently, its closed graph neighbourhood is . Some boundary conventions use this closed graph neighbourhood itself; because the compared set families have equal size, either convention gives the same inequality.
Order the Boolean lattice first by increasing size, and within a size by lexicographic order, with the smallest differing coordinate in the earlier set. If is the initial segment in this simplicial order on the discrete cube with , Harper inequality is
In particular, writing , if then .
Here is the full simplicial section compression proof. The cases are immediate. A simplicial initial segment has an initial-segment closed graph neighbourhood: it contains every smaller level, and its remaining upper level is the upper shadow of a lexicographic initial segment. That upper shadow is lexicographic initial because a set has a face in the segment exactly when its earliest face does, and earliest faces preserve lexicographic order.
Assume the result in dimension . For a coordinate , delete it from the present section and write the two sections as . Their neighbourhood sections are exactly
Replace both sections by equally large simplicial initial segments . The mathematical induction hypothesis controls each internal neighbourhood. Both sets in each new union are initial segments, so that union has size equal to the larger of their sizes. The corresponding old union has at least that size. Therefore this simplicial section compression does not enlarge .
Repeatedly compress any noninitial section. Every change strictly reduces the sum of the global simplicial positions of the set family members, so the process terminates at a set family compressed in every section. Suppose an earlier vertex is missing while a later vertex is present. If they agree in any coordinate, they contradict compression of that coordinate's section. Thus . They must also be consecutive in simplicial order: an intermediate vertex, whether present or absent, would create another inversion and would have to equal one of these two complementary vertices. No other inversion is possible for the same reason. Hence is either the required initial segment or that segment with its last vertex exchanged for the next vertex , with complementary.
For completeness, these terminal families for simplicial section compression can be checked explicitly. If , the exceptional consecutive vertices are the last -set and first -set . For , the initial segment is all levels through . After the exchange every vertex of size at most is still in its closed graph neighbourhood: a -set has at least two -faces, so deleting the one face cannot remove it, and itself neighbours a retained smaller set. Thus the new neighbourhood contains the old one. For , the two single-vertex set families have the same neighbourhood.
If , the exceptional pair is and . The initial segment consists of every level below and all -sets containing coordinate one. Its closed graph neighbourhood consists of every level through and the -sets containing coordinate one. For , each of the latter has faces containing coordinate one, so deleting removes no such neighbour. Every lower level remains covered. For , the added vertex itself keeps the sole two-element neighbour covered. Again the exchange does not decrease the neighbourhood. These are the only complementary consecutive pairs, as is seen by checking the central ranks and the lexicographic transition between middle-rank sets containing and avoiding coordinate one.
We have reached a set family whose neighbourhood is at least the initial segment's, without increasing the original neighbourhood. This proves Harper inequality by mathematical induction, including the exceptional compressed set families often omitted from the argument.
For the final request, the usual two-coordinate shift does not increase the boundary of a uniform set family. To see this carefully, let and let move a set containing but not to its partner with replaced by , only if that partner is absent. For any uniform set family ,
Here is the local witness check for the lower shadow inclusion. A shadow member containing neither or both of has an old witness after possibly exchanging in that witness. For a paired shadow vertex containing only, either its old version or its -partner has an old witness, which suffices for its membership in the shifted shadow. For a vertex containing only that survives in the new shadow, its new witness either contains both coordinates, supplying both old shadow partners directly, or is an unshifted -only witness whose -partner was already present. In either event both old shadow partners existed, which is exactly the condition for the -vertex to survive the shadow shift. This exhausts the coordinate patterns.
Taking complements converts an upper shadow into a lower shadow and converts into , proving the second inclusion. Each shift preserves cardinality on the shadow level. The external boundary of an -uniform set family is the disjoint union of its lower and upper shadows, so
The endpoint levels have an empty shadow on one side and obey the same conclusion.
Work over the finite field . For each set family member form the intersection polynomial
At the characteristic vector of a set , its value is . The given restrictions make for and . Hence these functions are linearly independent: evaluate a purported relation at each set family member to eliminate its coefficient.
Use multilinear reduction on the Boolean cube, replacing every positive power of by . This preserves all evaluations on and cannot increase degree. The multilinear polynomials of degree at most have basis for . Their dimension is , and therefore
where for . The proof also covers a list whose distinct integers have repeated residues: no assumption of distinct residues is needed for this first bound.
To obtain the sharper conclusion, suppose the common size residue avoids . If , no set on this ground set can have the required residue, so the set family is empty. Otherwise, add the modular-size auxiliary polynomials
again understood as functions after multilinear reduction on the Boolean cube. They have degree at most , and all vanish on the set family's characteristic vectors of sets.
The are linearly independent. Indeed, evaluate on with :
The first factor is nonzero in the finite field. Starting with and proceeding in increasing cardinality shows for every such .
Moreover, the combined list consisting of the and the is linearly independent. Evaluation at each first kills the coefficient of ; the preceding argument then kills all remaining coefficients. Comparing this list with the dimension of the degree-at-most- space yields
This is a nonuniform common-residue version of the Frankl-Wilson theorem; exact equality of all member sizes was never used.
The exclusion of the small residues is necessary. A concrete example with is , , , the residue list , and the set family of all two-element subsets. Every member has size residue , outside that list, while distinct members intersect in zero or one element. But
Here the omitted condition fails at . Thus the example satisfies all the other hypotheses, rather than relying on a vacuous case.
The lower shadow consists of the sets obtained by removing one element from a member:
For a nonempty uniform set family, write its size in its unique decreasing binomial coefficient expansion
The Kruskal-Katona theorem states that
A colexicographic initial segment attains equality; thus this is an exact minimum, not just an asymptotic estimate.
Here is a direct proof of the requested Lovász shadow bound, avoiding any unproved numerical interpolation of the Kruskal-Katona theorem. The real binomial coefficient means . It is strictly increasing for . Since the set family is nonempty and its size is an integer, necessarily .
Apply the usual left coordinate shifts of a set family until the set family is fixed by every shift. A shift preserves its size and does not increase its lower shadow; the witness argument is supplied in Solution 3. Termination follows because every nontrivial shift reduces . It suffices to prove the inequality for this shifted set family.
Induct on , and, for each fixed , on . The cases and give, respectively, the single empty shadow member and the faces of an -set. Split the set family at coordinate one, writing for the members avoiding it and for the sets obtained by deleting it from members containing it. Every -subset of a member of belongs to : replace the one omitted coordinate by coordinate one. Therefore
The two terms count shadow members avoiding and containing coordinate one.
Put . This is positive. If , the Pascal's identity gives . In this case and is a smaller nonempty set family. The mathematical induction hypothesis on family size gives , contradicting its containment in . Consequently . Write , so . The mathematical induction hypothesis on uniformity and the Pascal's identity now give
For the degree-zero term is the constant one, which causes no difficulty.
For the graph application, identify a triangle-free graph with a subset of the possible edges. Removing an edge preserves being triangle-free, so . If is nonempty, the Lovász shadow bound gives
Thus, for with ,
If the next set family is empty its probability is zero, so the same inequality holds without introducing . If , every later set family is empty; the divided expression is undefined and the correct assertion is this zero-probability conclusion.
Iterate the monotonicity of the effective ground-set parameter of a hereditary uniform layer. Whenever , all the intermediate parameters are at least their layer sizes, and all factors below are nonnegative. We obtain the stronger estimate
The second inequality follows from and the fact that decreases with . If the target set family is empty, the requested bound follows directly when its right side is nonnegative. When , the printed product can have signed factors and should instead be stopped at the first empty layer: its unrestricted signed form is not a meaningful probability bound. In the nonzero target range there is no such ambiguity. A uniformly safe extension, for , is
It agrees with the printed expression whenever all its factors are nonnegative. In particular is always safe when , and this includes the requested doubling case.
Taking in the nonzero range,
If the -edge set family is empty the conclusion is immediate; if , interpreting the event as impossible gives the same conclusion. These qualifications distinguish the probability assertion from products or ratios outside their domains.
Write for the space of infinite subsets of the natural numbers, identifying a set with its increasing enumeration. If is finite and is infinite with every element of above , set
For the empty stem there is no lower-bound restriction. These sets form the basis of the Ellentuck topology, also called the star topology. The stem is fixed, while the infinite tail may be thinned.
A completely Ramsey set is one for which every admits an infinite with or . This keeps the same stem. A Ramsey set of infinite subsets requires that every infinite admit an infinite with a homogeneous empty-stem cone . It does not require preserving a nonempty finite stem.
A set is a star-Baire set if it differs from a star-open set by a star-meagre set, equivalently is star-meagre for some star-open . A nowhere dense set has closure with empty interior, and a meagre set is a countable union of such sets, with both notions interpreted in the specified topology.
For a non-Ramsey example, put and well-order all infinite subsets of as , where . Recursively choose two fresh points , not used at earlier stages. This is possible because each cone has cardinality and fewer than points have been used before any stage. Let
keeping all the outside . Every infinite-subset cone on meets both and its complement. Thus is not Ramsey, even when regarded as a subset of : any infinite set can first be thinned to avoid . This uses the axiom of choice, rather than claiming a Borel counterexample.
Now set
Every infinite has an infinite subset avoiding , and then . Hence is Ramsey. But no stem-preserving thinning of is homogeneous for , because splits every tail cone. Hence is not completely Ramsey.
To prove the topological equivalence, we first establish the Ellentuck meagre-set fusion lemma: every star-meagre set can be avoided in a refinement with the original stem. Call a set completely Ramsey-null if this avoidance holds in every .
If is star-nowhere dense, then is star-open and dense. By the granted complete-Ramsey property of star-open sets, every has a refinement either contained in or disjoint from . The latter alternative would put a nonempty open set inside , contradicting density of . Thus is completely Ramsey-null.
For a countable union of completely Ramsey-null sets, use fusion, taking care of every possible finite stem. Starting with , at stage choose above all previous choices. From the part of above , successively thin an infinite tail for each of the finitely many subsets so that
Each thinning keeps the stem fixed; subsequent thinnings preserve earlier avoidance. Let . For any and fixed , put . The rest of lies in , because all later selected points do. Therefore and . Since was arbitrary,
This proves the fusion lemma. Considering all subsets , not merely the single selected prefix, is essential: elements of need not use every .
Suppose first that is star-Baire, with star-meagre and star-open. Thin to avoiding the meagre difference by the lemma. Then apply the granted complete-Ramsey property of to find homogeneous for , with . On this refinement and agree, so it is homogeneous for . Thus is completely Ramsey.
Conversely, let be completely Ramsey and let be the union of all basic neighborhoods wholly contained in , namely its star-interior. Every has a homogeneous refinement. If that refinement lies in , it lies in ; if it avoids , it also avoids . Consequently every basic neighborhood contains a nonempty open refinement disjoint from . Since such a refinement is also disjoint from the closure of , this difference is star-nowhere dense. Thus is star-meagre, and is star-Baire. We have proved
Finally, is not star-meagre: otherwise apply the fusion lemma to its purported meagre cover inside any nonempty basic neighborhood, obtaining a nonempty disjoint from , a contradiction.
The printed paper does not define . In the coarser Ramsey cone topology, whose basic open sets are without finite stems, is -meagre. To prove this, let . Its cone-topology closure is : every cone neighborhood of a point containing has a subset with least element , whereas if the neighborhood avoids . No nonempty cone lies in , since its infinite ground set can be thinned to remove . Therefore each is nowhere dense, but . This proves meagreness of the Ramsey cone topology and exhibits the contrast with the star topology.
If instead denotes the ordinary topology on infinite subsets, with basic cylinders , the answer is not -meagre. Indeed, given countably many nowhere dense sets, extend a finite increasing prefix successively so that its cylinder avoids the closure of the next set. Make the prefix longer at each step. Their union is an infinite increasing enumeration belonging to every chosen cylinder and avoiding the whole proposed cover. The same construction starts inside any nonempty cylinder, so this alternative product topology is also a Baire space. The two conventions have different answers, so the distinction must be made explicitly rather than inferred from the symbol alone.

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