New Mathematics Series

Series introduction

The New Mathematical Library (NML for short) is an internationally renowned series of mathematics books originally published by the Mathematical Association of America (MAA). The original intention of this series of books is to bridge the gap between high school mathematics courses and professional mathematics research, and to provide high-quality teaching materials suitable for high school students and junior college students.

Background and Origin

The birth of the New Mathematical Library (NML) is an important milestone in the history of American education. This series of books is not simply a commercial publication, but a product of national education reforms in response to geopolitical tensions and scientific competition during the Cold War. Its core goal is to improve the mathematical literacy of American teenagers and cultivate future top scientific talents.

On October 4, 1957, the Soviet Union successfully launched Sputnik 1, the first artificial satellite in human history. This incident shocked American society and triggered the so-called "Sputnik Crisis". The United States realized that it had fallen behind the Soviet Union in basic science and engineering education, triggering national defense and security anxiety.

In order to reverse the disadvantage, the U.S. government significantly increased funding for science education and established the School Mathematics Study Group (SMSG). The group believes that traditional middle school mathematics education places too much emphasis on mechanical operations and lacks the rigorous logic and beauty of modern mathematics. Therefore, SMSG promoted the "New Math" movement and invited the best contemporary mathematicians to write a series of books that can display "real mathematics" for gifted high school students. This is the origin of the New Math series.

The series began in the 1960s as part of the School Mathematics Study Group (SMSG) programme. The goal is to expose young readers to real mathematical thinking, not just the application of formulas. The series has been written by leading mathematicians over the years, with Anneli Lax as its long-time editor, so the series is often associated with her name in the mathematical community.

Core features

• Academic rigor:Although it is a popular science reading, it maintains extremely high precision in argumentation and logic, and does not sacrifice the authenticity of mathematics due to simplification.
• Diversity of topics:The content covers diverse fields such as number theory, geometry, algebra, graph theory, topology, and history of mathematics.
• Heuristic teaching:It emphasizes the problem-solving process and mathematical beauty, and encourages readers to think independently.

Representative works

• Numbers: Rational and Irrational - by Ivan Niven.
• Geometric Inequalities - Nicholas D. Kazarinoff.
• Symmetry in Mathematics and other related topics.

Readership

This series of books is not only suitable as a training material for students participating in mathematics competitions (such as AMC, AIME), but also very suitable for middle school teachers as a supplementary teaching resource, or for anyone interested in pure mathematics to read.

book list

Below is a complete list of the series, arranged by number:

1. Numbers: Rational and Irrational - Ivan Niven
2. What is Calculus About? - W. W. Sawyer
3. An Introduction to Inequalities - E. F. Beckenbach and R. Bellman
4. Geometric Inequalities - N. D. Kazarinoff
5. The Contest Problem Book I - C. T. Salkind
6. The Lore of Large Numbers - P. J. Davis
7. Uses of Infinity - Leo Zippin
8. Geometric Transformations I - I. M. Yaglom
9. Continued Fractions - C. D. Olds
10. Graphs and Their Uses - Oystein Ore
11. Hungarian Problem Book I
12. Hungarian Problem Book II
13. Episodes from the Early History of Mathematics - Asger Aaboe
14. Groups and Their Graphs - I. Grossman and W. Magnus
15. The Mathematics of Choice - Ivan Niven
16. From Pythagoras to Einstein - Banesh Hoffmann
17. The Contest Problem Book II - C. T. Salkind
18. First Concepts of Topology - W. G. Chinn and N. E. Steenrod
19. Geometry Revisited - H. S. M. Coxeter and S. L. Greitzer
20. Invitation to Number Theory - Oystein Ore
21. Geometric Transformations II - I. M. Yaglom
22. Elementary Cryptanalysis - Abraham Sinkov
23. Ingenuity in Mathematics - Ross Honsberger
24. Geometric Transformations III - I. M. Yaglom
25. The Contest Problem Book III - C. T. Salkind and J. M. Earl
26. Mathematical Methods in Science - George Polya
27. International Mathematical Olympiads 1959-1977 - S. L. Greitzer
28. The Great Art or the Rules of Algebra - Girolamo Cardano
29. Thinking Geometrically - Thomas Q. Sibley
30. Mathematical Gems I - Ross Honsberger
31. Mathematical Gems II - Ross Honsberger
32. Mathematical Gems III - Ross Honsberger
33. International Mathematical Olympiads 1978-1985 - Murray S. Klamkin
34. USA Mathematical Olympiads 1972-1986 - Murray S. Klamkin
35. The Early Mathematics of Leonhard Euler - C. Edward Sandifer
36. The Contest Problem Book IV - Artino, Gaglione, and Shell
37. Episodes from the 19th and 20th Century History of Mathematics - Chandler Davis
38. The Contest Problem Book V - George Berzsenyi and Stephen B. Maurer
39. Over and Over Again - Gengzhe Chang and Thomas W. Sederberg
40. The Contest Problem Book VI - Leo J. Schneider
41. The Games of Gods and Men - P. G. de Gennes
42. Geometric Transformations IV - I. M. Yaglom
43. Isoperimetric Inequalities - Viktor Katsnelson
44. Mathematical Miniatures - Svetoslav Savchev and Titu Andreescu
45. On the Heights - A. S. Amitay
46. When Less is More - Claudi Alsina and Roger B. Nelsen
47. The Contest Problem Book VII - Harold B. Reiter
48. The Contest Problem Book VIII - J. Douglas Faires and David Wells
49. The Contest Problem Book IX - David Wells and J. Douglas Faires
50. A Friendly Mathematics Competition - Rick Gillman
51. The Geometry of Numbers - C. D. Olds, Anneli Lax, and Davi B. Davi

basic algebra

definition

Basic algebra is the field of mathematics that studies numbers, symbols, and their operations. It developed from arithmetic, incorporating unknown numbers and symbols into calculations, and describing quantitative relationships through algebraic expressions and equations.

core content

• Algebraic formula:Consists of numbers, letters (unknown numbers) and arithmetic symbols, e.g.2x + 3y。
• equation:Indicates that two algebraic expressions are equal, for examplex + 5 = 12。
• inequality:Indicates size relationships, such as2x + 1 > 7。
• Function concept:Describe the relationship between input and output, e.g.f(x) = x²。

Main operations

• Algebraic rules for addition, subtraction, multiplication and division
• Operations with exponents and radicals
• Factoring and expansion
• Solve linear equations and quadratic equations of one variable

Application examples

• Solve practical problems in life, such as speed and work efficiency problems
• Provides mathematical tools for geometry and trigonometry
• as further studylinear algebra、abstract algebraandalgebraic geometrythe basis of

Related to other areas of mathematics

• arithmetic:Basic algebra is a generalization of arithmetic.
• geometry:Representing geometric figures algebraically (analytical geometry).
• analyze:Algebraic expressions of functions are the basis of mathematical analysis.

Solution of quadratic equation of one variable

definition

A quadratic equation is an equation that contains only one unknown number and the highest degree is quadratic. The general form is:

ax² + bx + c = 0   （a ≠ 0）

Solution formula

The solution of a quadratic equation can be given byRoot formulagives:

x = (-b ± √(b² - 4ac)) / (2a)

inΔ = b² - 4accalleddiscriminant, determines the type of solution.

solution situation

• likeΔ > 0, has two unequal real solutions.
• likeΔ = 0, has two equal real solutions (multiple roots).
• likeΔ < 0, has no real solutions, but has two conjugate complex solutions.

example

Solve equations2x² - 4x - 6 = 0：

1. coefficient:a = 2，b = -4，c = -6
2. Discriminant:Δ = (-4)² - 4(2)(-6) = 16 + 48 = 64
3. Substitute into the formula:
   x = (4 ± √64) / 4 = (4 ± 8) / 4
4. Solution:x₁ = 3，x₂ = -1

Other solutions

• Factoring:If the equation can be decomposed into(x - p)(x - q) = 0, then the solution isx = porx = q。
• Preparation method:Convert the quadratic equation into square form and solve it.
• Image method:Use parabolay = ax² + bx + cSolve for the intersection point with the x-axis.

Solution of cubic equation of one variable

general form

The general form of a cubic equation of one variable is:

ax³ + bx² + cx + d = 0　(a ≠ 0)

reduced to simplified form

By substituting variables x = y - b/(3a), the quadratic term can be eliminated and the equation can be converted into a simplified form:

y³ + p·y + q = 0

in:

• p = (3ac - b²) / (3a²)
• q = (2b³ - 9abc + 27a²d) / (27a³)

discriminant

The solution type of the cubic equation is determined by the discriminant Δ:

Δ = (q/2)² + (p/3)³

• Δ > 0: one real root and two conjugate complex roots.
• Δ = 0: All roots are real and at least two are equal.
• Δ < 0 ：三個互不相等的實根。

Cardano’s Formula

When y³ + p·y + q = 0, one of the solutions is:

y = ³√(-q/2 + √Δ) + ³√(-q/2 - √Δ)

The remaining solutions can be found using three different values ​​of the cube root.

back generation

Finally, substitute y back to x = y - b/(3a) to get the solution to the original cubic equation.

cardano formula

Question setting

The general form of a cubic equation of one variable is:

ax³ + bx² + cx + d = 0　(a ≠ 0)

By substituting x = y - b/(3a), the equation can be transformed into a "simplified cubic equation":

y³ + p·y + q = 0

in:

• p = (3ac - b²) / (3a²)
• q = (2b³ - 9abc + 27a²d) / (27a³)

solution idea

Let y = u + v and plug this into the simplified equation:

(u + v)³ + p(u + v) + q = 0

After expansion, we get:

u³ + v³ + (3uv + p)(u + v) + q = 0

If 3uv + p = 0, the terms containing (u+v) can be eliminated and become:

u³ + v³ + q = 0

Therefore it needs to satisfy:

• uv = -p/3
• u³ + v³ = -q

Construct a quadratic equation

Assume U = u³, V = v³, then:

• U + V = -q
• UV = (uv)³ = (-p/3)³ = -p³/27

Therefore U and V are solutions to the following quadratic equation:

z² + qz - (p³/27) = 0

Solve for U and V

Use the quadratic formula:

U, V = -q/2 ± √( (q/2)² + (p/3)³ )

Right now:

• u³ = -q/2 + √Δ
• v³ = -q/2 - √Δ

where Δ = (q/2)² + (p/3)³.

cardano formula

So the solution for y is:

y = ³√(-q/2 + √Δ) + ³√(-q/2 - √Δ)

Substitute again:

x = y - b/(3a)

The solution to the original equation can be obtained. The remaining two solutions can be calculated using three different branches of the cube root.

solution type

• Δ > 0: one real root and two conjugate complex roots.
• Δ = 0: All roots are real and at least two are equal.
• Δ < 0 ：三個不同的實根，此時公式中需引入三角函數形式以避免複數立方根的困擾。

Solution to the fourth equation of one variable

general form

The general form of a fourth degree equation is:

ax⁴ + bx³ + cx² + dx + e = 0　(a ≠ 0)

reduced to simplified form

First substitute the variables x = y - b/(4a) and eliminate the cubic terms to obtain the "simplified quartic equation":

y⁴ + p·y² + q·y + r = 0

The coefficient is:

• p = (8ac - 3b²) / (8a²)
• q = (b³ - 4abc + 8a²d) / (8a³)
• r = (-3b⁴ + 256a³e - 64a²bd + 16ab²c) / (256a⁴)

Ferrari’s Method

Let y⁴ + p·y² + q·y + r = 0. The idea is to rewrite it in the form of "difference of squares":

(y² + α)² = (β·y + γ)²

After expanding and comparing the coefficients, we can obtain the condition that by appropriately choosing α, the original quartic equation can be decomposed into two quadratic equations.

Construct auxiliary cubic equations

The specific steps are as follows:

1. Let y⁴ + p·y² + q·y + r = (y² + m)² - (ny + k)²
2. Compare the coefficients and obtain the conditions for m, n, k.
3. After sorting out, it can be seen that m needs to satisfy an "auxiliary cubic equation" (called resolvent cubic).

Auxiliary cubic equation

The cubic equation is:

z³ + 2p·z² + (p² - 4r)z - q² = 0

Once you have solved for one of the real roots z₀, you can construct a quadratic equation to factor the original equation.

Decomposition and solution

Selecting z₀, the original equation can be decomposed into two quadratic equations:

y² ± √(z₀)·y + (p/2 + z₀/2 ± q/(2√(z₀))) = 0

After solving y one by one, finally back-substitute:

x = y - b/(4a)

Four solutions to the quartic equation can be obtained.

solution type

• All roots may be real or complex.
• If the discriminant > 0, then 4 different real roots are possible.
• If the discriminant = 0, then there are at least multiple roots.
• If the discriminant< 0，則存在複數根。

Ferrari method

background

Ferrari’s Method is a classic algebraic technique for solving quartic equations of one variable, proposed by Italian mathematician Lodovico Ferrari in the 1540s. It decomposes the quartic equation into a quadratic equation to solve it by "constructing an auxiliary cubic equation (resolvent cubic)".

General form of quartic equation

ax⁴ + bx³ + cx² + dx + e = 0　(a ≠ 0)

Do the substitution first:

x = y - b/(4a)

After eliminating the cubic terms, we get the "simplified quartic equation":

y⁴ + p·y² + q·y + r = 0

in:

• p = (8ac - 3b²) / (8a²)
• q = (b³ - 4abc + 8a²d) / (8a³)
• r = (-3b⁴ + 256a³e - 64a²bd + 16ab²c) / (256a⁴)

basic idea

The goal is to decompose y⁴ + p·y² + q·y + r into the product of two quadratic expressions. set up:

y⁴ + p·y² + q·y + r = (y² + m)² - (ny + k)²

Compare the expanded coefficients to obtain the conditional expressions about m, n, k, which are then converted into an "auxiliary cubic equation".

Auxiliary cubic equation

Let z = n², we can get:

z³ + 2p·z² + (p² - 4r)z - q² = 0

This is the so-called "resolvent cubic". Once you have solved for a real root z₀, you can use it to factor the quartic equation.

Decomposition steps

Taking z₀ > 0, a quadratic equation can be constructed:

y² ± √(z₀)·y + (p/2 + z₀/2 ± q/(2√(z₀))) = 0

These two quadratic equations can completely decompose the original quartic equation.

Answer completed

After solving for y, substitute back:

x = y - b/(4a)

Four solutions to the quartic equation can be obtained.

Features

• The method is generally applicable and any fourth-order equation can be solved.
• The key lies in the choice of "resolvent cubic".
• The actual calculation process may be quite tedious, but in theory it is always possible.

Example of solving a quartic equation

topic

Solve the equation: x⁴ + 2x² - 8x + 1 = 0

Step 1: Confirm the form

The original equation no longer has an x³ term, so it is already in the form of a "simplified quartic equation":

y⁴ + p·y² + q·y + r = 0

Here y = x, and:

• p = 2
• q = -8
• r = 1

Step 2: Construct auxiliary cubic equations

The auxiliary cubic equation is:

z³ + 2p·z² + (p² - 4r)z - q² = 0

Substitute p=2, q=-8, r=1:

z³ + 4z² + (4 - 4)z - 64 = 0

Right now:

z³ + 4z² - 64 = 0

Step 3: Solve the auxiliary cubic equation

Try integer roots, let z=4:

4³ + 4·4² - 64 = 64 + 64 - 64 = 64 ≠ 0

Let z=2:

2³ + 4·2² - 64 = 8 + 16 - 64 = -40 ≠ 0

Let z= -8:

(-8)³ + 4·(-8)² - 64 = -512 + 256 - 64 = -320 ≠ 0

Let z= 8:

8³ + 4·8² - 64 = 512 + 256 - 64 = 704 ≠ 0

Let z= 4:

= 64 + 64 - 64 = 64 ≠ 0

Use z= -4 instead:

(-4)³ + 4·(-4)² - 64 = -64 + 64 - 64 = -64 ≠ 0

z = -2：

-8 + 16 - 64 = -56 ≠ 0

z = 16：

16³ + 4·16² - 64 = 4096 + 1024 - 64 = 5056 ≠ 0

At this time, the general cubic equation solution method needs to be used instead.
After calculating the formula, we can get a real root as z₀ ≈ 3.54.

Step 4: Construct a quadratic equation

Take √(z₀) ≈ 1.88. Then the original equation is decomposed into two quadratic equations:

y² + √(z₀)·y + (p/2 + z₀/2 + q/(2√(z₀))) = 0

y² - √(z₀)·y + (p/2 + z₀/2 - q/(2√(z₀))) = 0

Substitute the values:

• First quadratic: y² + 1.88y + (1 + 1.77 - 2.13) ≈ y² + 1.88y + 0.64 = 0
• Second quadratic: y² - 1.88y + (1 + 1.77 + 2.13) ≈ y² - 1.88y + 4.90 = 0

Step Five: Solve the Quadratic Equation

• y² + 1.88y + 0.64 = 0 → y ≈ -0.42 or -1.46
• y² - 1.88y + 4.90 = 0 → Δ < 0 → 複數根 y ≈ 0.94 ± 2.06i

Step 6: Revert

Since the original formula x = y (no need for back-substitution correction), the solution is:

• x ≈ -0.42
• x ≈ -1.46
• x ≈ 0.94 + 2.06i
• x ≈ 0.94 - 2.06i

in conclusion

The equation x⁴ + 2x² - 8x + 1 = 0 has two real roots and two conjugate complex roots.
Although the process of Ferrari's method is cumbersome, it can systematically decompose the quartic equation into a quadratic equation to solve.

Remainder of a polynomial divided by a higher degree

x²⁰²⁶divided by (x²+1)(x-1)²The remainder solution of

Calculation principle

Let the division formula be B(x) = (x^2+1)(x-1)^2. Since the degree of the division is 4th, the highest degree of the remainder R(x) must be less than 4th.
Let the remainder be R(x) = ax^3 + bx^2 + cx + d.
According to the principle of polynomial division, the dividend can be expressed as:
x^2026 = (x^2+1)(x-1)^2 Q(x) + ax^3 + bx^2 + cx + d

Substitute special values ​​to solve

1. When x = 1 (real roots of division equation):
1^2026 = a(1)^3 + b(1)^2 + c(1) + d
a + b + c + d = 1 --- (Equation 1)

2. Differentiate both sides of the original equation and enter x = 1 (processing multiple roots):
2026x^2025 = (partial differential of division) + 3ax^2 + 2bx + c
Since (x-1)^2 still contains the (x-1) term after differentiation, this part is 0 after substituting x=1:
2026 = 3a + 2b + c --- (Equation 2)

3. When x = i (imaginary root of the division formula, i^2 = -1):
i^2026 = (i^2)^1013 = (-1)^1013 = -1
R(i) = a(i^3) + b(i^2) + c(i) + d = -ai - b + ci + d
Sort out the real and imaginary parts: -1 = (d - b) + i(c - a)
From this we can get:
d - b = -1 --- (Equation 3)
c - a = 0 => c = a --- (Equation 4)

Simultaneous Equations Operation

Substituting (Equation 4) c = a into (Equation 1) and (Equation 2):
(1) a + b + a + d = 1 => 2a + b + d = 1
(2) 3a + 2b + a = 2026 => 4a + 2b = 2026 => 2a + b = 1013

Substituting 2a + b = 1013 into 2a + b + d = 1:
1013 + d = 1 => d = -1012

Substituting d = -1012 into (Equation 3):
-1012 - b = -1 => b = -1011

Substituting b = -1011 into 2a + b = 1013:
2a - 1011 = 1013 => 2a = 2024 => a = 1012
Since c = a, so c = 1012

Calculation result

Remainder R(x) = 1012x^3 - 1011x^2 + 1012x - 1012

x²⁰²⁶divided by (x²+1)(x-1)²Solution 2 of the remainder

Calculation ideas

This solution does not use the imaginary number i or calculus. We use the congruence property of polynomials to find out the difference between the dividend and the two factors (x²+1) and (x-1)²The remainders are finally combined into the total remainder.

Step 1: Find x²⁰²⁶divide by x²+1 remainder

Considering the congruence relationship, when the division formula is x²+1 when x²Equivalent to -1.
x²⁰²⁶ = (x²)¹⁰¹³
will x²= -1 Substitute:
(-1)¹⁰¹³ = -1
Therefore, x²⁰²⁶divide by x²The remainder of +1 is -1.

Step 2: Find x²⁰²⁶Divide by (x-1)²remainder

Let x = (x-1) + 1 and expand using the binomial theorem:
x²⁰²⁶ = [(x-1) + 1]²⁰²⁶
In the expansion, terms containing (x-1) to the 2nd power and higher can be (x-1)²Divisible.
We only need to keep the last two items:
Remainder = C(2026, 1) * (x-1)¹ * 1²⁰²⁵ + C(2026, 0) * 1²⁰²⁶
Remainder = 2026 * (x-1) + 1
Remainder = 2026x - 2026 + 1 = 2026x - 2025

Step 3: Use substitution method to find the total remainder

Let the total remainder be R(x). Because the division is to the 4th power, the remainder is up to the 3rd power.
According to the result of the first step, R(x) = (x²+1)(ax + b) - 1。
Next, we ask R(x) to be divided by (x-1)²The remainder of must equal 2026x - 2025.

will x²+1 is expressed in the form (x-1):
x²+1 = (x-1+1)² + 1 = (x-1)² + 2(x-1) + 1 + 1 = (x-1)² + 2(x-1) + 2
In mold (x-1)²down, x²+1 is equivalent to 2(x-1) + 2.

Represent ax+b as (x-1):
ax + b = a(x-1+1) + b = a(x-1) + (a+b)

Plug the above result into R(x) and expand (ignoring the 2nd order term of (x-1)):
R(x) is equivalent to [2(x-1) + 2] * [a(x-1) + (a+b)] - 1
= 2a(x-1) + 2(a+b)(x-1) + 2(a+b) - 1
= (4a + 2b)(x-1) + (2a + 2b - 1)

Compare with the remainder of the second step, 2026(x-1) + 1:
1. 4a + 2b = 2026 => 2a + b = 1013
2. 2a + 2b - 1 = 1 => a + b = 1

Subtract the two equations: (2a + b) - (a + b) = 1013 - 1
We get a = 1012.
Substituting a + b = 1 gives us b = -1011.

final result

Substitute a and b into R(x) = (x²+1)(1012x - 1011) - 1：
R(x) = 1012x³ - 1011x² + 1012x - 1011 - 1
R(x) = 1012x³ - 1011x² + 1012x - 1012

Lambert's W function

core definition

The Lambert W function, also known as the Product Logarithm, is the inverse function of the function f(w) = w * e^w. For a complex number z, the value of W(z) is defined as the value that satisfies the following equation:

W(z) * exp(W(z)) = z

This means that if you know the product of a number and its exponential function, Lambert's W function can help you work backwards to work out the number itself. This is useful when working with transcendental equations containing exponential terms.

branching properties

Since the function f(w) = w * e^w is not injective over the real domain (that is, different inputs may result in the same output), its inverse function has two branches in the real domain:

• Main branch W_0(z):Defined when z is greater than or equal to -1/e. In this branch, when z is 0, W_0(0) = 0. The range of this branch is real numbers greater than or equal to -1.
• Negative branch W_-1(z):Defined only when z is between -1/e and 0 (exclusive). The range of this branch is real numbers less than or equal to -1.

At z = -1/e (approximately -0.3678), the two branches meet, where W(-1/e) = -1.

discover history

The function is named after Swiss mathematician Johann Heinrich Lambert, who first touched on the concept in 1758 while studying trinomial equations. Subsequently, the great mathematician Leonhard Euler conducted a more in-depth analysis of it in 1783. However, the official name "Lambert's W function" was not widely adopted until the 1990s in order to allow mathematical software (such as Maple or Mathematica) to have consistent naming conventions.

Science and Engineering Applications

Lambert's W-function provides analytical solutions in several areas, freeing scientists from relying solely on numerical simulations:

• physics:It appears in the derivation of Planck's law, Wien's displacement law, and when studying the energy levels of quantum systems.
• Electronic Engineering:Used to describe the current versus voltage relationship of a diode circuit, especially when calculating solar cell models with series resistance.
• Biochemical Kinetics:In Michaelis-Menten kinetics, the process of enzymatic reactions changing with time is described.
• Algorithm analysis:This function describes the asymptotic behavior when analyzing the average retrieval time of certain hashing algorithms or tree structures.

series

basic definition

A series is the process or result in mathematics of adding the items in a sequence in order. If the sequence contains a finite number of terms, it is called a finite series; if it contains an infinite number of terms, it is called an infinite series. The concept of series is the basis of calculus and mathematical analysis and helps us understand how to deal with infinite accumulation.

Arithmetic series

Arithmetic series refers to the accumulation process in which the differences (called tolerances) of any two adjacent items in a sequence are equal. Its most famous property is that the sum of a series can be calculated by multiplying the average of the first and last terms by the number of terms.

Example: 1 + 3 + 5 + 7 + 9 = 25

geometric series

A geometric series refers to an accumulation process in which the ratios (called common ratios) of any two adjacent terms in a sequence are equal. In the case of an infinite series, if the absolute value of the common ratio is less than 1, the series will converge to a definite value.

Example: 1 + 1/2 + 1/4 + 1/8 + ... = 2

Convergence judgment

For infinite series, the most important research direction is to determine whether it converges. Convergence means that the result of adding infinite numbers approaches a finite constant; if the sum tends to infinity or oscillates between multiple values, it is called divergence.

• Convergence series:Such as geometric series (common ratio less than 1) or the results of Basel's problem.
• Divergence series:For example, in the harmonic series (1 + 1/2 + 1/3 + ...), although each term is getting smaller, the sum tends to infinity.

Special series and applications

Series have wide applications in advanced mathematics and engineering:

• Power series:Representing a function as a power of a variable is the basis for computer processing of function operations.
• Taylor series:Use derivatives to expand complex functions (such as trigonometric functions) into infinite series.
• Fourier series:Decompose periodic signals into series sums of sine and cosine waves for signal processing and physical wave analysis.

infinite series

basic definition

An infinite series is an expression that sequentially adds all the terms in an infinite sequence. If the sequence is a1, a2, a3..., then the corresponding series is recorded as a1 + a2 + a3 + .... Although we cannot complete infinite additions in reality, through the concept of mathematical limits, we can study whether the sum tends to a specific value.

convergence and divergence

The most important property of infinite series is its convergence:

• convergence:If as the number of addition terms increases, the partial sum (the sum of the first n terms) approaches infinitely close to a fixed real number S, we say that the series converges, and its sum is S.
• Divergence:If the partial sum does not tend to any fixed value (for example, to infinity, or to swing between multiple values), the series is said to diverge.

geometric series

The geometric series is the most common and well-understood example of an infinite series, in which each term is the previous term multiplied by a fixed ratio (the common ratio r). A geometric series converges when the absolute value of the common ratio is less than 1. For example:

1/2 + 1/4 + 1/8 + 1/16 + ... = 1

This geometric figure visually shows that when an infinite number of positive numbers are added together, the result can be a finite number.

Zeno's Paradox and Mathematical Solution

The ancient philosopher Zeno once proposed the famous "Achilles chasing the tortoise" paradox. He argued that the pursuer must first reach the starting point of the pursued, and when he reaches that point, the pursued has moved forward some distance, so the pursuer can never catch up to the turtle. The mathematical answer to this paradox is an infinite series: the sum of infinite time periods can be a finite value, which means that the pursuer can surpass the tortoise in a limited time.

Judgment method

Mathematicians have developed a variety of tools to judge the convergence of a complex series. Common methods include:

• Comparative judgment method:Compare unknown series to series known to converge or diverge.
• Ratio discrimination method:Observe the limit of the ratio of the latter term to the previous term.
• Points judgment method:Use the convergence of function integrals to judge series.

scientific applications

Infinite series have a wide range of applications in science and engineering, such as:

• Taylor series:Expand complex functions (such as sine or exponential functions) into the sum of infinite polynomials to facilitate computer numerical operations.
• Fourier series:Decomposing periodic signals into infinite combinations of waveforms is the basis of modern communication and audio processing.

harmonic series

basic definition

调和级数是一个无限级数，由正整数的倒数按顺序相加而成。 Its form is as follows:

1 + 1/2 + 1/3 + 1/4 + 1/5 + ... + 1/n + ...

It is called "harmony" because the overtone sequence in music theory is closely related to this sequence. On a stringed instrument, if the string length is shortened to 1/2, 1/3, 1/4, etc., the frequency emitted corresponds to the reciprocal of these numbers.

Divergent properties

The most famous property of harmonic series is that it is divergent. This means that as the number of terms increases, the sum approaches infinity rather than converging to a fixed value. Although the value of each term (1/n) will get smaller and closer to zero, they will not shrink fast enough for the sum to stop growing.

The first person to prove the divergence of harmonic series was the 14th-century mathematician Nicole Oresme. He used an ingenious grouping method, dividing the terms into groups, and proved that the sum of each group is greater than 1/2, so the sum of infinite many 1/2 must lead to infinity.

Growth rate and logarithm

Although the harmonic series diverges to infinity, it grows extremely slowly. The sum of the first million terms is only about 14.39. Mathematician Euler discovered that the difference between the sum of the first n terms of the harmonic series and the natural logarithm ln(n) tends to a constant called the Euler-Mascheroni constant, which is approximately equal to 0.5772.

Interesting application: stacking blocks problem

Harmonic series has a famous application in physics: if you have a stack of identical rectangular wooden blocks, you can use the properties of harmonic series to perform "eccentric stacking." As long as there are enough wooden blocks, you can theoretically make the top wooden block completely suspended beyond the edge of the bottom wooden block, and the offset distance can be infinite.

Relevance to prime numbers

Harmonic series are also deeply related to the distribution of prime numbers. The series is also divergent if we just add the reciprocals of the primes (1/2 + 1/3 + 1/5 + 1/7 + ...). This was proved by Euler, who indirectly proved that there are infinitely many prime numbers.

Basel issues

problem definition

The Basel problem is a famous number theory problem first proposed by the Italian mathematician Montori in 1644. This problem requires calculating the exact value of the sum of the reciprocals of the squares of all positive integers, namely:

1 + 1/4 + 1/9 + 1/16 + 1/25 + ...

Although this series was known to converge, at the time, mathematicians had difficulty finding the exact value of its convergence.

historical background

This problem is called the Basel problem because the Bernoulli family who proposed the problem and Euler who finally solved it are both from Basel, Switzerland. The famous mathematician Jacob Bernoulli tried unsuccessfully to solve this problem, admitting in 1689 that it was an extremely difficult challenge. It was not until 1734 that Leonhard Euler, then only 28 years old, published a solution that shocked the mathematical world.

Euler's solutions and results

Euler used the infinite product expansion of the sine function to derive the exact value of this series. He concluded that the sum of this series is equal to:

pi squared divided by 6

This result is approximately equal to 1.644934. This was very surprising at the time, since pi should appear in a sequence of sums of squares of integers that seemed completely unrelated to circular geometry.

mathematical meaning

The solution to the Basel problem not only made Euler famous, but also opened up new paths for subsequent mathematical research:

• Riemann ZETA function: The Basel problem is actually the value of the Riemann zeta function when s is equal to 2, that is, zeta(2).
• Distribution of prime numbers: The answer to this question is deeply related to the distribution of prime numbers.
• Theory of infinite series: Euler's method of dealing with this problem greatly promoted the development of infinite series and analysis.

Calculus

Calculus is a discipline in mathematics that studies the rate of change and accumulation of quantities. Calculus consists of two parts: differential calculus and integral calculus. It is widely used in physics, engineering, biology, economics and other fields. It is a basic tool for describing continuous changes.

Differential calculus

The main purpose of differential calculus is to study the rate of change of a function. Differential operations are used to find the derivative of a function, which describes the rate at which the function changes with the independent variables. Simply put, the derivative can be thought of as the slope of an instantaneous change.

• Derivative: The derivative describes the rate of change of a function at a certain point. For example, iff(x) = x^2,butf'(x) = 2xexpressf(x)existxrate of change.
• differential: Differentiation is the application of derivatives, which represents the change of a function within a small range of change. likedy/dxyesyrelativelyxThe derivative of , thendyexpressxWhen small changes occuryamount of change.

integral calculus

Integral calculus is used to calculate accumulated quantities and is closely related to the calculation of area and volume. Integral is the inverse operation of derivative and is mainly used to solve the inverse change of cumulative quantity, sum or function.

• indefinite integral: Indefinite integral represents the antiderivative of a function and is usually used to find the general solution of a function. For example, iff(x) = 2x,but∫f(x)dx = x^2 + C,inCis the integral constant.
• definite integral: Definite integral represents the cumulative quantity within a certain interval and is used to calculate the area under the curve. For example,∫[a, b] f(x) dxexpressf(x)in the interval[a, b]the sum within.

fundamental theorem of calculus

The fundamental theorem of calculus connects differential and integral calculus and shows that integral operations can be solved through derivatives. Specifically, ifF'(x) = f(x),but∫[a, b] f(x) dx = F(b) - F(a)。

Applications of Calculus

Calculus has a wide range of applications in science and engineering, here are some examples:

• physics: Describe the movement, speed, acceleration, etc. of an object.
• biology: Study the growth model of organisms, the metabolic rate of drugs, etc.
• economics: Analyze issues such as market changes, minimum cost or maximum benefit.
• engineering: Used to design, optimize and simulate engineering systems.

example

Here is a simple differential and integral example:

Differentiation: If f(x) = x^3, then f'(x) = 3x^2

Integral: If f(x) = 3x^2, then ∫f(x)dx = x^3 + C

in conclusion

Calculus is a mathematical tool that studies change and accumulation, and is essential for understanding and simulating real-world phenomena.

Differential formula table

Below are some common differential formulas that have a wide range of applications in mathematics and physics.

Basic differential formula

• Constant term: d(c)/dx = 0,incis a constant.
• Power function: d(x^n)/dx = n * x^(n-1)。
• Exponential function: d(e^x)/dx = e^x。
• Logarithmic function: d(ln(x))/dx = 1/x。

Differential formulas of trigonometric functions

• Sine function: d(sin(x))/dx = cos(x)。
• Cosine function: d(cos(x))/dx = -sin(x)。
• Tangent function: d(tan(x))/dx = sec²(x)。
• Cotangent function: d(cot(x))/dx = -csc²(x)。
• Secant function: d(sec(x))/dx = sec(x) * tan(x)。
• Cosecant function: d(csc(x))/dx = -csc(x) * cot(x)。

Inverse trigonometric function differential formula

• Arcsine function: d(arcsin(x))/dx = 1/√(1 - x²)。
• Arc cosine function: d(arccos(x))/dx = -1/√(1 - x²)。
• Arctangent function: d(arctan(x))/dx = 1/(1 + x²)。
• Inverse cotangent function: d(arccot(x))/dx = -1/(1 + x²)。
• Inverse secant function: d(arcsec(x))/dx = 1/(|x| * √(x² - 1))。
• Inverse cosecant function: d(arccsc(x))/dx = -1/(|x| * √(x² - 1))。

Multiplication and division differential formulas

• Multiplication rule: d(u * v)/dx = u' * v + u * v'。
• Division rule: d(u / v)/dx = (u' * v - u * v') / v²。

chain rule

The chain rule is used for differentiation of composite functions:

d(f(g(x)))/dx = f'(g(x)) * g'(x)

Implicit function differentiation

If the function is given implicitly, e.g.F(x, y) = 0, then the implicit function differentiation method can be used:

(dy/dx) = -(∂F/∂x) / (∂F/∂y)

partial integration method

Basic concepts

formula

• u(x): Choose a function that is easier to differentiate
• v′(x): Choose a function that is easier to integrate

Definite integral version

Selection skills

1. L: logarithmic function (such as ln x)
2. I: Inverse trigonometric function (such as arctan x)
3. A: Algebraic function (such as xⁿ)
4. T: Trigonometric functions (such as sin x, cos x)
5. E: Exponential function (such as eˣ)

example

Reuse some points

Examples of trigonometric and exponential functions

Comparison with substitution integral

application

• Calculate the integral of high-order polynomials multiplied by exponential and trigonometric functions
• Solve the integral part of a differential equation
• Derivation of Fourier and Laplace transformation properties

Feynman Integral Techniques

What is the Feynman integral technique?

Feynman's Technique is a method for calculating complex integrals, named after the famous physicist Richard Feynman. This technique solves the problem by parameterizing the integral, introducing differential variables, and performing the integral operation in the final step. This method is particularly suitable for solving integrals that are difficult to solve in traditional ways.

Basic steps of Feynman technique

Feynman integration techniques usually include the following steps:

1. Introduce parameters:Introduce a parameter to make the integration easier to operate. This parameter can be a variable in the integral, or a new variable to help simplify the form of the integral.
2. Differentiating the parameters:Differentiating the introduced parameters can convert complex integrals into integrals over the parameters, thereby reducing the difficulty of the problem.
3. Calculate points:The differentiated results are integrated, and finally the parameter values ​​are reintroduced at appropriate steps to complete the final integral calculation.

Application examples

Here is a simple example of Feynman's integral technique:

Suppose we need to calculate the following integral:
    I = ∫ e^(-x^2) dx

    We can introduce a parameter t and let the integral be I(t) = ∫ e^(-t * x^2) dx.
    Next, the parameter t is differentiated and the corresponding integral is calculated, finally returning t to the desired value.

This method is suitable for solving complex integrals of similar forms, especially when there is parameterization.

Advantages of Feynman's Integral Technique

The advantage of Feynman's integration technique is that it can simplify difficult integration problems, especially in physics and engineering. Many common integrals can be solved by this technique. This method can deal with complex integration problems more flexibly without losing accuracy.

in conclusion

The Feynman integration technique is a powerful and flexible calculation method that simplifies integration problems by introducing parameters and differentials. This technique has wide applications in physics, mathematics and other fields, and is an important tool for solving complex integral problems.

differential equations

A differential equation is an equation containing an unknown function and its derivatives that describes the rate of change in a system. Differential equations are widely used in scientific fields such as physics, engineering, economics and biology, and are particularly suitable for simulating phenomena that change over time or space.

Classification of differential equations

Differential equations are generally divided into the following types:

• Ordinary Differential Equation (ODE): Ordinary differential equations contain only one independent variable and its derivative, and are common in time-dependent systems, such as simple harmonic motion.
• Partial Differential Equation (PDE): Partial differential equations contain multiple independent variables and their partial derivatives, and are usually used to describe changes in multi-variable systems, such as heat conduction equations or wave equations.
• Linear and nonlinear equations：
  • linear differential equation: The unknown function of the equation and its derivatives are all linear.
  • nonlinear differential equations: Contains nonlinear terms of unknown functions, such as squares, exponentials, or other nonlinear combinations.

Solutions to Differential Equations

Methods for solving differential equations vary depending on the type and complexity of the equation. Common methods include:

• Separation of Variables: Applies to separable variables.
• characteristic equation method: used for linear differential equations, especially linear homogeneous equations.
• variable substitution: Simplify the equation through appropriate substitution of variables.
• Numerical methods: When the equation cannot be solved analytically, use numerical solution methods, such as Euler's method, Runge-Kutta method, etc.

Applications of Differential Equations

Differential equations have applications in many fields of science, here are a few examples:

• physics: Newton's equations of motion describe the motion of an object.
• biology: Describes the growth and decline of a population.
• economics: Simulate market changes over time.
• engineering: Used for simulating circuits, mechanical systems, fluid mechanics, etc.

example

The following is an example of an ordinary differential equation:

      dy/dx = 3x^2
    

The solution to this equation is:

      y = x^3 + C
    

in,Cis the integral constant.

in conclusion

Differential equations are powerful tools for describing changes in natural and engineered systems, allowing us to simulate and predict system behavior.

partial differential equations

definition

A Partial Differential Equation (PDE) is an equation containing partial derivatives of one or more variables. This type of equation is used to describe the law of change in a multivariable system.

basic type

• Elliptic: Describes steady-state phenomena, such as Laplace's equation.
• Hyperbolic: Describes wave phenomena, such as wave equations.
• Parabolic: Describes diffusion or conduction processes, such as heat equations.

Solution method

• Analytical solution methods: separation of variables method, Fourier transform, Green's function, etc.
• Numerical solution methods: finite difference method, finite element method, finite volume method, etc.

Common equations

1. Heat equation: ∂u/∂t = α ∇²u
2. Wave equation: ∂²u/∂t² = c² ∇²u
3. Laplace's equation: ∇²φ = 0
4. Poisson's equation: ∇²φ = f(x, y, z)

Application areas

• heat transfer and diffusion
• Acoustics and vibration
• electromagnetism
• quantum mechanics
• fluid mechanics

Heat Equation

Describing how heat spreads through space over time, the formula is as follows:

∂u/∂t = α ∇²u

inuis the temperature,αis the thermal diffusion coefficient,∇²is the Laplacian operator.

Wave Equation

Describe the propagation of vibrations or waves, such as sound waves or electromagnetic waves:

∂²u/∂t² = c² ∇²u

uis the displacement,cis the wave speed.

Laplace Equation

Descriptive equations for static fields (such as electrostatic fields):

∇²φ = 0

Often used in steady-state problems, such as electric fields and gravity fields.

Poisson Equation

When there are source terms in the field, Laplace's equation expands to:

∇²φ = ρ/ε₀

ρis the charge density,ε₀is the vacuum dielectric constant.

Schrödinger Equation

The core partial differential equations in quantum mechanics:

iħ ∂ψ/∂t = - (ħ²/2m) ∇²ψ + Vψ

ψis the wave function,ħTo reduce Planck’s constant,Vis potential energy.

Maxwell's Equations

Describe changes in electromagnetic fields, including partial differential forms:

∇ × E = -∂B/∂t
∇ × B = μ₀ε₀ ∂E/∂t + μ₀J

Eis the electric field,Bis the magnetic field,Jis the current density.

Fourier conversion

Fourier transformation is a method of converting signals in the time domain or space domain into a frequency domain representation and has important applications in signal processing, physics, and engineering. Through Fourier transformation, different frequency components in the signal can be analyzed.

Fourier transformation definition

$𝔐\left\{f\right(t\left)\right\}=F\left(\omega \right)=\int -\infty f\left(t\right)e^(-\mathrm{j\omega t})\mathrm{dt}$

in:

• f(t)is a signal in the time domain
• ωis the angular frequency (radians per second)
• F(ω)is the converted frequency domain function, describing the frequency component of the signal

nature

Some common Fourier transformation properties are as follows:

• Linearity:ℱ{af(t) + bg(t)} = aF(ω) + bG(ω)
• Translational: iff(t)The Fourier is converted toF(ω),butf(t - t0)The Fourier is converted toF(ω)e-jωt0
• differential:ℱ{f'(t)} = jωF(ω)
• integral:ℱ{∫-∞t f(τ) dτ} = F(ω) / jω

Fourier transformations of common functions

These properties and formulas can help us understand the frequency components and spectral characteristics of signals, and are widely used in signal processing and communication systems.

Fourier Transformation for Solving Partial Differential Equations

Heat Equation

Wave Equation

Laplace Equation

advantage

• Convert differentials into algebraic multiplications to make equations easier to solve
• Especially suitable for linear, constant coefficient PDE and infinite domain problems
• Analytical solutions can be quickly derived using initial conditions and boundary conditions.

Laplace conversion

Laplace transformation is a method used to convert a time domain function into a frequency domain representation. It is widely used in mathematics and engineering, especially in control systems, signal processing, and solutions to differential equations.

Laplace transformation definition

$ℒ\left\{f\right(t\left)\right\}=F\left(s\right)=\int {\forall }_0\infty f\left(t\right)e{-}^s\mathrm{dt}$

in:

• f(t)is a function in the time domain
• sis a plural variable, usually written ass = σ + jω
• F(s)is the converted frequency domain function

nature

Some common Laplace transformation properties are as follows:

• Linearity:ℒ{af(t) + bg(t)} = aF(s) + bG(s)
• Delay: iff(t)The Laplace transformation isF(s),Sof(t-a)u(t-a)The Laplace transformation ise-asF(s)
• differential:ℒ{f'(t)} = sF(s) - f(0)
• integral:ℒ{∫0t f(τ) dτ} = F(s) / s

Laplace transformations of common functions

These properties and formulas can assist in solving complex differential equations and converting them into algebraic equations for easy analysis and design of systems.

Laplace Transformation for Solving Ordinary Differential Equations

First order linear differential equation

Second-order differential equation with constant coefficients

Response to impulse input (unit step function)

advantage

• Initial conditions can be directly substituted, without the need to deal with general solutions and special solutions separately.
• Especially suitable for processing discontinuous inputs with segments, pulses, delays, etc.
• Systematic solutions to linear differential equations

Green's function

definition

Green Function is a tool used to solve linear differential equations, especially for non-homogeneous partial differential equations containing source terms. If for a linear operatorL,satisfy

L G(x, ξ) = δ(x - ξ)

inδ(x - ξ)is the Dirac delta function, thenG(x, ξ)is the Green's function of this operator.

application

If Green's function is knownG(x, ξ), then the non-homogeneous equation can be

L u(x) = f(x)

The solution of is expressed in integral form:

u(x) = ∫ G(x, ξ) f(ξ) dξ

physical meaning

Green's function can be regarded as the "response" produced by the unit source term in space, for example:

• The potential energy generated by a unit point charge in an electric field
• Temperature distribution caused by unit heat source in heat transfer
• Response due to instantaneous point excitation in fluctuations

Common examples

The Green's function of a Laplace equation (on the infinite interval) is:

G(x, ξ) = -|x - ξ| / 2

Solution steps

1. Confirm linear operatorLand boundary conditions
2. find satisfactionL G(x, ξ) = δ(x - ξ)Green's function that meets the boundary conditions
3. Substitute into the integral expression to solveu(x)

Sturm–Liouville theory

Sturm–Liouville theory is a mathematical framework for dealing with eigenvalue problems. It is mainly used to solve eigenfunctions and eigenvalue problems of linear differential equations. The theory has wide applications in physics, engineering and applied mathematics, particularly in describing system behavior in vibration, heat conduction and quantum mechanics.

Sturm–Liouville problem form

A typical Sturm–Liouville problem can be expressed as a second-order differential equation of the following form:

      (p(x)y')' + (q(x) + λr(x))y = 0
    

in:

• yis an unknown function.
• λis the characteristic value.
• p(x)、q(x)andr(x)is a known function, andp(x)andr(x)A positive value within a given interval.

boundary conditions

In order to formulate the Sturm–Liouville problem, the equation needs to satisfy two boundary conditions. Common boundary conditions include:

• Dirichlet boundary conditions：y(a) = 0andy(b) = 0
• Neumann boundary conditions：y'(a) = 0andy'(b) = 0
• or mixed boundary conditions

These boundary conditions determine the eigenvaluesλPossible values ​​​​of , and affect the corresponding characteristic functiony(x)form.

Eigenvalues ​​and Eigenfunctions

The solution to the Sturm–Liouville problem consists of a set of eigenvaluesλand the corresponding characteristic functiony(x). These characteristic functions satisfy orthogonality, that is, in the weight functionr(x)Below, the integrals of different characteristic functions are zero:

∫[a, b] y_m(x) y_n(x) r(x) dx = 0 (when m ≠ n)

in,y_m(x)andy_n(x)are different eigenvaluesλ_mandλ_nthe corresponding characteristic function.

Application of Sturm–Liouville theory

Sturm–Liouville theory is widely used in the following fields:

• physics: Describe the energy levels of particles in quantum mechanics; solve the eigenvalue problem of temperature distribution in heat conduction problems.
• Vibration analysis: Used to analyze vibration patterns and frequencies.
• engineering: Applied to structural analysis, circuit design, and acoustic problems.
• applied mathematics: Helps expand the function into a linear combination of characteristic functions, which is particularly important in Fourier analysis.

example

Consider the following simple Sturm–Liouville problem:

      y'' + λy = 0,   y(0) = 0, y(π) = 0
    

Eigenvalues ​​for this problemλforλ_n = n^2(innis a positive integer), and the corresponding characteristic function isy_n(x) = sin(nx)。

in conclusion

Sturm–Liouville theory provides a framework for dealing with eigenvalue problems and is of great significance for analyzing linear differential equations and understanding the vibration modes of systems.

Rainville ordinary differential equation

What is Rainville ordinary differential equation?

Rainville ordinary differential equations refer to a class of equations named after Harry Rainville Rainville, whose research covers a variety of differential equation theories and proposes important solutions and applications, especially in engineering and physics. In his work, Rainville provides systematic solution guidance for first-order, second-order and higher-order ordinary differential equations, which is very helpful for understanding the theory of differential equations.

Classification of Rainville Ordinary Differential Equations

• First order ordinary differential equation:These equations contain only first derivatives and are of the formdy/dx = f(x, y). First-order equations are often used to model simple dynamic systems.
• Second-order ordinary differential equation:An equation containing second derivatives is of the formd²y/dx² = g(x, y, dy/dx). This type of equation is very common in the description of physical phenomena such as vibration and wave.
• Higher order ordinary differential equations:Equations containing higher-order derivatives usually correspond to more complex systems and require more complicated solutions.

Solution of Rainville Ordinary Differential Equation

Rainville proposed a variety of solutions to different differential equations:

• Separation of variables method:Solve first-order ordinary differential equations by separating the variables.
• Integral factor method:For linear equations, use integration factors to reduce the equation to a solvable form.
• Characteristic root method:Used for second-order linear ordinary differential equations to find general solutions based on the properties of characteristic roots.
• Laplace transform:It is especially suitable for ordinary differential equations containing initial conditions, converting the equations into Laplace space for solution.

Applications of Rainville Ordinary Differential Equations

• physics:Many physical phenomena such as current changes in electrical circuits, mechanical vibrations and fluid dynamics can be described by ordinary differential equations.
• engineering:Various dynamic systems in engineering, such as automatic control, structural analysis and heat conduction problems, are also often modeled using differential equations.
• Biomathematics:It is used to simulate problems such as population dynamics, population changes in ecosystems, and pharmacokinetics in organisms.

in conclusion

Rainville Ordinary Differential Equations provides a variety of solutions and applications of differential equations, and provides an important tool for dynamic system modeling in different disciplines. Whether in physics, engineering or biomathematics, Rainville equations and solutions help us deeply understand and predict the behavior of systems.

Legendre polynomial

definition

Legendre polynomials are a set of orthogonal polynomials commonly used to solve Laplace's equation and related boundary value problems in spherical coordinates. In mathematical physics, they are a special case of the Sturm–Liouville theory.

Legendre polynomialP_n(x)is the solution to a second-order linear differential equation:

      (1 - x^2) y'' - 2x y' + n(n + 1)y = 0
    

in,nis a non-negative integer.

Orthogonality

Legendre polynomials satisfy the orthogonality condition, that is, in the interval[-1, 1]above, the weight function is1When , the following integral relationship is satisfied between polynomials of different orders:

∫[-1, 1] P_m(x) P_n(x) dx = 0 (when m ≠ n)

generating function

The generating function of the Legendre polynomial is:

      (1 - 2xt + t^2)^(-1/2) = ∑ P_n(x) t^n  (n = 0, 1, 2, ...)
    

low order polynomial

Here are some low-order Legendre polynomials:

• P_0(x) = 1
• P_1(x) = x
• P_2(x) = (3x^2 - 1)/2
• P_3(x) = (5x^3 - 3x)/2

application

Legendre polynomials have important applications in physics and engineering, including but not limited to the following areas:

• quantum mechanics: Describes the wave function in a spherically symmetric system.
• electromagnetism: Used to describe the spherical harmonic expansion of electric and magnetic fields.
• numerical analysis: Used in Gaussian integration to construct the Gauss-Legendre integral method.

example

consider functionf(x) = x^2, expand it into a linear combination of Legendre polynomials:

      f(x) = (2/3) P_2(x) + (1/3) P_0(x)
    

in conclusion

Legendre polynomials provide a powerful tool for dealing with spherical symmetry problems and play an important role in numerical calculations and theoretical physics.

Hermite polynomial

definition

Hermite polynomials are a set of orthogonal polynomials in mathematics, commonly used in fields such as probability theory, numerical analysis, and quantum mechanics. Hermite polynomials satisfy the following differential equation:

    y'' - 2xy' + 2ny = 0

in,nis a non-negative integer.

recursive formula

Hermite polynomials can be generated using the following recurrence relation:

    H₀(x) = 1,
    H₁(x) = 2x,
    Hₙ₊₁(x) = 2xHₙ(x) - 2nHₙ₋₁(x)

Orthogonality

Hermite polynomials in weight functionsw(x) = e^(-x²)The following satisfies orthogonality:

∫[-∞, ∞] Hₘ(x)Hₙ(x)e^(-x²) dx = 0 (when m ≠ n)

generating function

The generating function of the Hermite polynomial is:

    e^(2xt - t²) = ∑ Hₙ(x) tⁿ / n!  (n = 0, 1, 2, ...)

low order polynomial

Here are some low-order Hermite polynomials:

• H₀(x) = 1
• H₁(x) = 2x
• H₂(x) = 4x² - 2
• H₃(x) = 8x³ - 12x

application

Hermite polynomials are widely used in the following fields:

• quantum mechanics: Used to describe the wave function of the resonator.
• probability theory: Cumulative moments for the normal distribution.
• numerical analysis: used for Gauss-Hermitian integration method.

Chebyshev polynomial

(1 - x²) T''(x) - x T'(x) + n² T(x) = 0

f(x) ≈ ∑ an Tn(x)

integral equation

definition

Integral equation refers to an equation in which the unknown function appears in the integral sign. It is a common mathematical model in many physical and engineering problems (such as heat conduction, electromagnetic fields, elastic mechanics, etc.). Its solutions are closely related to differential equations and are often converted into each other.

basic form

The general form of the integral equation is as follows:

f(x) = λ ∫ab K(x, t) φ(t) dt + g(x)

• f(x)：known function
• φ(t)：Unknown function (to be found)
• K(x, t)：Kernel function, describing the relationship between input and unknown
• λ：Proportionality constant

Main types

• Fredholm type:The upper and lower limits of integration are fixed constants
• Volterra:The upper limit of integration is variable x, which is essentially a cumulative process
• Category 1:Unknown functions appear only in integrals
• Category 2:The unknown function appears in both the integral and the external terms

Example

Fredholm Category 2:

φ(x) = ∫01 (x + t) φ(t) dt + sin(x)

Volterra Category 1:

x² = ∫0x t φ(t) dt

Applications in Physics

• Solve the potential field using Green's function in electrostatics
• The relationship between elastic body force and boundary stress
• Time response representation of heat conduction problems
• Scattering theory in quantum mechanics

Solution method

• Analytical method:Direct integration or transformation (such as Fourier or Laplace)
• Numerical method:Discretize the integration range and convert it into an algebraic equation
• Series expansion method:Expand the unknown function on a known basis

Relationship to differential equations

In many problems, integral equations and differential equations are equivalent. For example, differential equations can be obtained by differentiating integral equations, or Green's functions can be used to convert differential equations into integral form, which is particularly helpful for dealing with boundary value problems.

Conclusion

Integral equations provide an effective tool for analyzing continuous systems and boundary conditions. Compared with differential equations, it is more suitable for dealing with problems with non-locality, memory or boundary effects, and is an indispensable mathematical method in modern physics and engineering.

Integral Equations and Method of Moments

Overview of Integral Equations

An integral equation is an equation in which the unknown function appears within the integral sign. It is often used to describe the distribution of field quantities in physical problems, such as electromagnetic fields, sound fields, and thermal fields. Its basic form is as follows:

φ(x) = ∫ K(x, x') ψ(x') dx'

• φ(x)：Known function (input)
• K(x, x')：Kernel function, describing the interaction of the system
• ψ(x')：Unknown function needs to be solved

Common types

• Friedholm type:Points range is fixed
• Volterra type:The integration range varies with x

Applications in Electromagnetics

When calculating electromagnetic fields, integral equations can be used to describe the radiation and scattering behavior caused by boundary conditions. For example, Green's functions are used to establish boundary integral equations to avoid directly solving the differential form of Maxwell's equations.

Introduction to Moment Method

Method of Moments (MoM) is a numerical method that discretizes integral equations and is used to approximately solve field problems. The main idea is to expand the unknown function into a linear combination of a set of basis functions, and construct an algebraic equation system through the test function.

Step instructions

1. Expand the unknown function into a combination of basis functions:

   ψ(x) ≈ ∑ aₙ fₙ(x)

2. Substitute into the integral equation, inner product with the test function (gₘ(x)), and convert to an algebraic system:

   ∑ aₙ ∫ gₘ(x) K(x, x') fₙ(x') dx' dx = ∫ gₘ(x) φ(x) dx

3. Build a linear system:

   [Z][a] = [V]

   • Z：impedance matrix
   • a：unknown coefficient vector
   • V：excitation vector

Commonly used bases and test functions

• impulse function
• step function
• Orthogonal polynomials (such as Legendre polynomials)

Application examples

• Antenna Radiation Characteristics Simulation
• Analysis of scattering problems (e.g. radar cross-section)
• Solving for current distribution at conductive boundaries
• Modeling of sound field and heat transfer problems

Advantages and limitations

• advantage:Suitable for boundary problems, can reduce computational domain, and has high numerical stability
• limit:The matrix is ​​a dense matrix and requires high computing resources; it is suitable for small and medium-sized problems.

Conclusion

Integral equations and the method of moments provide powerful solution tools in field theory and boundary value problems. Through the establishment of numerical discretization and linear algebra systems, various scattering, radiation and transmission phenomena can be effectively solved, and are widely used in the fields of electromagnetics, acoustics and computational physics.

Feynman parameter method

Basic concepts

formula form

• Aᵢ is the denominator of the propagator (usually momentum squared minus mass squared)
• αᵢ is the exponent of the propagator (usually 1)
• xᵢ is the introduced Feynman parameter, and the integration range is [0, 1]
• δ represents the Dirac delta function, which is used to constrain the sum of xᵢ to 1

Common simplified situations

Application steps

1. Express the propagator denominator as the product of A₁, A₂, ..., Aₙ
2. Combine denominators into a single term using the Feynman parameter method
3. Complete momentum integral (usually becomes Gaussian integral)
4. Perform integration over Feynman parameters

Allocation methods and variable transformations

Advantages and uses

• Simplify the integral of multiple propagators to a single propagator
• Facilitates Wick rotation and Euclideanization
• Convenient for regularization (such as dimension regularization) and reshaping calculations

The graphical meaning of Feynman parameters

Things to note

• The integral obtained after using Feynman parameters usually needs to be solved using variable transformation techniques.
• For multi-loop integration, multiple sets of Feynman parameters may need to be introduced

Related applications

• Calculation of scattering amplitudes for one-turn and multi-turn Feynman diagrams
• Self-energy and vertex angle correction in quantum electrodynamics (QED) and quantum chromodynamics (QCD)
• Ultraviolet divergence processing and reforming group flows in high energy physics

gamma function

What is the gamma function?

Gamma Function is a mathematical function that extends factorial and is usually used in the field of complex numbers and real numbers. For a positive integer n, the gamma function is defined as the factorial of n:

Γ(n) = (n-1)! where n = 1, 2, 3,...

For a positive real number x, the gamma function is defined as follows:

Γ(x) = ∫(0 to ∞) t^(x-1) * e^(-t) dt

This integral converges when x > 0.

Properties of the gamma function

The gamma function has several important properties, including:

• Recursion property:The gamma function satisfies Γ(n + 1) = n * Γ(n), which makes the calculation simple.
• Reflective properties:The gamma function satisfies the reflection property: Γ(x) * Γ(1-x) = π / sin(πx), which is very useful for many mathematical analysis problems.
• Logarithmic properties:For any x, the logarithm of Γ(x) satisfies ln(Γ(x)) = ∫(0 to x) (1/t) dt, which provides a deep understanding of the gamma function.

Application of gamma function

The gamma function has wide applications in many fields of science and engineering, particularly in:

• statistics:The gamma function is an indispensable tool when calculating the correlation of distributions such as the gamma and chi-square distributions.
• Numerical analysis:The gamma function is often used to solve complex numerical integral and differential equations.
• physics:In quantum physics and thermodynamics, the gamma function is often used to describe the behavior of a system.

Summarize

The gamma function is a special function that is very important in mathematics. It extends the concept of factorial and has wide applications in many fields. By understanding the properties and applications of the gamma function, we can better solve a variety of mathematical and scientific problems.

Difference product operation

definition

Fractional-order derivatives and integrals, collectively called "Differintegrals", are concepts in mathematics that extend derivatives and integrals to non-integer orders. It covers derivative and integral operations of any order on functions.

Riemann-Liouville definition

One major definition of fractional derivatives and integrals is the Riemann-Liouville form:

    Dⁿ[a, b]f(x) = (1 / Γ(m - n)) dᵐ/dxᵐ ∫[a, x] (x - t)ⁿ⁻ᵐ f(t) dt

in,nis a non-integer,mis satisfiedm - 1 < n < man integer,Γis the gamma function.

Caputo definition

The Caputo definition provides a form suitable for the initial value problem:

    Dⁿf(x) = (1 / Γ(m - n)) ∫[a, x] (x - t)ⁿ⁻ᵐ f⁽ᵐ⁾(t) dt

The Caputo definition is more suitable for describing physical phenomena than the Riemann-Liouville form.

nature

• linearity: Fractional derivatives and integrals are linear operations.
• Additivity：DⁿDᵐf(x) = Dⁿ⁺ᵐf(x)。
• Zeroth order special case：D⁰f(x) = f(x)。

application

Fractional derivatives and integrals have important applications in many fields of science and engineering:

• control system: Describes dynamic systems with memory effects.
• signal processing: Analyze filter behavior for non-integer dimensions.
• physics: Simulate fractal media and abnormal diffusion phenomena.
• financial mathematics: Modeling the complexity of stochastic processes in asset prices.

Bessel function

What is Bessel function?

Bessel Functions are a type of special functions widely used in mathematics and physics, especially when solving circular or cylindrical symmetry problems. These functions are named after the mathematician Friedrich Bessel and are usually represented by J_n(x), where n is the order of the function, and x is the independent variable.

Bessel function types

There are two main types of Bessel functions:

• Bessel functions of the first kind:Denoted J_n(x), it is finite at x=0 and is most common in most applications.
• Bessel functions of the second kind:Denoted as Y_n(x), it is undefined when x=0 and is usually used to deal with certain boundary conditions.

Properties of Bessel functions

Bessel functions have many important mathematical properties, including:

• Orthogonality:Within a specific interval, the Bessel function satisfies the orthogonality condition, which is very important for certain integral calculations.
• Recurrence relationship:Bessel functions satisfy specific recurrence relationships and can be used to calculate higher-order function values.
• Asymptotic behavior:The asymptotic properties of Bessel functions can simplify many calculations as x goes to infinity.

Application of Bessel function

Bessel functions are widely used in many fields of science and engineering, especially in:

• Wave equation:Bessel functions are often used to explain wave behavior when analyzing cylindrically symmetric wave problems.
• Quantum Mechanics:Bessel functions play an important role when solving the wave function of some quantum systems.
• Electromagnetism:When describing electromagnetic wave propagation in cylindrical waveguides, Bessel functions are used for calculations.
• Signal processing:Bessel functions are also used in filter design and frequency response analysis.

Summarize

As a special function, Bessel function is of great significance in mathematics and its application fields. Its unique properties and wide range of applications make it an indispensable tool in physics and engineering.

hypergeometric function

definition

Hypergeometric functions are a special class of functions, defined as generalized hypergeometric series:

    _2F_1(a, b; c; z) = ∑ (aₖ bₖ / cₖ) * zᵏ / k!  (k = 0, 1, 2, ...)

in,aₖ = a(a+1)(a+2)...(a+k-1)represents the ascending factorial,c ≠ 0, -1, -2, ...。

Convergence

The series converges under the following conditions:

• |z| < 1When the series converges.
• |z| = 1when, ifRe(c - a - b) > 0, then convergence.

special circumstances

Hypergeometric functions include a variety of special cases, such as:

• Legendre polynomial:whena = b = 1/2，c = 1。
• Beta function: can be passed through_2F_1Express.
• Jacobi polynomial: Closely related to hypergeometric functions.

differential equations

Hypergeometric functions satisfy the following hypergeometric differential equation:

    z(1 - z)y'' + [c - (a + b + 1)z]y' - aby = 0

application

Hypergeometric functions have important applications in the following fields:

• physics: Describes wave functions and electromagnetic fields in quantum mechanics.
• statistics: Used to calculate probability distribution.
• numerical analysis: as a basic tool in approximation methods.

Legendre Functions

Legendre Functions are a special set of functions that solve Legendre differential equations. These functions are widely used in physics and engineering problems, especially in spherically symmetric systems such as electrostatic fields, gravitational fields, and spherical coordinate systems in quantum mechanics.

The Legendre differential equation is a second-order ordinary differential equation of the form:

(1 - x²) d²y/dx² - 2x dy/dx + l(l + 1)y = 0
        

in,lis a non-negative integer,xThe value range of is -1 to 1.

whenlWhen it is a non-negative integer, the solution of Legendre differential equation is Legendre polynomial, usually written asPl(x). Legendre polynomials are the form of polynomial solutions. The following are the first few polynomials:

• P0(x) = 1
• P1(x) = x
• P2(x) = (3x² - 1) / 2
• P3(x) = (5x³ - 3x) / 2

Legendre polynomials satisfy orthogonality, that is:

∫-11 Pl(x) Pm(x) dx = 0, when l ≠ m

Associated Legendre Functions are used to solve problems with angular momentum in spherical coordinates. The Legendre joint function is written asPlm(x),inmis an integer and satisfies|m| ≤ l。

The Legendre joint function can be derived by differentiation from Legendre polynomials:

Plm(x) = (1 - x²)|m|/2 d|m|Pl(x) / dx|m|
        

• Electrostatic and gravitational fields: Solve potential equations in spherically symmetric fields, such as the Earth's gravitational field or the electric field distribution of a charged sphere.
• quantum mechanics: Solve the Schrödinger equation in spherical coordinates, especially when angular momentum is involved, such as the electron orbits of atoms.
• Engineering applications: Spherical harmonic analysis in acoustics and electromagnetics for wave problems on a sphere.

#Python example: Use SciPy to calculate Legendre polynomial P3(x)
from scipy.special import legendre

# Define Legendre polynomial
P3 = legendre(3)
x = 0.5 # Take x = 0.5

# Calculate P3(x)
result = P3(x)
print("P3(0.5) =", result)

This example shows how to use the Python SciPy suitelegendreFunction Calculate Legendre PolynomialP3(x)value.

In summary, the Legendre function plays an important role in many physical and engineering problems, especially in symmetry problems in spherical coordinate systems.

difference equation

Difference equation (Difference Equation) is an equation that describes the relationship between discrete variable sequences. It is widely used in fields such as mathematics, physics, economics, and engineering to describe the dynamic behavior of discrete systems.

Basic form of difference equation

The basic form of the difference equation is as follows:

y[n+1] = f(y[n], y[n-1], ..., y[0], n)

in:

• y[n]represents a sequence in timenvalue
• fis a function that determines the recurrence relationship of the sequence

Types of difference equations

• Linear difference equation:If the difference equation can be expressed in linear form, that isy[n+1] = a y[n] + b, is called a linear difference equation.
• Homogeneous difference equation:When the right-hand side contains no sequence-independent terms, that isf = 0, then it is a homogeneous difference equation.
• Non-homogeneous difference equation:If it contains terms that are independent of the sequence (such as constant or independent variable terms), it is a non-homogeneous difference equation.

First order difference equation

The form of the first-order difference equation is:

y[n+1] = ay[n] + b

This equation can be used to describe a linearly growing or decaying sequence.

second order difference equation

The second-order difference equation considers the relationship between two previous values, such as:

y[n+2] = a y[n+1] + b y[n] + c

This type of equation is often used to describe oscillatory behavior and more complex dynamic systems.

Solution of Difference Equations

Common methods for solving difference equations include:

• Recursion method:Calculate the value of a sequence step by step based on initial conditions.
• Z-Transform:Convert the difference equation into an algebraic equation so that it can be solved.
• Eigenvalue method:For linear difference equations, the general solution is obtained using eigenvalue decomposition.

Difference equations have important application value in digital signal processing, control systems, financial models and other fields, helping to analyze and predict the behavior of discrete systems.

generic function

J[y] = ∫ L(x, y, y') dx

∂L/∂y - d(∂L/∂y')/dx = 0

vector analysis

1. Definition of vector

• A vector is a quantity with magnitude and direction that can represent physical quantities such as velocity, force, and acceleration.
• Vectors are usually represented as arrows or as pairs (or arrays) of numbers in a coordinate system.

2. Basic operations on vectors

• Vector addition:The result of adding two vectors is a new vector from the start point to the end point. Follow the parallelogram rule.
• Vector subtraction:Vector subtraction represents the vector formed from the end point of one vector to the end point of another vector.
• Scalar multiplication:Multiplying a vector by a scalar changes the vector's magnitude but not its direction (if the scalar is positive).

3. Inner product of vectors

• The inner product (dot product) is the product of two vectors. The result is a scalar, defined as the product of the magnitude of the two vectors and the cosine of their angle.
• formula:v · w = |v| |w| cos(θ), where θ is the angle between the two vectors.
• The inner product is used to calculate projections, determine the orthogonality of vectors, etc.

4. External product of vectors

• The outer product (cross product) is the product of two three-dimensional vectors. The result is a vector that is perpendicular to the original two vectors.
• formula:v × w = |v| |w| sin(θ) n, where n is the unit vector perpendicular to v and w.
• The outer product is used to calculate areas, volumes, and moments in physics.

5. Vector fields

• A vector field is a function in which each point in space is associated with a vector and is used in fields such as fluid mechanics and electromagnetism.
• Vector fields can describe the velocity distribution of fluids in space or changes in electric field strength.

6. Calculus in vector analysis

• gradient:The gradient of a scalar field is a vector field that indicates the direction of the greatest rate of change in space.
• Divergence:The divergence of a vector field is a measure of how "divergent" the field is at a certain point and is used to describe the velocity of fluid outflow.
• Curl:The curl of a vector field measures the "rotation" of the field around a certain point and is used to describe rotational motion.

Eigenvalues ​​and eigenvectors

What are eigenvalues ​​and eigenvectors?

Eigenvalue and Eigenvector are important concepts in linear algebra, especially in the study of matrices. For a given square matrix A, if there is a non-zero vector v, so that when A acts on v, the result is a multiple of v, that is:
A * v = λ * v, where λ is the eigenvalue and v is the corresponding eigenvector.

Definition of eigenvalues

The eigenvalue is a scalar associated with the eigenvector and represents the scaling factor of the matrix in the direction of the eigenvector. For a square matrix A, its eigenvalues ​​can be obtained by solving the characteristic equation:

det(A - λI) = 0, where I is the identity matrix and det represents the determinant. Solving this equation yields all eigenvalues ​​of A.

Definition of feature vector

Eigenvectors refer to vectors whose direction remains unchanged under matrix transformation. For a given eigenvalue λ, the eigenvector v is a non-zero solution that satisfies the above equation. Eigenvectors provide insight into the behavior and structure of the matrix A.

Application of eigenvalues ​​and eigenvectors

Eigenvalues ​​and eigenvectors have wide applications in many fields, including:

• Principal component analysis (PCA):Used for data dimensionality reduction to identify the most important features in the data.
• Dynamic system analysis:Helps understand system stability and behavior.
• Quantum Mechanics:Used to describe the evolution of quantum states.
• Image processing:Plays an important role in image compression and feature extraction.

Summarize

Eigenvalues ​​and eigenvectors are core concepts in linear algebra and are crucial to understanding the properties of matrices and solving various application problems. They provide important information about linear transformations and are widely used in data analysis, engineering, and scientific research.

conjugate symmetric matrix

What is a conjugate symmetric matrix?

The conjugate symmetric matrix (Hermitian Matrix) is a special square matrix that satisfies the following conditions: for any element a_{ij}, there is a_{ij} = \overline{a_{ji}} . This means that the element relationships of the matrix are symmetric, but taking into account the conjugation of complex numbers. Simply put, a matrix is ​​equal to its own conjugate transpose, which is:

A = A*, where A* represents the conjugate transpose of matrix A.

Properties of conjugate symmetric matrices

Conjugate symmetric matrices possess several important properties, including:

• Eigenvalues:All eigenvalues ​​of a conjugate symmetric matrix are real numbers, which makes it very useful in many applications.
• Orthogonal eigenvectors:The eigenvectors corresponding to different eigenvalues ​​are orthogonal, which is of great significance in data analysis and signal processing.
• Diagonalizability:All conjugate symmetric matrices are diagonalizable, and diagonalization can be achieved through a set of orthogonal matrices.

Applications of conjugate symmetric matrices

Conjugate symmetric matrices have a wide range of applications in mathematics and engineering. Common examples include:

• Quantum Mechanics:In quantum systems, the Hamiltonian usually appears in the form of a conjugate symmetry matrix and describes the energy of the system.
• Control theory:In system stability analysis, the conjugate symmetry matrix is ​​used to describe the state variables of the system.
• Signal processing:In the analysis of multivariate signals, conjugate symmetric matrices are used to deal with correlations and covariances.

Summarize

Conjugate symmetric matrix is ​​an important concept in linear algebra and has many excellent mathematical properties and applications. In various fields of science and engineering, understanding and utilizing the properties of conjugate symmetry matrices is crucial to solving practical problems.

Euler's rotation theorem

Euler's Rotation Theorem, proposed by mathematician Leonhard Euler in the 18th century, is an important theorem describing the rotation of rigid bodies. This theorem states that in three-dimensional space, any rigid body rotation fixed at a point can be expressed as a rotation about a fixed axis. This fixed axis is called the axis of rotation.

Euler's rotation theorem states: For any rigid body in three-dimensional space, if the rigid body rotates from one direction to another in space, then its rotation can be equivalent to a rotation around a fixed axis. This means that only the rotation angle needs to be knownθand the direction of the rotation axis, the rotation can be described.

In practical applications, rotation is usually expressed using Euler angles. Euler angles include three angles, which respectively describe the rotation of a rigid body on three mutually orthogonal axes in space. These three angles are usually expressed as(α, β, γ),in:

• α (Alpha): The first rotation angle, rotating around the Z axis.
• β (Beta): The second rotation angle, rotating around the X axis.
• γ (Gamma): The third rotation angle, again rotating around the Z axis.

Through these three angles, any rotation of the rigid body in space can be described.

According to Euler's rotation theorem, the rotation of a rigid body can be represented by a rotation matrix or a quaternion. The rotation matrix is ​​a 3x3 orthogonal matrix used to describe the transformation of a rigid body in space. For rotation angleθ, about the axis of rotation(x, y, z), the rotation matrix is ​​expressed as:

R(θ) = 
    | cosθ + x²(1 - cosθ)     xy(1 - cosθ) - zsinθ   xz(1 - cosθ) + ysinθ |
    | yx(1 - cosθ) + zsinθ    cosθ + y²(1 - cosθ)    yz(1 - cosθ) - xsinθ |
    | zx(1 - cosθ) - ysinθ    zy(1 - cosθ) + xsinθ   cosθ + z²(1 - cosθ)  |
        

• Robotics: In robot motion control, Euler angles are used to describe the orientation and rotation of the robot arm.
• computer graphics: In 3D modeling and animation, use Euler angles or quaternions to control the rotation of objects to avoid the Gimbal Lock problem.
• Aviation and aerospace: Describes the attitude of the aircraft in space, especially the changes in heading, pitch and roll angles.

# Python example: Calculate rotation matrix using SciPy
from scipy.spatial.transform import Rotation as R

# Define rotation angle (degrees) and axis
angle = 45 # 45 degrees
axis = [0, 0, 1] # Rotate around the Z axis

# Calculate rotation matrix
rotation = R.from_rotvec(angle * np.pi / 180 * np.array(axis))
rotation_matrix = rotation.as_matrix()
print("rotation matrix:", rotation_matrix)

This example shows how to use the Python SciPy suite to calculate a rotation matrix of 45 degrees about the Z-axis.

In summary, Euler's rotation theorem provides a concise and powerful description method for the rotation of rigid bodies and is of key significance in many engineering and physics applications.

Nabla operator

Definitions and symbols

The Nabla operator (symbol ∇) is a vector differential operator. In the three-dimensional Cartesian coordinate system, it is defined as a set of vectors that are partially differentiated with respect to the directions of the three coordinate axes. In mathematics and physics, this symbol is usually pronounced del or nabla. It is not a specific numerical value, but an operation instruction, which must act on a certain function (scalar field or vector field) to be meaningful.

Three core operations

• Gradient:When the Nabla operator acts on a scalar function, the result is a vector field. This vector points in the direction in space where the scalar field is increasing most rapidly, and its magnitude represents the increasing rate of change.
• Divergence:This is the Dot Product of the Nabla operator and the vector field. The result is a scalar quantity that describes whether, at a certain point, the vector field diverges outward (like a source) or converges inward (like a sink).
• Curl:This is the outer product (Cross Product) of the Nabla operator and the vector field. The result is a vector that describes the tendency of the vector field to rotate around a certain point, its strength, and the direction of the axis of rotation.

Laplacian

When the Nabla operator is dot producted with itself, it results in the Laplacian operator (noted ∇²). This is a second-order differential operator that plays a key role in equations describing physical phenomena such as heat conduction, electrostatic potential distribution, and wave phenomena.

Name and history

This inverted triangle notation was originally introduced by Scottish mathematician William Rowan Hamilton. The name Nabla was suggested by a friend of James Clerk Maxwell and is derived from the Greek word for an ancient plucked instrument shaped like an inverted triangle (naubla in Greek).

physical meaning

The Nabla operator is an indispensable tool in Maxwell's equations, which describe the fundamental laws of electromagnetism, and in the Navier-Stokes equations of fluid mechanics. It simplifies complex spatial change relationships into elegant vector expressions, allowing us to more intuitively understand the interaction between energy flow, fluid vortices and electromagnetic fields.

linear algebra

definition

Linear algebra is a branch of mathematics that studies vectors, vector spaces (linear spaces), linear transformations, and matrices. It is a basic tool in modern mathematics and its application fields (such as physics, engineering, economics, and computer science).

Basic concepts

• vector: A quantity with magnitude and direction, which can be expressed as an ordered sequence, such as(x, y, z)。
• matrix: A rectangular number table used to represent linear transformations or system equations.
• vector space: A set of vectors, enclosed in vector addition and numerical multiplication.
• linear transformation: Maintain the mapping of vector addition and multiplication operation structures.

Common operations

• Matrix addition and multiplication
• Vector dot product and cross product
• determinant of matrix(used to determine reversibility)
• inverse matrix(if exists)
• Gaussian elimination method(Solving a system of linear equations)

Eigenvalues ​​and eigenvectors

For square matrixA, if there is a non-zero vectorvwith scalarλMakes:

    A * v = λ * v

butλcalledEigenvalue，vfor the correspondingeigenvector. This plays an important role in system stability analysis, physical modeling and data dimensionality reduction.

application

• computer graphics: Use matrices to represent rotation, scaling and projection.
• statistics: Principal component analysis (PCA) is used for dimensionality reduction.
• machine learning: Use vectors and matrices to represent data when training the model.
• project: Used for structural analysis, signal processing, circuit design, etc.

linear transformation

definition

Linear transformation refers to a mapping from one vector space to another vector space and satisfies the following two properties:

• Additive closure: T(u + v) = T(u) + T(v)
• Number multiplication is closed: T(cu) = cT(u)

in,Tis a linear transformation,uandvis a vector,cis a scalar quantity.

Matrix representation

In linear algebra, any linear transformation can be expressed as a matrix multiplication:

    T(x) = A * x

inAis a matrix,xis a vector.

Geometric meaning

Common linear transformations in linear algebra include:

• rotate: Rotate a vector around a point or axis.
• Zoom: Changes the length of a vector, but not its direction (unless the scaling factor is negative).
• mirror: Reflect the vector onto a plane.
• cut: Change the direction of the vector but keep a certain dimension unchanged.

Nuclei and images

• Null space: all satisfiedT(x) = 0vector ofxcollection.
• Image: all possibleT(x)The set of vectors formed.

characteristic

• Linear transformations preserve the linear structure of vectors.
• The origin is always mapped to the origin (i.e.T(0) = 0）。
• Multiple linear transformations can be combined (synthesized), corresponding to matrix multiplication.

application

• computer graphics: Rotate, scale and move graphics.
• machine learning: Each layer of operation in a neural network is basically a linear transformation.
• Engineering and Physics: Describe phenomena such as force, motion, deformation, etc.
• data analysis: Principal component analysis (PCA) essentially finds a linear transformation that maximizes the projection of the data.

Euler's rotation theorem

definition

Euler's rotation theorem states that in three-dimensional space, any rigid body displacement around a fixed point can be regarded as the result of a single rotation around a unique axis passing through the fixed point. This means that no matter how complex the continuous rotation a rigid body undergoes, the change in its final position relative to the initial position can always be achieved by rotating a specific angle around a specific rotation axis.

Core features

• Fixed axis:In any rotational displacement, there is at least one straight line where the positions of all points remain unchanged before and after the rotation. This line is the axis of rotation.
• Rotation invariance:The theorem emphasizes the geometric nature of rotation operations in three-dimensional Euclidean space, that is, rotation maintains the distance and relative position between points in a rigid body.
• Degrees of freedom:Three-dimensional rotation has three degrees of freedom and can usually be described by the direction of the axis of rotation (two dimensions) plus the angle of rotation (one dimension).

mathematical explanation

In linear algebra, this theorem can be described in terms of rotation matrices. If a 3x3 real matrix R is orthogonal and its determinant has value 1 (belonging to the special orthogonal group SO(3)), then the matrix must have an eigenvalue of 1. The eigenvector corresponding to eigenvalue 1 is the axis of rotation because the vector remains unchanged when the matrix R acts on it.

Proof of concept

Euler's original proof was based on spherical geometry. He observed that any transformation that moves one set of great-circle arcs on the sphere to another set of equal-length arcs must leave a pair of antipodal points on the sphere unchanged. The straight line connecting the pair of fixed points is the axis of rotation of the rigid body.

Practical application

• Aerospace:Used to describe the attitude of an aircraft or satellite in space, usually combined with Euler angles or quaternions for navigation calculations.
• Robotics:Calculate the orientation of a robotic arm's end-effector in three-dimensional space.
• Computer graphics:Achieve smooth rotation of objects and perspective conversion in 3D modeling and animation.
• Classical mechanics:Analyze rigid body dynamics, such as the precession and nutation phenomena of gyroscopes.

abstract algebra

definition

group

ring

domain

Isomorphism and isomorphism

Modules and vector spaces

application

Development history

representative figure

geometry

definition

Classification

• Euclidean geometry:Based on Euclid's "Elements of Geometry", it takes points, lines, and surfaces as basic elements, emphasizing parallelism, postulates, proofs, etc., as the basis of traditional geometry.
• Non-Euclidean geometry:Abandon Euclid's fifth postulate, including hyperbolic geometry and elliptical geometry, and apply it to the theory of relativity and the structure of the universe.
• Analytical geometry:Use coordinates and algebraic equations to describe geometric figures. It was founded by Descartes and Fermat and combines algebra and geometry.
• Differential Geometry:Study the geometric properties of smooth curves and surfaces, using the tools of calculus, with applications in physics, general relativity, and modern physics.
• Projective geometry:The study of the relationship between perspective and projection is common in art and computer graphics.
• Topological geometry:Care about the connectivity and invariance of shapes rather than specific measurements, such as Möbius strips and Klein bottles.
• Algebraic Geometry:Taking the geometric objects defined by polynomial equations as the core of research, combining abstract algebra and geometry, it is an important field of modern mathematics.

basic elements

• point:Position marker without size.
• Wire:Made up of countless points, it has no thickness and is extendable.
• noodle:A two-dimensional flat set, such as a plane, a circle, or a triangle.
• body:Solids in three-dimensional space, such as cubes, spheres, and polyhedrons.

geometric transformation

• Pan
• rotate
• reflection
• Zoom
• Projective and affine transformations

application

Development history

representative figure

Topology

definition

Topology is a branch of mathematics that studies the properties of space that remain under continuous deformation (such as stretching, bending, but excluding tearing and gluing). It focuses on the "nature of shape" of an object rather than specific geometric measurements.

topological space

Topological space is a set with a system of subsets called "topology". These subsets satisfy:

• Empty sets and all sets in topology.
• The union of any open sets is still an open set.
• The intersection of a finite number of open sets is still an open set.

These open sets are used to define concepts such as "contiguity" and "continuity".

Basic concepts

• Open and closed sets: The basic set type in topology, used to define continuity and limits.
• connectivity: Whether the space is a single whole and cannot be divided into two disjoint open sets.
• firmness: Similar to the concept of "bounded and closed", any open cover has a finite sub-cover.
• Homotopy and homeomorphism: Describes the equivalence of space under continuous deformation.

Common examples

• ring (circle)andcoffee cupAre topologically equivalent in that they can be continuously deformed from each other.
• mobius stripandKlein bottleNon-ordinary spaces are important research objects in topology.

Important concepts and theories

• continuous function: In topology, a map is continuous if it maintains an open set structure.
• Homology and fundamental groups: Use algebraic methods to study the topological properties of space.
• classification theory: Classify space according to topological properties, such as surface classification theorem.

application

• mathematical analysis: Topological basis of limit and continuity.
• physics: Describe the space model in the structure of the universe, quantum field theory, and superstring theory.
• data analysis: Topological data analysis (TDA) is used to discover shapes and structures in high-dimensional data.
• computer science: Topological concepts are applied to network connections and graph theory analysis.

algebraic geometry

definition

Algebraic geometry is a branch of mathematics that studies the sets of solutions to polynomial equations. These solution sets are called "Algebraic Variety". Algebraic geometry combines the concepts of algebra (especially abstract algebra) and geometry, and is widely used in various fields of mathematics and physics.

basic objects

• Affine space:bykⁿFor example, wherekis a domain (such as real or complex numbers),nis the number of variables.
• Polynomial Ideal:The ideal generated by a set of polynomialsI, its zero point set is recorded asV(I)。
• Algebraic varieties:The set of ideal zero points of a polynomial, that is, all points in space that satisfy the set of polynomials.

example

existℝ²Equations inx² + y² - 1 = 0Represents a unit circle, which is an algebraic variety.

important concepts

• Hilbert's zero point theorem:Relate algebraic ideals to geometric zero sets.
• Regular function:Functions definable on algebraic varieties, corresponding to quotient ringsk[x₁,...,xₙ]/Ielements.
• Projective space:In order to deal with infinite points, projective space is introducedℙⁿ, and consider homogeneous polynomials.
• Singularity and Smoothness:Some points on an algebraic variety may not be smooth, and these points are called singular points.

Application areas

• coding theory
• Number theory and Yang-Mills theory
• Calabi-Yau manifolds in string theory
• Computer Algebra and Automatic Proofs

Calculation tools

• Gröbner basis (for simplifying polynomial systems)
• Computational algebraic geometry software such as Macaulay2, Singular, SageMath

group theory

Group G = {0, 1}
Operation: 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, 1 + 1 = 0 (modulo 2)

subgroups and orders

Subgroup

• Non-emptiness: H ≠ ∅
• Closure: for any a, b ∈ H, there is ab ∈ H
• Inverse property: for any a ∈ H, there is a⁻¹ ∈ H

Example of subgroup

• The even set 2ℤ of the additive group of integers (ℤ, +) is its subgroup.
• In the multiplicative group (ℝ⁺, ×), the set of all square numbers {x² | x ∈ ℝ⁺} forms a subgroup.
• In the symmetry group S₃, the set {e, (12)} is a subgroup.

Order

1. Order of the group:The total number of elements in group G is denoted as |G|. If |G| is finite, G is called a finite group.
2. Order of elements:For a ∈ G, if there is a smallest positive integer n such that aⁿ = e (identity element), then n is called the order of a, recorded as ord(a).

properties of order

• If G is a finite group, then the order of each element a is divided by the order of the group |G| (Lagrange's theorem).
• If ord(a) = n, then a^k = e if and only if n | k.
• The order of the subgroup also divides the order of the parent group.

example

• In the additive group (ℤ₆, +), element 2 has order 3 because 2×3 ≡ 0 (mod 6).
• In the multiplicative group (ℤ₇*, ×), element 3 has order 6 because 3⁶ ≡ 1 (mod 7).

extended concept

• Generate subgroups:The set of all powers ⟨a　 generated by an element a is a subgroup.
• Cyclic group:If a group can be generated from a single element, it is called a cyclic group.

normal subgroup

definition

significance

Judgment condition

• H is a subgroup of G.
• For all g ∈ G, gHg⁻¹ ⊆ H.
• If gH = Hg, then H is a normal subgroup.

example

• In the additive group (ℤ, +), any subgroup nℤ is a normal subgroup because addition is commutative.
• In the symmetry group S₃, the subgroup A₃ = {e, (123), (132)} is a normal subgroup.
• Among the general linear group GL(n, ℝ), the special linear group SL(n, ℝ) = {A | det(A) = 1} is a normal subgroup.

Quotient Group

nature

• Every subgroup of an Abelian group is a normal subgroup.
• If H ⊲ G, then G/H is still a group.
• If K ≤ H ≤ G and K ⊲ G, H ⊲ G, then K ⊲ H.
• Normal subgroups play a central role in group decomposition and isomorphism theorems.

application

group theory symmetry

core concepts

In mathematics, group theory is a tool specifically used to study symmetries. Symmetry of a system is defined as a property that remains unchanged under some transformation. Group theory collects these invariant transformations together into a mathematical structure called a group. This allows us to use algebraic methods to accurately classify and analyze symmetries, rather than relying solely on visual intuition.

Four axioms of groups and symmetry transformations

To treat a symmetry operation as a group, the following four basic conditions must be met:

• Closeness:Performing two symmetry operations in succession (such as a 90 degree rotation followed by a 90 degree rotation), the result must still be a symmetry operation for the system.
• Associative law:The order in which the three operations are performed does not affect the result (i.e. operation A combined with B combined with C is equal to A combined with B combined with C).
• Unit element:There is an operation that does not change anything (identity transformation), which is also a type of symmetry.
• Anti-element:Every symmetry operation must have a counter-operation that cancels it out (e.g. clockwise rotation versus counterclockwise rotation).

Common types of symmetry groups

• Cyclic Group:Describes symmetries produced solely by repeating a single operation, such as the rotational symmetry of a fan blade.
• Dihedral Group:Describes the symmetry of a polygon, including rotation and flipping (reflection). For example, the square dihedral group contains 4 rotation operations and 4 reflection operations.
• Permutation Group:Study the symmetry of the order of elements in a set, which is the basis of abstract algebra and the theory of radical solutions to equations.

Application areas

• Chemistry and Crystallography:Use point groups to classify the geometric structure of molecules and predict their spectral characteristics; use space groups to describe the repeated arrangement of atoms inside the crystal.
• Particle Physics:The interactions between elementary particles conform to a specific symmetry group (such as SU(3)xSU(2)xU(1) in the Standard Model). The existence of symmetry determines the conservation of physical quantities such as charge and spin.
• Cryptozoology:Use complex operations in group theory to design encryption algorithms to ensure the security of data transmission.

Symmetry breaking

Symmetry breaking is a profound concept in group theory. It refers to the phenomenon that a system originally has high symmetry, but due to changes in the environment or energy state, it eventually exhibits lower symmetry. This is crucial in explaining how mass was created in the early universe (the Higgs mechanism) and how phase changes, such as water freezing into crystals, occurred.

Galois theory

Overview

Galois Theory is a French mathematicianÉvariste GaloisA theory developed in the 19th century to studySolvability of Polynomial Equationsand its corresponding symmetry. This theory willgroup theoryanddomain theoryCombined, it provides conditions for judging whether a polynomial can be solved by radicals.

core concepts

domain expansion

Given a domainK, if there is a larger domainLmakeKyesLsubdomain of , then it is calledLyesKofexpansion domain, recorded asL/K。

Galois group

For a domain expansionL/K,likeGal(L/K)is maintained by allKA group composed of fixed automorphisms is calledGalois group。

Fundamental theorem

The basic theorem of Galois theory was establishedCorrespondence between Galois group and domain expansion：

• Normally separable domain extensions correspond to normal subgroups of the group.
• Solvability of radical expressions and whether the Galois group isSolvable groupRelated.

Solvability of polynomials

One of the core results of Galois' theory is thatDetermine whether the discriminant equation can be solved using radicals：

• likenThe Galois group of the second degree equation isSolvable group, then the equation can be solved by radicals.
• Five times and moregeneral polynomialThe Galois group isnon-solvable group, so it generally cannot be solved using radical formulas.

application

• proveThere is no general radical solution to the quintic equation。
• Researchfinite fieldandalgebraic number theorysymmetry in.
• in cryptographyfinite field arithmetic。

Galois group

What is a Galois group?

Galois Group is a mathematical structure in algebra used to study the symmetry between the roots of polynomial equations. The Galois group was discovered by French mathematician Évariste Galois. Galois, it is mainly used to explore the solvability of polynomials and describe the symmetry and transformation properties of their roots.

Basic concepts of Galois group

• Domain expansion:The Galois group is usually defined on the expansion of a certain domain, that is, from a basic domain to a larger domain containing the roots of the equation.
• Automorphism:The elements of the Galois group are automorphic maps on this extended field, that is, maps that map the extended field onto itself while preserving algebraic operations invariant.
• symmetry:Each Galois group element can be regarded as a symmetric transformation between the roots of a polynomial equation, so the Galois group describes the symmetric structure of the roots.

Galois theory

Galois theory is a branch of theory in mathematics used to study the solvability of polynomial equations, especially using algebraic methods to determine whether polynomials can be solved using radicals. This theory relates the solvability of polynomials to the Galois group structure of their roots:

• Solvable group:If the Galois group is a "solvable group", then the corresponding polynomial can be solved using radicals.
• Unsolvable group:If the Galois group is unsolvable, the solution of the polynomial cannot be expressed by radicals, such as polynomials of the fifth degree and above.

Applications of Galois Groups

• Solutions to algebraic equations:The Galois group can help determine whether a polynomial can be solved using radicals, which is an important tool in solving algebraic equations.
• Number theory:In number theory, Galois groups are used to study the distribution properties of numbers and the structure of prime numbers, especially in analytic number fields and modular forms.
• Quantum mechanics and symmetry:As a tool for symmetry research, the Galois group also appears in physics to help describe the symmetry transformation of the system.

in conclusion

Galois groups play an important role in mathematics, providing a way to analyze the structure of polynomial roots from a symmetry perspective. Through the relationship between the Galois group and the solvability of algebraic equations, Galois theory has elevated the study of mathematical equations to a new level and has become one of the cornerstones of modern algebra.

complex variables

Complex Variable is a branch of mathematics that studies complex functions and their properties. Complex functions consist of real and imaginary parts and have many unique properties, such as analyticity and conjugation.

Representation of plural numbers

pluralzIt can be expressed as:

z = x + yi

• xis the real part of the complex number, expressed asRe(z)
• yis the imaginary part of the complex number, expressed asIm(z)
• iis an imaginary unit, satisfyingi2 = -1

Polar form of complex numbers

Complex numbers can also be expressed in polar form:

z = r(cosθ + i sinθ) = reiθ

• ris the modulus, expressed as|z|
• θis the argument angle, expressed asarg(z)

complex function

complex functionf(z)is the pluralzA function that maps to another complex number can be written as:

f(z) = u(x, y) + iv(x, y)

• u(x, y)is the real part of the function
• v(x, y)is the imaginary part of the function

analytical

When the complex functionf(z)When it is differentiable within a certain point and its neighborhood, it is called an "analytic function". The analytical function satisfies the Cauchy-Riemann equation:

∂u/∂x = ∂v/∂yand∂u/∂y = -∂v/∂x

Common complex functions

• f(z) = zn:polynomial function
• f(z) = ez: Exponential function
• f(z) = sin(z)andf(z) = cos(z): trigonometric function
• f(z) = ln(z): Complex logarithmic function

Complex variables and their functions are widely used in the fields of mathematical physics, electrical engineering, and power systems. Their unique analytical properties make them an important research object.

complex conjugate

complex plane

definition

Complex Plane, also known as Argand Diagram, is a plane coordinate system used to represent complex numbers. The horizontal axis represents the real part, and the vertical axis represents the imaginary part.

plural form

Plural numbers are usually expressed asz = a + bi,in:

• ais the real part, corresponding to the horizontal axis of the complex plane
• bis the imaginary part, corresponding to the vertical axis of the complex plane

Polar coordinate representation

Complex numbers can also be expressed in polar coordinates as:

z = r(cosθ + i sinθ) = reiθ

in:

• r = |z|is the modular length of a complex number, representing the distance from the origin to point z
• θis the Argument, that is, the angle between z and the positive direction of the real axis

Basic arithmetic geometry meaning

• addition:vector addition
• multiplication:Multiply module lengths and add angles
• Conjugate:Make the point symmetric about the real axis, e.g.z = a + bi, its conjugate isz̄ = a - bi

example

likez = 3 + 4i,but:

• real part = 3
• Imaginary part = 4
• Model length|z| = √(3² + 4²) = 5
• Debateθ = arctan(4/3)

This point would fall in the first quadrant in the complex plane, 5 units from the origin.

Steepest descent method in the field of complex numbers

Method overview

Method of Steepest Descent is a numerical method used to solve complex integral problems, especially when oscillating functions or rapidly changing functions are involved. This method approximates the integral value by finding the fastest descent path on the complex plane.

Basic principles

The core concept of the steepest descent method is to use the Stationary Phase Method to calculate the integral along a path on the complex plane. When choosing this path, the following conditions need to be met:

• The real part on the path decreases rapidly to reduce the oscillation of the integral.
• The imaginary part along the path remains stable, ensuring that the integral does not diverge.

Step instructions

Here are the steps to use the steepest descent method:

1. For the integral functionf(z)Analyze and find the saddle point of the function, that is, satisfyf'(z) = 0point.
2. Near the saddle point, choose an appropriate descent path such thatRe(f(z))Decline rapidly.
3. The integral is converted into a parameterized form along the descending path for calculation.
4. Use approximation methods to solve the transformed integral.

Application areas

The steepest descent method is widely used in physics and engineering, especially in quantum mechanics and statistical physics, to solve problems such as:

• Oscillatory integrals, such as high-frequency problems in Fourier transforms.
• Approximate solution of partition functions.
• Phase analysis in wave phenomena.

Advantages and limitations

The main advantage of the steepest descent method is that it can effectively handle oscillatory and rapidly changing integration problems. However, its applicability depends on the properties of the integral function and requires a deep understanding of complex functions and saddle point theory.

complex variable analysis

Complex analysis is a discipline in mathematics that studies complex functions and their properties. It involves concepts such as analytic functions, conjugate functions, and complex integrals, and has wide applications in physics, engineering, and applied mathematics.

Basic concepts

• plural:Expressed asz = x + yi,inxandyare the real part and the imaginary part respectively,iis an imaginary unit.
• Complex plane:Think of a complex number as a point on a plane, where the real part is the horizontal axis and the imaginary part is the vertical axis.
• Modules and arguments:pluralzThe modulus is|z|, the argument angle isarg(z)。

analytic function

Analytical functions are complex functions that have derivatives and are continuous on the complex plane. analytic functionf(z)Satisfies the Cauchy-Riemann equation:

∂u/∂x = ∂v/∂yand∂u/∂y = -∂v/∂x

inuandvrespectivelyf(z)The real and imaginary parts of .

complex integral

Complex integration is the process of integrating analytic functions over the domain of complex numbers. Commonly used formulas include:

• Cauchy's integral theorem:likef(z)Analyzing within a region, the integral along the closed path in the region is zero, that is∮ f(z) dz = 0。
• Cauchy integral formula:likef(z)is resolved within the region, andz_0Within the area, thenf(z_0) = (1/2πi) ∮ f(z)/(z - z_0) dz。

Residue theorem

Residue theorem is an important tool for complex integral calculation, especially suitable for calculating the integral of analytic functions with singular points. For a person inz_0Functions with isolated singularitiesf(z), which surroundsz_0The closed-circuit integral of is:

∮ f(z) dz = 2πi * Res(f, z_0)

inRes(f, z_0)forf(z)existz_0remainder.

application

Complex variable analysis has important applications in many fields, such as:

• Fluid Mechanics:Use analytic functions to describe the flow of ideal fluids.
• Electromagnetism:Describe the behavior of electromagnetic fields in the complex plane.
• Digital signal processing:Used to analyze signal spectrum characteristics.

Complex variable analysis not only provides a rich mathematical theoretical foundation, but also plays an important role in science and engineering.

complex integral

Complex Integrals refers to the calculation of integrals of complex-valued functions on the complex plane. Complex integrals are very important in the analysis of complex variables and are used to solve many problems in physics, engineering and mathematics. The calculation of complex integrals involves integration on complex curves and the properties of complex functions.

The basic form of a complex integral is along a curveCintegral functionf(z),Right now:

∫C f(z) dz
        

in,z = x + iyis a plural number,xandyis a real number,f(z)Usually an analytic function defined on the complex plane.

Cauchy's integral theorem is an important theorem in complex integrals. It states that iff(z)in closed curveCAnalysis within the enclosed region, then the integral along this closed curve is zero:

∫C f(z) dz = 0
        

This theorem reveals the properties of closed-path integration of analytic functions in the complex plane and becomes the basis for subsequent integration techniques.

Cauchy's integral formula further illustrates the integral properties of analytic functions. likef(z)is resolved within the region, andais a point in the area, then:

f(a) = (1 / 2πi) ∫C f(z) / (z - a) dz
        

This formula not only shows that the analytic function at the pointaThe value of can be expressed as an integral, and it also provides a powerful tool for calculating complex integrals.

The residue theorem is a powerful computational method for evaluating complex integrals. likef(z)in closed curveCanalysis within the enclosed area, and there are only a finite number of isolated singular points in this areaz1, z2, ..., zn,but:

∫C f(z) dz = 2πi Σ Res(f, zk)
        

in,Res(f, zk)expressf(z)existzkThe remainder at. The residue theorem is a powerful method for evaluating complex integrals, especially whenf(z)When it contains extreme points.

• Electric and magnetic field calculations: Used in electromagnetics to solve for field strengths, especially in calculations of fields with symmetry.
• fluid mechanics: Used to analyze the velocity field and pressure field of fluids, especially to describe flow conditions on complex manifolds.
• quantum mechanics: Used in quantum mechanics to calculate quantum states and probability amplitudes, especially to analyze complex wave functions.

#Python example: Use SymPy to calculate simple complex integrals
from sympy import symbols, integrate, I

# Define variables
z = symbols('z')
f = 1 / (z - 1)

# Calculate points
result = integrate(f, (z, 1 + I, 1 - I))
print("∫(1 / (z - 1)) dz =", result)

This example shows how to use the Python SymPy library to compute complex integrals.

In summary, complex integrals play an important role in physics, engineering, and mathematical analysis, providing a powerful method for describing and solving problems in the domain of complex numbers.

probability statistics

standard deviation

definition

Standard Deviation (SD) is an indicator used in statistics to measure the distance of data distribution from the mean. The larger the value, the more dispersed the data distribution is; the smaller the value, the more concentrated the data is.

formula

For a set of datax₁, x₂, ..., x_n, its standard deviation formula is as follows:

Parent standard deviation (σ):

σ = sqrt(Σ (xi - μ)² / N)

Sample standard deviation (s):

s = sqrt(Σ (xi - x̄)² / (n - 1))

Calculation steps

1. Calculate the mean (μ or x̄).
2. Calculate the difference between each data point and the mean and square it.
3. Find the sum of these squared values.
4. Divide by the total number of data (N) or (n - 1) (for the sample standard deviation).
5. Take the square root of the result.

application

• Risk analysis: A measure of the volatility of a stock or investment.
• Quality control: testing product consistency.
• Test assessment: Analyzing the dispersion of student test scores.

game theory

Game Theory Theory) is a mathematical theory that studies how to make optimal decisions in a decision-making environment, especially when the decisions of all parties affect each other. Game theory is widely used in economics, political science, sociology, psychology and other fields. The main purpose is to understand how individuals or groups choose the most advantageous strategies in competitive and cooperative situations.

Basic concepts of game theory

• Player: An individual or group participating in the game, usually with multiple players.
• Strategy: The course of action chosen by each player.
• Payoff: The gain or loss each player receives based on his or her own strategy and the strategies of other players.
• Game: The structure of the entire game, including players, strategies, payments and other elements.
• Equilibrium: At the end of the game, all players have chosen a strategy that they do not want to change, usually a "Nash equilibrium".

Main types of game theory

There are many different types of games in game theory. According to the game structure and the information of the participants, games can be divided into the following categories:

• Cooperative games and non-cooperative games: In cooperative games, players can cooperate to obtain maximum benefits, while in non-cooperative games, each player considers his own interests independently.
• Zero-sum game and non-zero-sum game: In a zero-sum game, one party's gain is the other party's loss, and the total gain is zero; in a non-zero-sum game, all parties may gain or lose at the same time.
• Static game and dynamic game: In a static game, all players select strategies at the same time, while in a dynamic game, players select strategies in sequence.
• Complete information and incomplete information game: In a complete information game, all players have complete knowledge of other players’ choices and payments; in incomplete information games, there is information asymmetry.

Nash Equilibrium

Nash equilibrium is an important concept in game theory. It is formed when each player chooses the most advantageous strategy and no one is willing to change his strategy. This means that in a Nash equilibrium, each player's decision is the best choice.

For example, the typical "Prisoner's Dilemma" problem is a Nash equilibrium case in game theory. In this game, even if cooperation can maximize the overall benefits of both parties, due to incomplete information, both parties choose the strategy that is most beneficial to themselves, thus reaching a Nash equilibrium.

Applications of Game Theory

• economics: Study market competition, price setting, labor negotiations and other issues.
• political science: Used to analyze voting behavior, diplomatic strategies, policy formulation, etc.
• Psychology and Sociology: Used to study interpersonal interaction, social behavior and decision-making psychology.
• AI: Used in machine learning, strategic planning, and human-computer interaction.

in conclusion

Game theory reveals the behavioral characteristics of people in competitive and cooperative environments by studying the interactions between different decision makers. It helps us understand how to make the best decisions in various situations, and has a profound impact on modern economics, social sciences, psychology and other fields.

probability distribution

Probability distribution (probability distribution) is a mathematical function used to describe the possible value range of a random variable and its probability. Random variables can be discrete or continuous, and probability distributions can be divided into discrete probability distributions and continuous probability distributions based on the properties of random variables.

Discrete probability distributions apply to discrete random variables that have a finite or countably infinite range of values. Common discrete probability distributions are:

• Binomial Distribution: Used to describe the distribution of the number of successes in a fixed number of independent trials, such as the number of heads in a coin toss.
• Poisson Distribution: Suitable for the distribution of the number of events occurring per unit time or space, such as the number of phone calls per minute.
• Geometric Distribution: Describes the number of failures before the first success, suitable for memorized processes, such as the number of heads for the first time in a coin toss.

Continuous probability distributions are suitable for continuous random variables whose range of values ​​is continuous. Common continuous probability distributions include:

• Normal Distribution: Describes the central tendency of a data set and is a common distribution for many natural phenomena, such as height or measurement error. Its density function presents a symmetrical bell-shaped curve.
• Exponential Distribution: Suitable for describing the time interval between events, such as the time interval between customers arriving at the store.
• Uniform Distribution: Each value has the same probability of appearing in a given range, such as randomly selecting any value in the range [a, b].

• Probability Mass Function (PMF): Used to describe the distribution of discrete random variables. The PMF defines the probability of each possible value, such as the chance of heads or tails in a coin toss.
• Probability Density Function (PDF): Used to describe the distribution of continuous random variables. PDF does not directly give the probability, but the density, which needs to be calculated through integration to calculate the probability in a specific range.

#Python example: Generate normally distributed data and draw graphics
import numpy as np
import matplotlib.pyplot as plt

# Generate 1000 data points consistent with normal distribution
data = np.random.normal(loc=0, scale=1, size=1000)

# Draw histogram
plt.hist(data, bins=30, density=True, alpha=0.6, color='b')

# PDF of normal distribution
xmin, xmax = plt.xlim()
x = np.linspace(xmin, xmax, 100)
p = np.exp(-((x)**2) / 2) / np.sqrt(2 * np.pi)
plt.plot(x, p, 'k', linewidth=2)
plt.title("Normally distributed data points and PDF")
plt.show()

This example shows how to use Python to generate normally distributed data and plot its histogram and theoretical density function to help understand the shape and characteristics of the data distribution.

• Statistics and Data Science: Probability distributions are the basis for analyzing and predicting data patterns.
• machine learning: Many algorithms assume that the data follows a specific probability distribution for parameter estimation and model building.
• Engineering and Science Simulation: Distribution models help simulate random processes in the real world, such as network traffic and customer arrival intervals.

Probability distribution is a basic concept in statistics and data analysis. It helps us understand the behavior and characteristics of random phenomena and is widely used in various fields.

Generate and graph normally distributed data using HTML5

This example shows how to use JavaScript to generate normally distributed data and plot it via HTML5's Canvas.

<canvas id="chart" width="800" height="400"></canvas>

<script>
    // Generate normally distributed data
    function generateNormalData(mean, stdDev, count) {
        const data = [];
        for (let i = 0; i < count; i++) {
            data.push(mean + stdDev * Math.sqrt(-2 * Math.log(Math.random())) * Math.cos(2 * Math.PI * Math.random()));
        }
        return data;
    }

    //Set chart parameters
    const mean = 0;
    const stdDev = 1;
    const data = generateNormalData(mean, stdDev, 1000);
    const canvas = document.getElementById('chart');
    const ctx = canvas.getContext('2d');
    
    // draw histogram
    function drawHistogram(data, bins, color) {
        const width = canvas.width;
        const height = canvas.height;
        const max = Math.max(...data);
        const min = Math.min(...data);
        const binWidth = (max - min) / bins;

        //Initialize each interval
        const histogram = Array(bins).fill(0);
        data.forEach(value => {
            const bin = Math.min(Math.floor((value - min) / binWidth), bins - 1);
            histogram[bin]++;
        });

        // Draw a rectangle for each interval
        const maxCount = Math.max(...histogram);
        const barWidth = width / bins;
        histogram.forEach((count, index) => {
            const barHeight = (count / maxCount) * height;
            ctx.fillStyle = color;
            ctx.fillRect(index * barWidth, height - barHeight, barWidth - 1, barHeight);
        });
    }

    drawHistogram(data, 50, '#336699');
</script>

Standard deviation and normal distribution

Standard deviation range in normal distribution

In the normal distribution (Normal Distribution), the probability of data falling within different standard deviation ranges is as follows:

• ±0.5σ: approx.38.29%
• ±1σ: approx.68.27%
• ±2σ: approx.95.45%
• ±3σ: approx.99.73%
• ±4σ: approx.99.994%
• ±5σ: approx.99.99994%
• ±6σ: approx.99.9999998%

application

• Risk analysis: A measure of the volatility of a stock or investment.
• Quality control: testing product consistency.
• Test assessment: Analyzing the dispersion of student test scores.

Boisson distribution

Poisson Distribution is a discrete probability distribution that describes the number of occurrences of an event within a fixed time or space range. This allocation is particularly suitable for independent and randomly occurring events, such as the number of customer arrivals per minute, the number of requests to the computer server, etc.

• event independence: In the Boisson allocation, the probabilities of each event occurring are independent of each other.
• Fixed time or space interval: Boisson assignment describes the number of occurrences of an event within a specific time or space range.
• average incidence: The average number of occurrences of Boisson's distribution is parameterizedλIndicates that this parameter represents the average occurrence rate of the event.

The probability mass function (PMF) of the Boisson allocation can be expressed as:

P(X = k) = (λ^k * e^(-λ)) / k!
        

in:

• k: The number of times an event occurs within a given interval (non-negative integer).
• λ: The average occurrence rate of events in this interval (constant greater than 0).
• e: Natural constant, approximately 2.71828.

This function describes the occurrence of events within a fixed time or spacekprobability.

For example, if a coffee shop has an average of 3 customers entering the store every minute, that isλ = 3, then the probability of exactly 5 customers entering the store at a certain minute is:

P(X = 5) = (3^5 * e^(-3)) / 5! ≈ 0.1
        

• service request: The number of requests the server receives per minute, or the number of calls to the customer service center per hour.
• accident rate: The number of traffic accidents on a certain road section during a specific period.
• natural phenomenon: The number of earthquakes within a certain period of time, or the number of cells distributed per square meter.

# Generate Boisson allocation using Python
import numpy as np
import matplotlib.pyplot as plt

# Set the average occurrence rate λ
λ = 3
# Generate data consistent with Boisson distribution
data = np.random.poisson(λ, 1000)

# Draw histogram
plt.hist(data, bins=range(0, 15), density=True, alpha=0.7, color="blue", edgecolor="black")
plt.title("Boisson distribution histogram (λ=3)")
plt.xlabel("Number of event occurrences")
plt.ylabel("probability")
plt.show()

This example shows how to generate Boisson allocation data and plot a histogram to visualize the distribution of event occurrences.

Boisson allocation is a powerful tool for describing the number of occurrences of random events and is suitable for a variety of applications in statistics, engineering, natural sciences, and more.

hypergeometric distribution

definition

Hypergeometric allocation is a discrete probability distribution that describes the distribution of the number of successes when drawing samples from a finite set without replacement. Suppose there is a collection containing two types of objects, where:

• N:Total number of objects
• K: Number of first-class objects
• N - K:Quantity of second type objects

randomly selected fromnobjects, the number of times the first type of object was successfully extractedXSubject to hypergeometric distribution.

probability mass function

The probability mass function of hypergeometric distribution is:

    P(X = k) = [C(K, k) * C(N - K, n - k)] / C(N, n)

in:

• C(a, b) = a! / (b!(a - b)!)Represents the number of combinations.
• kis the number of successes, satisfyingmax(0, n - (N - K)) ≤ k ≤ min(n, K)。

Expected value and variation

The expected value and variation of hypergeometric distribution are:

• expected value: E[X] = n * (K / N)
• Variation number: Var[X] = n * (K / N) * ((N - K) / N) * ((N - n) / (N - 1))

application

Hypergeometric allocation is widely used in the following fields:

• Quality control: Detect the number of defective products in a batch of products.
• sample survey: Analyze the proportion of samples with specific attributes in a limited population.
• card games: Calculate the probability of drawing a specific suit or number from a deck of playing cards.

Variation analysis

Analysis of Variance (ANOVA) is a statistical method used to test whether there are significant differences in the means between multiple sets of data. ANOVA is often used to determine whether the effects of different treatments or groups on results are significant, such as comparing the effects of different drugs on treatment effects.

Single-factor variation analysis is suitable for testing the impact of a single factor on multiple sets of data. Assume that the number of samples in each group isn, the total number of groups isk, then the following statistics can be calculated.

• Total Sum of Squares (SST): Measures the total variation across all data points. The calculation formula is:

SST = ΣΣ(yij - ȳ)2
        

in,yijIndicates the firstiGroup No.jdata points,ȳis the overall average of all data.

• Sum of Squares Between (SSB): Reflects the variation between the average value of each group and the overall average value. The calculation formula is:

SSB = Σni(ȳi - ȳ)2
        

in,ȳifor the firstigroup mean,niis the number of samples in the group.

• Sum of Squares Within (SSW): Reflects the variability of data points within each group. The calculation formula is:

SSW = ΣΣ(yij - ȳi)2
        

in,ȳiis the average of each group.

In ANOVA, each amount of variation has a corresponding degree of freedom:

• Total degrees of freedom (df_total): The total number of data points minus 1, that isN - 1,inNis the total number of data points.
• Degrees of freedom between groups (df_between):The number of groups minus 1, that isk - 1。
• Within-group degrees of freedom (df_within): Total degrees of freedom minus degrees of freedom between groups, that isN - k。

Then calculate the Mean Square (MS):

• Between-group mean square (MSB)：MSB = SSB / dfbetween
• Within-group mean square (MSW)：MSW = SSW / dfwithin

Finally, the F test was used to compare between-group variation and within-group variation to determine whether the difference between groups was significant. The F-value calculation formula is:

F = MSB / MSW
        

The larger the F value, the more significant the difference between groups. By looking up a table or using statistical software to compare the F value and the critical value, you can determine whether to reject the null hypothesis.

For example, we tested the effects of different fertilizers on plant growth height. The sample heights corresponding to the three groups of fertilizers are as follows:

• Fertilizer A: 10, 12, 15, 14
• Fertilizer B: 16, 15, 17, 18
• Fertilizer C: 14, 13, 15, 16

By calculating SST, SSB, SSW, and then calculating the F value to determine whether there is a significant difference in the effects of different fertilizers.

Variation analysis is a commonly used statistical method, especially suitable for comparing the effects of multiple sets of data, and has been widely used in scientific research, engineering and other fields.

numerical analysis

Basic concepts

Numerical analysis is a discipline that uses numerical methods to solve mathematical problems and uses approximate calculations to deal with problems that cannot be solved with analytical methods. Its core is to seek efficient, stable and accurate calculation methods.

Main areas

• Numerical Linear Algebra: Solving Systems of Linear Equations and Eigenvalue Problems
• Interpolation and Approximation: Constructing Approximate Expressions for Functions
• Numerical Differentiation and Integration: Computing Approximations of Derivatives and Integrals
• Solving Differential Equations Numerically: Solving Ordinary and Partial Differential Equations
• Optimization method: find the extreme value or optimal solution of the function

Application scope

• Engineering Computing: Simulating and designing complex structures or systems
• Scientific research: astrophysics, meteorological simulation, biological modeling, etc.
• Financial Engineering: Risk Assessment and Pricing of Financial Derivatives
• Computer Graphics: Image Processing and 3D Modeling

Advantages and Challenges

• Advantages:
• Can solve complex problems that cannot be handled by analytical methods
• Applicable to a variety of science and engineering fields
• challenge:
• Approximate solutions may contain numerical errors
• The efficiency and stability of the algorithm need to be carefully considered

Common methods

• Interpolation methods: Lagrange interpolation, spline interpolation
• Numerical integration: trapezoid method, Simpson method, Gaussian integral
• Solving equations numerically: Newton's method, bisection method, Jacobi iteration
• Numerical solution of differential equations: Euler method, Runge-Kutta method

learning resources

It is recommended to learn the basics of mathematical analysis and linear algebra, and practice using tools such as Python and MATLAB. Recommended reference books include "Numerical Analysis: Theory and Practice" and "Applied Numerical Methods".

finite element method

Basic concepts

Finite Element Method (FEM) is a numerical analysis method that is widely used in engineering and physical sciences to solve stress, heat conduction, fluid mechanics and other problems of complex structures.

Working principle

The finite element method divides a continuum into many small finite elements, establishes an approximate mathematical model within each element, and finally merges these models to solve the entire problem.

Application areas

• Structural mechanics: analysis of stress and deformation of buildings and mechanical components
• Heat conduction: studying the temperature distribution and heat flow of materials
• Fluid mechanics: simulate the motion behavior and pressure distribution of fluids
• Electromagnetics: Calculating the distribution of electric and magnetic fields

Advantages and limitations

• Advantages:
• Suitable for complex geometries and boundary conditions
• Able to handle multiple physics coupling problems
• limit:
• Requires high computing power and memory resources
• Model building and meshing can be time-consuming

software tools

• ANSYS
• ABAQUS
• COMSOL Multiphysics
• SolidWorks Simulation

Study suggestions

It is recommended to start learning from basic mechanics and mathematics, gradually master the theory and practice of the finite element method, and use relevant software to practice operations.

convolution

Convolution is a mathematical operation widely used in signal processing, image processing and deep learning. The main function of convolution is to apply a function called "kernel" or "filter" to process data and extract features.

For one-dimensional discrete convolution operation, its mathematical definition is as follows:

(f * g)(t) = Σ_i=-∞^∞ f(i) ⋅ g(t - i)

in:

• fandgare two functions or sequences.
• *Represents the convolution operator.
• for each locationt，gwas moved to this position andfPerform a weighted sum.

In image processing, convolution is a similar operation, but applied to two-dimensional data (i.e., each pixel of the image).

• image processing: Convolution can be used for blurring, edge detection and sharpening images. For example, the Sobel filter can emphasize edge features of an image.
• Convolutional Neural Network (CNN): In deep learning, the convolutional layer can automatically learn features in the data and extract information such as edges and shapes for classification or detection.
• signal processing: In audio, electronic and biomedical signals, convolution can be used for filtering, denoising or signal enhancement.

1. Select filter:Select a size ofk x kfilter, for example3 x 3。
2. Slide operation: Apply the filter starting from the upper left corner of the image to each position in sequence.
3. weighted sum: The pixel value at the corresponding position is multiplied and summed by the elements in the filter.
4. Result storage: Store the convolution result of each position in a new matrix to form a "feature map".
5. Repeat operation: Repeat the above steps until all areas of the image are convolved.

• edge detection: Use a convolution kernel such as Laplacian or Sobel filter to detect image edges.
• Blur effect: A mean filter or Gaussian filter can blur an image, making details less clear.
• Sharpening effect: Use the sharpening convolution kernel to strengthen the edges of the image and make the image clearer.

Through various applications of convolution, data features can be effectively extracted and applied to a variety of data analysis and processing fields.

fuzzy theory

discrete mathematics

Sets and set operations

logic and propositions

Relationships and functions

Fundamentals of number theory

graph theory

Combinatorics

Bollinger algebra

Automata and Formal Languages

Relational Databases and Discrete Structures

Mathematical induction and recursion

set theory

Basic concepts of collections

Representation method of collection

Subsets and Complete Sets

Set operations

• Union (∪):A ∪ B represents all elements of A and B.
• Intersection (∩):A ∩ B represents elements that belong to both A and B.
• Difference set (−):A − B represents elements that belong to A but not to B.
• complement (A′ or A^c）: Relative to the complete set U, the complement is all elements that do not belong to A.

Cartesian product

Power set

Set Identity Law and Algebraic Properties

Infinite sets and cardinal numbers

Equivalence classes and divisions

Applications of set theory

Bollinger algebra

Basic concepts

Basic operations

• AND (AND, ∧): A ∧ B, the result is 1 only when A and B are both 1.
• or (OR, ∨): A ∨ B, the result is 1 when at least one of A or B is 1.
• NOT (NOT, ¬):¬A, invert the value of A, 1 becomes 0, and 0 becomes 1.

Common logical operators

• Exclusive OR (XOR, ⊕):A ⊕ B, when the values ​​of A and B are different, the result is 1.
• Same or (XNOR):A ⊙ B, when A and B have the same value, the result is 1.
• implies(→): A → B, when A is 1 and B is 0, the result is 0, and the rest is 1.

Basic properties of Bollinger algebra

• Commutative law: A ∨ B = B ∨ A, A ∧ B = B ∧ A
• Associative law: (A ∨ B) ∨ C = A ∨ (B ∨ C)
• Distributive law: A ∧ (B ∨ C) = (A ∧ B) ∨ (A ∧ C)
• Double Negation Law: ¬(¬A) = A
• Absorption law: A ∨ (A ∧ B) = A
• DeMorgan's law: ¬(A ∧ B) = ¬A ∨ ¬B, ¬(A ∨ B) = ¬A ∧ ¬B

truth table

logic gate

• AND gate
• OR gate
• NOT gate
• NAND (not AND) gate
• NOR (non-OR) gate
• XOR (exclusive OR) gate

Boolean functions and simplification

Standard shape

• Main conjunction (POS, Product of Sums)
• Main disjunct (SOP, Sum of Products)

Applications of Bollinger Algebra

• digital logic design
• Conditional judgment in programming
• Data query and filtering
• Control systems and automation equipment

graph theory

Basic concepts

Type of graph

• undirected graph: The sides have no direction, (u, v) and (v, u) are considered the same.
• directed graph: The edges have directions, (u, v) means pointing from u to v.
• weighted graph: Edges carry numerical weights, representing distance, cost, etc.
• simple diagram: A graph that does not contain multiple edges and self-loops.
• complete graph: There are edges connecting any two vertices.

basic terminology

• degree: The number of edges connected to a vertex. Undirected graphs are called degrees, while directed graphs are divided into in-degree and out-degree.
• path: The sequence of edges and vertices passed from one vertex to another.
• simple path: Path that does not repeat vertices.
• loop: A path whose starting point and end point are the same.

connectivity

• connected graph: There is a path between any two vertices in an undirected graph.
• Strongly connected graph: There is a bidirectional path between any two vertices in a directed graph.
• connected components: A maximal connected subgraph in an undirected graph.

Trees and Spanning Trees

• Tree: An undirected graph that is connected and has no loops.
• spanning tree: A subgraph in the graph, which contains all vertices and is a tree.
• minimum spanning tree: The spanning tree with the smallest total weight of edges in the weighted graph.

Graph representation

• adjacency matrix: Use a matrix to represent the connection relationship between vertices.
• adjacency list: Each vertex corresponds to a list of adjacent vertices.

Graph traversal

• Depth First Search (DFS): Take the deep path first, then backtrack.
• Breadth First Search (BFS): Expand the search layer by layer.

Classic graph theory algorithm

• Dijkstra's algorithm: Find the shortest path (weighted graph, non-negative edges).
• Floyd-Warshall algorithm: Calculate the shortest path between any two points.
• Kruskal algorithm: Find the minimum spanning tree.
• Prim's algorithm: It is also an algorithm for finding the minimum spanning tree.
• topological sort: Sort vertices for a directed acyclic graph (DAG).

Graph coloring and coloring issues

Graph theory applications

• social network analysis
• Traffic and route planning
• computer network structure
• Resource allocation and scheduling
• Circuit design and dependency graph analysis

Combinatorics

Basic concepts

arrangement

combination

Repeated arrangements and repeated combinations

• repeat arrangement: Elements can be selected repeatedly at each position, the total number isnʳ
• Repeat combination: Select r repeatable combinations from n elements, the total number isC(n + r − 1, r)

Inclusion-exclusion principle

binomial theorem

recursive relationship

Application skills of permutation and combination

• Interpolation method: Commonly used to restrict certain elements from being adjacent.
• Discuss on a case-by-case basis: Count different conditions separately and then add them together.
• Correspondence method:Convert the problem into a known combinatorial structure.

generating function

Number of divisions

Applications of Combinatorics

• Cryptography and Security Design
• Algorithm analysis and time complexity estimation
• Graph theory and network structure counting
• Probability Theory and Statistics
• Scheduling and resource allocation issues

T:0000

資訊與搜尋 | 回nature首頁 | 回math首頁
email: Yan Sa [email protected] Line: 阿央
電話: 02-27566655 ,03-5924828

阿央
泱泱科技
捷昱科技泱泱企業