April 20th, 2010, 10:52 AM  #1 
Member Joined: May 2009 Posts: 34 Thanks: 0  Set Theory : Closures
Hey guys, I got a general question. Does any attribute of a set (like symmetric,reflexive and etc) have a closure? If they don't, then how do I prove that there's no asymmetric closure, for example? Thanks in advance. 
April 20th, 2010, 11:51 AM  #2 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Set Theory : Closures
I'm going to give a particular interpretation to your question; you'll have to tell me if it's right. You're considering relations over sets, and attributes of those relations. A relation over a set is a subset of pairs with members in the set; an attribute is a subset of the class of relations. You're looking for a relation which is a superset of a given relation and has the attribute. (One could also consider unique closures, as in your examples: no superset of the original relation can have the attribute without containing all members of the new relation.) A natural counterexample is the attribute of unicornness. No relations are unicorns, so there is no "unicorn closure". Perhaps this is trivial, and we should consider nonempty attributes (attributes for which relations exist which have that attribute). So consider the attribute of falsity, which includes only the empty relation. (A relation FALSE with this property is such that a FALSE b is false for every a, b in the set.) Any nonempty relation has no 'falsity' closure. Clearly, for an attribute A to have a closure it must contain the relation TRUE which contains every pair of members in the set (else that relation has no Aclosure). Any such attribute has an Aclosure  if nothing else, map every relation to TRUE. So perhaps the question should be, which attributes have unique closures? Certainly some attributes exist which have closures but no unique closures. Consider an underlying set has an odd number of elements (at least three) and the attribute oddness which is true only for relations with an odd number of members. The relation FALSE contains 0 members, so it does not have oddness. But adding any pair to the relation gives it oddness, and so there is no unique oddness closure. But there are an odd number of elements and hence an odd number of pairs, so the relation TRUE that contains all pairs has oddness. Thanks for the question, that was fun. I hadn't thought about any of this before. 
April 21st, 2010, 03:46 AM  #3 
Member Joined: May 2009 Posts: 34 Thanks: 0  Re: Set Theory : Closures
Yes, you've understood my question precisely but your examples weren't clear enough to me. Like the first one, what is unicorn attribute? I google it but didn't find any declaration or an addition explanation? Also, I am not quiet sure what is this FALSE relation you've mentioned. For example, I got A={1,2,3,4}. so how does FALSE work here? I really appreciate your time and efforts, it sounds very interesting. THANK u very much 
April 21st, 2010, 05:25 AM  #4  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Set Theory : Closures Quote:
http://images.pictureshunt.com/pics/u/unicorn1846.jpg A relation is a set, a collection of pairs. A unicorn is an animal with one horn. No relations are unicorns. Quote:
FALSE is {} because FALSE is true for no pairs of A. For example, 4 FALSE 2 is false because (4, 2) is not in {}.  
April 21st, 2010, 10:36 AM  #5  
Senior Member Joined: Oct 2007 From: Chicago Posts: 1,701 Thanks: 3  Re: Set Theory : Closures Quote:
 
April 21st, 2010, 11:11 AM  #6 
Member Joined: May 2009 Posts: 34 Thanks: 0  Re: Set Theory : Closures
LOL!!! I am an ass! Anyway, thanks, your example is good, but I think I have something more simple. For example, I have noticed there are symmetric, transitive and reflexive closure. I am sure that there's a good example of R that doesn't have a asymmetric closure or antitransitive closure. but somehow I can't figure one. 
April 21st, 2010, 12:23 PM  #7  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Set Theory : Closures Quote:
 

Tags 
closures, set, theory 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Set Theory  yas442  Abstract Algebra  0  December 3rd, 2013 04:22 AM 
Set theory help.  MathsLOL  Algebra  4  March 4th, 2012 09:34 AM 
Graph theory and number theory  proglote  Number Theory  3  October 30th, 2011 04:20 PM 
Categorytheory (finite group theory) prove  butabi  Abstract Algebra  8  September 3rd, 2011 01:52 PM 
set theory  pmmeeran  Applied Math  1  January 4th, 2009 12:52 PM 