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

[sequence-real] Real number sequence := . Usually denoted as . Depending on the situation, set it to start from or from

[limit-sequence-real] Sequence limit

Operations of limits

[rational-dense-in-real] is dense in .

Proof

equivalent to

Accurate to at most a little bit difference, there is

so

==>

==>

  • or

Proof and

==>

[geometric-series] Geometric series .

Proof ,

[geometric-series-test] Geometric series convergence test. let .

Proof

[exponential-vs-power] Exponential growth is faster than power.

Proof define

use Geometric series convergence test

[exponential-root-of-power-function]

Proof

==>

Proof

When , by

When , use

[factorial-vs-exponential-1] Factorial growth is faster than exponential.

Proof define . use Geometric series convergence test

corresponds to the number of bijections of , corresponds to the number of self-mappings of . etc. are similar

[iterated-power-vs-factorial]

Proof define . use geometric series convergence test

Comparison of growth rates, real number version

  • with

[mean-inequality] Mean inequality alias [AM-GM-inequality]

obtains <==>

Dimensionless

Proof

<==>

<==>

Use differential method to calculate the extreme value. Consider the function

First derivative

The first derivative equals zero, solving the equation yields

Second derivative

Determine the positive definiteness of the quadratic form

The multiplication factor can be extracted

All are order polynomial of , and the first-order differential being zero makes , so for judging positive definiteness, we only need to consider , the quadratic form

So at the first derivative is zero and the second derivative is (semi) positive definite, the function will not become smaller nearby, so that's the minimum, and it's

[best-multiplication-decomposition] Optimal multiplication decomposition

forall fixed

question: which makes maximum?

For each , according to the mean inequality, should be used for equal addition to obtain the maximum

When what is the equal division number , has the maximum value?

monotonically increasing

Proof

Function

  • Increasing when

  • Decreasing when

Therefore takes the maximum value near

Proof of the monotonic property of

Example . Therefore, when , 1 equal division is the best

i.e.

[natural-constant] Natural constant

Although the two limits appear to be so different in form

Proof

Binomial expansion

When is fixed, we have

For each

also

by

Therefore

converges. ==> at the tail geometric series control

[factorial-function-1]

Infinite product definition of the factorial function . Not in the subtraction direction but in the addition direction.

==>

with

Sometimes it is more convenient to use the equivalent .

To prove convergence, one method is to convert the infinite product into an infinite sum using . Using a trick.

Using Taylor expansion .

  • Using the properties of the factorial function, it can be proven that cf. Euler-reflection-formula. Here, only convergence is proven.

    converges, for and for .

    is called the Riemann Zeta function.

  • is the Euler gamma constant [Euler-constant]

as an additive asymptote. as a multiplicative asymptote.

Proof

let

Can use and converges.

Can also use integral estimation.

is bounded.

is monotonically decreasing.

[Euler-reflection-formula] Euler reflection formula or

Using the countable generalization of the fundamental theorem of algebra, wiki:Weierstrass_factorization_theorem

Using

The zeros of are . The zeros of are , corresponding to the zeros of

, expanding as a power series, the coefficient of is

Comparing the coefficient of in the Taylor expansion of at , which is

In particular

Thus

And we get [Wallis-formula]

[factorial-function-2]

According to Euler's insight, the integral definition of the factorial function is, for and then for (and possibly for other normed-algebra)

The two definitions of are equivalent, but this is not obvious. The extension of from to is not unique, because one can add analytic functions that take the value for to maintain the extension of , for example by adding the function

(ref-25, vol.2, sect.Euler-integral) The function sequence converges monotonically and uniformly on to . Exchange series and integral

Variable substitution can yield another integral representation

[Gaussian-integral] Variable substitution or then

We have obtained using the Euler reflection formula. It can also be obtained using the polar coordinate method

[iterated-power-vs-factorial-2]

Comparison of growth rates of factorial and tetration

so , so

Proof of

def

def

[sequence-multiplication-mean-limit] Multiplication average does not change the limit

Proof

[sequence-addition-mean-limit] Addition average

[harmonic-series-diverge] Harmonic series diverges

Proof diverges because it is not limit-distance-vanish. e.g.

[iterated-power-vs-factorial-3] [Stirling-approximation]

Tips

Taylor expansion

We know

(ref-26) The last term

So or

(ref-27) Variable substitution

The function monotonically converges to for respectively when .

Exchange series and integral, and use

For a discussion on the appearance of , also see why-pi-in-Gaussian-integral