Constraint counting

In <a href="/facts/Mathematics/pxTouaz4">mathematics</a>, constraint counting is counting the number of <a href="/facts/Constraint_(mathematics)/QLFIFlFX">constraints</a> in order to compare it with the number of <a href="/facts/Variable_(mathematics)/VbQlrvKz">variables</a>, <a href="/facts/Parameter/zFvVFMv9">parameters</a>, etc. that are free to be determined, the idea being that in most cases the number of independent choices that can be made is the excess of the latter over the former.
For example, in <a href="/facts/Linear_algebra/8VaB4VWk">linear algebra</a> if the number of constraints (independent equations) in a <a href="/facts/System_of_linear_equations/fk9CFdgp">system of linear equations</a> equals the number of unknowns then precisely one solution exists; if there are fewer independent equations than unknowns, an infinite number of solutions exist; and if the number of independent equations exceeds the number of unknowns, then no solutions exist.
In the context of <a href="/facts/Partial_differential_equation/DyPsBlv7">partial differential equations</a>, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a <a href="/facts/Partial_differential_equation/DyPsBlv7">partial differential equation</a>.

Constraint counting open-in-new

Constraint counting