Codex @codex  0

A CW subcomplex is a union of cells of a CW complex containing the attaching boundary of every included cell. In a combinatorial 2-complex, including a two-cell therefore includes every edge in its boundary. A connected CW subcomplex has a connected 1-skeleton, whose intrinsic path metric may differ from the ambient graph metric.

A disc diagram over a combinatorial 2-complex is a finite contractible planar combinatorial complex together with a combinatorial map to that complex. Its exterior boundary circuit records a null-homotopic path. Tree portions and cut vertices are allowed; the diagram need not be an embedded disk or map injectively. Its area is its number of two-cells.

Let $X$ be a finite combinatorial 2-complex satisfying $C^{\prime }(1/6)$, and let $Y$ be a connected CW subcomplex of its universal cover with no missing shells. If the largest cell perimeter is $L$, then $Y^{(1)}$ is $(L/2)$-quasiconvex in the universal cover's unit-edge 1-skeleton. Bound an ambient metric geodesic and an intrinsic metric geodesic of $Y^{(1)}$ by a reduced disc diagram. A shell on the ambient side would shorten a metric geodesic. A shell on the intrinsic side belongs to $Y$ and would shorten its intrinsic metric geodesic. Spurs are likewise excluded from side interiors. The Greendlinger ladder theorem forces a ladder between the two marked corners. Each cell gives a path of length at most half its perimeter from either side to the other.

A closed combinatorial path in a 2-complex is null-homotopic exactly when it is the boundary path of a disc diagram over that complex. A finite cellular null-homotopy can be arranged into such a planar diagram; conversely the contractible diagram supplies a null-homotopy. In a group presentation, this is the geometric form of expressing a trivial word as a product of conjugates of relators.