Small problem when computing components of affinoid

[oossen]

In the following, I manually define an affinoid consisting of two "thin anuli", given by v(x)=1 and v(x)=3.

sage: from mclf import *

sage: v = QQ.valuation(3)
sage: FX.<x> = FunctionField(QQ)
sage: X = BerkovichLine(FX, v)
sage: xi = []
sage: for i in range(5):
sage: 	xi.append(X.point_from_discoid(x, i))

sage: T4 = AffinoidTree(X, root=xi[4])
sage: T3 = AffinoidTree(X, root=xi[3], children=[T4], is_in=True)
sage: T4.make_parent(T3)
sage: T2 = AffinoidTree(X, root=xi[2], children=[T3])
sage: T3.make_parent(T2)
sage: T1 = AffinoidTree(X, root=xi[1], children=[T2], is_in=True)
sage: T2.make_parent(T1)
sage: T0 = AffinoidTree(X, root=xi[0], children=[T1])
sage: T1.make_parent(T0)

sage: V = AffinoidDomainOnBerkovichLine(T0)
sage: V
Affinoid with 2 components:
Elementary affinoid defined by
v(x) >= 1
v(1/x) >= -1
v(x) >= 3
v(1/x) >= -3
Elementary affinoid defined by
v(x) >= 3
v(1/x) >= -3

The first component has a redundant set of inequalities.

I think this happens because of a small mistake in AffinoidTree.connected_components (in line 338, we add a tree T1 to itself instead of adding T2 as a child).