- #1

- 1,270

- 0

If S is connected, then the interior of S is connected."

Is this true or not?

I can't think of a counterexample, but I don't know how to prove it either...

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter kingwinner
- Start date

In summary, the statement "If S is connected, then the interior of S is connected" is true. Although the "backward" case of starting with an open set and considering its closure does not necessarily yield the same result, it is still a subset of the possibilities and can help with finding a proof or counterexample. Taking the example of an interval (a,b] or [a,b), it is clear that the interior of [a,b] and (a,b) are connected, but the interior of [a,b) is not necessarily connected. This generalization holds for R^n as well. Therefore, the statement is true but it is important to consider all possibilities and not just specific examples.

- #1

- 1,270

- 0

If S is connected, then the interior of S is connected."

Is this true or not?

I can't think of a counterexample, but I don't know how to prove it either...

Physics news on Phys.org

- #2

Staff Emeritus

Science Advisor

Gold Member

- 14,981

- 26

kingwinner said:

If S is connected, then the interior of S is connected."

Is this true or not?

I can't think of a counterexample, but I don't know how to prove it either...

It might help to think "backwards" -- rather than thinking of starting with a set S, and then working with its interior, why not start with an open set, and then consider its closure (possibly excluding part of the boundary)?

- #3

- 1,270

- 0

But that "backward" one is not equivalent to the original one.

How can I find a counterexample?

How can I find a counterexample?

- #4

Staff Emeritus

Science Advisor

Gold Member

- 14,981

- 26

- #5

Gold Member

- 4,699

- 371

an interval (a,b] or [a,b) (the same should work also for R^n).

obviously if [a,b) is connected, then (a,b) is'nt necessarily.

- #6

- 1,270

- 0

I can't figure it out and I don't know which direction to push my proof towards...

- #7

- 1,270

- 0

- #8

Science Advisor

Homework Helper

- 42,989

- 975

?? All of [a,b], [a,b), (a,b], (a,b)loop quantum gravity said:

an interval (a,b] or [a,b) (the same should work also for R^n).

obviously if [a,b) is connected, then (a,b) is'nt necessarily.

A Connectedness math problem is a type of mathematical puzzle where the goal is to find the minimum number of connections needed to connect a set of points or objects together. This type of problem is commonly used in graph theory and computer science.

The solution to a Connectedness math problem involves identifying the minimum number of connections needed to connect all the points or objects together. This can be done by drawing a diagram and counting the number of connections needed, or by using mathematical formulas and algorithms to find the minimum number of connections.

Connectedness math problems have many practical applications in fields such as transportation, computer networking, and social networks. For example, in transportation planning, these problems can help determine the most efficient routes for buses or trains to connect different locations.

Yes, there are various types of Connectedness math problems, including the minimum spanning tree problem, the shortest path problem, and the traveling salesman problem. Each type has its own specific rules and methods for solving.

There is no one specific strategy for solving Connectedness math problems, as each problem may require a different approach. However, some common strategies include breaking the problem into smaller, manageable parts, using visual aids such as diagrams or graphs, and using mathematical formulas and algorithms.

Share:

- Replies
- 24

- Views
- 726

- Replies
- 1

- Views
- 567

- Replies
- 20

- Views
- 1K

- Replies
- 13

- Views
- 635

- Replies
- 20

- Views
- 2K

- Replies
- 5

- Views
- 793

- Replies
- 5

- Views
- 569

- Replies
- 3

- Views
- 459

- Replies
- 3

- Views
- 531

- Replies
- 5

- Views
- 604