Simply connected domain
Builds on Closed curve
Definition
Let . The set is simply connected if is path-connected and each continuous closed curve has this property. There are a point and a continuous map such that An open simply connected set is a simply connected domain.
Remarks
The map deforms the loop into the constant loop at through closed loops in . Each convex set is simply connected. For example, and each ball are simply connected. The plane minus the origin is not simply connected, and neither is minus the -axis. But minus a point is simply connected for . An equivalent condition: is path-connected, and any two paths in with the same end points can be deformed into each other with the end points fixed.
Reading path
To understand this page from the ground up, read these 16 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Function concept
- Fréchet derivative definition
- Function of several variables concept
- Vector-valued function concept
- Limit of a function of several variables concept
- Continuity in R^n definition
- Differentiable function of several variables definition
- Partial derivative definition
- Differentiable on an open set definition
- Higher partial derivatives definition
- Iterated derivative definition
- C^k function characterised by continuous derivatives statement
- Parametrised curve definition
- Closed curve definition
- Simply connected domain definition
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Simply_connected_space, Definition and equivalent formulations
- Web https://en.wikipedia.org/wiki/Simply_connected_space, Examples
About this page
| Tag | 075C629XTH |
|---|---|
| URI | m2://075C629XTH |
| Kind | definition |
| Writing | W1 stated |
| MSC | 55Q05 |
| Defines | Simply connected domain |
| Uses | Closed curve |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.