<?xml version="1.0" encoding="UTF-8"?>

<record version="11" id="7639">
 <title>irreflexive</title>
 <name>Irreflexive</name>
 <created>2006-02-20 00:58:19</created>
 <modified>2008-02-27 18:30:14</modified>
 <type>Definition</type>
 <creator id="9137" name="smw"/>
 <author id="9137" name="smw"/>
 <classification>
	<category scheme="msc" code="03E20"/>
 </classification>
 <synonyms>
	<synonym concept="irreflexive" alias="antireflexive"/>
 </synonyms>
 <related>
	<object name="Reflexive"/>
 </related>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here</preamble>
 <content>A binary relation $\mathcal{R}$ on a set $A$ is said to be \emph{irreflexive} (or \emph{antireflexive}) if $\forall a\in A$, $\neg a\mathcal{R} a$. In other words, ``no element is $\mathcal{R}$-related to itself."

For example, the relation $&lt;$ (``less than") is an irreflexive relation on the set of natural numbers.

Note that ``irreflexive" is not simply the negation of ``\PMlinkname{reflexive}{Reflexive}
." Although it is impossible for a relation (on a nonempty set) to be both \PMlinkname{reflexive}{Reflexive}
 and irreflexive, there exist relations that are neither. For example, the relation $\{(a,a)\}$ on the two element set $\{a,b\}$ is neither reflexive nor irreflexive. 

Here is an example of a non-reflexive, non-irreflexive relation ``in nature." A subgroup in a group is said to be \emph{self-normalizing} if it is equal to its own normalizer. For a group $G$, define a relation $\mathcal{R}$ on the set of all subgroups of $G$ by declaring $H\mathcal{R}K$ if and only if $H$ is the normalizer of $K$. Notice that every nontrivial group has a subgroup that is not self-normalizing; namely, the trivial subgroup $\{e\}$ consisting of only the identity. Thus, in any nontrivial group $G$, there is a subgroup $H$ of $G$ such that $\neg H\mathcal{R} H$. So the relation $\mathcal{R}$ is non-reflexive. Moreover, since the normalizer of a group $G$ in $G$ is $G$ itself, we have $G\mathcal{R} G$. So $\mathcal{R}$ is non-irreflexive.</content>
</record>
