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

use alternation of tensor-induced-quadratic-form

Iterate through all , orthonormal bases with , to obtain the signature

let . span <==>

Abbreviation

[quadratic-form-inequality-Euclidean] Inner product inequality (Euclidean). . i.e. or

[triangle-inequality-Euclidean] Triangle inequality (Euclidean)

  • Proof

  • Proof

[Euclidean-space-topology] Euclidean topology. is continuous at :=

let

[closure] Closure :=

[closed-set] Closed set :=

(open) closed(๐”น)

[open-set] Open set :=

open <==> closed

[interval] Interval refers to a subset of with property that the order is uninterrupted

[best-interval-decomposition] The optimal interval decomposition of

def as the set of all intervals, including open, closed, half open half closed, single point

def

Due to the existence of single-point intervals, and

has a linear order chain. Taking for each maximal linear order chain will continue to yield intervals. The set of these intervals is denoted as

and

The intervals in are disjoint, and the decomposition method is unique, so these intervals form the optimal interval decomposition of

  • When , is an interval, connected
  • When , is not connected. Example

If is a closed set, then the intervals in are all closed intervals

recall the linear-order intersection of nested closed intervals is non-empty

[bounded-closed-interval-is-compact] Bounded closed interval of ==> compact

Proof

let be a net of . let

Since is bounded and closed,

Take the optimal closed interval decomposition

For all decomposed closed intervals of , consider any maximal linear order chain maximal-linear-order

According to nested-closed-interval-theorem, the intersection of a nested set of closed intervals in the linear order is a non-empty closed interval

Similar to the proof of closed-interval-net-theorem, prove that is the smallest closed interval, thus every

[compact-imply-subsequence-converge] compact ==> sequence has a convergent subsequence. The same applies to nets

Proof

forms a net

compact ==>

let

use the definition of closure

let

==>

  • Unit closed ball
  • Unit sphere

[circle-is-compact] compact

Proof is continuous

is continuously isomorphic to (quotient-topology) is continuously isomorphic to i.e. collapsing endpoints (quotient-topology)

bounded closed interval compact ==> quotient compact. by quotient preserves compact

[closed-ball-sphere-is-compact]

Proof

compact. Inductive hypothesis compact

  • compact

(Draw a picture) continuous. Isomorphism is obtained after quotienting the origin

compact. by product-topology-preserve-compact

compact

  • compact

Constructing from using polar coordinates, after quotient, we get compact

Another method the boundary collapses to a point to get compact

Proof

maps the sphere to the sphere and

Stereographic projection

The composite mapping plus the mapping mapping to , the resulting mapping is still continuous, and after quotient it is a bijection

Projective space (Euclidean) compact. Proof

Similarly (and )

[Euclidean-set-distance]

  • [bounded] bounded :=
  • [unbounded] unbounded :=

is invariant

by stereographic projection

Translation does not change the infinity of (but only a conformal mapping of , conformal group )

in Euclidean topology of

  • Bounded <==> away from <==>
  • Unbounded <==>

[Euclidean-space-compact-iff-bounded-closed] compact <==> is a bounded closed set

Proof

  • <==

The bounded closed set of corresponds to a closed set of and does not include

compact + closed-set-in-compact-space-is-compact ==> is compact in

From topology, restrict back to subspace topology +

Get compact

  • ==>
  • Closed set

let

forms a net of . Note that it is possible that

  • compact ==>

==>

  • Bounded
The open ball of does not contain . The open ball family covers . Take finite cover, still does not contain

let be net of

[nested-closed-set-theorem] The intersection of nested bounded closed sets of is non-empty. The intersection result is also a closed set. It can be understood as the minimal element of linear order chain nested closed sets

[closed-net-theorem] The intersection of a net of bounded closed sets of is non-empty Proof

Map the closed set of to the closed set of , is compact, so the intersection of nested closed sets or the intersection of a net of closed sets is non-empty. Boundedness makes it not converge to

[limit-distance-vanish-net] :=

or . The tail of the net is bounded

A net can be composed of tails

[Cauchy-completeness-Euclidean]

in , limit-distance-vanish net converges to a point

According to the closed set net theorem ==> let

limit-distance-vanish ==>

Some infinite-dimensional linear spaces e.g. Lebesgue-integrable , bounded closed sets cannot be compact but still satisfy limit-distance-vanish net converging to a point

According to induction, finite summation is associative and commutative. But this does not guarantee infinite summation i.e.

let

  • Rearrangement
  • converges to

Then may not converge or converge to other value

compare

Convergence (not ==>) Absolute convergence

let be a sequence

  • converges ==>

    Proof

    ==> By the triangle inequality

  • ==> does not converge

Any sequence can define such that

Rearrangement does not change the tail behavior of the sequence

If , rearrangement invariant

Proof

==>

==> (by )

==>

def

[series-rearrangement-absolutely-convergence-real] Absolute convergence ==> converges and rearrangement invariant

Proof and use operation of convergent sequence

and ==> and rearrangement invariant

Question The case of norm reduce to ?

harmonic series vs , say that, convergence is closer to normal convergence. convergence is more suitable for Fourier serise

The last possibility

[series-rearrangement-real]

let and

  • Converges to
  • Does not converge to

Example

  • Convergent case
  • Divergent case

Proof

  • Converges to

. Meaning: is the smallest natural number that makes the positive summation greater than

. Meaning: is the smallest natural number that makes the negative summation less than

And so on, exhaust all

Rearrange to

According to the definition of

According to the definition of

And so on

==>

  • Converges to

In the handling of

Change to

Change to

  • Does not converge to

Change to

Change to

Series in that are rearrangement invariant are also absolutely convergent series

converges ==>

[series-rearrangement-absolutely-convergence]

let be a sequence

==> converges and is rearrangement invariant

Proof

  • converges. by using the triangle inequality and Cauchy sequence converges

  • Rearrangement invariant

Now consider the case where is not absolutely convergent

def

From the triangle inequality or the equivalence of -norm, -norm, -norm of

  • is a linear subspace

let . The component of is absolutely convergent

Consider the component of

[series-rearrangement]

let

  • and ==> converges to in the component, rearrangement invariant
  • . is rearrangement unstable in the component

The positive linear combination with of sequences with the same convergence pattern preserves their convergence pattern