betaFeedback

WorksMathematics

No free lattice contains an infinite ascending chain of copies of FL(3)

Abstract

No free lattice contains an infinite strictly ascending chain of sublattices isomorphic to FL(3), the free lattice on three generators; this answers a question that R. A. Dean asked and the second author's 1997 notes on the problem left open. Every such chain would yield, inside FL(3), a coherent chain of proper self-embeddings Θ0,Θ1,Θ2,…Θ_0, Θ_1, Θ_2, \dots with Θk∘Θj=ΘjΘ_k \circ Θ_j = Θ_j for j<kj < k, so that each later embedding fixes the image of each earlier one pointwise. Every proper self-embedding of FL(3) whose fixed sublattice contains a free generating triple fixes one of the three generators, say zz, because a power of it or of its dual lies above the identity, and a self-embedding that moves every generator and lies above the identity fixes at most eleven elements. Up to duality, a proper self-embedding fixing the image of such a Θ1Θ_1 pointwise fixes only elements above z∧(x∨y)z \wedge (x \vee y), where no free generating triple containing zz can lie. We also verify the one-step example of the 1997 notes, prove that no step toward such a chain is self-similar, and show that the configuration the argument rules out at length three does occur at length two. Without freeness the answer reverses: FL(3) contains an infinite strictly ascending chain of 3-generated sublattices, so the lattice analogue of Takahasi's chain condition for free groups fails. The theorem itself is checked by the Agda proof assistant under its safe flags, for free lattices over generators with decidable equality, and its formal proof uses no classical principle: finite searches and an induction on a finite set replace the infinite pigeonhole principle by which a chain yields a coherent chain.

In memory of R. A. Dean (1924–2022).

2020 Mathematics Subject Classification. Primary 06B25; Secondary 03B35.

Whitman’s solution to the word problem

Free generating sets

Canonical form

Embeddings and canonical joinands

Complexity under embeddings

The one-step example

Where the new generators can sit

The nine generators and the twelve relations

The verification

The step seen from inside

Chains as sequences of self-embeddings

The self-similar case

The variant without freeness

No step is self-similar

Coherent chains and the fixed-sublattice question

The transitions of a chain

Theorem C: the finite forms

Theorem C: the coherent form

The fixed-sublattice question

Three facts about fixed sublattices

Self-embeddings with a fixed free triple

Inflationary self-embeddings and duality

Four lemmas

The fourteen elements

Theorem E

Rigidity, and the answer

A first form

Lemma 5 and Theorem G

What is checked where

The almost-proof

The argument

The truncation theorem

Lemma 2 of the notes in any lattice, and the gap as a predicate

The verdict on the one-step example

What survives

The formal development

What is checked, and how

How the development and the proofs were produced

Where each statement lives

The cost

The searches

Remarks and questions

Acknowledgments

References

The problem, its history, and the theorem

Let FL(X)\mathrm{FL}(X) be the free lattice on a set XX of generators, FL(n)\mathrm{FL}(n) the free lattice on nn generators, often labeled x1,…,xnx_1,\ldots,x_n, and FL(3)=FL({x,y,z})\mathrm{FL}(3)=\mathrm{FL}(\{x,y,z\}). A copy of FL(3)\mathrm{FL}(3) in a lattice LL is a sublattice of LL isomorphic to FL(3)\mathrm{FL}(3).

R. A. Dean asked the following question in an email shortly after the publication, in 1995, of the monograph Free Lattices [13] by Freese, Ježek and Nation:

Dean’s problem. Is there a free lattice FL(X)\mathrm{FL}(X) with sublattices L0⊊L1⊊L2⊊⋯L_0 \subsetneq L_1 \subsetneq L_2 \subsetneq\cdots, every LkL_k isomorphic to FL(3)\mathrm{FL}(3)?

Dean had retired from Caltech in 1987, and the second author, at work with Nation on free lattices, had tried to reach him and found no address. The book reached him, and his email said that of the outstanding problems on free lattices he knew of, only this one was still open.

The second author’s survey of free lattices, Appendix G of Grätzer’s General Lattice Theory [11 p. 578], records the problem as follows: “In a recent communication, R. A. Dean informed me of an old problem in free lattice theory: can a free lattice have an ascending chain of sublattices all isomorphic to FL(3)\mathrm{FL}(3)? This problem did not appear in print and I was unaware of it.”1

The second author also wrote “Notes on Dean’s problem” [10]; these include an example of one step of such a chain, show that the obvious attack on the problem fails, and provide an “almost proof” that an ascending chain cannot exist. As far as we know, Appendix G of Grätzer’s book is the only place the problem appears in print. This paper answers the question.

Theorem H (Dean’s problem). No free lattice contains an infinite strictly ascending chain of sublattices isomorphic to FL(3)\mathrm{FL}(3).

The shape of the question

The sublattices of free lattices have been studied since Whitman’s two papers [23, 24], which solved the word problem for FL(X)\mathrm{FL}(X), found the canonical form of its elements, and showed that FL(3)\mathrm{FL}(3) contains a copy of FL(ω)\mathrm{FL}(\omega), the free lattice on countably many generators; the monograph [13], which we cite as FJN and by theorem number throughout, tells the history in its introduction.

Dean, Jónsson, Galvin and Kiefer took the subject up in the 1950s and 1960s, with the finite sublattices as a main interest. Jónsson and Kiefer proved that free lattices, hence all their sublattices, are semidistributive, and that a finite lattice satisfying Whitman’s condition (W) (§ 13.2) has breadth at most four, so that the finite sublattices of a free lattice satisfy a nontrivial lattice equation [18] (FJN, Theorems 1.21 and 1.30 and Corollary 1.31). Dean’s paper on sublattices of free lattices [5] shows, among other things, that the lattice freely generated by any countable ordered set embeds in FL(3)\mathrm{FL}(3) (FJN, Chapter V, Section 2). Jónsson conjectured that a finite lattice embeds in a free lattice if and only if it is semidistributive and satisfies (W), and Nation proved it [20] (FJN, Theorem 5.55).

So the finite sublattices of a free lattice are characterized. Dean’s question concerns the infinite ones, specifically FL(3), which contains a copy of every countable one; it asks how the copies of FL(3) inside a free lattice can sit inside one another. Read inside FL(3) (Theorem C), the answer is a statement about its self-embeddings: no infinite sequence of proper self-embeddings of FL(3) has each later one fixing the images of all earlier ones pointwise (Corollary 6.4).

Three classical facts, all from FJN, fix the question’s shape.

  1. Whitman proved that FL(ω\omega), the free lattice on countably many generators, embeds in FL(3) (FJN, Theorem 1.28). Hence if one free lattice has such a chain then every FL(XX) with ∣X∣≥3|X| \ge3 does, and FL(3) is the only case. (For ∣X∣≤2|X| \le2 the free lattice is finite.)

  1. A descending chain is easy. FL(3) has proper sublattices isomorphic to itself (the elements x∨(y∧z)x \mathbin{\vee} (y \mathbin{\wedge} z), y∨(z∧x)y \mathbin{\vee} (z \mathbin{\wedge} x), z∨(x∧y)z \mathbin{\vee} (x \mathbin{\wedge} y) generate one, § 14.4), and iterating a self-embedding θ\theta with such an image gives FL(3)⊋θ(FL(3))⊋θ2(FL(3))⊋⋯\mathrm{FL}(3) \supsetneq\theta(\mathrm{FL}(3)) \supsetneq\theta^2(\mathrm{FL}(3)) \supsetneq\cdots. Figure 1 shows the two directions.

Figure 1. Left, the descending chain FL(3) ⊋\supsetneq θ(FL(3))\theta(\mathrm{FL}(3)) ⊋\supsetneq θ2(FL(3))\theta^2(\mathrm{FL}(3)) ⊋⋯\supsetneq\cdots that a proper self-embedding θ\theta of FL(3) gives; right, the ascending chain L0⊊L1⊊L2⊊⋯L_0 \subsetneq L_1 \subsetneq L_2 \subsetneq\cdots of copies of FL(3) in a free lattice that Dean asks for.

  1. A copy of FL(3) inside FL(XX) determines its triple of free generators up to order, so a copy and its free triple are the same datum: the free generators of a free lattice are its elements that are both join prime and meet prime, and the automorphisms of FL(XX) are the permutations of XX (FJN, Lemma 1.4 and Corollaries 1.5 and 1.6).

The obvious attack fails. Suppose ⟨a,b,c⟩⊆⟨a′,b′,c′⟩\langle a,b,c\rangle\subseteq\langle a',b',c'\rangle, where ⟨S⟩\langle S\rangle denotes the sublattice generated by SS and both triples freely generate copies of FL(3). Then aa, bb, cc are lattice terms in a′a', b′b', c′c', and one might hope that a′a', b′b', c′c' must occur as subterms of aa, bb, cc, which would force a chain to stabilize, since a term has finitely many subterms. The one-step example of the 1997 notes (verified here in § 14) shows that hope is false: each new generator in the step has complexity 4 and each old one complexity 3, and the notes add that the new generators may be chosen as complex as one likes.

Finite ascending chains of every length exist trivially. (Read the chain of (ii) upward, starting from θn(FL(3))\theta^n(\mathrm{FL}(3)).) The content of the question is the infinite chain.

The shape of the proof

Fix a chain L0⊊L1⊊⋯L_0 \subsetneq L_1 \subsetneq\cdots in FL(X)\mathrm{FL}(X) with isomorphisms φk:FL(3)→Lk\varphi_k:\mathrm{FL}(3)\to L_k. Reading the inclusion Lj⊆LkL_j\subseteq L_k through the isomorphisms gives, for j≤kj\leq k, an injective endomorphism θj,k=φk−1∘φj\theta_{j,k}=\varphi_k^{-1}\circ\varphi_j of FL(3)\mathrm{FL}(3), which is onto if and only if j=kj=k. The argument has four parts, which we now sketch. Figure 2 shows which of these results each proof uses. Nonstandard terms used here are defined in the sequel.

Results on the way to Theorem H

Figure 2. The results on the way to Theorem H: an arrow runs from a result to each proof that cites it, and the proof of Theorem H is the constructive one of Remark 8.2. The results of § 13, which every part uses, are left out, and so is Lemma 6.10, that a self-embedding of FL(3)FL(3) fixing two generators is the identity, which the proofs of Lemma 2 and Lemma 8.1 cite.

  1. Theorem B. A lattice embedding never lowers the complexity of an element, the depth of its canonical form.

Since φ0=φk∘θ0,k\varphi_0=\varphi_k\circ\theta_{0,k}, the complexity of θ0,k(g)\theta_{0,k}(g) is at most that of φ0(g)\varphi_0(g) for each generator gg, so the maps θ0,k\theta_{0,k} take finitely many values, and two of them coincide, θ0,j=θ0,k\theta_{0,j}=\theta_{0,k} with j<kj<k; then θj,k\theta_{j,k} is a proper self-embedding of FL(3)\mathrm{FL}(3) that fixes the copy θ0,j(FL(3))\theta_{0,j}(\mathrm{FL}(3)) of FL(3)\mathrm{FL}(3) pointwise. By a diagonal argument the whole chain is, on a subsequence, a coherent chain (Definition 6.2) of proper self-embeddings Θ0,Θ1,Θ2,…\Theta_0,\Theta_1,\Theta_2,\ldots of FL(3)\mathrm{FL}(3) with Θk∘Θj=Θj\Theta_k\circ\Theta_j=\Theta_j for j<kj<k (the coherent form of Theorem C); we call the LkL_k the links of the chain and the Θk\Theta_k those of the coherent chain. The diagonal argument uses the infinite pigeonhole principle, but the proof needs only a coherent chain of length three, and four links Li⊊Lj⊊Lk⊊LlL_i\subsetneq L_j\subsetneq L_k\subsetneq L_l with θi,j=θi,l\theta_{i,j}=\theta_{i,l} and θj,k=θj,l\theta_{j,k}=\theta_{j,l} give one (the four-link form of Theorem C).

  1. Theorem E. Every proper self-embedding of FL(3)\mathrm{FL}(3) whose fixed sublattice contains a free triple fixes one of the generators.

A positive power of such a self-embedding, or of its dual, is inflationary, lying above the identity (§ 18.1, Proposition 7.4), and the engine of the proof is a count: the elements of FL(3)\mathrm{FL}(3) whose canonical trees have no generator among the meetands of any meet are fourteen (Proposition 7.2, a proof, not a computation), every fixed point of an inflationary self-embedding that moves every generator is one of the eleven that are not generators (Proposition 7.3), and a fixed free triple supplies fixed points of arbitrarily large complexity.

  1. Lemma 5. Every fixed point of an inflationary self-embedding that fixes zz and moves xx and yy lies above c=z∧(x∨y)c=z\wedge(x\vee y).

  1. Theorem G. There is no coherent chain of length three.

In a coherent chain of length three, Θ1\Theta_1 fixes a generator, say zz, and a power of Θ2\Theta_2 or of its dual is such a self-embedding fixing Θ1(FL(3))\Theta_1(\mathrm{FL}(3)). In the first case Θ1(y)≥c\Theta_1(y)\geq c by (3), while Θ1(x)≤x∨y\Theta_1(x)\leq x\vee y by the partition lemma at zz (§ 13.2), so Θ1(x)∧Θ1(z)≤(x∨y)∧z=c≤Θ1(y)\Theta_1(x)\wedge\Theta_1(z)\leq(x\vee y)\wedge z=c\leq\Theta_1(y), which the free triple Θ1(x),Θ1(y),Θ1(z)\Theta_1(x),\Theta_1(y),\Theta_1(z) forbids; the dual case is the same argument for the dual of Θ1\Theta_1.

Parts (2) to (4) are finite. Part (1) is not, as stated, but the proof needs only the four-link form of Theorem C, and finite searches with an induction on the number of values of θ0,⋅\theta_{0,\cdot}, replace the infinite pigeonhole principle (Remark 8.2). So Theorem H itself has a complete constructive formalization in the Agda proof assistant, for free lattices over generators with decidable equality, which classically is every free lattice; § 21 says exactly what is formally verified, and at which commit of the release of the Agda repository that accompanies the paper.

We note that the configuration part (4) rules out at length three does occur at length two: there is a proper self-embedding of FL(3)FL(3) fixing a free triple pointwise (Theorem D), so no shorter argument of this kind is available.

Free groups

Free lattices do not, in general, behave like free groups, but the analogue of Dean’s question for free groups also has a negative answer. Takahasi [21] and, independently, Higman [15] proved that an ascending chain of subgroups of bounded rank in a free group stabilizes, as Takahasi’s later note recalls [22]. So the analogue, with copies of the free group of rank three in place of copies of FL(3)FL(3), has a short answer, and that answer does not need the links to be free, since every subgroup of a free group is free.

The argument of Takahasi’s note bounds the lengths of the free generators of a subgroup UU containing a finitely generated subgroup HH by the lengths of of the generators of HH, provided no proper free factor of UU (a subgroup generated by part of a free basis of UU) contains HH [22 Theorem 2]. In a free lattice the analogous bound fails, although the corresponding proviso is automatic there: two of the free generators of a copy of FL(3)FL(3) generate a finite sublattice, which contains no copy of FL(3)FL(3). In the one-step example of § 14, each generator of the larger copy of FL(3)FL(3) has complexity 4 and each generator of the smaller one complexity 3.

Freeness of the links is essential. Without it the answer reverses: FL(3)FL(3) contains an infinite strictly ascending chain of 3-generated sublattices, none of them isomorphic to FL(3)FL(3) (Theorem 4.5), so the lattice analogue of Takahasi’s chain condition fails. Theorem H is the statement that it holds when the links are free, that is, copies of FL(3)FL(3). Its proof rests on the monotonicity that does hold, Theorem B, which bounds not the generators of the links but the maps between them.

The analogy runs one step further. The fixed subgroup of an injective endomorphism of a free group of rank nn has rank at most nn [16, 3]. Whether the fixed sublattice of a proper self-embedding of FL(3)FL(3) is always finitely generated is open (§ 22); by Theorem D it can contain a copy of FL(3)FL(3).

What is new

The main contributions of the paper, beyond the answer to Dean’s question, are the following:

  • Theorem A, that an injective endomorphism of a free lattice which maps a finitely generated sublattice onto a superset of it maps it onto itself, closes the self-similar case: no chain is generated by one injective endomorphism of the ambient lattice, nor by its powers (Corollaries A1 to A3).

  • Theorem B, that a lattice embedding never lowers complexity, is Lemma 9.13 of FJN read level by level.

  • Theorem C sharpens the finiteness argument of the notes, in which only the pattern by which the generators of a later link cut the term trees of the bottom link’s generators, one of finitely many, recurs along the chain, to the recurrence of the whole term that expresses the bottom link in a later one, and in its coherent form it makes Dean’s problem equivalent to the existence of an infinite coherent chain (Corollary 6.4).

  • Theorem D answers the fixed-sublattice question (Question 6.7) positively: a proper self-embedding of FL(3)FL(3) can fix a copy of FL(3)FL(3) pointwise, so the route to a negative answer through that question is closed, and coherent chains of length two exist.

  • Theorem E and Corollary E1 describe every proper self-embedding with a fixed free triple: it fixes exactly one generator, and, up to duality and a power, it moves the other two up inside the ideal below their join.

  • Lemma 5 and Theorem G prove that every such self-embedding is rigid, in that no proper self-embedding fixes its image pointwise, so that no coherent chain of length three exists.

  • Theorem F is a first form of that rigidity, for a class of self-embeddings.

  • Theorem 4.5 shows that the freeness of the links cannot be dropped.

The one-step example is verified (§ 14), and the almost-proof of the notes is formalized up to its gap, which is stated as a decidable predicate (§ 20).

The formal development (§ 21) adds, besides the check of Theorem H and the other finite results above, in the forms § 21 states, a formalization of Whitman’s theory of free lattices, including his rules as an inductive relation on terms, proved sound and complete for the order of every lattice, so that the terms modulo the relation form FL(X)\mathrm{FL}(X), with a decidable order and the universal property; the canonical form, decided, and the refinement theorem (Theorems 2.6 and 2.7, in the forms § 21 states); free generation, decided by Corollary 2.5; Lemma 2.8; the embedding of FL(ω)\mathrm{FL}(\omega) in FL(3)\mathrm{FL}(3); and the fixed and periodic points of self-embeddings.

Whitman’s recursion has been run inside a proof assistant before: James and Hinze implemented it in Coq as a reflective tactic, proved sound for every lattice and terminating [17], and Guilloud and Pit-Claudel proved a sequent calculus for orthologic sound and complete for ortholattices in Coq, with a proof search of quadratic cost [14]. We know of no machine-checked proof that Whitman’s rules are complete, and none of the canonical form, of the structure of the sublattices of a free lattice, or of the fixed points of its self-embeddings, in Lean’s Mathlib, Isabelle’s Archive of Formal Proofs, the Rocq (formerly Coq) and Agda libraries on GitHub, and the Mizar Mathematical Library, searched by name and by full text in October 2026. As far as we know, our formal development is the first of each, and Theorem H is the first significant theorem about free lattices beyond the word problem to be checked by machine.

Section 2 collects what we use from [13] and proves Theorem B. Section 3 verifies the one-step example and reads its step from inside FL(3)\mathrm{FL}(3). Section 4 reformulates a chain as a sequence of self-embeddings and proves that the variant without freeness has a negative answer, and Section 5 proves that no step toward a chain is self-similar (Theorem A), which closes the approach a computer search would have followed. Section 6 proves Theorem C in its finite and coherent forms, states the fixed-sublattice question, and answers it positively (Theorem D). Section 7 proves Theorem E and Section 8 proves Lemma 5, Theorem G and Theorem H, the last both classically and constructively. Section 9 formalizes the almost-proof of the notes up to its gap and decides the gap on the one-step example, as the record of the path that was superseded. Section 10 describes the formal development: what it checks, section by section; how it and the proofs were produced; the name of each statement in the Agda source; what the checking costs; and which computer searches were run and what they found. § 22 lists what remains.

Preliminaries

Everything in this section is in Chapter I of FJN [13], except Lemma 9.13 of its Chapter IX, Theorem B, which is ours, and Lemma 2.9, an elementary count that FJN does not state. We state each result we use with its number in the book. Dually refers to the statement obtained by exchanging ∨\vee and ∧\wedge and reversing the order; the duals of an element of FL(3)\mathrm{FL}(3) and of a self-embedding are defined in § 18.1.

Terms, rank and complexity

A lattice term over XX is a generator x∈Xx \in X or a formal join t1∨⋯∨tnt_1 \vee\cdots\vee t_n or formal meet t1∧⋯∧tnt_1 \wedge\cdots\wedge t_n of terms, n>1n > 1. Its rank (FJN, Chapter I, Section 2, where it is also called the length) is 1 for a generator and one more than the sum of the ranks of t1,…,tnt_1,\ldots,t_n for a join or a meet; so x∨y∨zx \vee y \vee z has rank 4 and x∨(y∨z)x \vee(y \vee z) rank 5. Its complexity is 0 for a generator and one more than the largest complexity among t1,…,tnt_1,\ldots,t_n for a join or a meet: the depth of the term tree. The subterms of a term are defined as usual. A term tt over XX names an element tLt^L of any lattice LL with a map X→LX \to L; in FL(X)\mathrm{FL}(X) every element is named by a term, and we write s≤ts \leq t for sFL(X)≤tFL(X)s^{\mathrm{FL}(X)} \leq t^{\mathrm{FL}(X)}.

Whitman’s solution to the word problem

References

  1. [1]Agda Developers, Agda, 2026, version 2.9.0, not yet released: the development version at commit da66a8c (5 October 2026) of https://github.com/agda/agda; documentation at https://agda.readthedocs.io/.
  2. [2]Agda-native AIR, 2026-10-20, a private repository: agda-mcp across the seventeen sessions that wrote one formal development, 2026, a field report of the Agda-native AIR project, written by Claude Opus 5.5 (Anthropic) at the first author’s request from the sessions’ own records; the file docs/field-reports/2026-10-20-private-development-agda-mcp-use.md at commit 137d9fb (21 October 2026), https://github.com/formalverification/agda-native-air/blob/137d9fb/docs/field-reports/2026-10-20-private-development-agda-mcp-use.md.
  3. [3]Mladen Bestvina and Michael Handel, Train tracks and automorphisms of free groups, Ann. of Math. (2) 135 (1992), no. 1, 1–51. MR 1147956DOI
  4. [4]Matthew L. Daggitt, Guillaume Allais, James McKinna, Andreas Abel, Nathan van Doorn, James Wood, Ulf Norell, Donnacha Oisín Kidneỳ, Sergei Meshveliani, Sandro Stucki, Jacques Carette, Alex Rice, Jason Z. S. Hu, Li-yao Xia, Shu-Hung You, Reed Mullanix, and Wen Kokke, The Agda standard library: version 2.0, J. Open Source Softw. 10 (2025), no. 116, 9241, version 2.3 with the five changes it needs under Agda 2.9.0 is the tag v2.3-agda-2.9.0 of https://github.com/formalverification/agda-stdlib.DOI
  5. [5]R. A. Dean, Sublattices of free lattices, Lattice Theory (R. P. Dilworth, ed.), Proceedings of Symposia in Pure Mathematics, vol. II, American Mathematical Society, Providence, RI, 1961, pp. 31–42. MR 0133263DOI
  6. [6]William DeMeo, agda-deans-problem: the formal development of “No free lattice contains an infinite ascending chain of copies of FL(3)”, 2026, Apache-2.0, the repository ualib/agda-deans-problem on GitHub, released with this paper, to be archived on Zenodo at its tag; it pins agda-lattices at commit 41fb55e.
  7. [7]———, agda-lattices: lattice theory in Agda, 2026, Apache-2.0, at commit 41fb55e (30 October 2026, its release v0.2.0) of https://github.com/ualib/agda-lattices.DOI
  8. [8]———, Agda-native AIR: an Agda-native artificial intelligence reasoning environment, 2026, version 0.2.0, which includes the agda-mcp server, Apache-2.0, archived on Zenodo, https://doi.org/10.5281/zenodo.23378575; source at https://github.com/formalverification/agda-native-air/tree/v0.2.0.
  9. [9]William DeMeo and Jacques Carette, The Agda Universal Algebra Library (agda-algebras), 2026, the development version toward version 3.0, at commit b4d0ab6 (24 October 2026) of https://github.com/ualib/agda-algebras.
  10. [10]Ralph Freese, Notes on Dean’s problem, manuscript dated 29 July 1997, four pages, https://math.hawaii.edu/~ralph/Notes/DeansProb/dean.pdf.
  11. [11]——, Free lattices, General Lattice Theory, Birkhäuser, Basel, second ed., 1998, Appendix G of G. Grätzer’s book, pp. 575–590. MR 1670580
  12. [12]——, Free lattices, 2002, revised version of Appendix G of Grätzer’s General Lattice Theory, https://math.hawaii.edu/~ralph/Preprints/appendix.pdf.
  13. [13]Ralph Freese, Jaroslav Ježek, and J. B. Nation, Free lattices, Mathematical Surveys and Monographs, vol. 42, American Mathematical Society, Providence, RI, 1995. MR 1319815
  14. [14]Simon Guilloud and Clément Pit-Claudel, Verified and optimized implementation of orthologic proof search, Computer Aided Verification (CAV 2025), Part I (Ruzica Piskac and Zvonimir Rakamarić, eds.), Lecture Notes in Computer Science, vol. 15933, Springer, Cham, 2025, arXiv:2501.09418, pp. 130–152.arxiv.org/abs/2501.09418
  15. [15]Graham Higman, A finitely related group with an isomorphic proper factor group, J. London Math. Soc. 26 (1951), 59–61. MR 0038347DOI
  16. [16]W. Imrich and E. C. Turner, Endomorphisms of free groups and their fixed points, Math. Proc. Cambridge Philos. Soc. 105 (1989), no. 3, 421–422. MR 0985677DOI
  17. [17]Daniel W. H. James and Ralf Hinze, A reflection-based proof tactic for lattices in Coq, Trends in Functional Programming, Volume 10 (Zoltán Horváth, Viktória Zsók, Peter Achten, and Pieter Koopman, eds.), Intellect, Bristol, 2011, TFP 2009, Komárno; https://www.cs.ox.ac.uk/people/Ralf.Hinze/publications/TFP09.pdf, pp. 97–112.
  18. [18]Bjarni Jónsson and James E. Kiefer, Finite sublattices of a free lattice, Canad. J. Math. 14 (1962), 487–497. MR 0137667DOI
  19. [19]Keith A. Kearnes and Emil W. Kiss, The shape of congruence lattices, vol. 222, Memoirs of the American Mathematical Society, no. 1046, American Mathematical Society, Providence, RI, 2013.DOI
  20. [20]J. B. Nation, Finite sublattices of a free lattice, Trans. Amer. Math. Soc. 269 (1982), no. 1, 311–337. MR 0637041DOI
  21. [21]Mutuo Takahasi, Note on locally free groups, J. Inst. Polytech. Osaka City Univ. Ser. A 1 (1950), 65–70. MR 0041845
  22. [22]——, Note on chain conditions in free groups, Osaka Math. J. 3 (1951), 221–225. MR 0046362DOI
  23. [23]Philip M. Whitman, Free lattices, Ann. of Math. (2) 42 (1941), no. 1, 325–330. MR 0003614DOI
  24. [24]——, Free lattices II, Ann. of Math. (2) 43 (1942), no. 1, 104–115. MR 0006143DOI

Paper details

vlnc:W_a5vy4gvs
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude Fable 5.1 (bare), Claude Opus 5.5, GPT-6-Astra, Kimi K3 (bare)

View statement
Looking for related papers…
Contents