What is the irreflexive closure of an irreflexive relation?
up vote
2
down vote
favorite
I am working on a problem that states the following:
When is it possible to define the irreflexive closure of a relation R, that is, a relation that contains R, is irreflexive, and is contained in every irreflexive relation that contains R?
Attempt
First note that a relation $R$ defined on a set $A$ is irreflexive if $(a,a) notin R$ for all $a in A$.
Suppose $R$ is a relation defined in a set $A$. Let $S$ be an irreflexive relation on $A$ that contains $R$. Then $(a,a)notin S$ for all $a in A$ and $R subseteq S$ which implies that $(a,a) notin R$ for all $a in A$. Therefore, $R$ is irreflexive on $A$. Hence, unless $R$ is irreflexive, we can't define irreflexive closure of $R$.
Finally, note that when $R$ is irreflexive, the irreflexive closure of $R$ is $R$ itself.
Question is my approach correct?
relations
add a comment |
up vote
2
down vote
favorite
I am working on a problem that states the following:
When is it possible to define the irreflexive closure of a relation R, that is, a relation that contains R, is irreflexive, and is contained in every irreflexive relation that contains R?
Attempt
First note that a relation $R$ defined on a set $A$ is irreflexive if $(a,a) notin R$ for all $a in A$.
Suppose $R$ is a relation defined in a set $A$. Let $S$ be an irreflexive relation on $A$ that contains $R$. Then $(a,a)notin S$ for all $a in A$ and $R subseteq S$ which implies that $(a,a) notin R$ for all $a in A$. Therefore, $R$ is irreflexive on $A$. Hence, unless $R$ is irreflexive, we can't define irreflexive closure of $R$.
Finally, note that when $R$ is irreflexive, the irreflexive closure of $R$ is $R$ itself.
Question is my approach correct?
relations
3
seems sound to me
– Exodd
Jun 10 '15 at 16:23
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I am working on a problem that states the following:
When is it possible to define the irreflexive closure of a relation R, that is, a relation that contains R, is irreflexive, and is contained in every irreflexive relation that contains R?
Attempt
First note that a relation $R$ defined on a set $A$ is irreflexive if $(a,a) notin R$ for all $a in A$.
Suppose $R$ is a relation defined in a set $A$. Let $S$ be an irreflexive relation on $A$ that contains $R$. Then $(a,a)notin S$ for all $a in A$ and $R subseteq S$ which implies that $(a,a) notin R$ for all $a in A$. Therefore, $R$ is irreflexive on $A$. Hence, unless $R$ is irreflexive, we can't define irreflexive closure of $R$.
Finally, note that when $R$ is irreflexive, the irreflexive closure of $R$ is $R$ itself.
Question is my approach correct?
relations
I am working on a problem that states the following:
When is it possible to define the irreflexive closure of a relation R, that is, a relation that contains R, is irreflexive, and is contained in every irreflexive relation that contains R?
Attempt
First note that a relation $R$ defined on a set $A$ is irreflexive if $(a,a) notin R$ for all $a in A$.
Suppose $R$ is a relation defined in a set $A$. Let $S$ be an irreflexive relation on $A$ that contains $R$. Then $(a,a)notin S$ for all $a in A$ and $R subseteq S$ which implies that $(a,a) notin R$ for all $a in A$. Therefore, $R$ is irreflexive on $A$. Hence, unless $R$ is irreflexive, we can't define irreflexive closure of $R$.
Finally, note that when $R$ is irreflexive, the irreflexive closure of $R$ is $R$ itself.
Question is my approach correct?
relations
relations
edited Jun 10 '15 at 16:35
Andrés E. Caicedo
64.3k8157244
64.3k8157244
asked Jun 10 '15 at 16:21
Camilo Celis Guzman
1585
1585
3
seems sound to me
– Exodd
Jun 10 '15 at 16:23
add a comment |
3
seems sound to me
– Exodd
Jun 10 '15 at 16:23
3
3
seems sound to me
– Exodd
Jun 10 '15 at 16:23
seems sound to me
– Exodd
Jun 10 '15 at 16:23
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1320166%2fwhat-is-the-irreflexive-closure-of-an-irreflexive-relation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
3
seems sound to me
– Exodd
Jun 10 '15 at 16:23