2
$\begingroup$

Let $\mathcal{P}$ be a finitely generated planar algebra.

Question : Is it also singly generated ?

I ask this question, because, on one hand I've read on this paper of V. Jones and D. Bisch :
"It thus makes sense to ask how many elements of $\mathcal{P}$ are required to generate $\mathcal{P}$ "

But on the other hand, if finitely many elements $(b_i)_{i \in I}$ generate $\mathcal{P}$, with $b_i \in V_{n_i}$ a $n_i$-box, then by using a "direct sum" planar tangle (with $N=\sum_{i \in I} n_i$) $$ T : \bigotimes_{i \in I} V_{n_i} \to V_{N}$$ we produce the $N$-box $B = T(\otimes_i b_i)$ : enter image description here
which generate $\mathcal{P}$, because $\forall i$ we can generate $b_i$ (up to rescaling), by applying a "trace" planar tangle on all the $j \ne i$ components of the box $B$: enter image description here

I'm not an expert in planar algebra, perhaps this question is obvious, and perhaps this argument is trivially true or trivially false.

$\endgroup$
2
  • $\begingroup$ What if some of the $b_i$ trace to $0$? $\endgroup$ Commented Nov 21, 2013 at 19:00
  • $\begingroup$ @TheoJohnson-Freyd : Perhaps it's possible to replace all the null-trace generators by non-null-trace generators, I don't know. $\endgroup$ Commented Nov 21, 2013 at 19:11

1 Answer 1

4
$\begingroup$

Your answer will work, except if the $b_i$'s have trace zero as Theo points out. If the $b_i\in \mathcal{P}_{n_i}$ has trace zero, just use $1_{n_i}+b_i$ instead of $b_i$, where $1_{n_i}$ is $n_i$ parallel strands. Then you can cap this off to get a scalar as before. By what you remarked above, you'll be able to recover $1_{n_i}+b_i$, from which you can recover $b_i$ in the obvious way.

The above technique is used in Kodiyalam and Tupurani (arXiv:1003.4577), where they show all finite depth subfactors are singly generated. A more interesting question would be to find the smallest depth at which such a planar algebra is singly generated.

$\endgroup$
8
  • $\begingroup$ Thank you Dave! About your question, the $2221$ subfactor planar algebra (of depth $4$) is known to be generated by two $3$-box, so it's generated be a single $6$-box. Is it known whether or not, it's also generated by a single $r$-box with $r<6$, and what's the smallest $r$ ? $\endgroup$ Commented Nov 21, 2013 at 21:46
  • 1
    $\begingroup$ In fact, 2221 is singly generated by a 3-box. Just look at the planar algebra generated by one of the 3-boxes. There's no multiplicity 2 subfactor at that index (we would have seen it in the classification), so it must be 2221. $\endgroup$ Commented Nov 21, 2013 at 22:28
  • $\begingroup$ You're right! In R. Han thesis, page 48, theorem 5.0.16 (R3(T)) : $T^2 = f^{(3)} + \frac{Z(T^3)}{[4]}T + \frac{Z(QT^2)}{[4]}Q $, so we obtain $Q$ from $T$. $\endgroup$ Commented Nov 21, 2013 at 22:42
  • $\begingroup$ I would like to formulate a conjecture like "a depth $n$ subfactor is cyclic iff its planar algebra is generated by a single $n$-box", but I don't know yet if it's relevant. $\endgroup$ Commented Nov 21, 2013 at 22:52
  • 1
    $\begingroup$ I think that's not true. Look at the $\mathbb{Z}/2\mathbb{Z}\times \mathbb{Z}/2\mathbb{Z}$ subfactor. If I call the minimal projections at depth 2 $P$,$Q$,$R$, then $P-Q$ generates the planar algebra, since if I square it, I get $P+Q$, so I can recover $P$ and $Q$, and using $f^{(2)}$, I can recover $R$. But this group is not cyclic. $\endgroup$ Commented Nov 21, 2013 at 23:07

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .