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

note-math

In flat space, linear and affine are often mixed. Similarly, in flat space, so are polynomials. Zero-order polynomials correspond to the use of affine

First deal with the case of one-dimensional real numbers

exponential power function

[polynomial-function-1d] A polynomial function is a finite linear combination of power functions. (Affine) base point , (vector) offset

Polynomial function representation is not affine invariant, i.e. switching the base point will result in a polynomial function representation of the same order but with different coefficients. Scaling is also the case

[change-base-point-polynomial] Switch base point

Represents the same affine function

then

Proof expand the calculation, to compare coefficients, collect power function terms, by the exchange of summation

If the base point is in the coordinates and the symbol is changed, then the polynomial function is expressed as

Extending from polynomial as a finite linear combination to a countably infinite linear combination is called the exponential power series of a function

The definitions of some functions do not come directly from the exponential power series, Example

In addition to as countably infinite data, can also be used. The exponential power function is changed to the exponential power function

  • requires multiplicative inverse

  • requires solving the equation and needs to deal with the issue of whether the number of solutions is unique

  • is unbounded at

  • When , the multiple derivatives will not be interrupted

Here we only deal with power series for the time being, and refer to them as power series for short

Now deal with the high-dimensional case i.e.

If the range is , we can also define the multiplication of functions and the multiplicative inverse

First try to define polynomial functions and power series based on tensors i.e. multilinear

If not necessary, there is no need to take the linear direct sum of tensors of all orders (called tensor algebra)

[polynomial-function] Using the range and multilinear function . Base point , offset , define polynomial function

Affine transformations, i.e., changing the base point i.e. translation, or linear transformations i.e. (including scaling), do not change the order of the polynomial

may not be collinear

Extending to is simple. For the cases of , due to non-commutativity and non-associativity, high-dimensional linear algebra and tensors require new processing methods

Different tensors may give the same polynomial, but the symmetric tensor is uniquely corresponding

Change notation

  • [power-tensor]

The method to restore from a monomial of order or a power tensor to a symmetric tensor of order is difference

In the -th order monomial of , there is a term , but there are many other interfering terms

The whole problem is symmetric with respect to , so a symmetric construction should be used

In the second order

[difference-symmetric-tensor] Symmetric tensor -th order difference

Question Is there an intuitive understanding of the -th order difference?

[successive-difference] The -th order difference can be written as times the first-order difference

where , ,

Due to the commutativity of summation, the order of successive differences does not affect the final result

Proof of difference-symmetric-tensor

Forcibly write it as a summation over all , with a weight to calculate the number of repetitions

where the weight for each is defined as

For any non-empty finite set ,

Proof

combination <==> for each there are choices

for

define

define

is a bijection

Weight

The last condition

  • When , it must hold for all
  • When , it only holds when is a bijection i.e. is all -th order permutations, then

The symmetric tensor makes

There are -th order permutations

The symmetry of the symmetric multilinear function allows the properties of difference to be inherited

[difference-polynomial] The -th order difference of is

The -th order difference of is

From this, we get that the polynomial function determines its multiple symmetric linear function representation Proof First, -difference gives the same , after removing from both sides, it is still the same polynomial function, the order is , continue difference to get the same โ€ฆ

For power series, finite-order difference can never give zero

Formally, division and limits can be used to eliminate higher-order terms