Dependence relation
From Wikipedia, the free encyclopedia
In mathematics, a dependence relation is a binary relation which generalizes the relation of linear dependence.
Let X be a set. A (binary) relation
between an element a of X and a subset S of X is called a dependence relation, written
, if it satisfies the following properties:
- if
, then
; - if
, then there is a finite subset S0 of S, such that
; - if T is a subset of X such that
implies
, then
implies
; - if
but
for some
, then
.
Given a dependence relation
on X, a subset S of X is said to be independent if
for all
If
, then S is said to span T if
for every
S is said to be a basis of X if S is independent and S spans X.
Remark. If X is a non-empty set with a dependence relation
, then X always has a basis with respect to
Furthermore, any two bases of X have the same cardinality.
[edit] Examples
- Let V be a vector space over a field F. The relation
, defined by
if υ is in the subspace spanned by S, is a dependence relation. This is equivalent to the definition of linear dependence. - Let K be a field extension of F. Define
by
if α is algebraic over F(S). Then
is a dependence relation. This is equivalent to the definition of algebraic dependence.
[edit] See also
This article incorporates material from Dependence relation on PlanetMath, which is licensed under the GFDL.

