nLab element

Redirected from "member".
Contents

This entry is about the concept in mathematics, specifically in set theory/type theory/category theory. For the concept in chemistry see at chemical element.

Context

Foundations

foundations

The basis of it all

 Set theory

set theory

Foundational axioms

foundational axioms

Removing axioms

Mathematics

Contents

Idea

An element of a set is a thing which “belongs to,” or “is an element of,” that set.

The circularity of this definition is unavoidable in foundational set theories in which “set” is an undefined term. In “definitional” set theories, where “set” is defined in terms of something else, elements are likewise defined in terms of the same “something else.”

If sets (or setoids) are regarded as the semantics of some type theory, then an element of a set is the interpretation of a term of some type.

Generalisations

symbolin propositional logicUnicode
::typing relationU+003A
=propositional equality relationU+003D
¬\neglogical negation operatorU+00AC
¬¬\neg \negdouble negationU+00AC&U+00AC
\nLeftarrow, \nleftarrownegation of converse implication, or negation of converse conditionalU+21CD, U+219A
\nLeftrightarrow, \nleftrightarrownegation of logical equivalence, or negation of biconditionalU+21CE, U+21AE
\nRightarrow, \nrightarrownegation of implication, or negation of conditionalU+21CF, U+219B
\Leftarrow, \leftarrowconverse implication, or converse conditionalU+21D0, U+2190
\Rightarrow, \rightarrowimplication, or conditionalU+21D2, U+2192
\Leftrightarrow, \leftrightarrowlogical equivalence, or biconditionalU+21D4, U+2192
\wedgelogical conjunctionoperatorU+2227
\veelogical dysjunction operatorU+2228
\neqinequality, or apartness relationU+2260
\vdashsyntactic entailment relationU+22A2
\vDashsemantic entailment relationU+22A8
\toptruth value, or top elementU+22A3
\botfalse value, or bottom elementU+22A4
\veebar, \opluslogical exclusive dysjunction operatorU+22BB, U+2295
¯\bar{\wedge}logical non-conjunction operatorU+22BC
¯\bar{\vee}logical non-dysjunction operatorU+22BD
symbolin first-order logicUnicode
\foralluniversal quantifierU+2200
\existsexistential quantifierU+2203
!\exists!uniqueness quantifierU+2203&U+0021
\nexistsnegation of existential quantifierU+2204
symbolin set theoryUnicode
×binary Cartesian product, or binary productU+00D7
\varnothingempty, or uninhabited setU+2205
\inmembership relationU+2208
\notinnegation of membership relationU+2209
\nicontainment relationU+220B
\notninegation of containment relationU+220C
\prodn-ary Cartesian product, or product operatorU+220F
\coprodn-ary disjoint union, or coproduct operatorU+2210
\capbinary intersection operatorU+2229
\cupbinary union operatorU+222A
\subsetsubset of relationU+2282
\supsetsuperset of relationU+2283
⊂⃒\nsubsetnegation of subset relationU+2284
⊃⃒\nsupsetnegation of superset relationU+2285
\subseteqinclusion relation, or subset of, or equal toU+2286
\supseteqconverse of inclusion relation, or superset of, or equal toU+2287
\sqcupbinary disjoint union, or binary coproduct operatorU+2294
\bigcapn-ary intersection operatorU+22C2
\bigcupn-ary union operatorU+22C3

\;

\phantom{-}symbol\phantom{-}\phantom{-}in linear logic\phantom{-}
A\phantom{A}\topA\phantom{A}additive truth
A\phantom{A}\botA\phantom{A}additive falsehood
A\phantom{A}00A\phantom{A}multiplicative falsehood
A\phantom{A}11A\phantom{A}multiplicative truth
A\phantom{A}\multimapA\phantom{A}A\phantom{A}linear implicationA\phantom{A}
A\phantom{A}\otimesA\phantom{A}A\phantom{A}multiplicative conjunctionA\phantom{A}
A\phantom{A}\oplusA\phantom{A}A\phantom{A}additive disjunctionA\phantom{A}
A\phantom{A}&\&A\phantom{A}A\phantom{A}additive conjunctionA\phantom{A}
A\phantom{A}\invampA\phantom{A}A\phantom{A}multiplicative disjunctionA\phantom{A}
A\phantom{A}!\;!A\phantom{A}A\phantom{A}exponential conjunctionA\phantom{A}
A\phantom{A}?\;?A\phantom{A}A\phantom{A}exponential disjunctionA\phantom{A}
A\phantom{A}^\botA\phantom{A}A\phantom{A}negationA\phantom{A}

\;

\phantom{-}symbol\phantom{-}\phantom{-}in dependent type theory\phantom{-}\phantom{-}propositions as types\phantom{-}
A\phantom{A}\toA\phantom{A}function typeA\phantom{A}implication
A\phantom{A}×\timesA\phantom{A}product typeA\phantom{A}conjunction
A\phantom{A}++A\phantom{A}sum typeA\phantom{A}disjunction
A\phantom{A}00, \emptysetA\phantom{A}empty typeA\phantom{A}false
A\phantom{A}11A\phantom{A}unit typeA\phantom{A}true
A\phantom{A}==, Id\mathrm{Id}A\phantom{A}identity typeA\phantom{A}propositional equality
A\phantom{A}\simeqA\phantom{A}equivalence of typesA\phantom{A}logical equivalence
A\phantom{A}\sum, Σ\Sigma, ×\timesA\phantom{A}dependent sum typeA\phantom{A}existential quantifier
A\phantom{A}\prod, Π\Pi, \toA\phantom{A}dependent product typeA\phantom{A}universal quantifier
A\phantom{A}isContr\mathrm{isContr}A\phantom{A}is contractible typeA\phantom{A}unique proof
A\phantom{A}isContr(A+B)\mathrm{isContr}(A + B)A\phantom{A}sum type is contractible typeA\phantom{A}exclusive disjunction
A\phantom{A}isContr( x:AB(x))\mathrm{isContr}\left(\sum_{x:A} B(x)\right)A\phantom{A}dependent sum type is contractible typeA\phantom{A}uniqueness quantifier
A\phantom{A}ua\mathrm{ua}A\phantom{A}univalence axiomA\phantom{A}propositional extensionality

Last revised on July 3, 2018 at 06:48:59. See the history of this page for a list of all contributions to it.