Summing over all edge subsets produces a two-variable invariant with many evaluations. This is a compact note, but the quantifiers and hypotheses stay on the page.
Notation
Graph invariants often satisfy deletion--contraction recurrences. The chromatic polynomial \(P_G(q)\) and Tutte polynomial \(T_G(x,y)\) package many counts into algebraic form.
The first display fixes the mathematical data. I label it \(\mathsf{data}\) mentally, while the next is the \(\mathsf{claim}\); the bridge between them is the displayed \(\Longrightarrow\), not an automatic implication.
Stress the formula
Here is a concrete symbolic test. Reading it from left to right reveals which transformation is reversible and which is only an implication.
Interpretation
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
Limit of the argument
Deletion--contraction must distinguish loops and bridges. Applying the generic edge recurrence to either special case changes the invariant incorrectly.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.