User:Jon Awbrey/Sandbox

Table of Mathematical Symbols

Typographical Towers
Version 1

Example 1. Any algebra being trivially a homologue of itself, the algebra of finitary operations on {0, 1} qualifies as a Boolean algebra. To understand the operations of Boolean algebra and their laws in general it therefore suffices to understand them for just this two-element Boolean algebra.

There being kkn n-ary operations f: Xn&rarr;X on a k-element set X, there are therefore 22n n-ary operations on {0,1}. Although we don't need to specify an order for the operations, it is natural to list the smaller arities first. This then makes the signature of a Boolean algebra
 * 0-0-1-1-1-1-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-3-3-&hellip;,

meaning that every Boolean algebra, however small or large, has two constants or "nullary" operations, four unary operations, 16 binary operations, 256 ternary, etc., which we call the Boolean operations of the given Boolean algebra.

Version 2

Example 1. Any algebra being trivially a homologue of itself, the algebra of finitary operations on {0, 1} qualifies as a Boolean algebra. To understand the operations of Boolean algebra and their laws in general it therefore suffices to understand them for just this two-element Boolean algebra.

There being kkn n-ary operations f: Xn&rarr;X on a k-element set X, there are therefore 22n n-ary operations on {0,1}. Although we don't need to specify an order for the operations, it is natural to list the smaller arities first. This then makes the signature of a Boolean algebra
 * 0-0-1-1-1-1-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-3-3-&hellip;,

meaning that every Boolean algebra, however small or large, has two constants or "nullary" operations, four unary operations, 16 binary operations, 256 ternary, etc., which we call the Boolean operations of the given Boolean algebra.

Vicissitude 1
Truth (antonym falsity) refers to the property of a proposition or its symbolic expression having a degree of fidelity with reality. A statement that is judged to have the property of truth is said to be true, and may be referred to in substantive terms as "a truth". The abstract object to which all true statements may be taken to refer is frequently referred to in general terms as "the truth". In rhetorical contexts where obfuscation is a factor, honesty and sincerity may also be considered as aspects of the "truth".

Vicissitude 2
Truth (opposite falsity) refers to the property of a proposition or its symbolic expression as having a strong fidelity with reality. A statement that is judged to have the property of truth is said to be true, and may be referred to in substantive terms as "a truth". The abstract object to which all true statements may be taken to refer is also referred to in general terms as "the truth". In rhetorical contexts where obfuscation is a factor, honesty and sincerity may also be considered as aspects of the "truth".

Old Biz
The formula for computing G o H says the following:

(G o H)_ij =  the ij^th entry in the matrix representation for G o H   =   the entry in the i^th row and the j^th column of G o H   =   the scalar product of the i^th row of G with the j^th column of H   =   Sum_k (G_ik H_kj)


 * $$(G \circ H)_{ij}$$

Matrix Matters
Table Format

Matrix Format


 * $$\begin{matrix}

F & = & 4:3:4 & + & 4:4:4 & + & 4:5:4 \\ G & = & 4:3  & + & 4:4   & + & 4:5   \\ H & = & 3:4  & + & 4:4   & + & 5:4 \end{matrix}$$

Minimal Negation Operators

 * = 0


 * (x) = ~x = &not;x = x&prime;


 * (x, y) = x + y = x&prime;y + xy&prime;


 * (x, y, z) = x&prime;yz + xy&prime;z + xyz&prime;


 * $$\begin{matrix}

(\ )  & = & 0      & = & \mbox{false} \\ (x)   & = & \neg x & = & \tilde{x} & = & x' \\ (x, y) & = & x + y & = & \tilde{x} y \lor x \tilde{y} & = & x'y \lor xy' \end{matrix}$$

Nested Tables
{| align="center" style="width:90%"
 * align="center" | projXY(L1)


 * align="center" | projXZ(L1)
 * align="center" | projYZ(L1)
 * }

Dyadic Projections
{| align="center" style="width:90%"
 * align="center" style="width:30%" | projXY(LA)


 * align="center" style="width:30%" | projXZ(LA)


 * align="center" style="width:30%" | projYZ(LA)


 * }

{| align="center" style="width:90%"
 * align="center" style="width:30%" | projXY(LB)


 * align="center" style="width:30%" | projXZ(LB)


 * align="center" style="width:30%" | projYZ(LB)


 * }

Projective reducibility of triadic relations
By way of illustrating the different sorts of things that can occur in considering the projective reducibility of relations, it is convenient to reuse the four examples of 3-adic relations that are discussed in the main article on that subject.

Examples of projectively irreducible relations
The 3-adic relations L0 and L1 are shown in the next two Tables:

A 2-adic projection of a 3-adic relation L is the 2-adic relation that results from deleting one column of the table for L and then deleting all but one row of any resulting rows that happen to be identical in content. In other words, the multiplicity of any repeated row is ignored.

In the case of the above two relations, L0, L1 &sube; X &times; Y &times; Z &asymp; B3, the 2-adic projections are indexed by the columns or domains that remain, as shown in the following Tables.

{| align="center" style="width:90%"
 * align="center" | projXY(L1)


 * align="center" | projXZ(L1)
 * align="center" | projYZ(L1)
 * }

It is clear by inspection that the following equations hold:

These equations say that L0 and L1 cannot be distinguished from each other solely on the basis of their 2-adic projection data. In such a case, either relation is said to be irreducible with respect to 2-adic projections. Since reducibility with respect to 2-adic projections is the only interesting case where it concerns the reduction of 3-adic relations, it is customary to say more simply of such a relation that it is projectively irreducible, the 2-adic basis being understood. It is immediate from the definition that projectively irreducible relations always arise in non-trivial multiplets of mutually indiscernible relations.

Examples of projectively reducible relations
The 3-adic relations LA and LB are shown in the next two Tables:

Epigraph 3
Ye knowe eek, that in forme of speche is chaunge With-inne a thousand yeer, and wordes tho That hadden prys, now wonder nyce and straunge Us thinketh hem; and yet they spake hem so, And spedde as wel in love as men now do; Eek for to winne love in sondry ages, In sondry londes, sondry been usages. Geoffrey Chaucer, "Troilus and Criseyde", 2.4.22-28 (1385) http://en.wikisource.org/wiki/Troilus_and_Criseyde:Book_II

Formal Axioms
Format 1

Here is one way of reading the axioms under the entitative interpretation:


 * I1. true or true  =  true.


 * I2. not true      =  false.


 * J1. a or not a  =  true.


 * J2. [a or b] and [a or c]  =  a or [b and c].

Here is one way of reading the axioms under the existential interpretation:


 * I1. false and false  =  false.


 * I2. not false        =  true.


 * J1. a and not a  =  false.


 * J2. [a and b] or [a and c]  =  a and [b or c].

Format 2

Here is one way of reading the axioms under the entitative interpretation:

Here is one way of reading the axioms under the existential interpretation:

Format 3


 * A
 * B
 * C
 * D


 * 1
 * 2
 * 3
 * 4

Peirce's Law
Format 1

Here is Peirce's own statement of the law: A fifth icon is required for the principle of excluded middle and other propositions connected with it. One of the simplest formulae of this kind is: This is hardly axiomatical. That it is true appears as follows. It can only be false by the final consequent x being false while its antecedent (x —< y) —< x is true. If this is true, either its consequent, x, is true, when the the whole formula would be true, or its antecedent x —< y is false. But in the last case the antecedent of x —< y, that is x, must be true. (Peirce, CP 3.384). Peirce goes on to point out an immediate application of the law: From the formula just given, we at once get: where the a is used in such a sense that (x —< y) —< a means that from (x —< y) every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of x follows the truth of x. (Peirce, CP 3.384).

Format 2

Here is Peirce's own statement of the law:
 * A fifth icon is required for the principle of excluded middle and other propositions connected with it. One of the simplest formulae of this kind is:


 * This is hardly axiomatical. That it is true appears as follows.  It can only be false by the final consequent x being false while its antecedent (x —< y) —< x is true.  If this is true, either its consequent, x, is true, when the the whole formula would be true, or its antecedent x —< y is false.  But in the last case the antecedent of x —< y, that is x, must be true.  (Peirce, CP 3.384).

Peirce goes on to point out an immediate application of the law:
 * From the formula just given, we at once get:


 * where the a is used in such a sense that (x —< y) —< a means that from (x —< y) every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of x follows the truth of x.  (Peirce, CP 3.384).

=Relation in TeX=

A relation is a mathematical object of a very general type, the generality of which is best approached in several stages, as will be carried out below. The basic idea, however, is to generalize the concept of a binary relation, such as the binary relations of equality and order that are denoted by the signs "=" and "<" in statements of the form "5 + 7 = 12" and "5 < 12". The concept of a relation is also the fundamental notion in the relational model for databases.

A finitary relation or a polyadic relation — specifically a k-ary relation, a k-adic relation, or a k-place relation when the parameter k, called the arity, the adicity, or the dimension of the relation, is known to apply — is conceived according to a formal definition to be given shortly. But it serves understanding to introduce a few preliminary ideas in preparation for the formal definition.

A relation $$L$$ is defined by specifying two mathematical objects as its constituent parts:


 * The first part is called the frame of $$L$$, written $$frame\,(L)$$ or $$F(L).$$


 * The second part is called the graph of $$L$$, written $$graph\,(L)$$ or $$G(L).$$

In the special case of a finitary relation, for concreteness a k-place relation, the concepts of its frame and its graph are defined as follows:


 * The frame of $$L$$ is specified by giving a sequence of $$k$$ sets, $$X_1, \ldots, X_k,$$ called the domains of the relation $$L,$$ and taking the frame of $$L$$ to be their set-theoretic product or cartesian product $$F(L) = X_1 \times \ldots \times X_k.$$


 * The graph of $$L$$ is given by specifying a subset of this cartesian product, and taking the graph of $$L$$ to be this subset, $$G(L) \subseteq F(L) = X_1 \times \ldots \times X_k.$$

Strictly speaking, then, the relation L consists of a couple of things, L = (F(L), G(L)), but it is customary in loose speech to use the single name L in a systematically equivocal fashion, taking it to denote either the couple L = (F(L), G(L)) or the graph G(L). There is usually no confusion about this so long as the frame of the relation can be gathered from context.

Definition
A relation L over the sets X1, …, Xk is a (k+1)-tuple L = (X1, …, Xk, G(L)) where G(L) is a subset of X1 &times; … &times; Xk (the cartesian product of these sets). If all of the Xj for j = 1 to k are the same set X, then L is more simply called a relation over X. G(L) is called the graph of L and, as in the case of binary relations, L is often identified with its graph.

An k-ary predicate is a boolean-valued function of k variables.

Remarks
Because a relation as above defines uniquely a k-ary predicate that holds for x1, …, xk if (x1, …, xk) is in G(R), and vice versa, the relation and the predicate are often denoted with the same symbol. So, for example, the following two statements are considered to be equivalent:


 * $$ (x_1, x_2,\dotsb)\in G(R)$$
 * $$ R(x_1, x_2,\dotsb)$$

Relations are classified according to the number of sets in the Cartesian product; in other words the number of terms in the expression:
 * Unary relation or property: R(x)
 * Binary relation: R(x, y) or x R y
 * Ternary relation: R(x, y, z)
 * Quaternary relation: R(x, y, z, w)

Relations with more than 4 terms are usually called k-ary; for example "a 5-ary relation".

Definition
A relation L over the sets X1, …, Xk is a (k+1)-tuple L = (X1, …, Xk, G(L)) where G(L) is a subset of X1 &times; … &times; Xk (the cartesian product of these sets). If all of the Xj for j = 1 to k are the same set X, then L is more simply called a relation over X. G(L) is called the graph of L and, as in the case of binary relations, L is often identified with its graph.

An k-ary predicate is a boolean-valued function of k variables.

Remarks
Because a relation as above defines uniquely a k-ary predicate that holds for x1, …, xk if (x1, …, xk) is in G(R), and vice versa, the relation and the predicate are often denoted with the same symbol. So, for example, the following two statements are considered to be equivalent:


 * $$ (x_1, x_2,\dotsb)\in G(R)$$
 * $$ R(x_1, x_2,\dotsb)$$

Relations are classified according to the number of sets in the Cartesian product; in other words the number of terms in the expression:
 * Unary relation or property: R(x)
 * Binary relation: R(x, y) or x R y
 * Ternary relation: R(x, y, z)
 * Quaternary relation: R(x, y, z, w)

Relations with more than 4 terms are usually called k-ary; for example "a 5-ary relation".

Format 2
=Textbox=

=Wisdom of Fonts=

$$\mathcal{A\,B\,C\,D\,E\,F\,G\,H\,I\,J\,K\,L\,M}$$

$$\mathcal{N\,O\,P\,Q\,R\,S\,T\,U\,V\,W\,X\,Y\,Z}$$

$$\mathcal{a\,b\,c\,d\,e\,f\,g\,h\,i\,j\,k\,l\,m}$$

$$\mathcal{n\,o\,p\,q\,r\,s\,t\,u\,v\,w\,x\,y\,z}$$

$$\mathcal{0\,1\,2\,3\,4\,5\,6\,7\,8\,9}$$

$$\mathcal{0}$$

$$\mathcal{1\ 2\ 3}$$

$$\mathcal{4\ 5\ 6}$$

$$\mathcal{7\ 8\ 9}$$

$$\mathcal{6}$$

$$\mathcal{7}$$

$$\mathcal{8}$$

$$\mathcal{9}$$

$$\mathcal{61}$$

$$\mathcal{6\,8}$$

$$\mathcal{6\,9}$$

$$\mathcal{6\,n}$$

$$|\!\mathcal{6\,n}\!|$$

$$\mathcal{4\,7\,5}$$

$$\mathcal{4\ 7\ 7\ 7\ 7\ 7\ 5}$$

$$\mathcal{4\,6\,7\,5}$$

$$\mathcal{4\,6\,7\,8}$$

=Joins — Natural Or Else=

$$ -\!< $$

$$\triangleright \triangleleft$$

$$\triangleright\!\triangleleft$$

Voila!

$$\begin{matrix} a & b \\ c & d \end{matrix}$$

$$\triangleright\!\triangleleft$$

$$\begin{matrix} \triangleright\!\triangleleft \\ R & S \end{matrix}$$

$$\begin{matrix} \triangleright\!\triangleleft \\ R & \theta & S \end{matrix}$$

$$R \begin{matrix} \triangleright\!\triangleleft \\ i\ \theta\ j \end{matrix} S$$

$$\begin{matrix} R\ \triangleright\!\triangleleft\ S \\ i\, \theta\, j \end{matrix}$$

$$ >< \!$$

$$ >\!< $$

$$ |>\!<| $$

$$ |\!>\!<\!| $$

$$ |\!>\!<\!| $$

$$\begin{matrix}R\ \triangleright\!\triangleleft\ S \\ \ i\ \theta\ j\end{matrix}$$

$$\begin{matrix}R\ |\!>\!<\!|\ S \\ i\ \theta\ j\end{matrix}$$

=Eunucode=


 * The entity named nbsp is a non-breaking space, so a formula or equation will not have an awkward line break appear in its midst. An alternative is to paste in a UTF-8 unicode character like thinsp, which should appear as whitespace in the edit window, and (since it is not the "space" character) also prevent line breaking: a  =  b. Here's a list of sample spacing options: ensp (" "), emsp (" "), emsp13 (" "), emsp14 (" "), numsp (" "), puncsp (" "), thinsp (" "), VeryThinSpace (" "). --KSmrqT 06:35, 3 February 2006 (UTC)

=Junkyard=

$$proj_{XY}(L) = L_{XY} = \{(x, y) \in X \times Y : (\exists z \in Z) (x, y, z) \in L \}$$

$$proj_{XZ}(L) = L_{XZ} = \{(x, z) \in X \times Z : (\exists y \in Y) (x, y, z) \in L \}$$

$$proj_{YZ}(L) = L_{YZ} = \{(y, z) \in Y \times Z : (\exists x \in X) (x, y, z) \in L \}$$

$$proj_{XY}(L) = L_{XY} = \{(x, y) \in X \times Y \mid \exists z \in Z \mid (x, y, z) \in L \}$$

$$proj_{XZ}(L) = L_{XZ} = \{(x, z) \in X \times Z \mid \exists y \in Y \mid (x, y, z) \in L \}$$

$$proj_{YZ}(L) = L_{YZ} = \{(y, z) \in Y \times Z \mid \exists x \in X \mid (x, y, z) \in L \}$$

QV Table
Logic


 * Predicate
 * Property


 * Proposition
 * Relative term


 * Rheme
 * Role

Computer science


 * Database
 * Relational algebra


 * Relational database
 * Relational model

Primary sources
 * Logic of Relatives (1870)
 * Logic of Relatives (1883)

Elements


 * Attribute
 * Distinctive feature


 * Feature
 * Function


 * Functional
 * Quality

Algebra


 * Category theory
 * Operation
 * Operator


 * Multigrade operator
 * Parametric operator


 * Relation algebra
 * Universal algebra

Combinatorics, geometry, set theory


 * Relation
 * Relation composition


 * Relation construction
 * Relation reduction


 * Theory of relations

Logic


 * Predicate
 * Property


 * Proposition
 * Relative term


 * Rheme
 * Role

Computer science


 * Database
 * Relational algebra


 * Relational database
 * Relational model

Primary sources
 * Logic of Relatives (1870)
 * Logic of Relatives (1883)

=Casing the Joint=

$$ f(n) = \begin{cases} n/2, & \mbox{if }n\mbox{ is even} \\ 3n+1, & \mbox{if }n\mbox{ is odd} \end{cases} $$

$$ \psi_{\mbox{CIRCLE}}(X) = \begin{cases} 1 & \mbox{if the figure }X \mbox{ is a circle,} \\ 0 & \mbox{if the figure is not a circle.} \end{cases} $$