Index of notation
The reference numbers indicate the chapter, section, and subsection, in that order. (R refers to the Summary of Results.)
□ \square □ , τ \tau τ , ∨ \vee ∨ , ¬ \neg ¬ , ⇒ \Rightarrow ⇒ : I.1.1
τ x ( A ) \tau_x(A) τ x ( A ) , ( B ∣ x ) A (B\mid x)A ( B ∣ x ) A , A { x } A\{x\} A { x } , A { x , y } A\{x,y\} A { x , y } , A { B } A\{B\} A { B } , A { B , C } A\{B,C\} A { B , C } : I.1.1
not ( A ) (A) ( A ) , ( A ) (A) ( A ) or ( B ) (B) ( B ) , ( A ) ⇒ ( B ) (A)\Rightarrow(B) ( A ) ⇒ ( B ) : I.2
“A A A and B B B ” : I.3.4
⟺ \Longleftrightarrow ⟺ , A ⟺ B A\Longleftrightarrow B A ⟺ B : I.3.5
( ∃ x ) R (\exists x)R ( ∃ x ) R , ( ∀ x ) R (\forall x)R ( ∀ x ) R : I.4.1
( ∃ A x ) R (\exists_Ax)R ( ∃ A x ) R , ( ∀ A x ) R (\forall_Ax)R ( ∀ A x ) R : I.4.4
= = = , ≠ \ne = , T = U T=U T = U , T ≠ U T\ne U T = U : I.5.1
∈ \in ∈ , ∉ \notin ∈ / , T ∈ U T\in U T ∈ U , T ∉ U T\notin U T ∈ / U : II.1.1
⊂ \subset ⊂ , ⊃ \supset ⊃ , ⊄ \not\subset ⊂ , ⊅ \not\supset ⊃ , x ⊂ y x\subset y x ⊂ y , x ⊃ y x\supset y x ⊃ y : II.1.2
C o l l x R \mathrm{Coll}_xR Coll x R , ε x ( R ) \varepsilon_x(R) ε x ( R ) : II.1.4
{ x , y } \{x,y\} { x , y } , { x } \{x\} { x } : II.1.5
C X A C_XA C X A , X − A X-A X − A , C A CA C A , ∅ \varnothing ∅ : II.1.7
⊃ \supset ⊃ , ( T , U ) (T,U) ( T , U ) , pr 1 z \operatorname{pr}_1z pr 1 z , pr 2 z \operatorname{pr}_2z pr 2 z : II.2.1
A × B A\times B A × B , A × B × C A\times B\times C A × B × C , A × B × C × D A\times B\times C\times D A × B × C × D , ( x , y , z ) (x,y,z) ( x , y , z ) : II.2.2
pr 1 ⟨ G ⟩ \operatorname{pr}_1\langle G\rangle pr 1 ⟨ G ⟩ , pr 2 ⟨ G ⟩ \operatorname{pr}_2\langle G\rangle pr 2 ⟨ G ⟩ , pr 1 G \operatorname{pr}_1G pr 1 G , pr 2 G \operatorname{pr}_2G pr 2 G (G a graph) : II.3.1
G ⟨ X ⟩ G\langle X\rangle G ⟨ X ⟩ , G ( X ) G(X) G ( X ) , G ( x ) G(x) G ( x ) (G a graph, X a set, x an object) : II.3.1
Γ ⟨ X ⟩ \Gamma\langle X\rangle Γ ⟨ X ⟩ , Γ ( X ) \Gamma(X) Γ ( X ) , Γ ( x ) \Gamma(x) Γ ( x ) (Γ \Gamma Γ a correspondence, X a set, x an object) : II.3.1
G − 1 \overset{-1}{G} G − 1 (G a graph), Γ − 1 \overset{-1}{\Gamma} Γ − 1 (Γ \Gamma Γ a correspondence) : II.3.2
G ′ ∘ G G'\circ G G ′ ∘ G , G ′ G G'G G ′ G (G, G' graphs), Γ ′ ∘ Γ \Gamma'\circ\Gamma Γ ′ ∘ Γ , Γ ′ Γ \Gamma'\Gamma Γ ′ Γ (Γ \Gamma Γ , Γ ′ \Gamma' Γ ′ correspondences) : II.3.3
Δ A \Delta_A Δ A , I A I_A I A (A a set) : II.3.3
f ( x ) f(x) f ( x ) , f x f_x f x (f a function), F ( x ) F(x) F ( x ) , F x F_x F x (F a functional graph) : II.3.4
f : A → B , A → f B : I I .3.4 f : \mathrm{A} \to \mathrm{B},\ A \xrightarrow{f} \mathrm{B} : \mathrm{II}.3.4 f : A → B , A f B : II .3.4
x → T ( x ∈ A , T ∈ C ) , x → T ( x ∈ A ) , x → T , ( T ) x ∈ A , T ( by abuse of language ) ( T a term ) : I I .3.6 x \to T\ (x \in A,\ T \in C),\ x \to T\ (x \in A),\ x \to T,\ (T)_{x\in A},\ T\ (\text{by abuse of language})\ (T\text{ a term}) : \mathrm{II}.3.6 x → T ( x ∈ A , T ∈ C ) , x → T ( x ∈ A ) , x → T , ( T ) x ∈ A , T ( by abuse of language ) ( T a term ) : II .3.6
pr 1 , pr 2 : I I .3.6 \operatorname{pr}_1,\ \operatorname{pr}_2 : \mathrm{II}.3.6 pr 1 , pr 2 : II .3.6
g f ( g , f mappings ) ( by abuse of language ) : I I .3.7 gf\ (g,f\text{ mappings})\ (\text{by abuse of language}) : \mathrm{II}.3.7 g f ( g , f mappings ) ( by abuse of language ) : II .3.7
f ( x , y ) , f ( ⋅ , y ) , f ( x , ⋅ ) , f ( , y ) , f ( x , ) : I I .3.9 f(x,y),\ f(\cdot,y),\ f(x,\cdot),\ f(\ ,y),\ f(x,\ ) : \mathrm{II}.3.9 f ( x , y ) , f ( ⋅ , y ) , f ( x , ⋅ ) , f ( , y ) , f ( x , ) : II .3.9
u × v ( u , v functions ) , ( u , v ) ( by abuse of language ) : I I .3.9 u\times v\ (u,v\text{ functions}),\ (u,v)\ (\text{by abuse of language}) : \mathrm{II}.3.9 u × v ( u , v functions ) , ( u , v ) ( by abuse of language ) : II .3.9
⋃ i ∈ I X i , ⋂ i ∈ I X i : I I .4.1 \bigcup_{i\in I}X_i,\ \bigcap_{i\in I}X_i : \mathrm{II}.4.1 i ∈ I ⋃ X i , i ∈ I ⋂ X i : II .4.1
⋃ X ∈ E X , ⋂ X ∈ E X : I I .4.1 \bigcup_{X\in\mathfrak{E}}X,\ \bigcap_{X\in\mathfrak{E}}X : \mathrm{II}.4.1 X ∈ E ⋃ X , X ∈ E ⋂ X : II .4.1
A ∪ B , A ∪ B ∪ C , A ∩ B , A ∩ B ∩ C : I I .4.5 A\cup B,\ A\cup B\cup C,\ A\cap B,\ A\cap B\cap C : \mathrm{II}.4.5 A ∪ B , A ∪ B ∪ C , A ∩ B , A ∩ B ∩ C : II .4.5
{ x , y , z } : I I .4.5 \{x,y,z\} : \mathrm{II}.4.5 { x , y , z } : II .4.5
P ( X ) : I I .5.1 \mathfrak{P}(X) : \mathrm{II}.5.1 P ( X ) : II .5.1
F ( E , F ) , F E : I I .5.2 \mathfrak{F}(E,F),\ F^E : \mathrm{II}.5.2 F ( E , F ) , F E : II .5.2
∏ i ∈ I X i , pr i : I I .5.3 \prod_{i\in I}X_i,\ \operatorname{pr}_i : \mathrm{II}.5.3 i ∈ I ∏ X i , pr i : II .5.3
pr J : I I .5.4 \operatorname{pr}_J : \mathrm{II}.5.4 pr J : II .5.4
( g i ) i ∈ I ( extension to products of the family ( g i ) i ∈ I , by abuse of language ) : I I .5.7 (g_i)_{i\in I}\ (\text{extension to products of the family }(g_i)_{i\in I},\ \text{by abuse of language}) : \mathrm{II}.5.7 ( g i ) i ∈ I ( extension to products of the family ( g i ) i ∈ I , by abuse of language ) : II .5.7
x ≡ y ( m o d R ) ( R an equivalence relation ) : I I .6.1 x\equiv y\pmod R\ (R\text{ an equivalence relation}) : \mathrm{II}.6.1 x ≡ y ( mod R ) ( R an equivalence relation ) : II .6.1
E / R ( E a set , R an equivalence relation ) : I I .6.2 E/R\ (E\text{ a set},\ R\text{ an equivalence relation}) : \mathrm{II}.6.2 E / R ( E a set , R an equivalence relation ) : II .6.2
R A ( R an equivalence relation , A a set ) : I I .6.6 R_A\ (R\text{ an equivalence relation},\ A\text{ a set}) : \mathrm{II}.6.6 R A ( R an equivalence relation , A a set ) : II .6.6
R / S ( R , S equivalence relations ) : I I .6.7 R/S\ (R,S\text{ equivalence relations}) : \mathrm{II}.6.7 R / S ( R , S equivalence relations ) : II .6.7
R × R ′ ( R , R ′ equivalence relations ) : I I .6.8 R\times R'\ (R,R'\text{ equivalence relations}) : \mathrm{II}.6.8 R × R ′ ( R , R ′ equivalence relations ) : II .6.8
x ≤ y , y ≥ x , x ≰ y : I I I .1.3 x\leq y,\ y\geq x,\ x\nleq y : \mathrm{III}.1.3 x ≤ y , y ≥ x , x ≰ y : III .1.3
x < y , y < x : I I I .1.3 x<y,\ y<x : \mathrm{III}.1.3 x < y , y < x : III .1.3
sup E X , inf E X : I I I .1.9 \sup_E X,\ \inf_E X : \mathrm{III}.1.9 sup E X , inf E X : III .1.9
sup X , inf X : I I I .1.9 \sup X,\ \inf X : \mathrm{III}.1.9 sup X , inf X : III .1.9
sup ( x , y ) , inf ( x , y ) : I I I .1.9 \sup(x,y),\ \inf(x,y) : \mathrm{III}.1.9 sup ( x , y ) , inf ( x , y ) : III .1.9
sup x ∈ A f ( x ) , inf x ∈ A f ( x ) : I I I .1.9 \sup_{x\in A}f(x),\ \inf_{x\in A}f(x) : \mathrm{III}.1.9 x ∈ A sup f ( x ) , x ∈ A inf f ( x ) : III .1.9
sup x ∈ A x , inf x ∈ A x : I I I .1.9 \sup_{x\in A}x,\ \inf_{x\in A}x : \mathrm{III}.1.9 x ∈ A sup x , x ∈ A inf x : III .1.9
[ a , b ] , [ a , b [ , ] a , b ] , ] a , b [ : I I I .1.13 [a,b],\ [a,b[,\ ]a,b],\ ]a,b[ : \mathrm{III}.1.13 [ a , b ] , [ a , b [ , ] a , b ] , ] a , b [ : III .1.13
[ ← , a ] , ] ← , a [ , ] a , → [ , [ a , → [ : I I I .1.13 [\leftarrow,a],\ ]\leftarrow,a[,\ ]a,\rightarrow[,\ [a,\rightarrow[ : \mathrm{III}.1.13 [ ← , a ] , ] ← , a [ , ] a , → [ , [ a , → [ : III .1.13
∑ i ∈ I E i , ( ordinal sum ) : I I I .1 , Exercise 3 \sum_{i\in I}E_i,\ (\text{ordinal sum}) : \mathrm{III}.1,\ \text{Exercise 3} i ∈ I ∑ E i , ( ordinal sum ) : III .1 , Exercise 3
S x : I I I .2.1 S_x : \mathrm{III}.2.1 S x : III .2.1
Is ( Γ , Γ ′ ) , Ord ( E ) , λ < μ , ∑ i ∈ I λ i , ∏ i ∈ I λ i , λ + μ , μ λ , λ ∗ ( λ , μ , λ , order-types ) \operatorname{Is}(\Gamma,\Gamma'),\ \operatorname{Ord}(E),\ \lambda<\mu,\ \sum_{i\in I}\lambda_i,\ \prod_{i\in I}\lambda_i,\ \lambda+\mu,\ \mu\lambda,\ \lambda^*(\lambda,\mu,\lambda,\text{order-types}) Is ( Γ , Γ ′ ) , Ord ( E ) , λ < μ , ∑ i ∈ I λ i , ∏ i ∈ I λ i , λ + μ , μ λ , λ ∗ ( λ , μ , λ , order-types ) : III.2, Exercise 13
ξ η \xi^\eta ξ η (ξ , η \xi,\eta ξ , η ordinals) : III.2, Exercise 18
Eq ( X , Y ) , Card ( X ) \operatorname{Eq}(X,Y),\ \operatorname{Card}(X) Eq ( X , Y ) , Card ( X ) : III.3.1
0 , 1 , 2 0,1,2 0 , 1 , 2 : III.3.1
c ≤ d \mathfrak{c}\leq\mathfrak{d} c ≤ d (c , d \mathfrak{c},\mathfrak{d} c , d cardinals) : III.3.2
sup i ∈ I a i , ( ( a i ) i ∈ I \sup_{i\in I}a_i,\ ((a_i)_{i\in I} sup i ∈ I a i , (( a i ) i ∈ I a family of cardinals) : III.3.2
∑ i ∈ I a i , ∏ i ∈ I a i , ∏ i ∈ I ( ( a i ) i ∈ I \sum_{i\in I}a_i,\ \prod_{i\in I}a_i,\ \prod_{i\in I}((a_i)_{i\in I} ∑ i ∈ I a i , ∏ i ∈ I a i , ∏ i ∈ I (( a i ) i ∈ I a family of cardinals) : III.3.3
a + b , a b a+b,\ ab a + b , ab (a , b a,b a , b cardinals) : III.3.3
a b a^b a b (a , b a,b a , b cardinals) : III.3.5
3 , 4 3,4 3 , 4 : III.4.1
a − b a-b a − b (a , b a,b a , b integers, b < a b<a b < a ) : III.5.2
( t i ) i ∈ I , ( t i ) a ≤ i ≤ b (t_i)_{i\in I},\ (t_i)_{a\leq i\leq b} ( t i ) i ∈ I , ( t i ) a ≤ i ≤ b : III.5.4
∏ i ∈ I X i , ∏ i = a b X i \prod_{i\in I}X_i,\ \prod_{i=a}^{b}X_i ∏ i ∈ I X i , ∏ i = a b X i : III.5.4
φ A \varphi_A φ A (A A A a subset of a set E E E ) : III.5.5
a b , a / b \frac{a}{b},\ a/b b a , a / b (a , b a,b a , b integers such that b b b divides a a a ) : III.5.6
5 , 6 , 7 , 8 , 9 5,6,7,8,9 5 , 6 , 7 , 8 , 9 : III.5.7
n ! n! n ! (n n n an integer) : III.5.8
( n p ) \binom{n}{p} ( p n ) (n , p n,p n , p integers) : III.5.8
N , ℵ 0 \mathbf{N},\ \aleph_0 N , ℵ 0 : III.6.1
( x n ) n ∈ N , ( x n ) k ≤ n , ( x n ) n ≥ k , ( x n ) (x_n)_{n\in\mathbf{N}},\ (x_n)_{k\leq n},\ (x_n)_{n\geq k},\ (x_n) ( x n ) n ∈ N , ( x n ) k ≤ n , ( x n ) n ≥ k , ( x n ) : III.6.1
∏ n ∈ N X n , ∏ n = k ∞ X n \prod_{n\in\mathbf{N}}X_n,\ \prod_{n=k}^{\infty}X_n ∏ n ∈ N X n , ∏ n = k ∞ X n : III.6.1
f n f^n f n (f f f a mapping) : III.6.2
ω α , ℵ α \omega_\alpha,\ \aleph_\alpha ω α , ℵ α (α \alpha α an ordinal) : III.6, Exercise 10
lim ← E α \lim_{\leftarrow}E_\alpha lim ← E α (E α E_\alpha E α sets) : III.7.1
lim ← u α \lim_{\leftarrow}u_\alpha lim ← u α (u α u_\alpha u α mappings) : III.7.2
lim α , λ ← E α λ , lim α ← E α λ , lim α , λ ← u α λ , lim α ← u α λ \lim_{\alpha,\lambda\leftarrow}E^\lambda_\alpha,\ \lim_{\alpha\leftarrow}E^\lambda_\alpha,\ \lim_{\alpha,\lambda\leftarrow}u^\lambda_\alpha,\ \lim_{\alpha\leftarrow}u^\lambda_\alpha lim α , λ ← E α λ , lim α ← E α λ , lim α , λ ← u α λ , lim α ← u α λ : III.7.3
lim α ← E α \lim_{\alpha\leftarrow}E_\alpha lim α ← E α (E α E_\alpha E α sets) : III.7.5
lim α → u α \lim_{\alpha\rightarrow}u_\alpha lim α → u α (u α u_\alpha u α mappings) : III.7.6
lim α , λ → E α λ , lim α → E α λ , lim α , λ → u α λ , lim α → u α λ : \displaystyle \lim_{\overrightarrow{\alpha,\lambda}} E_\alpha^\lambda,\ \lim_{\overrightarrow{\alpha}} E_\alpha^\lambda,\ \lim_{\overrightarrow{\alpha,\lambda}} u_\alpha^\lambda,\ \lim_{\overrightarrow{\alpha}} u_\alpha^\lambda : α , λ lim E α λ , α lim E α λ , α , λ lim u α λ , α lim u α λ : III.7.7
S ( E 1 , … , E n ) S(E_1,\ldots,E_n) S ( E 1 , … , E n ) (S an echelon construction scheme, E 1 , … , E n E_1,\ldots,E_n E 1 , … , E n sets) : IV.1.1
⟨ f 1 , … , f n ⟩ s \langle f_1,\ldots,f_n\rangle^s ⟨ f 1 , … , f n ⟩ s (S an echelon construction scheme, f 1 , … , f n f_1,\ldots,f_n f 1 , … , f n mappings) : IV.1.1
R { x , y , z } R\{x,y,z\} R { x , y , z } : R.1.2
= , ≠ =,\ne = , = : R.1.6
∈ , ∉ \in,\notin ∈ , ∈ / : R.1.7
∁ A , E − A \complement A,\ E-A ∁ A , E − A : R.1.7
∅ \varnothing ∅ : R.1.8
{ a } \{a\} { a } : R.1.9
P ( E ) \mathfrak{P}(E) P ( E ) : R.1.10
⊂ , ⊃ , ⫋ , ⫌ \subset,\supset,\subsetneqq,\supsetneqq ⊂ , ⊃ , ⫋ , ⫌ : R.1.12
∪ , ∩ \cup,\cap ∪ , ∩ : R.1.13
{ x , y , z } \{x,y,z\} { x , y , z } : R.1.13
X A X_A X A (X a subset) : R.1.16
E A \mathscr{E}_A E A (E \mathscr{E} E a set of subsets) : R.1.16
f ( x ) , f x , x → f ( x ) f(x),\ f_x,\ x\to f(x) f ( x ) , f x , x → f ( x ) (f f f a mapping, x x x an element) : R.2.2
f ( X ) f(X) f ( X ) (X a subset) : R.2.4
f − 1 f^{-1} f − 1 (f f f a mapping) : R.2.6
g ∘ f , h ∘ g ∘ f g\circ f,\ h\circ g\circ f g ∘ f , h ∘ g ∘ f (f , g , h f,g,h f , g , h mappings) : R.2.11
f A f_A f A (f f f a mapping) : R.2.13
( x i ) i ∈ I , ( x i ) (x_i)_{i\in I},\ (x_i) ( x i ) i ∈ I , ( x i ) : R.2.14
( x , y ) (x,y) ( x , y ) : R.3.1
E × F E\times F E × F (E, F sets) : R.3.1
pr 1 , pr 2 \operatorname{pr}_1,\operatorname{pr}_2 pr 1 , pr 2 : R.3.1
Δ \Delta Δ : R.3.4
Z − 1 Z^{-1} Z − 1 (Z a subset of a product) : R.3.4
K ( X ) K(X) K ( X ) (K a subset of E × F E\times F E × F , X a subset of E) : R.3.6
K ( x ) K(x) K ( x ) (K a subset of E × F E\times F E × F , x an element of E) : R.3.9
B ∘ A , B A , C ∘ B ∘ A , C B A B\circ A,\ BA,\ C\circ B\circ A,\ CBA B ∘ A , B A , C ∘ B ∘ A , C B A (A a subset of E × F E\times F E × F , B a subset of F × G F\times G F × G , C a subset of G × H G\times H G × H ) : R.3.10
( x , y , z ) (x,y,z) ( x , y , z ) : R.3.12
E × F × G E\times F\times G E × F × G : R.3.12
pr 1 , 2 \operatorname{pr}_{1,2} pr 1 , 2 : R.3.12
( f , g , h ) ( f , g , h m a p p i n g s ) : R .3.12 (f,g,h)\ (f,g,h\ mappings) : R.3.12 ( f , g , h ) ( f , g , h ma pp in g s ) : R .3.12
⋃ i ∈ I X i , ⋃ i X i , ⋃ X ∈ F X : R .4.4
\bigcup_{i\in I} X_i,\quad \bigcup_i X_i,\quad \bigcup_{X\in\mathfrak{F}} X : R.4.4
i ∈ I ⋃ X i , i ⋃ X i , X ∈ F ⋃ X : R .4.4
⋂ i ∈ I X i , ⋂ i X i , ⋂ X ∈ F X : R .4.9
\bigcap_{i\in I} X_i,\quad \bigcap_i X_i,\quad \bigcap_{X\in\mathfrak{F}} X : R.4.9
i ∈ I ⋂ X i , i ⋂ X i , X ∈ F ⋂ X : R .4.9
∏ i ∈ I X i , ∏ i X i : R .4.9
\prod_{i\in I} X_i,\quad \prod_i X_i : R.4.9
i ∈ I ∏ X i , i ∏ X i : R .4.9
E I ( E , I s e t s ) : R .4.9 E^I\ (E,I\ sets) : R.4.9 E I ( E , I se t s ) : R .4.9
pr J , pr X : R .4.11 \operatorname{pr}_J,\operatorname{pr}_X : R.4.11 pr J , pr X : R .4.11
( f I ) ( f I m a p p i n g s ) : R .4.13 (f_I)\ (f_I\ mappings) : R.4.13 ( f I ) ( f I ma pp in g s ) : R .4.13
E / R ( E a s e t , R a n e q u i v a l e n c e r e l a t i o n o n E ) : R .5.2 E/R\ (E\ a\ set,\ R\ an\ equivalence\ relation\ on\ E) : R.5.2 E / R ( E a se t , R an e q u i v a l e n ce r e l a t i o n o n E ) : R .5.2
R A ( R a n e q u i v a l e n c e r e l a t i o n , A a s u b s e t ) : R .5.5 R_A\ (R\ an\ equivalence\ relation,\ A\ a\ subset) : R.5.5 R A ( R an e q u i v a l e n ce r e l a t i o n , A a s u b se t ) : R .5.5
T / R ( T , R e q u i v a l e n c e r e l a t i o n s ) : R .5.9 T/R\ (T,\ R\ equivalence\ relations) : R.5.9 T / R ( T , R e q u i v a l e n ce r e l a t i o n s ) : R .5.9
R × S ( R , S e q u i v a l e n c e r e l a t i o n s ) : R .5.10 R\times S\ (R,\ S\ equivalence\ relations) : R.5.10 R × S ( R , S e q u i v a l e n ce r e l a t i o n s ) : R .5.10
N : R .6.2 N : R.6.2 N : R .6.2
≤ , ≥ , < , > : R .6.3 \leq,\ \geq,\ <,\ > : R.6.3 ≤ , ≥ , < , >: R .6.3
[ a , b ] , [ a , b [ , ] a , b ] , ] a , b [ , ] ← , a ] , ] ← , a [ , [ a , → [ , ] a , → [ , ] ← , → [ : R .6.4 [a,b],\quad [a,b[,\quad ]a,b],\quad ]a,b[,\quad ]\leftarrow,a],\quad ]\leftarrow,a[,\quad [a,\to[,\quad ]a,\to[,\quad ]\leftarrow,\to[ : R.6.4 [ a , b ] , [ a , b [ , ] a , b ] , ] a , b [ , ] ← , a ] , ] ← , a [ , [ a , → [ , ] a , → [ , ] ← , → [ : R .6.4
sup E X , sup X , inf E X , inf X : R .6.7 \sup_E X,\ \sup X,\ \inf_E X,\ \inf X : R.6.7 sup E X , sup X , inf E X , inf X : R .6.7
sup x ∈ A f ( x ) , inf x ∈ A f ( x ) : R .6.7
\sup_{x\in A} f(x),\quad \inf_{x\in A} f(x) : R.6.7
x ∈ A sup f ( x ) , x ∈ A inf f ( x ) : R .6.7
lim ⟶ ( E α β , f β α ) , lim ⟶ E α , lim ⟶ u α : R .6.13
\underset{\longrightarrow}{\lim}(E_{\alpha\beta},f_{\beta\alpha}),\quad \underset{\longrightarrow}{\lim}E_\alpha,\quad \underset{\longrightarrow}{\lim}u_\alpha : R.6.13
⟶ lim ( E α β , f β α ) , ⟶ lim E α , ⟶ lim u α : R .6.13
lim ⟵ ( E α β , f α β ) , lim ⟵ E α , lim ⟵ u α : R .6.14
\underset{\longleftarrow}{\lim}(E_{\alpha\beta},f_{\alpha\beta}),\quad \underset{\longleftarrow}{\lim}E_\alpha,\quad \underset{\longleftarrow}{\lim}u_\alpha : R.6.14
⟵ lim ( E α β , f α β ) , ⟵ lim E α , ⟵ lim u α : R .6.14
( x n ) , ( x m , n ) ( m , n n a t u r a l i n t e g e r s ) : R .7.8 (x_n),\quad (x_{m,n})\ (m,n\ natural\ integers) : R.7.8 ( x n ) , ( x m , n ) ( m , n na t u r a l in t e g er s ) : R .7.8