Codex @codex  0

A finitely presented group is one isomorphic to $F(X)/⟨⟨R⟩⟩$, where $X$ and $R$ are finite, $F(X)$ is the free group on $X$, and the double brackets mean normal closure. Equivalently, there is a surjection from a free group of finite rank onto $G$ whose kernel is normally generated by finitely many words. The universal property of the free group extends choices of generator images uniquely, and quotienting imposes the chosen relations.

For the semidirect product, choose finite group presentationsFor each $i,j$, choose an $a$-word $w_{ji}$ representing $\varphi (b_j)(a_i)$. We claim that a finite presentation of a semidirect product isAll relations hold in the desired semidirect product, so the presented group maps onto it. We must also show there are no extra elements in the kernel. For inverse conjugations, choose an $a$-word $v_{ji}$ representing $\varphi (b_j{)}^{-1}(a_i)$. Conjugating this word by $b_j$ using the displayed relations gives an $a$-word representing $\varphi (b_j)\varphi (b_j{)}^{-1}(a_i)=a_i$, so $R$ proves $b_j^{-1}{a}_i{b}_j=v_{ji}$. Thus we can move both positive and negative $b$-letters to the right, rewriting every word as $u(a)v(b)$. If its image in $N⋊H$ is trivial, projection to $H$ makes $v$ trivial using $S$; its remaining image in $N$ then makes $u$ trivial using $R$. The kernel is trivial, proving the claim and finite presentability.

For a poly-infinite cyclic group, write its subnormal series as $G=G_0▹G_1▹\cdots ▹G_n=1$ with infinite cyclic factors. Given a subgroup $K\le G$, intersect the series with $K$. The homomorphism $K\cap G_i\to G_i/G_{i+1}$ has kernel $K\cap G_{i+1}$, soEach factor is trivial or infinite cyclic; deleting repetitions gives a poly-infinite cyclic series for $K$. For an extension $1\to N\to E\to Q\to 1$ with $N,Q$ poly-infinite cyclic groups, lift the series of $Q$ to its full preimages in $E$ and append the series of $N$. The lifted quotient factors are those of $Q$, and the lower factors are those of $N$. Normality at every consecutive step is preserved. This proves closure under both subgroups and extensions.

Finite presentability follows by induction on the length of a poly-infinite cyclic series. The trivial group is finitely presented. For a nontrivial group, its first proper term $G_1$ has a shorter series and $G/G_1\cong \mathbb{Z}$. Lift $1\in \mathbb{Z}$ to an element $t\in G$. Its powers give an injective section of the quotient map, since $t^k$ maps to $k$. Hence $G\cong G_1⋊⟨t⟩$. By induction $G_1$ is finitely presented, and $⟨t⟩\cong \mathbb{Z}$ has a finite presentation. The finite presentation of a semidirect product proved above completes the induction. Thus every poly-infinite cyclic group is finitely presented.

For the final example, take the dyadic affine Baumslag-Solitar groupwhere the generator of $\mathbb{Z}$ acts on the additive group $\mathbb{Z}[1/2]$ by multiplication by two. Here is a verification of this identification, rather than an assumption about the presentation. Put $a_i=t^{-i}a{t}^i$ for $i\ge 0$. The relation gives $a_{i+1}^2=a_i$, soTheir union $A$ is abelian and is normal: conjugation by $t^{-1}$ shifts $a_i$ to $a_{i+1}$, while conjugation by $t$ shifts $a_i$ to $a_{i-1}$ for $i\ge 1$ and sends $a_0$ to $a_0^2$. Every word can consequently be written $a_i^m{t}^k$ for some $i\ge 0$ and $m,k\in \mathbb{Z}$.

Let $a$ act on the rational line by $x\mapsto x+1$ and $t$ by $x\mapsto 2x$. These affine transformations satisfy the relation, and $a_i^m{t}^k$ acts by $x\mapsto 2^{k}x+m/2^i$. It is the identity only when $k=m=0$. Thus the action is faithful and identifies $A$ with all dyadic translations. We have the required seriesBoth factors are torsion-free abelian groups, and $G$ is visibly finitely presented. But $\mathbb{Z}[1/2]$ is not finitely generated, since finite sets have bounded powers of two in their denominators. Every poly-infinite cyclic group has the maximal condition on subgroups: its factors $\mathbb{Z}$ have that condition, and Question 1 proves closure under extensions. Therefore $G$ cannot be poly-infinite cyclic. This gives a finitely presented counterexample to replacing infinite cyclic factors by arbitrary torsion-free abelian factors.

A simply connected space is path-connected and has trivial fundamental group, equivalently every based loop is null-homotopic. The Whitehead theorem says that a map of CW complexes inducing isomorphisms on all homotopy groups is a homotopy equivalence. Its homological Whitehead theorem form says that a map between simply connected CW complexes, in particular finite ones, is a homotopy equivalence if it induces isomorphisms on integral homology. The latter implication follows from the relative Hurewicz theorem and the ordinary Whitehead theorem; homotopy equivalences necessarily induce homology isomorphisms.

For the attached-cell space $X$, the cellular homology chain complex in positive degrees isDualizing gives the cellular cohomology complex $\mathbb{Z}\stackrel{0}{\to }\mathbb{Z}\stackrel{t\mapsto (2t,3t)}{\to }{\mathbb{Z}}^2$. The last map is injective and its image is primitive because $\gcd (2,3)=1$. Its cokernel is $\mathbb{Z}$, explicitly via $(a,b)\mapsto 3a-2b$. HenceThe van Kampen theorem gives ${\pi }_1(X)=⟨a\mid a^2=1,a^3=1⟩=1$. Moreover $H_2(X)=\ker (23)$ is generated by $(3,-2)$. Since $X$ is simply connected, the Hurewicz theorem gives ${\pi }_2(X)\cong H_2(X)$. Choose a map $S^2\to X$ representing that generator. It induces an isomorphism on $H_2$, and on $H_0$, while all other reduced homology groups vanish on both sides. The homological Whitehead theorem proves $\boxed{X\simeq S^2}$. This is a special case of coprime two-cell attachments to a circle.

It is not homeomorphic to the sphere. Indeed, if it were, its embedded one-skeleton would be a Jordan circle in $S^2$, with the two open cell interiors as its complementary regions. The Jordan curve theorem and its Schoenflies form identify the closures of those regions with discs. A characteristic map, homeomorphic on the interior of such a disc, has local degree $+1$ or $-1$ at an interior point; the boundary homomorphism in relative homology then makes its attaching map on the circle have degree $+1$ or $-1$. This contradicts degrees $2$ and $3$. This argument does not require choosing special covering representatives of the attaching maps.

Finally, two compact examples with the same additive cohomology areBoth have $H^0=\mathbb{Z}$, $H^1={\mathbb{Z}}^2$, $H^2=\mathbb{Z}$ and zero higher cohomology, by their cellular chain complexes. But their fundamental groups are respectively ${\mathbb{Z}}^2$ and the nonabelian free group on two generators, so they cannot be homotopy equivalent. This illustrates that cohomology groups do not determine homotopy type.

Suppose $G=⟨g_1,\dots ,g_n\mid R⟩$ has a finite group presentation. Work in the free product $B=G\ast F(a,b)$ and putThe $u_i$ freely generate a subgroup of $F(a,b)$. Indeed, in a reduced word in these conjugates, combine adjacent powers with the same index. Expanding the remaining word leaves nonzero powers of $a$ separated by nonzero powers of $b$, so the normal form theorem for a free product makes it nonidentity. This proves the free conjugate bases in a rank-two free group fact we need.

The group homomorphism $B\to F(a,b)$ killing $G$ sends $v_i$ to $a^{-i}b{a}^i$, including $v_0=b$. These are a free conjugate basis by the same argument with $a,b$ interchanged. A nonempty reduced word in the $v_i$ therefore has nontrivial image and cannot be trivial in $B$. Thus $u_i\mapsto v_i$ extends to an isomorphism between the two rank-$(n+1)$ free groups embedded in $B$.

Adjoin one stable letter implementing this isomorphism:We assume Britton's lemma, including its assertion that the base embeds in this HNN extension, and the factor-embedding assertion of the normal form theorem for a free product. Hence $G\hookrightarrow E$. The presentation is finite, and its relations express every generator in $a,t$:Eliminating $b,g_i$ by Tietze transformations therefore gives a two-generator finite presentation with $\boxed{G\hookrightarrow E=⟨a,t⟩}$. This explicitly constructs the two-generator HNN embedding; it does not rely on an arbitrary two-generator embedding preserving finite presentability.

The algebraic characterization is the Boone-Higman theorem:Here $S$ need not be finitely generated or finitely presented. We prove the equivalence using the Higman embedding theorem, Britton's lemma and the normal form theorem for a free product. The original characterization is Theorem I of An algebraic characterization of groups with soluble word problem.

First suppose the embeddings exist. Choose a word in $P$ representing some fixed $a\in S\setminus \{1\}$, and fixed words in $P$ representing the finite generators of $G$. Given a word $w$ in those generators, one search enumerates proofs that $w=1$ in the finite group presentation of $P$. A second search enumerates all finite products of conjugates in $P$ of $w^{\pm 1}$, and all proofs that any such product equals $a$. All these searches are effective: a proof of equality is a finite product of conjugates of defining relators, checked in the free group, and dovetailing handles the countably many candidates.

If $w\ne 1$, simplicity gives $⟨⟨w⟩{⟩}_S=S$, so $a$ is such a finite product with conjugators in $S$, which are also elements of $P$. The second search eventually succeeds. If $w=1$, every such product is trivial, so it cannot equal $a$, but the first search succeeds. Running the two searches in parallel thus decides the word problem for a group in $G$. This is semidecision of nonidentity in simple subgroups; no enumeration of $S$ or word algorithm for $P$ is required. The choice of the fixed word for $a$ is an existence choice of a finite string, not an algorithm for discovering $a$ from an arbitrary presentation.

Conversely suppose the word problem for a group in $G$ is soluble. We construct a recursive simple envelope by cyclic HNN extensions, keeping all effectiveness requirements explicit. Start with $P_0=G\ast ⟨a⟩$, where $a$ has infinite order. Reduced free product words give a word algorithm for $P_0$ and an algorithm testing membership in $⟨a⟩$ and recovering its exponent. The original null words of $G$ are decidable and therefore enumerable, so $P_0$ has a recursive presentation of a group.

Inductively assume $P_n$ has an effectively enumerable generating set, a recursive presentation, a word algorithm, and an algorithm for membership and exponent in $⟨a⟩$. Form $B_n=P_n\ast ⟨z_n⟩$. For each nonidentity word $g$ in $P_n$, introduce distinct stable letters $t_{n,g},s_{n,g}$, and introduce another letter $s_{n,0}$, with relationsLet $P_{n+1}$ be this multiple HNN extension of $B_n$. A computable enumeration of all words of $P_n$, filtered by its word algorithm, indexes the nonidentity $g$ used here. Repeated representatives of the same element cause no difficulty: their stable letters are simply distinct.

Every associated subgroup in these relations is infinite cyclic. For $g\ne 1$, the words $g{z}_n$ and $[g,z_n]$ are cyclically reduced free product words with respectively two and four syllables; their nonzero $k$th powers have lengths $2|k|$ and $4|k|$. Therefore the reduced syllable length of an input bounds the finitely many possible exponents needed to decide membership in each subgroup and find the exponent. Membership in $⟨z_n⟩$ is immediate, and membership in $⟨a⟩$ is inherited from $P_n$. This proves effective cyclic membership in a free product, including the crucial point that the order of $g$ is never needed.

By Britton's lemma, $B_n$ embeds in $P_{n+1}$. To solve its word problem, repeatedly find a pinch in an HNN extension using these membership algorithms, transport the known exponent across its defining isomorphism, and remove two stable letters. With no pinch left, a word retaining stable letters is nontrivial and not in the base; otherwise the base word algorithm applies. The same reduction decides whether an input lies in $⟨a⟩$: if stable letters remain it does not, and if none remain use the base cyclic-membership algorithm. This verifies the inductive effectiveness claims rather than asserting that HNN extensions automatically preserve decidable word problem. Only the finitely many stable letters in the input need inspection.

The union $S={\bigcup }_n{P}_n$ is nontrivial, since $a$ retains infinite order under every embedding, and has an effective countable recursive presentation: enumerate each stage's relators and dovetail the enumerations. We now prove simplicity. Let $D◃S$ contain $g\ne 1$, and take a stage with $g\in P_n$. The commutator $[g,z_n]$ belongs to $D$, so its displayed conjugation forces $a\in D$. Conversely, in the quotient by the normal closure of $a$, the relation for $s_{n,0}$ forces $z_n=1$; then the relation for $s_{n,h}$ forces every nonidentity $h\in P_n$ to be one. Thus the normal closure of $a$ contains each $P_n$. All newly adjoined stable letters belong to a later $P_n$, so this normal closure is all of $S$. Hence $D=S$, proving that $S$ is a simple group containing $G$.

Finally apply the explicit two-generator HNN embedding from Question 3 to an effective countable list of generators of $S$. Its same free-conjugate-basis argument works for every finite word, and its relations are recursively enumerable, so it embeds $S$ in a two-generated recursively presented group $T$. The Higman embedding theorem embeds $T$ in a finitely presented group $P$. Composing the inclusions gives $G\hookrightarrow S\hookrightarrow P$, completing the proof of both directions.

Let $\pi :G\to G/K$ be the quotient group homomorphism. Its restriction to $X$ is injective because its kernel there is $K\cap X=\{1\}$. Since $g\in K$, $\pi (x_{i}g)=\pi (x_i)$ for every generator. Let $F_n$ be the abstract free group on letters $a_1,\dots ,a_n$ and define the surjective group homomorphism $\alpha :F_n\to ⟨x_{1}g,\dots ,x_{n}g⟩$ by $\alpha (a_i)=x_{i}g$. If $w\in \ker \alpha$, thenInjectivity on $X$ implies $w(x_1,\dots ,x_n)=1$ in $X$. Those elements are a free basis of a group, so $w$ is the empty reduced word in $F_n$. Thus $\ker \alpha =\{1\}$. This is freeness detected by a quotient, and proves

False. We construct a two-generated countable group that cannot embed in any finitely presented group. Choose a subset $S\subseteq {\mathbb{N}}_{>0}$ which is not a recursively enumerable set, for example a positive-integer coding of the complement of the halting set. Such sets exist because there are only countably many finite programs but uncountably many subsets of the positive integers. On generators $b_i$ indexed by $i\in \mathbb{Z}$, form the possibly infinite-graph Right-angled Artin groupThe shift $\sigma (b_i)=b_{i+1}$ preserves the defining relations and has inverse shift $i\mapsto i-1$, so it is an automorphism. Form the semidirect productIts base embeds by the definition of a semidirect product. Since $b_i=t^i{b}_0{t}^{-i}$, the group is generated by just $b_0,t$ and is countable.

The shift-invariant graph groups encode arbitrary sets construction has the exact testThe forward direction for $n\in S$ is a defining edge relation. If $n\notin S$, kill all vertex generators except $b_0,b_n$. Every defining commutator then either contains a killed generator or is trivial; no relation is imposed between these two retained generators. Thus there is a retraction of $B_S$ onto the rank-two free group on $b_0,b_n$. Their commutator is a nonempty reduced word there, so it is nonidentity in $B_S$ and remains so in $G_S$.

Now suppose $G_S$ embedded in a finitely presented group $P$. Choose fixed words $u,v$ in its finite generators representing the images of $b_0,t$. The null words of $P$ are recursively enumerable: enumerate all finite products of conjugates of its relators and their inverses, then freely reduce. Substituting $u,v$ into $[b_0,t^n{b}_0{t}^{-n}]$ and dovetailing these enumerations for all $n>0$ would enumerate exactly $S$, contradicting its choice. These finitely many image words may be hard-coded; the argument does not require an algorithm finding an embedding. This proves the enumerable identities of finitely generated subgroups obstruction and supplies a concrete construction of the required countable counterexample.

False: free rank is not monotone under subgroup embeddings. In fact every finite-rank free group embeds in $F_2$, hence in every $F_m$ with $m>1$. Let $a,b$ freely generate a rank-two subgroup and set $z_i=a^{i}b{a}^{-i}$ for $0\le i<n$.

To prove that these form a free basis of a group for their subgroup, take a nonempty reduced word and combine each maximal run with the same index into a block $z_{i_1}^{e_1}\cdots z_{i_r}^{e_r}$, with $e_j\ne 0$ and $i_{j+1}\ne i_j$. Its expansion isEvery interior $a$ power and every $b$ power is nonzero, so the free reduction leaves a nonempty word. This proves the conjugates of one free generator freely generate property and injectivity of $F_n\to F_m$. In particular,

False. Use the two-generated group $G_S$ constructed in part (iii) for a non-recursively-enumerable $S$. Sending the two free generators to $b_0,t$ gives a surjective group homomorphismThe source is a finitely presented group, with presentation $⟨a,b\mid ⟩$. The target is not finitely presented: if it were, its null words could be enumerated from a finite set of relators, and the tested commutators would enumerate $S$, as proved in part (iii). Thus even a quotient of a rank-two free group need not admit a finite presentation. A quotient by a finitely normally generated kernel would be finitely presented, but the assertion places no such restriction on its kernel.

A topological group module $A$ is a topological abelian group with a jointly continuous action of $G$ by group automorphisms. Its continuous cochains with topological coefficients arewith pointwise addition. The inhomogeneous differential isFor $n=0$, this means $(da)(g)=ga-a$. Continuity of multiplication and of the action ensures that $d$ preserves continuous cochains. Expanding $d(dc)$ gives cancellation in pairs: the two orders of multiplying neighbouring arguments agree by associativity, and the two ways of applying the action agree by its action law. Thus $d^2=0$. The cocycles are $Z^n=\ker (d:C^n\to C^{n+1})$ and the coboundaries are $B^n=\mathrm{im}(d:C^{n-1}\to C^n)$, with $B^0=0$. DefineFor general topological coefficients this is an algebraic quotient of the continuous cochains; its optional quotient topology need not be Hausdorff. For discrete coefficients it is the usual continuous cohomology of a profinite group. In degree zero it is the subgroup of invariant elements.

Give the discrete prime field ${\mathbb{F}}_p$ its trivial $G$-action. The one-cocycle condition becomes $c(gh)=c(g)+c(h)$ and every one-coboundary is zero. HenceEvery such group homomorphism kills powers and group commutators, hence their closure $\Phi (G)$, and every continuous functional on the quotient pulls back. If $G$ is topologically finitely generated, $V=G/\Phi (G)$ is a finite elementary abelian group. To verify finiteness without assuming it, the closure of a subgroup generated by $r$ elements of this abelian exponent-$p$ quotient has at most $p^r$ elements; a finite subgroup is already closed. Thus $V$ is a finite-dimensional vector space. Question 2 says that a generating family of $G$ is minimal precisely when its images give a basis of $V$. The dual space has the same finite dimension. This proves

There is a genuine missing hypothesis if the printed assertion is read for arbitrary pro-p groups and $d(G)$ means the least cardinality of any dense generating family. Here is an explicit infinite-rank failure of the first-cohomology generator formula. Let $I=\{0,1{\}}^{\mathbb{N}}$ and $G={\prod }_{r\in I}{\mathbb{F}}_p$. Enumerate the finite binary strings as $s_1,s_2,\dots$ and define $g_n(r)=1$ if $s_n$ is a prefix of $r$, and $0$ otherwise. For finitely many distinct sequences $r_1,\dots ,r_k$, choose long enough prefixes to distinguish each individually. The corresponding $g_n$ project onto the coordinate unit vectors of ${\mathbb{F}}_p^k$, so $⟨g_n:n\ge 1⟩$ surjects onto every finite coordinate projection and is dense in the product topology. No finite family can generate densely, since a finitely generated abelian exponent-$p$ subgroup is finite and closed. Thus $d(G)={\aleph }_0$. On the other hand, continuity of a linear functional to ${\mathbb{F}}_p$ means its kernel contains a basic neighbourhood, so it depends on finitely many coordinates. The coordinate projections are consequently a basis of the continuous dual space, givingThe unrestricted infinite-rank formula is false. A convention requiring a generating basis tending to the identity is different from the printed unrestricted topological generator count; the finite-rank identity proved above has no such ambiguity.

For finite $X$, a free pro-p group $F_p(X)$ is characterized by the universal property that every map $X\to P$ to a pro-p group extends uniquely to a continuous group homomorphism $F_p(X)\to P$. It is the pro-p completion of the abstract free group on $X$: each map to a finite $p$-group factors through one of the defining finite quotients, and passing to the inverse limit gives the extension to any pro-p group; uniqueness follows from density. This unrestricted universal property can also define the completion on an arbitrary set $X$. When using an infinite basis required to tend to the identity, one instead imposes the universal property only for maps tending to the identity. Only the finite-rank version is needed for the following argument.

A finite pro-p presentation is an isomorphismThere are finitely many generators and finitely many relators, and the denominator is their closed normal closure. The relators are elements of the free pro-p group; they may be limits of ordinary words. That distinction is important when writing conjugation relations below.

Now suppose $K{⊴}_{o}G$ has a finite pro-p presentation with generators $k_1,\dots ,k_a$ and relators $R_1,\dots ,R_t$. The quotient $Q=G/K$ is a finite p-group. Choose a finite finite pro-p presentation $Q=⟨{\bar{y}}_1,\dots ,{\bar{y}}_b\mid S_1,\dots ,S_c⟩$. Such a presentation exists, for example by using its entire finite multiplication table. Lift the quotient generators to $y_j\in G$. For every $i,j$, choose elements $W_{ij},V_{ij}$ of the free pro-p group on the $x_i$ that map respectively to $y_j^{-1}{k}_i{y}_j$ and $y_j{k}_i{y}_j^{-1}$ in $K$. Choose $U_{\ell }(x)$ mapping to $S_{\ell }(y)$, which lies in $K$. Form the finite finite pro-p presentationAll listed relations hold in $G$, giving a continuous surjective group homomorphism $P\to G$: its compact image contains $K$ and maps onto $Q$.

Let $X$ be the closed subgroup of $P$ topologically generated by the $x_i$. Both conjugation directions were included, so each $y_j$ normalizes $X$. The $x_i$ also normalize it, and its closed normalizer contains the generators of $P$. Thus $X⊴P$. The relations $R_h$ give a continuous surjection $K\to X$. Its composite with $X\to K$ induced by $P\to G$ fixes every $k_i$, and hence is the identity. Therefore the surjection $K\to X$ is injective as well, so $X\cong K$. On quotienting by $X$, the conjugation and kernel relations disappear, and the remaining presentation is exactly $⟨y_1,\dots ,y_b\mid S_1,\dots ,S_c{⟩}_{\mathrm{pro}\text{-}p}=Q$. Thus $P/X\to G/K$ is an isomorphism. The kernel of $P\to G$ lies in $X$ and meets $X$ trivially, so is trivial. Consequently $P\cong G$, proving

Consider the Möbius transformationsTheir group lies in ${\mathrm{PSL}}_2(\mathbb{Z})$, which is a discrete subgroup of the Möbius group: integer entries cannot approach the identity matrix except by eventually equalling it, and passing to the quotient by $\{I,-I\}$ preserves this property.

For freeness let $X=\{x\in \mathbb{R}:|x|>1\}$ and $Y=\{x\in \mathbb{R}:|x|<1\}$. For every nonzero integer $n$, $A^n(Y)=(2n-1,2n+1)\subset X$ andA reduced word involving both generators can be conjugated to a cyclically reduced word beginning with $A^n$ and ending with a nonzero power of $B$, after interchanging the generators if necessary. Repeated use of these inclusions shows that this word sends $X$ into the proper subset $A^n(Y)$ of $X$, so it cannot be the identity. Nonzero pure powers of either generator are also nonidentity. This is the ping-pong lemma in this particular action, and proves that $\boxed{⟨A,B⟩\cong F_2}$ is a free group of rank two as well as a discrete subgroup of ${\mathrm{PSL}}_2(\mathbb{C})$.

Fix a bounded tile in Euclidean space $\Omega$ with labelled flat boundary faces. For each face label $s$, encode an assembly of $n$ copies by an involutive real symmetric signed permutation matrix $M_s$: a paired interface contributes a two-by-two swap, an unglued face with a Neumann boundary condition contributes $+1$ on the diagonal, and an unglued face with a Dirichlet boundary condition contributes $-1$. Use the same face-identification convention on each copy. If a second assembly has matrices $N_s$ and there is an invertible constant matrix $C$ satisfyingthen the map $u=(u_1,\dots ,u_n)\mapsto Cu$ is an isomorphism between corresponding Laplace-Beltrami operator eigenspaces. This is the transplantation theorem.

To prove it, restrict an eigenfunction to the tile copies and identify each copy with $\Omega$. Along a face, let $a$ be its vector of boundary values and $b$ its vector of outward normal derivatives. At a glued interface the values agree and the outward derivatives are opposite. At an unglued face with a Neumann boundary condition the derivative vanishes, and at a face with a Dirichlet boundary condition the value vanishes. All three cases are encoded byThe intertwining identities give $N_s(Ca)=Ca$ and $N_s(Cb)=-Cb$, so the transplanted function satisfies the second assembly's interface and boundary conditions. On each tile its Laplace-Beltrami operator is the same constant linear combination of the original Laplacians, hence it has the same eigenvalue. Across an interface, matching values and opposite normal derivatives make it a weak solution; elliptic regularity, or the allowed reflection principle, makes it a genuine smooth solution there. At corners the operator is understood by its finite-energy, Friedrichs extension; the same matching argument applies to its quadratic form domain. Applying $C^{-1}$ reverses the construction. Thus dimensions of all eigenspaces agree, including multiplicities, and the two specified boundary-value spectra coincide.

The requested pair exists with explicitly specified mixed boundary conditions and polygonal boundary. Take four copies $Q_0,Q_1,Q_2,Q_3$ of an octagonal regular polygon in Euclidean space. Label four alternate sides $a,b,c,d$ in cyclic order; the four intervening sides always have a Neumann boundary condition. The labelled sides are disjoint even at their endpoints. Parameterize every side in the positive boundary direction of the reference octagon. When pairing same-labelled sides, identify equal parameters. This produces a locally flat surface with boundary: a neighbourhood of an interior point of an interface consists of two half-disks glued along their diameters. All tile vertices remain boundary points, with boundary angles $3\pi /4$ or $3\pi /2$; there are no interior cone points.

Here are the complete gluing and boundary conditions. An entry $ij$ pairs the corresponding sides of $Q_i,Q_j$. The indicated unpaired sides have a Dirichlet boundary condition; every other unpaired side has a Neumann boundary condition.Both assemblies are compact and connected. The Laplace-Beltrami operator is the nonnegative operator $P=-\Delta$ associated with the finite-energy quadratic form $\int |\nabla u{|}^2$, with zero Sobolev trace on the specified Dirichlet arcs. Thus the mixed boundary condition is defined without requiring classical differentiability at a corner or at a Dirichlet–Neumann junction.

The four signed permutation matrices for $D$ areFor $B$ they areUse the Hadamard matrixThe intertwining relations can be checked on all columns at once. Writing the columns of $C$ as $h_0,h_1,h_2,h_3$, direct application of the displayed $N_s$ givesFor the four intervening faces both assemblies have the identity face matrix, so these intertwining relations hold as well. Also $C^{T}C=C^2=4I$. This four-tile mixed-boundary transplantation between a disk and a nonorientable surface gives a bijection of every pair of eigenspaces, preserving eigenvalues and multiplicities.

There is also a direct argument on the quadratic form domains that handles all boundary corners. The orthogonal matrix $U=C/2$ acts on tile restrictions, preserves their L2 inner product and the sum of their Dirichlet energies, and commutes with taking a Sobolev trace. The condition $M_{s}u=u$ on each face encodes equality of the two traces at a paired interface and vanishing trace at an unpaired Dirichlet face. Intertwining takes these conditions exactly to $N_s(Uu)=Uu$. Consequently $U$ maps the whole form domain onto the other form domain and preserves its quadratic form. The associated self-adjoint operators are unitarily equivalent, proving isospectrality for the stated mixed boundary conditions without any assumption of smoothness at a Dirichlet–Neumann junction.

We now verify the actual topology using the topology of disk tiles glued along disjoint boundary arcs. Because the gluing arcs in each tile are disjoint, the resulting surface with boundary is a thickening of its gluing graph, with one vertex for each closed disc tile and one edge for each paired arc. One can construct this homotopy equivalence by taking a small central closed disc in each tile and narrow strips to its paired arcs. What remains is a collar neighbourhood of the boundary, which retracts onto this connected system of closed discs and strips. Shrinking each central closed disc and each strip then gives the gluing graph. Equivalently, begin with a spanning tree of the gluing graph: its closed disc tiles joined along boundary arcs form one closed disc, and every remaining pair of boundary arcs adds one band. Thus for $n$ tiles and $e$ paired arcs the fundamental group is a free group of rank $e-n+1$, and the Euler characteristic is $n-e$.

For $D$, the gluing graph is the pathGluing a new closed disc to a closed disc along one boundary arc again gives a closed disc; applying this three times proves that $D$ is homeomorphic to a closed disc. In particularFor $B$, the five paired arcs give the graph edges $13,12,02,01,23$. It is connected, and henceHere $F_2$ is the free group on two generators, so $B$ is not simply connected. To decide orientation of a surface, give every reference tile its counterclockwise orientation. Our same-parameter gluing preserves boundary directions, so a global orientation requires opposite orientation signs on paired tiles: the two induced boundary orientations at an interior interface must be opposite. Such signs exist exactly when the gluing graph is bipartite. In $B$ the cyclehas length three. Following it forces the sign to reverse three times and return to its starting tile with the opposite sign. This proves that $B$ is a nonorientable surface. It has nonempty boundary because every intervening octagon side remains unpaired. Thus $D$ is a simply-connected orientable surface with boundary, whereas its isospectral partner $B$ is neither simply connected nor orientable, exactly as required, for the specified mixed boundary problem.

The boundary qualification is essential. With smooth boundary and the same pure Dirichlet boundary condition or pure Neumann boundary condition on both surfaces, the following existing obstruction applies. Polygonal corners and the mixed boundary conditions in the construction above place it outside that obstruction.

With the interpretation of compact smooth Riemannian surfaces with the same pure Dirichlet boundary condition or pure Neumann boundary condition, the printed simply-connected/nonorientable pair cannot exist. The two-dimensional heat trace has the following expansion (the smooth-boundary coefficients are given in the heat-coefficient formulas, Theorems 5.1–5.2):where the boundary sign is minus for Dirichlet and plus for Neumann. The Gauss-Bonnet theorem identifies the constant term with $\chi (M)/6$. Isospectrality therefore forces equal Euler characteristics. A compact connected simply-connected surface with boundary is a disk and has $\chi =1$. A connected nonorientable surface with $c\ge 1$ crosscaps and $b\ge 1$ boundary components has $\chi =2-c-b\le 0$. Thus no such smooth pure-Dirichlet or pure-Neumann pair exists. This is the Euler characteristic from the heat trace of a bordered surface.

Piecewise-smooth boundaries introduce corner terms, and mixed boundary conditions change the heat coefficients, as the explicit construction above demonstrates. Moreover, in the usual pure-Neumann polygonal reflection-transplantation setup, the pure Neumann reflection transplantation preserves Euler characteristic argument applies even with corners. The numbers of tiles agree. For each face label the number of edge classes is $(n+\mathrm{tr}{M}_s)/2$, so these agree too. For each tile-vertex label, vertex classes are orbits of the subgroup generated by incident-face involutions. Their number is the dimension of invariant vectors in that permutation representation, which is unchanged by the intertwiner. Hence the numbers of vertices agree, proving equal $V-E+F$. Thus this standard tiled construction also cannot supply a disk on one side and a nonorientable surface on the other.

For comparison, the following existing construction gives an orientable and a nonorientable pair with the same spectrum for the pure Neumann boundary condition. Both have nontrivial fundamental groups; this is a separate example, not the construction used to meet the simply-connected requirement above. This eight-tile Neumann transplantation across orientability makes the comparison explicit. The finite seed is the affine modulo-eight example in the original orientability construction; the intertwiner and the topology checks are derived below. Take eight copies of a regular Euclidean hexagon and label three pairwise nonadjacent sides $\sigma ,t,u$. Every remaining side is a side with a Neumann boundary condition. Index the copies by $j\in \mathbb{Z}/8\mathbb{Z}$. For the first assembly pair same-labelled faces according tofor the second, usewith all arithmetic modulo eight. A fixed point means an unglued side with a Neumann boundary condition. Pair faces by the reflection convention, matching the same endpoint parameter in the reference tiles. The distinguished sides are disjoint, so no interior vertex singularities are created; the resulting surfaces have polygonal boundary corners.

Let $R{e}_j=e_{j+1}$ on the eight-dimensional tile-index space and setIt commutes with the permutation matrices for $t$ and $\sigma$, because its coefficients are invariant under reversing cyclic order. For $u_1,u_2$, write $C_{ij}=c_{i-j}$, where $c_0=c_4=1$, $c_1=c_7=2$, and all other $c_r$ vanish. The required relation $C{M}_{u_1}=M_{u_2}C$ is exactly $c_r=c_{3r+4}$, verified from these four nonzero entries. Thus all three intertwining relations hold.

The cyclic Fourier vectors diagonalize $C$. Its eigenvalues arenamely $6,2\sqrt{2},2,-2\sqrt{2},-2,-2\sqrt{2},2,2\sqrt{2}$. None is zero, so $C$ is invertible and the two assemblies are isospectral manifolds for the Neumann boundary condition.

We prove their topology as well. Their gluing graphs are connected: the first contains the spanning path $0,1,3,6,2,7,5,4$, and the second contains the spanning cycle $0,1,7,2,6,3,5,4,0$. Each has eight tile vertices and ten paired-face edges. Since tiles are disks and gluing arcs are disjoint, each surface retracts up to homotopy to this multigraph; thus its Euler characteristic is $8-10=-2$ and its fundamental group is a free group of rank three.

An orientation assigns a sign to each reference tile, and a reflection gluing requires opposite signs at the ends of every graph edge. The second graph admits this assignment: take sign $+$ on $\{0,5,6,7\}$ and sign $-$ on $\{1,2,3,4\}$. Every paired face joins opposite signs, proving orientability. In the first graph the cyclehas odd length. Transporting orientation around it reverses the initial sign, proving nonorientability. Hence the first surface is also not simply connected. The second surface is orientable but likewise not simply connected; the disk required in the question is supplied instead by the four-tile mixed-boundary construction above.

The four-tile construction resolves the printed simply-connected requirement under explicit mixed boundary conditions. The eight-tile comparison only concerns orientation of a surface under a pure Neumann boundary condition.

Let $H_k$ be the open hyperbolic half-plane beyond ${\gamma }_k$, opposite the central region $U$. These three half-planes have disjoint closures in the disk, and hyperbolic reflection $J_k$ exchanges $H_k$ and its complementary half-plane. In particular $J_k(U^{\circ })\subset H_k$ and $J_i(H_j)\subset H_i$ when $i\ne j$. A reduced nonempty reflection word therefore sends an interior point of $U$ into the half-plane corresponding to its first letter. It cannot be the identity. This ping-pong lemma argument proves that the reflection group isThe usual reflection tiling makes $U$ a fundamental domain for $W$: successive reflection across an offending side reduces a point to $U$, and the disjoint-side configuration yields locally finite tiles. Equivalently this is the disjoint-geodesic case of the reflection fundamental-domain theorem; there are no vertex relations because the sides never meet.

The orientation-preserving subgroup consists of even words. Every pair $J_i{J}_j$ can be expressed in $A=J_2{J}_1$ and $B=J_3{J}_2$: the other nontrivial pairs are their inverses and $J_3{J}_1=BA$, $J_1{J}_3=A^{-1}{B}^{-1}$. Thus it is exactly $G$. A fundamental set is $U\cup J_{2}U$, with one representative chosen on each paired side; its interior is a fundamental domain. To see there are no relations between $A,B$, the reflection-word tree has vertices the reduced words and edges joining $w$ to $w{J}_i$. The even subgroup acts freely on this tree; its quotient has two vertices joined by three edges. Choosing the $J_2$ edge as a spanning tree leaves two independent loops, represented by $A$ and $B$. Reduced loops in a graph form a free group, soThe quotient is the double of the central three-sided region along its geodesic sides: an orientable pair of pants, topologically a sphere with three points removed. Its three ends are hyperbolic funnels, not cusps, because the sides are ultraparallel and the peripheral transformations have positive translation lengths. The compact convex core has three geodesic boundary circles; the complete quotient itself has no boundary.

A Kleinian group is a discrete subgroup of ${\mathrm{PSL}}_2(\mathbb{C})$, acting by Möbius transformations on the Riemann sphere, equivalently by orientation-preserving isometries of hyperbolic space ${\mathbb{H}}^3$.

Consider the classes ofThey generate a discrete subgroup because their matrix representatives have integer entries: a sequence of such matrices converging to $I$ or $-I$ is eventually constant. On the real projective line set $X=\{x:|x|>1\}\cup \{\infty \}$ and $Y=\{x:|x|<1\}$. For every nonzero integer $m$,The last inclusion follows from $|2mx+1|\ge 2|x|-1>|x|$ when $|x|>1$; also $B^m(\infty )=1/(2m)\in Y$. The ping-pong lemma therefore says that the subgroup is the free product $⟨A⟩\ast ⟨B⟩$. Both generators have infinite order, soa free group on two generators. The ping-pong inclusions ensure that no nonempty reduced word can act as the identity, which is the essential freeness argument.

First realize the free isometric action. Choose generators $t_1,\dots ,t_r$ of the finitely presented group $T$. In every dimension $d\ge 3$, the connected sumhas fundamental group the free group $F_r$. Map its generators onto the $t_j$ and take the connected regular covering $N\to B_d$ corresponding to the kernel. Its deck transformation group is $F_r/\ker \pi \cong T$. Lift any Riemannian metric on $B_d$ to $N$. 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 $S^d$. If $T$ is infinite the covering manifold need not be compact, which is allowed in this first construction. Simple connectivity of $N$ is not being asserted here.

The requested nonhomeomorphism conclusion needs an extra hypothesis. For a counterexample even with distinct subgroups, take $T=S_3$, $U_1=⟨(12)⟩$ and $U_2=⟨(23)⟩$. They are conjugate and therefore Gassman equivalent. For every free isometric action of $T$, the conjugating element induces a Riemannian isometry $U_1\backslash N\to U_2\backslash N$. These quotients cannot be nonhomeomorphic. Identical subgroups give an even simpler obstruction. Thus the stated equivalence condition alone cannot imply the claimed topology.