1. notice
  2. English
  3. logic_topic
  4. 1. logic
  5. 2. basic
  6. 3. map
  7. 4. order
  8. 5. combinatorics
  9. calculus
  10. 6. real_numbers
  11. 7. limit_sequence
  12. 8. division_algebra
  13. 9. Euclidean_space
  14. 10. Minkowski_space
  15. 11. polynomial
  16. 12. analytic_Euclidean
  17. 13. analytic_struct_operation
  18. 14. ordinary_differential_equation
  19. 15. convex_hull
  20. 16. volume
  21. 17. integral
  22. 18. divergence
  23. 19. limit_net
  24. 20. topology
  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
  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. ้€ป่พ‘
  64. 56. ้€ป่พ‘
  65. 57. ๅŸบ็ก€
  66. 58. ๆ˜ ๅฐ„
  67. 59. ๅบ
  68. 60. ็ป„ๅˆ
  69. ๅพฎ็งฏๅˆ†
  70. 61. ๅฎžๆ•ฐ
  71. 62. ๆ•ฐๅˆ—ๆž้™
  72. 63. ๅฏ้™คไปฃๆ•ฐ
  73. 64. Euclidean ็ฉบ้—ด
  74. 65. Minkowski ็ฉบ้—ด
  75. 66. ๅคš้กนๅผ
  76. 67. ่งฃๆž (Euclidean)
  77. 68. ่งฃๆž struct ็š„ๆ“ไฝœ
  78. 69. ๅธธๅพฎๅˆ†ๆ–น็จ‹
  79. 70. convex_hull
  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

[sequence_real] Real sequence := . Usually denoted as . Depending on the situation, start from or

[limit_sequence_real] Limit of sequence

Operations on limits

[rational_dense_in_real] Density of in .

Proof

is equivalent to

Up to a difference of at most, 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 and

[factorial_vs_exponential_1] Factorial grows faster than exponential.

Proof define . Use geometric series convergence test

corresponds to the number of bijections from to itself, corresponds to the number of self-maps from to itself. and similar

[iterated_power_vs_factorial]

Proof define . Use geometric series convergence test

Comparison of growth rates, real number version

  • Power vs Exponential:

  • Exponential vs Factorial with

  • Factorial vs Tetration

[mean_inequality] Mean inequality alias [AM_GM_inequality]

Get <==>

Dimensionless

Proof

<==>

<==>

Calculate the maximum value using differential methods. Consider proving

Since the problem is homogeneous, we only need to consider the case where , and prove that

Let

If some , then . So we only need to consider

The boundary of the intersection of and is when some , and at this point . We only need to consider points having differential zero in interior without boundary.

Using the Lagrangian multiplier method. Let the differential of be zero on the tangent space of the surface , which is equivalent to the gradients and being collinear.

First-order differential

Collinearity implies

According to , we get , which gives . At this point .

Second derivative of

Determine the positive definiteness of the quadratic form

multiplication factor can be factored out

are all degree term polynomials of , and the first-order derivative being zero makes so for judging positive definiteness we only need to consider , the quadratic form

so at the first-order derivative is zero and the second-order derivative is (semi-)positive definite, the function will not decrease nearby, so there is a local minimum, and it is

[best_multiplication_decomposition] optimal multiplication decomposition

forall fixed

question: which makes maximal?

For each , according to the AM-GM inequality, the maximum of should be achieved by using equal parts for addition.

What value of equal division number maximizes ?

The function is monotonically increasing

Proof

The function

  • Increasing when

  • Decreases when

So takes its maximum near

Proof of โ€˜s monotonicity

Example . So when , decreases, partition is optimal

i.e.

[natural_constant] Natural constant

Even though the forms of the two limits look so different

Proof

Binomial expansion

When is fixed, we have

For each

also

by

So

converges. ==> In the tail geometric series control

[factorial_function_1]

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

==>

with

Sometimes itโ€™s more convenient to use the equivalent

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

Use Taylor expansion

  • Using the properties of the factorial function, we can prove cf. Euler_reflection_formula. Here we only prove convergence

    converges, for and for

    is called the Riemann Zeta function

  • is the Euler gamma constant [Euler_constant]

as additive asymptotic. as multiplicative asymptotic

Proof

let

You can use and converges

You can also use integral estimation

is bounded

is monotonically decreasing

[Euler_reflection_formula] Euler reflection formula or

converges absolutely := converges, equivalently converges, since , , equivalently converges.

absolute convergence implies convergence

So converges

Use

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

(asymptotically) is controlled by . Finite product, after expanding the multiplication, is a polynomial . On it is controlled by , giving compact uniform convergence, it can be proven that the -th derivative of the sequence converges to the -th derivative of , thus it can be proven that the coefficients of the power function of the sequence converge to the coefficients of the power function of

  • Using Cauchyโ€™s integral formula

  • Or, in the case of purely real numbers, prove that is controlled, and then

  • Infinite product theory in complex analysis
  • Or, from using Fourier transform integral (ref-25, vol.2)

    for

    let

    The series is controlled and convergent. Integral, exchange integral and series

, expanding into a power series, the coefficient of is

Compare with the coefficient of in the Taylor expansion of at , which is

Specifically

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-division-algebra)

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

(ref-25, vol.2, sect.Euler-integral) The function sequence is monotonically increasing convergent and uniformly convergent on to . Interchange the series and the integral

Variable substitution can yield another integral representation

[Gaussian_integral] Variable substitution or then

We already obtained using the Euler reflection formula. We can also use the polar coordinate method

[iterated_power_vs_factorial_2]

Comparison of the growth rates of factorial and hyper-exponentiation

so , so

Proof of

def

def

[sequence_multiplication_mean_limit] Multiplication mean does not change the limit

Proof

[sequence_addition_mean_limit] Addition mean

[harmonic_series_diverge] Harmonic series diverges

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

[iterated_power_vs_factorial_3] [Stirling_approximation]

Usage Tips

Taylor expansion so

We know . Thus

(ref-26) The last term is absolutely convergent

So can be decomposed into a term converge to constant

plus another term

so or

or

We also need to compute the remaining constant

(ref-27) Variable substitution

so

Functions converge monotonically to as for respectively, because:

Interchange series and integral, and use

So

So

Discussions on the appearance of can also be seen in why_pi_in_Gaussian_integral