Math 2.0

definition

Wronskian

Definition

Let II be an interval and let f1,…,fn:I→Rf_1, \dots, f_n : I \to \mathbb{R} be n−1n - 1 times differentiable functions. The Wronskian of f1,…,fnf_1, \dots, f_n is the function W(f1,…,fn):I→RW(f_1, \dots, f_n) : I \to \mathbb{R} given by W(f1,…,fn)(x)=det⁡(f1(x)f2(x)⋯fn(x)f1′(x)f2′(x)⋯fn′(x)⋮⋮⋱⋮f1(n−1)(x)f2(n−1)(x)⋯fn(n−1)(x)).W(f_1, \dots, f_n)(x) = \det \begin{pmatrix} f_1(x) & f_2(x) & \cdots & f_n(x) \\ f_1'(x) & f_2'(x) & \cdots & f_n'(x) \\ \vdots & \vdots & \ddots & \vdots \\ f_1^{(n-1)}(x) & f_2^{(n-1)}(x) & \cdots & f_n^{(n-1)}(x) \end{pmatrix}.

Remarks

For two functions, W(f,g)=fg′−f′gW(f, g) = f g' - f' g. Example: W(cos⁡,sin⁡)=cos⁡2+sin⁡2=1W(\cos, \sin) = \cos^2 + \sin^2 = 1. The Wronskian test uses WW to decide whether solutions of a linear equation are linearly independent.

Explanations

L1 human

The rows of the matrix are the functions, then their first derivatives, and so on. The determinant measures whether the vectors of starting data of the functions are independent at the point xx.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Wronskian, Definition