answersLogoWhite

0

Topology

While geometry is primarily concerned with the mathematical properties of spatial objects, topology is concerned with the mathematical properties of those objects under continuous deformations. Please post all questions about topological subjects like homeomorphisms, manifolds, convergence, and connectedness, as well as their broad applications in computing, physics, and graph theory, into this category.

1,087 Questions

For which sets Adoes there exist a bijection from A to A that is different from the identity function of A?

Let A be any set that has at least 2 elements and let every element in set A maps to itself except for 2 elements that do not map to each other. i.e.

A = 1, 2, 3, ... , n

1 --> 2

2 --> 1

3 --> 3

4 --> 4

...

n --> n

Difference between star and mesh topology?

1.The star topology use a hub in the center, only one hub. So all data exchange will go throught that one hub/router to reach another computer .If the hub is down, all the network is down too. In a mesh topology, each computer in the network has its own hub/or itself, so data exchange is done directly from one computer/or its hub, to another computer/or its hub, this is more secure since only one computer will be down in a case of problem with the interface(hub/itself[network card])

2. Star topology has minimal line cost because only n-1 lines are required for connecting n nodes while mesh topology is the most expensive network from the point of view of link cost.If there are n nodes in a network. n(n-1)/2 links are required. Hence, cost of linking the system grows with square of the number of nodes.

3.In star topology communication is not very fast between any two nodes while in mesh topology communication is very fast between any two nodes.

Define the concept network topologies?

The various devise in anetwork can be linked in several ways: Sar, bus or Ring

What happens when there is a break in the cable of the bus topology?

This sounds like a homework question.....hmmmm.

Anyway- if there's a break in a bus topology, the nodes that are downstream from the break are cut-off from the rest of the network.

In a ring topology, the nodes on both sides of the break will loop the path (self-healing) back towards the ring, so every node is still communicating with each other.

Why is an empty set a subset of every set?

Because every member of the empty set is also a member of the other set. "If x is an element of the empty set, then it is also an element of the other set." Because the first part of the "if" is always false, the result is true. If this doesn't seem logical, see the Wikipedia article on "Vacuous truth".

What is laplace equation of continuity?

partial vx w/ respect to x + partial vy w/ respect to y + partial vz w/ respect to z = 0

What is the difference between Logical architecture and physical architecture?

The logical architecture is a more detailed structure defines what has to be done to support the user services. It defines the processes that perform functions and the information or data flows that are shared between these processes. Logical architecture do not include physical server names or addresses. They do include any business services, application names and details, and other relevant information for development purposes.

A physical architecture has all major components and entities identified within specific

physical servers and locations or specific software services, objects, or solutions.

Include all known details such as operating systems, version numbers, and even

patches that are relevant. Any physical constraints or limitations should also

be identified within the server components, data flows, or connections. This

design usually precludes or may be included and extended by the final implementation

team into an implementation design.

Are mass and weight of matter the same thing?

Strictly speaking no. For practical purposes yes.

Mass does not change - 1 kg is 1 kg anywhere in the universe. However, 1 kg weighs less on the moon than it does on the earth. Weight is dependent on gravity.

1 kg weighs 9.81 Newtons on the earth and about 1.64 Newtons on the moon.

Discuss the consequences if a connection fails in a bus topology?

Any connection failure in a bus topology will result in the network becoming unusable due to signal bounce in the affected cable.

How do you prove the Baire Category Theorem?

The Baire Category Theorem is, in my opinion, one of the most incredible, influential, and important results from any field of mathematics, let alone topology. It is known as an existence theorem because it provides the necessary conditions to prove that certain things must exist, even if there aren't any examples of them that can be shown. The theorem was proved by René-Louis Baire in 1899 and is a necessary result to prove, amongst other things, the uniform boundedness principle and the open mapping theorem (two of the three most fundamental results from functional analysis), the real numbers being uncountable, and the existence of continuous, yet nowhere differentiable, functions from R to R.

The proof is quite long and involves some pretty advanced math, so to help with the reader's comprehension there is a list of symbols and their meanings at the end of this proof. Also, I've added many related links with definitions and explanations of the terms used in this proof.

The Baire Category Theorem:

If B, D is a nonempty, complete metric space, then the following two statements hold:

1) If B is formulated as the union of countably-many subsets, C1, C2, …, Cp, then at least one of the Cp is somewhere dense.

2) If A1, A2, …, Ap are countably-many, dense, open subsets of B, then ∩pAp is dense in B, i.e. Cl(∩pAp) = B

Proof:

1) If the first statement is false, then there is a countable family {Cp}, p Є P, of subsets of B such that B = ∪pCp, but (Cl Cp)o = Ø for each p Є P. Therefore, for each p, Cl CpB. Select b1 Є B - Cl C1. There is a positive number m1 < 1, since B - Cl C1 is open, such that N(b1, m1) ⊂ B - Cl C1. Now we set G1 = N(b1, m1/2). Then Cl G1N(b1, m1); hence Cl G1 ∩ Cl C1 = Ø.

Since G1 is a nonempty, open subset of B, that means G1 ⊄ Cl C2. So, choose a b2 Є G1- Cl C2. Since G1 - Cl C2 is open, there is an m2 > 0 such that N(b2, m2) ⊂ G1 - Cl C2. This time we'll require m2 < 1/2 and then set G2 = N(b2, m2/2). Then G2G1 and Cl G2 ∩ Cl C2 = Ø.

If we continue on like this, requiring m3 < 1/3, m4 < 1/4, etc., we'll obtain a decreasing sequence of mp-neighborhoods, G1G2G3 ⊃ … ⊃ Gp ⊃ … such that Cl Gp ∩ Cl Cp = Ø and mp < 1/p. Then Cl G1 ⊃ Cl G2 ⊃ Cl G3 ⊃ … ⊃ Cl Gp ⊃ … and d(Gp) --> 0.

I'm going to use a result from another theorem in topology, not proven here, which says that if G1G2G3 ⊃ … ⊃ Gp ⊃ … , d(Gp) --> 0, and ∩pGp ≠ Ø, then the metric space B, D is complete. Therefore, ∩p Cl Gp ≠ Ø. So, if we pick a g Є ∩pGp, then g Є Cp for some p, since ∪pCp = B. However, that would imply that g Є Cl Cp ∩ Cl Gp which is impossible because Cl Cp and Cl Gp are disjoint. So, for 1), Q.E.D.

2) To start, we're going to suppose that {Ap}, p Є P, is a countable family of dense, open subsets of B. To prove that ∩pAp is dense, all that we need to prove is that every neighborhood of any element of B meets ∩pAp. In other words, for any selected g Є Band any m > 0, we'll show that N(g, m) ∩ (∩pAp) ≠ Ø.

If we set T = Cl N(g, m/2), then TN(g, m). Now we'll show that T ∩ (∩pAp) ≠ Ø. We know that T is a subspace of the closed metric space, B, D, and that Titself is closed. So, using an earlier theorem that won't be proved here, T is a complete metric space. If we set Gp = T - Ap which is equal to Tp ∩ (B - Ap), we see that the intersection of two closed subsets of B, Gp is closed in both B and T.

Now suppose Gp is somewhere dense. Then there is an element t Є T and a number q > 0 such that N(t, q) ∩ T ⊂ Cl GpT = Gp. Therefore, N(t, q) ∩ (T - Gp) = Ø. We can see that t Є T = Cl N(g, m/2). Therefore N(t, q) meets N(g, m/2) at some point z. We then choose q' > 0 such that N(z, q') ⊂ N(t, q) ∩ N(g, m/2). However, since Ap is dense, N(z, q') intersects Ap at a point we'll call z' . Well, then it must be that z' Є N(t, q) ∩ TGp. But, Gp= T - Ap, hence z' Є T - Ap. That implies then that z'Ap which is a contradiction. Therefore Gp must be nowhere dense in T.

So, by the first statement of the theorem, 1), which we already proved, T ≠ ∪pGp. Thus, there is n element s Є T - ∪pGp. Therefore, since Gp = T - Ap, then s Є T ∩ (∩pAp) and so T∩ (∩pAp) ≠ Ø meaning N(g, m) ∩ (∩pAp) ≠ Ø.

Q.E.D.

List of symbols:

R - The set of real numbers, including rational, irrational, positive, and negative numbers, as well as 0. Not including complex numbers having an imaginary part other than 0i, where i is the imaginary number √(-1).

B, D - The metric space of set B with metric D.

pAp - The intersection of all of the subsets A1, A2, …, Ap.

Cl - The closure of whatever set is written after it.

p Є P - p is an element of the set P.

P - The set of all positive integers, not including 0. This set is often referred to as the set of natural numbers and is labeled N, but since at times the natural numbers are said to include 0, I've labeled this set P to avoid ambiguity. Not to mention, I've used N within my label for neighborhood.

pCp - The union of all of the of the subsets C1, C2, …, Cp.

( )o - The interior of whatever set is in the parentheses.

Ø - The empty set; i.e. the set with nothing in it.

N(b1, m1) - The neighborhood of point b1 within distance m1.

⊂ - … is a subset of …

⊃ - … is a superset of …

d( ) - The diameter of whatever set is in the parentheses.

--> 0 - The limit of whatever comes before the symbol "-->" goes to 0.

What hardware does a bus topology need?

A bus topology needs a trunk cable, which is a high speed central cable to which all the nodes can be connected. If the trunk cable breaks down, however, the whole network comes to a halt.

What letter replaces the space A-B-D- -K-P?

The answer is G. The letter separation increases by one each turn.

A-B is one space apart, B-D is two spaces apart, D-G is three spaces apart, G-K is four spaces apart, and K-P is five spaces apart.

What is isometry that does not change orientation?

It's a transformation that's order of the letters like ABCD of a figure don't change when transformed.

What is a crystal symmetry?

Crystal Symmetry is the ability of a crystal to shape by nature and has a symmetrical shape. It's also referred about the occupation of diamond cutters.