1. notice
  2. English
  3. 1. feature
  4. logic-topic
  5. 2. logic
  6. 3. set-theory
  7. 4. map
  8. 5. order
  9. 6. combinatorics
  10. calculus
  11. 7. real-numbers
  12. 8. limit-sequence
  13. 9. โ„^n
  14. 10. Euclidean-space
  15. 11. Minkowski-space
  16. 12. polynomial
  17. 13. analytic-Euclidean
  18. 14. analytic-Minkowski
  19. 15. analytic-struct-operation
  20. 16. ordinary-differential-equation
  21. 17. volume
  22. 18. integral
  23. 19. divergence
  24. 20. limit-net
  25. 21. compact
  26. 22. connected
  27. 23. topology-struct-operation
  28. 24. exponential
  29. 25. angle
  30. geometry
  31. 26. manifold
  32. 27. metric
  33. 28. metric-connection
  34. 29. geodesic-derivative
  35. 30. curvature-of-metric
  36. 31. Einstein-metric
  37. 32. constant-sectional-curvature
  38. 33. simple-symmetric-space
  39. 34. principal-bundle
  40. 35. group-action
  41. 36. stereographic-projection
  42. 37. Hopf-bundle
  43. field-theory
  44. 38. point-particle-non-relativity
  45. 39. point-particle-relativity
  46. 40. scalar-field
  47. 41. scalar-field-current
  48. 42. scalar-field-non-relativity
  49. 43. projective-lightcone
  50. 44. spacetime-momentum-spinor-representation
  51. 45. Lorentz-group
  52. 46. spinor-field
  53. 47. spinor-field-current
  54. 48. electromagnetic-field
  55. 49. Laplacian-of-tensor-field
  56. 50. Einstein-metric
  57. 51. interaction
  58. 52. harmonic-oscillator-quantization
  59. 53. spinor-field-misc
  60. 54. reference
  61. ไธญๆ–‡
  62. 55. notice
  63. 56. feature
  64. ้€ป่พ‘
  65. 57. ้€ป่พ‘
  66. 58. ้›†ๅˆ่ฎบ
  67. 59. ๆ˜ ๅฐ„
  68. 60. ๅบ
  69. 61. ็ป„ๅˆ
  70. ๅพฎ็งฏๅˆ†
  71. 62. ๅฎžๆ•ฐ
  72. 63. ๆ•ฐๅˆ—ๆž้™
  73. 64. โ„^n
  74. 65. Euclidean ็ฉบ้—ด
  75. 66. Minkowski ็ฉบ้—ด
  76. 67. ๅคš้กนๅผ
  77. 68. ่งฃๆž (Euclidean)
  78. 69. ่งฃๆž (Minkowski)
  79. 70. ่งฃๆž struct ็š„ๆ“ไฝœ
  80. 71. ๅธธๅพฎๅˆ†ๆ–น็จ‹
  81. 72. ไฝ“็งฏ
  82. 73. ็งฏๅˆ†
  83. 74. ๆ•ฃๅบฆ
  84. 75. ็ฝ‘ๆž้™
  85. 76. ็ดง่‡ด
  86. 77. ่ฟž้€š
  87. 78. ๆ‹“ๆ‰‘ struct ็š„ๆ“ไฝœ
  88. 79. ๆŒ‡ๆ•ฐๅ‡ฝๆ•ฐ
  89. 80. ่ง’ๅบฆ
  90. ๅ‡ ไฝ•
  91. 81. ๆตๅฝข
  92. 82. ๅบฆ่ง„
  93. 83. ๅบฆ่ง„็š„่”็ปœ
  94. 84. Levi-Civita ๅฏผๆ•ฐ
  95. 85. ๅบฆ่ง„็š„ๆ›ฒ็އ
  96. 86. Einstein ๅบฆ่ง„
  97. 87. ๅธธๆˆช้ขๆ›ฒ็އ
  98. 88. simple-symmetric-space
  99. 89. ไธปไธ›
  100. 90. ็พคไฝœ็”จ
  101. 91. ็ƒๆžๆŠ•ๅฝฑ
  102. 92. Hopf ไธ›
  103. ๅœบ่ฎบ
  104. 93. ้ž็›ธๅฏน่ฎบ็‚น็ฒ’ๅญ
  105. 94. ็›ธๅฏน่ฎบ็‚น็ฒ’ๅญ
  106. 95. ็บฏ้‡ๅœบ
  107. 96. ็บฏ้‡ๅœบ็š„ๅฎˆๆ’ๆต
  108. 97. ้ž็›ธๅฏน่ฎบ็บฏ้‡ๅœบ
  109. 98. ๅ…‰้”ฅๅฐ„ๅฝฑ
  110. 99. ๆ—ถ็ฉบๅŠจ้‡็š„่‡ชๆ—‹่กจ็คบ
  111. 100. Lorentz ็พค
  112. 101. ๆ—‹้‡ๅœบ
  113. 102. ๆ—‹้‡ๅœบ็š„ๅฎˆๆ’ๆต
  114. 103. ็”ต็ฃๅœบ
  115. 104. ๅผ ้‡ๅœบ็š„ Laplacian
  116. 105. Einstein ๅบฆ่ง„
  117. 106. ็›ธไบ’ไฝœ็”จ
  118. 107. ่ฐๆŒฏๅญ้‡ๅญๅŒ–
  119. 108. ๆ—‹้‡ๅœบๆ‚้กน
  120. 109. ๅ‚่€ƒ

note-math

Example interval best-interval-decomposition

[connected] Connected or limit connected := limit point set decomposition is no longer possible or closed set decomposition is no longer possible

with closed ==>

Intuitively speaking, connected = cannot give any substantial decomposition. For any set decomposition , from + connected, each must be connected to some other after the limit point:

Each of the closed set decomposition is an open set

Proof

The definition of connected is equivalent to the version decomposed into two closed sets

with closed ==>

Proof Taking the limit of the decomposition yields

Connected subset := topological subspace connected

Example is connected. has connected and disconnected sets. Connected sets may not be closed sets

[real-connected-is-interval] Connected sets of are intervals Proof by interval connected + optimal interval decomposition + number of intervals in optimal interval decomposition is disconnected

[connected-imply-closure-connected] is a connected set ==> is a connected set

Proof

close ==> closed set is closed set

let closed set decomposition

closed set decomposition and connected ==> one of them is an empty set, say so

But is the smallest closed set containing , so and

is not a connected set ==> is not a connected set

[connected-componet] Connected component decomposition := Limit point set decomposition's limit , such that each limit point set cannot be further decomposed i.e. connected

It is indeed the unique limit in the sense of net. The net comes from the decomposition of into two closed sets, which can be taken as a common refinement decomposition + closed sets are closed under finite intersection.

is connected or cannot be closed set decomposition and has closed set decomposition ==>

Proof The closed set decomposition of , , results in one of the sets being an empty set

is a limit connected set ==> is in the only one limit connected component of

Proof The points of must be in and therefore in some connected component.

==> Even if is only decomposed into connected sets, it is already a connected component decomposition.

The union of connected sets with a common point , , is connected

recall inheritance of subspace topology. So connectedness is also inherited.

So we only need to deal with the case of

Proof The connected sets containing are all in the same connected component. This shows that has only one connected component, and is therefore connected.

A connected component is a maximal element of the maximal linear order of a connected set family.

The image of a continuous function transmits connectedness.

The inverse-image of a continuous function transmits disconnectedness as contrapositive

Proof Closed set decomposition ==> Closed set decomposition

==> [mean-value-theorem-continuous] Intermediate Value Theorem for Continuous Functions. The image of a continuous function is connected therefore is an interval

If any two points in are in some connected subset , then is connected. Proof let with closed, prove that . Or and the union of connected sets that have a common point is connected

==> let be connected. If any two points in are in some connected image of a continuous function, then is connected

==> Path connected

[product-topology-preserve-connected] Product topology preserves connectedness

Proof

Using the common point method + each connected ==> all "cross-shaped" subsets are connected

Using the common point method again, the union of cross-shaped subsets forms a connected subset

and connected-imply-closure-connected ==> connected

Proof of

Just need to prove that each set of the point-net system of intersects some cross shape

The set of the point-net system of is

It intersects the cross shape

let the connected component decomposition

All connected components of are

Proof Using dependent-distributive and the product being connected implies product connectedness, so is connected, thus it can no longer be decomposed

Define (how?) the topology or limit point of (should be something compact open topology? cf. definition of net of analytic-space)

[homotopy] homotopy or limit point homotopy := is limit connected

Example is homotopic to

[homotopy-class] := the connected component of

Since composition preserves continuity, composition induces an operation on . Prove whether it is well-defined. Sometimes it's invertible, making it a group operation