A version of the closed graph theorem Jitender Singh1 Department of Mathematics, Guru Nanak Dev University, Amritsar-143005, Punjab, INDIA

Abstract In this note we discuss a variation of the closed graph theorem given by my students Ms. Kirandeep Kaur and Ms. Rupinder Kaur.

We need the following simple lemma: Lemma: A continuous bijective map from a compact topological space to a Hausdorff space is a homeomorphism. Proof : Let f : X → Y be a continuous bijective map such that X is compact and Y be Hausdorff. Then for any closed subset A of X, A is compact as being closed subspace of a compact space. Consequently f (A) is compact in Y by continuity of f. But then f (A) is closed in Y as compact subspace of a Hausdorff space is closed. This proves f −1 is continuous. Theorem: Let E be a compact Hausdorff space and f : E → f (E) be a map such that the graph G(f ) := {x × f (x) | x ∈ E} of f is a subspace of the product space E × f (E). Then f is continuous if and only if G(f ) is compact. Proof: Observe the following commuting diagram: -

-f (E) µ ¡ ¡

@

¡

@

π2

¡

@

¡ 6

j

x ◦j

π1

E × f (E)

y

π1

@

◦j

-

@ I

f = (π2 ◦ j) ◦ (π1 ◦ j)−1

π2

E

G(f ) Here π1 and π2 are the projection maps from the product space E × f (E) onto its components which are always continuous. Also, j denotes the inclusion map from the subspace G(f ) into E × f (E) which is also continuous in the subspace topology. From the diagram it is clear that f = (π2 ◦ j) ◦ (π1 ◦ j)−1 where the map π1 ◦ j is a bijection and f is continuous if and only if the inverse map (π1 ◦ j)−1 is continuous if and only if G(f ) is compact (because if G(f ) is compact then (π1 ◦ j)−1 is continuous by the preceding lemma. Conversely if (π1 ◦ j)−1 is continuous then it is a homeomorphism and G(f ) being homeomorphic image of the compact space E is compact.) References: [1] J. Munkres. Topology, John-Wiley, 2005. [2] W. Rudin. Principles of Mathematical Analysis, Mc Graw Hill, 2000. 1

Electronic mail: [email protected]

1

A version of the closed graph theorem

[1] J. Munkres. Topology, John-Wiley, 2005. [2] W. Rudin. Principles of Mathematical Analysis, Mc Graw Hill, 2000. 1Electronic mail: sonumaths@mail.com. 1.

63KB Sizes 0 Downloads 255 Views

Recommend Documents

Weakly closed graph
Until we define the notion of weak closedness, we fix a graph G and a labeling of. V (G). Let (a1,...,an) be a sequence such that 1 ≤ ai ≤ n and ai = aj if i = j. Definition 2.1. We say that ai is interchangeable with ai+1 if {ai,ai+1} ∈ E(G).

A stronger version of Friedman's self-embedding theorem
A stronger version of Friedman's self-embedding theorem. Keita Yokoyama. May 20, 2011. In [1], Harvey Friedman showed the famous self-embedding theorem for PA which asserts that every countable model of PA has an initial segment which is isomorphic t

A proof of a Graph-theoretic version of the Union ...
In [1] M. H. El-Zahar proposed a weaker version of this conjecture (Conjecture 2), and it is state in the following way: Let G = (V (G),E(G)) be a simple graph with neither loops nor multiple edges. A subgraph S of G is called a derived subgraph of G

A k-Provers Parallel Repetition Theorem for a version of ...
Feb 10, 2010 - where Xi is the questions set of prover i where i ∈ 1,...,k. Each prover ... The provers send their answers to the verifier, ai ∈ Ai where Ai is.

WEAKLY CLOSED GRAPH Let k be an F-finite field of ...
[HeHiHrKR] J. Herzog, T. Hibi, F. Hreindóttir, T. Kahle and J. Rauh, Binomial edge ideals and conditional independence statements, Adv. Appl. Math., 45 (2010), ...

The Fundamental Theorem of Calculus
Problem: Using the information above found in example 5, sketch a graph of ( ). g x . The solutions for example 5: SOLUTIONS: We use the modified diagram above. (a) To calculate. 0. 2. (0). ( ) g. f t dt. -. = ∫. , we note that A1 = A2 and that thi

On the automorphism group of a Johnson graph
Dec 11, 2014 - the automorphism group of the Johnson graph J(n, i) is Sn × 〈T〉, where T is the complementation .... Since A ∩ B and Ac ∩ Bc have the same cardinality, the complementation ... We call each clique Yp a clique of the first kind.

More finding the equation of a graph practice
More finding the equation of a graph practice. Page 2. More finding the equation of a graph practice. Page 3. More finding the equation of a graph practice.

The Birank Number of a Graph
of a minimality is that a k-ranking f is globally minimal if for all v ∈ V (G), ... †Department of Mathematics, Moravian College, Bethlehem, PA 18018, Email: [email protected]. ‡School of Mathematical Sciences, Rochester Institute of Techno

On the automorphism group of a Johnson graph
n = 2i cases was already determined in [7], but the proof given there uses. *Department of Electronics and Telecommunication Engineering, Vidyalankar Insti-.

Theorem of math.pdf
ሻ − ૚ࡼሺ. Page 3 of 11. Theorem of math.pdf. Theorem of math.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Theorem of math.pdf. Page 1 of 11.

SCHOOL CLOSED
PIZZA. Cheese. Pepperon i. 7. McDonald's. Happy Meal. Plain Hamburger. Cheese Burger. 4Pc Chicken. Nuggets. 8. Pick Up Stix. Brown. OR. White Rice w/house chicken & fortune cookie. 9. Taco Company. 1 Taco. Bean & Cheese. Burrito. Cheese Quesadilla. 1

a dichotomy theorem for graphs induced by commuting families of ...
Then gk ◦gs' ◦π(0nγ) = gt' ◦π(0nγ), and since 〈g0,g1,...〉 is prismatic, it follows that supp(t ) = supp(s )∐ {k}, thus k = ki, for some i ≤ n, and supp(t) = supp(s)∐ {ki}, ...

A trichotomy theorem in natural models of AD
The argument can be seen in a natural way as proving two dichotomy theorems, ..... holding not in the universe V of all sets but rather in particular inner models, such as L(R). ..... any tree T on R with no end nodes has an infinite branch.

2.4. Average Value of a Function (Mean Value Theorem) 2.4.1 ...
f(x)dx . 2.4.2. The Mean Value Theorem for Integrals. If f is con- tinuous on [a, b], then there exists a number c in [a, b] such that f(c) = fave = 1 b − a. ∫ b a f(x)dx ,.

the graph conception of set
X0 ∈ X1 ∈ X2 ∈ X0. But not only does the axiom rule out the existence of certain sets; it does so in such a way as to give rise to a picture of the set-theoretic universe as a hierarchy divided into levels. For let us define the levels Vα of t

A Closed-Form GARCH Option Valuation Model
(1998) that uses a separate implied volatility for each option to fit to the smirk/smile in implied volatilties. The GARCH model remains superior even though the ...

A Closed Form Expression for the Uncertainty in ...
REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT)

Pattern Recognition A closed-form reduction of multi ...
cDepartment of Management Information Systems, The University of Arizona, USA. A R T I C L E. I N F O .... Compared with the reduction in [4] which also utilizes the data ..... with probability at least 1 − over the choice of bi,. 1. N. N. ∑ i=1

A new proof of Belyi's Theorem
A new proof of Belyi's Theorem is given. While Belyi's two proofs use different methods to first reduce the branch locus from Q to Q and then from Q to {0, 1, ∞} ...

A STRUCTURE THEOREM FOR RATIONALIZABILITY ...
under which rti (ai) is a best reply for ti and margΘXT−i. (πti,rti (ai)) = κti . Define a mapping φti,rti (ai),m : Θ* → Θ* between the payoff functions by setting. (A.5).