We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary hyperplane arrangement whose combinatorics determines the combinatorics of all possible Pythagorean arrangements. We close with several applications and examples.