Dependence relation explained

In mathematics, a dependence relation is a binary relation which generalizes the relation of linear dependence.

Let

X

be a set. A (binary) relation

\triangleleft

between an element

a

of

X

and a subset

S

of

X

is called a dependence relation, written

a\triangleleftS

, if it satisfies the following properties:
  1. if

a\inS

, then

a\triangleleftS

;
  1. if

a\triangleleftS

, then there is a finite subset

S0

of

S

, such that

a\triangleleftS0

;
  1. if

T

is a subset of

X

such that

b\inS

implies

b\triangleleftT

, then

a\triangleleftS

implies

a\triangleleftT

;
  1. if

a\triangleleftS

but

a\ntriangleleftS-\lbraceb\rbrace

for some

b\inS

, then

b\triangleleft(S-\lbraceb\rbrace)\cup\lbracea\rbrace

.

Given a dependence relation

\triangleleft

on

X

, a subset

S

of

X

is said to be independent if

a\ntriangleleftS-\lbracea\rbrace

for all

a\inS.

If

S\subseteqT

, then

S

is said to span

T

if

t\triangleleftS

for every

t\inT.

S

is said to be a basis of

X

if

S

is independent and

S

spans

X.

If

X

is a non-empty set with a dependence relation

\triangleleft

, then

X

always has a basis with respect to

\triangleleft.

Furthermore, any two bases of

X

have the same cardinality.

If

a\triangleleftS

and

S\subseteqT

, then

a\triangleleftT

, using property 3. and 1.

Examples

V

be a vector space over a field

F.

The relation

\triangleleft

, defined by

\upsilon\triangleleftS

if

\upsilon

is in the subspace spanned by

S

, is a dependence relation. This is equivalent to the definition of linear dependence.

K

be a field extension of

F.

Define

\triangleleft

by

\alpha\triangleleftS

if

\alpha

is algebraic over

F(S).

Then

\triangleleft

is a dependence relation. This is equivalent to the definition of algebraic dependence.

See also