Difference between revisions of "Grounded relation"
MyWikiBiz, Author Your Legacy — Sunday November 24, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (bind math expressions) |
Jon Awbrey (talk | contribs) (cats) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
A '''grounded relation''' over a [[sequence]] of [[set]]s is a mathematical object consisting of two components. The first component is a subset of the [[cartesian product]] taken over the given sequence of sets, which sets are called the ''[[domain of discourse|domain]]s'' of the relation. The second component is just the cartesian product itself. | A '''grounded relation''' over a [[sequence]] of [[set]]s is a mathematical object consisting of two components. The first component is a subset of the [[cartesian product]] taken over the given sequence of sets, which sets are called the ''[[domain of discourse|domain]]s'' of the relation. The second component is just the cartesian product itself. | ||
| − | For example, if ''L'' is a grounded relation over a finite sequence of sets, then ''L'' has the form ''L'' = (''F''(''L''), ''G''(''L'')), where ''F''(''L'') ⊆ ''G''(''L'') = ''X''<sub>1</sub> × … × ''X''<sub>''k''</sub>, for some positive integer ''k''. | + | For example, if ''L'' is a grounded relation over a finite sequence of sets, ''X''<sub>1</sub>, …, ''X''<sub>''k''</sub> , then ''L'' has the form ''L'' = (''F''(''L''), ''G''(''L'')), where ''F''(''L'') ⊆ ''G''(''L'') = ''X''<sub>1</sub> × … × ''X''<sub>''k''</sub> , for some positive integer ''k''. |
The default assumption in almost all applied settings is that the domains of the grounded relation are [[nonempty]] sets, hence departures from this assumption need to be noted explicitly. | The default assumption in almost all applied settings is that the domains of the grounded relation are [[nonempty]] sets, hence departures from this assumption need to be noted explicitly. | ||
| Line 14: | Line 14: | ||
* [[Relation theory]] | * [[Relation theory]] | ||
* [[Relation type]] | * [[Relation type]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
[[Category:Logic]] | [[Category:Logic]] | ||
[[Category:Mathematics]] | [[Category:Mathematics]] | ||
| − | [[Category:Set | + | [[Category:Set Theory]] |
Latest revision as of 02:20, 16 February 2008
A grounded relation over a sequence of sets is a mathematical object consisting of two components. The first component is a subset of the cartesian product taken over the given sequence of sets, which sets are called the domains of the relation. The second component is just the cartesian product itself.
For example, if L is a grounded relation over a finite sequence of sets, X1, …, Xk , then L has the form L = (F(L), G(L)), where F(L) ⊆ G(L) = X1 × … × Xk , for some positive integer k.
The default assumption in almost all applied settings is that the domains of the grounded relation are nonempty sets, hence departures from this assumption need to be noted explicitly.
