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

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