The hypergraph removal lemma states that for any formula_4, there exists formula_5 such that the following is true: if formula_6 is any formula_7-vertex formula_2-regular hypergraph with at most formula_9 subgraphs isomorphic to formula_1, then it is possible to eliminate all copies of formula_1 from formula_6 by removing at most formula_13 hyperedges from formula_6.