For two hypergraphs, the bracket sums the insertions of hg2 into hg1 at every vertex of hg1, minus the insertions of hg1 into hg2 at every vertex of hg2, each term carrying a sign from the Koszul convention applied to the (graded) vertex being replaced.
▪
For n hypergraphs, the bracket sums consecutive insertions of all n arguments over every permutation of their order, each term signed by the permutation's parity together with the Koszul sign of the insertion.
▪
Terms are collected up to isomorphism: results that agree after canonicalization are merged by adding their coefficients, and terms whose coefficients cancel to 0 are dropped from the resulting association.
▪
Insertion at a vertex only happens when that vertex's "Degree" annotation (see
) matches the degree of the root of the inserted hypergraph; every vertex defaults to degree 0, so plain hypergraphs (with no degree annotations) insert at every vertex.
▪
For n = 2, the bracket satisfies the antisymmetry of a graded Lie bracket: swapping the two arguments negates the result.