Categories
  Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Dependence relation

From HandWiki - Reading time: 2 min

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 aS, if it satisfies the following properties:

  • if aS, then aS;
  • if aS, then there is a finite subset S0 of S, such that aS0;
  • if T is a subset of X such that bS implies bT, then aS implies aT;
  • if aS but aS{b} for some bS, then b(S{b}){a}.

Given a dependence relation on X, a subset S of X is said to be independent if aS{a} for all aS. If ST, then S is said to span T if tS for every tT. 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.

Examples

  • Let V be a vector space over a field F. The relation , defined by υS 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 αS if α is algebraic over F(S). Then is a dependence relation. This is equivalent to the definition of algebraic dependence.

See also




Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Dependence_relation
23 views | Status: cached on July 28 2024 06:04:26
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF