# Category:Theorems in approximation theory

Computing portal |

Here is a list of articles in the category **Theorems in approximation theory** of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Theorems in approximation theory"

The following 16 pages are in this category, out of 16 total.

### A

- Arakelyan's theorem
*(computing)*

### B

- Bernstein's theorem (approximation theory)
*(computing)*

### C

- Carleman's condition
*(computing)*

### E

- Erdős–Turán inequality
*(computing)*

### F

- Favard's theorem
*(computing)* - Fejér's theorem
*(computing)*

### H

- Hartogs–Rosenthal theorem
*(computing)*

### J

- Jackson's inequality
*(computing)*

### K

- Kolmogorov–Arnold representation theorem
*(computing)* - Krein's condition
*(computing)*

### L

- Lethargy theorem
*(computing)*

### M

- Mergelyan's theorem
*(computing)* - Müntz–Szász theorem
*(computing)*

### S

- Stone–Weierstrass theorem
*(computing)*

### W

- Walsh–Lebesgue theorem
*(computing)* - Wirtinger's representation and projection theorem
*(computing)*