Trac #34902: LatticePoset breadth, error in documentation

I got a mail about my posting in year 2017: "However, I read Stephan's
paper differently: He states that breadth k is equivalent  to containing
a Boolean lattice with k atoms (but none with k+1 atoms) as a subORDER,
and then states in his Lemma 1 that in the case k=3 this is the same as
subLATTICE."

Hence documentation of `breadth()` in `LatticePoset` containing

This can be also characterized by sublattices: a lattice of breadth at
least `$n$` contains a sublattice isomorphic to the Boolean lattice of
`$2^n$` elements.

must be changed to

This can be also characterized by subposets: a lattice of breadth at
least `$n$` contains a subposet isomorphic to the Boolean lattice of
`$2^n$` elements.

URL: https://trac.sagemath.org/34902
Reported by: jmantysalo
Ticket author(s): Frédéric Chapoton
Reviewer(s): Jori Mäntysalo

Author: Release Manager

build/pkgs/configure/checksums.ini

@@ -1,4 +1,4 @@
 tarball=configure-VERSION.tar.gz
-sha1=2b6bd1b9a065a92dd3b690353fe447a51282086c
-md5=5a2b0fbf6e801633ebeffa06a7c18814
-cksum=181357686
+sha1=fa75a547e057b288c375898e55174b5cabeb6604
+md5=3159229a565e92884da15971d99ed278
+cksum=2735701711

build/pkgs/configure/package-version.txt

@@ -1 +1 @@
-deed96d39acdd68f3f3b24f3139df0a6aa31a2b2
+1041dd26e41cfa00242dca4a3ee8c66e8e58aa55

src/sage/combinat/posets/lattices.py

@@ -1903,8 +1903,8 @@ def breadth(self, certificate=False):
         any join of elements `x_1, x_2, \ldots, x_{n+1}` is join of a
         proper subset of `x_i`.
 
-        This can be also characterized by sublattices: a lattice
-        of breadth at least `n` contains a sublattice isomorphic to the
+        This can be also characterized by subposets: a lattice
+        of breadth at least `n` contains a subposet isomorphic to the
         Boolean lattice of `2^n` elements.
 
         INPUT:
@@ -4300,7 +4300,7 @@ def is_constructible_by_doublings(self, type):
             return True
 
         if (type == 'interval' and len(self.join_irreducibles()) !=
-            len(self.meet_irreducibles())):
+                len(self.meet_irreducibles())):
             return False
 
         if type == 'upper' or type == 'interval':