Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Codimension
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Dual interpretation== In terms of the [[dual space]], it is quite evident why dimensions add. The subspaces can be defined by the vanishing of a certain number of [[linear functional]]s, which if we take to be [[linearly independent]], their number is the codimension. Therefore, we see that ''U'' is defined by taking the [[union (set theory)|union]] of the sets of linear functionals defining the ''W''<sub>i</sub>. That union may introduce some degree of [[linear dependence]]: the possible values of ''j'' express that dependence, with the RHS sum being the case where there is no dependence. This definition of codimension in terms of the number of functions needed to cut out a subspace extends to situations in which both the ambient space and subspace are infinite dimensional. In other language, which is basic for any kind of [[intersection theory]], we are taking the union of a certain number of [[Constraint (mathematics)|constraint]]s. We have two phenomena to look out for: # the two sets of constraints may not be independent; # the two sets of constraints may not be compatible. The first of these is often expressed as the '''principle of counting [[Constraint (mathematics)|constraints]]''': if we have a number ''N'' of [[parameter]]s to adjust (i.e. we have ''N'' [[degrees of freedom (physics and chemistry)|degrees of freedom]]), and a constraint means we have to 'consume' a parameter to satisfy it, then the codimension of the [[solution set]] is ''at most'' the number of constraints. We do not expect to be able to find a solution if the predicted codimension, i.e. the number of ''independent'' constraints, exceeds ''N'' (in the linear algebra case, there is always a ''trivial'', [[null vector]] solution, which is therefore discounted). The second is a matter of geometry, on the model of [[parallel lines]]; it is something that can be discussed for [[linear problem]]s by methods of linear algebra, and for non-linear problems in [[projective space]], over the [[complex number]] field.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)