 Triad in a hypergraph regularity partition

A triad is the set of triples supported on one prescribed pair cell for each of the three pairs of vertex classes. Relative triple density is measured among those supported triples. In strong hypergraph regularity, the pair cells must themselves be sufficiently regular and have controlled density before a small relative three-dimensional box norm can give a tetrahedron counting lemma.