For example if $J$ is a line segment with slope $1$ or $-1$ then $\Lambda(J)=\{0\}$. If $D$ is the line segment connecting points $(0,0)$ and $(2,1)$ then $\Lambda(D)=\{\frac{-3}5\}$. If $C$ is any continuum with non-empty interior then $\Lambda(C)=[-1,1].$ If $C$ is a circle then $\Lambda(C)=(-1,1).$ If $R$ consists of the edges of some rectangle (evenwith vertical and horizontal sides of positive length, and even when the interior is not included) then $\Lambda(R)=[-1,1].$
Although I do not know the answer to either (a) of (b), it is easy to see that parts (a) and (b) of the above question are equivalent. That (b) implies (a) is clear (as $K$ must be square-boxed if $\lambda(K)=0$), so we will indicate why (a) implies (b). Assume (a) and start with any hereditarily indecomposable plane continuum $C$, and then stretch it, either vertically or horizontally, to obtain a homeomorphic hereditarily indecomposable plane continuum $T$. By assumption (a), $T$ must have a square-boxed subcontinuum $L$. Now compress $T$ back onto $C$ (undoing exactly whatever whatever stretching was done), the result being that $L$ is transformed onto a subcontinuum $K$ of $C$, and and we could make $\lambda(K)$ to be any number $\lambda\in(-1,1)$, as we wish, by adjusting the amount (and direction) of stretching that was done.
Here is a sketch of the argument that
$\Lambda(C)$ must always be convex (for
any non-degenerate continuum $C$).
Suppose $\lambda_1,\lambda_2\in\Lambda(C)$
with $\lambda_1<\lambda_2$ and pick any
$\lambda$ with $\lambda_1<\lambda<\lambda_2$.
We need to show that there is a subcontinuum
$K$ of $C$ with $\lambda(K)=\lambda$. Pick
non-degenerate subcontinua $K_1,K_2$ of $C$ with
$\lambda(K_1)=\lambda_1$ and $\lambda(K_2)=\lambda_2$.
We can gradually and continuously "grow" $K_1$
till till it coincides with $C$. (Main idea, take
a a rectangle slightly larger than the bounding
box box of $K_1$, and with horizontal and vertical edges that do not intersect
$K_1$, then apply the boundary bumping theorem.)
More precisely, there is an
increasing increasing by set inclusion chain of continua
(note that "chain" here is used with its
set set-theoretic meaning, as a chain of nested continua;
and not with its often encountered continuum theoretic
meaning meaning, involving "adjacent links" that intersect)...
so there is an increasing by set inclusion chain of continua
(or a nested family of continua) starting at $K_1$
and and ending at $C$ such that
the width $w$ as well as the height $h$ of the respective
bounding bounding boxes are continuous non-decreasing
functions functions. (In particular every continuum in
this this chain is non-degenerate, being bigger than $K_1$,
so so lank rank is always well-defined.)
Similarly there is another increasing
by set inclusion chain of continua,
starting at $K_2$ and ending at $C$.
Traverse the first chain from $K_1$ to $C$,
and then follow by traversing in reverse the second
chain chain from $C$ to $K_2$, then the lank rank of
the contunia the contunua changes from $\lambda(K_1)=\lambda_1$
to $\lambda(C)$, and from there to $\lambda(K_2)=\lambda_2$.
So altogether the lank rank changes continuously
from $\lambda_1$ to $\lambda_2$, hence by the
intermediate value theorem there is some moment
of time (i.e. a continuum $K$ in at least one of
the two chains) such that $\lambda(K)=\lambda.$
It is indicated in the latter question that, unless a continuum if hereditarily square-boxed, then then it must cross some dyadic square.
So, if every hereditarily indecomposable plane continuum continuum $C$ must contain at least one square-boxed continuum continuum (which is the question asked here), then then $\Lambda(C)=(-1,1)$, so $C$ cannot be be hereditarily square-boxed, so it muchmust cross some some dyadic square.
(Disclaimer. I seem to promote above the idea that $\Lambda(C)=(-1,1)$ for every hereditarily indecomposable plane plane continuum $C$, but I feel quite lost with this question question, and I might be imagining things due to my incomplete incomplete understanding. I am curious.)
**Edit (May 7, 2023).
Asking whether $\Lambda(C)=(-1,1)$ may be asking for too much. Perhaps a pseudoarc $P$
could be constructed as the limit of a sequence of paths, each of which consist of straight line segments of slope that is bigger by absolute value than, say $60.$ Perhaps such a construction could achieve that for every subcontinuum $K$ of $P$ we would have, say, $\sigma(K)\ge3$ (and $\lambda(K)\ge\frac45$). So, $P$ need not have a square-boxed subcontinuum (and the answer to the question stated at the top would be negative...).
But that might be ok (as clarified below, related to Kevin Johnson's question), as long as $\Lambda(P)$ is big enough, say containing some interval. This motivates the following.
(Additional and formally weaker) Question.
Let $C$ be any hereditarily indecomposable plane continuum, or, for that matter, any non-degenerate plane continuum that is not
a straight line segment.
(c) must $C$ have two subcontinua $K_1$ and $K_2$ with $\lambda(K_1)\not=\lambda(K_2)$
(and, accordingly, $\sigma(K_1)\not=\sigma(K_2)$)?
In other words, must it be the case that $\Lambda(C)$ is not a singleton? (In which case $\Lambda(C)$ would have to be some interval of positive length, perhaps not necessarily containing $0.$)
If the answer to this version (c) of our question were positive, this would be "good enough" to answer Kevin Johnson's question referenced above. Say $C$ is a plane continuum that is not a straight line segment or a singleton. If there were two subcontinua $K_1$ and $K_2$ with $\lambda(K_1)\not=\lambda(K_2)$, then at least one of these values would be nonzero, say $\lambda(K_1)\not=0$, so the bounding box for $K_1$ would not be a square, implying in turn that $K_1$ crosses some dyadic square.