How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Fundamental Trigonometric Identities
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sine, Cosine, and the Definition of Pi
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The sine--cosine addition formulas and the quotient-function definitions supply the basic algebra on this page. The development keeps every tangent, cotangent, secant, and cosecant denominator visible, and uses the real polynomial and finite-counting prerequisites for the Chebyshev and binomial arguments.
The page derives subtraction, double- and triple-angle, signed half-angle, product-to-sum, and rational half-angle identities before connecting the unit circle with amplitude--phase form. It then develops real polynomial roots and Chebyshev recurrences, multiple-angle identities, and the minimax normalization of .
3 · Logical flowchart
4 · Definitions, theorems and proofs
Pythagorean and parity identities for all six trigonometric functions on their natural domains
Statement
For every real , , , and . Wherever the displayed quotients are defined, , , , , , and . The conventions and prerequisite facts used below are recorded in Parity and the Pythagorean identity for sine and cosine, Tangent, cotangent, secant, and cosecant on their exact natural domains.
Facts & Assumptions
Given: A real and the quotient definitions on their stated nonzero-denominator domains.
Proof
The sine--cosine Pythagorean and parity identities give the first three equalities.
On the domain of tangent, divide by ; on the domain of cotangent divide it by .
Applying the quotient definitions to the parity equalities gives the four quotient parity laws without introducing a zero denominator.
Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
Statement
For every real , and the quarter-turn and reflection formulas are On the common natural domains of the two sides, and The conventions and prerequisite facts used below are recorded in Pythagorean and parity identities for all six trigonometric functions on their natural domains, Quarter-turn values and shifts by pi/2 and pi, The addition formulas for sine and cosine, The zero sets of sine and cosine and the least positive common period 2 pi, Tangent, cotangent, secant, and cosecant on their exact natural domains.
Facts & Assumptions
Given: A real .
Quarter-turn values and shifts by pi/2 and pi states that, for every real , and .
The addition formulas for sine and cosine states that, for all real , and .
Tangent, cotangent, secant, and cosecant on their exact natural domains defines , , , and on their natural domains.
Proof
By [L1] with replaced by , and then [L3], and ; [L1] also gives the displayed quarter-turn formulas.
Apply [L2] to and use the values at supplied by [L1] (put ) together with [L3]. This gives and .
Substitute the cofunction and supplementary sine--cosine equalities into [L4]. The stated nonvanishing conditions are exactly those that make both quotient or reciprocal expressions defined, so this yields all eight displayed identities.
The subtraction formulas for sine and cosine
Statement
For all real , The conventions and prerequisite facts used below are recorded in The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine.
Facts & Assumptions
Given: Reals .
Proof
Apply the addition formulas to .
Replace and by their parity values and simplify.
Addition and subtraction formulas for tangent, cotangent, secant, and cosecant on their exact domains
Statement
If , then if , then If , then if , then The conventions and prerequisite facts used below are recorded in Tangent, cotangent, secant, and cosecant on their exact natural domains, The addition formulas for sine and cosine, The subtraction formulas for sine and cosine.
Facts & Assumptions
Given: Reals satisfying the relevant displayed nonvanishing hypothesis.
Tangent, cotangent, secant, and cosecant on their exact natural domains defines , , , and on their natural domains.
The addition formulas for sine and cosine gives the sine and cosine formulas for .
The subtraction formulas for sine and cosine gives and .
Proof
Under the cosine nonvanishing hypothesis, divide the two formulas in [L2] by . Their quotient gives the tangent addition formula, and their cosine formula gives . Taking reciprocals by [L1] gives the secant addition formula.
Under the sine nonvanishing hypothesis, divide the formulas in [L2] by . Their quotient gives the cotangent addition formula, and their sine formula gives . Taking reciprocals by [L1] gives the cosecant addition formula.
The two formulas in [L3], divided by the same nonzero products as in steps 1.1 and 1.2, give respectively the tangent--secant and cotangent--cosecant subtraction formulas. Every denominator used is nonzero by the hypothesis displayed next to that formula.
Double-angle and quadratic power-reduction identities
Statement
For every real , and When defined, . The conventions and prerequisite facts used below are recorded in The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, Tangent, cotangent, secant, and cosecant on their exact natural domains.
Facts & Assumptions
Given: A real .
Proof
Put in the addition formulas.
Use to rewrite the cosine identity and solve both resulting equalities for the squares.
Divide the double-angle sine identity by the double-angle cosine identity only when both quotient expressions are defined.
Triple-angle identities for sine, cosine, and tangent
Statement
For every real , If and are defined and , then . The conventions and prerequisite facts used below are recorded in Double-angle and quadratic power-reduction identities, The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, Tangent, cotangent, secant, and cosecant on their exact natural domains.
Facts & Assumptions
Given: A real satisfying the displayed tangent hypotheses where required.
Proof
Expand and by addition, then substitute the double-angle identities.
Use and to collect the stated cubic forms.
Divide the two cubic identities under the stated nonzero conditions and cancel the common cosine power.
Half-angle identities with the sign determined by the quadrant
Statement
For every real , where are respectively the signs of and (so ). Thus the positive square root is valid only where the relevant half-angle function is nonnegative. The conventions and prerequisite facts used below are recorded in Double-angle and quadratic power-reduction identities, Square roots exist: a unique with ; the positives are , Signs, monotonicity intervals, and ranges of sine and cosine, Tangent, cotangent, secant, and cosecant on their exact natural domains.
Facts & Assumptions
Given: A real .
Double-angle and quadratic power-reduction identities gives and for every real .
Square roots exist: a unique with ; the positives are says that every nonnegative real has a unique nonnegative square root.
Proof
Apply [L1] with . Then and , so both radicands are nonnegative.
By [L2], and .
Multiplying each equality of step 2.1 by its sign, with sign when the corresponding value is , yields the displayed identities. The sign ranges are therefore exactly .
Product-to-sum and sum-to-product identities
Statement
For all real , and, with , , the reverse sum-to-product identities follow by solving these formulas for the sums. The conventions and prerequisite facts used below are recorded in The addition formulas for sine and cosine, The subtraction formulas for sine and cosine.
Facts & Assumptions
Given: Reals .
Proof
Add and subtract the addition and subtraction formulas for cosine.
Add the addition and subtraction formulas for sine.
Substitute , to obtain every reverse identity.
The tangent half-angle identities and rational parametrization of the unit circle away from
Statement
If is defined, then Conversely every point on with has the unique parameter and equals . The conventions and prerequisite facts used below are recorded in Double-angle and quadratic power-reduction identities, Tangent, cotangent, secant, and cosecant on their exact natural domains, Parity and the Pythagorean identity for sine and cosine.
Facts & Assumptions
Given: The indicated real parameter or unit-circle point.
Proof
Divide the double-angle identities by to obtain the rational formulas; .
For a point with , put and use to simplify both rational expressions to and .
The same formula proves uniqueness.
is a bijection from onto the real unit circle
Statement
The map is a bijection from onto . The conventions and prerequisite facts used below are recorded in Parity and the Pythagorean identity for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine, The zero sets of sine and cosine and the least positive common period 2 pi, Pi as twice the smallest positive zero of cosine.
Facts & Assumptions
Given: A point on or parameters .
Proof
The Pythagorean identity puts every image point on .
The range and sign theorem supplies an angle in the stated half-open interval with prescribed cosine and the compatible sine, proving surjectivity.
If two parameters have the same pair, the sine--cosine period theorem says their difference is a multiple of ; the half-open interval forces that multiple to be zero.
Every has the amplitude-phase form
Statement
For reals not both zero, put . There is a unique with and , and for every real . For the left side is identically zero. The conventions and prerequisite facts used below are recorded in is a bijection from onto the real unit circle, Square roots exist: a unique with ; the positives are , The addition formulas for sine and cosine.
Facts & Assumptions
Given: Reals .
Proof
If , the claimed zero identity is immediate.
Otherwise and , so the unit-circle parametrization gives the stated unique .
Expand and substitute the two defining coordinates of .
Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials
Definition
A formal real polynomial is either the zero polynomial , or a finite coefficient list with ; we write the latter as . The list, rather than the function it induces, is the polynomial object. Its evaluation at is the real number .
For nonzero , define and . The zero polynomial has no degree and no leading coefficient. A nonzero polynomial is monic when . Thus degree and leading coefficient are defined from the displayed finite list, without asserting that distinct formal polynomials define distinct functions. The conventions for finite sums and integer powers used in the evaluation are recorded in Finite sums and finite products, by recursion, Integer powers .
A real polynomial vanishing at is divisible by
Statement
If and , then there is a real polynomial with for every real . The conventions and prerequisite facts used below are recorded in Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials, Factorisation of , and the resulting Lipschitz estimate, Laws of finite sums and finite products.
Facts & Assumptions
Given: A polynomial and a real root .
Proof
For each , the power-difference factorization gives .
Since , write .
Substitute the factorization from step 1.1 and collect the finite coefficient sums into a polynomial .
A nonzero real polynomial of degree has no more than distinct real roots
Statement
A nonzero real polynomial of degree has at most distinct real roots. The conventions and prerequisite facts used below are recorded in Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials, A real polynomial vanishing at is divisible by , The principle of mathematical induction.
Facts & Assumptions
Given: A nonzero real polynomial of degree .
Proof
At degree the polynomial is a nonzero constant and has no root.
Assume the claim at degree .
If a degree- polynomial has a root , the factor lemma writes it as with of degree ; every other root is a root of .
The induction hypothesis gives at most other roots, hence at most roots in all.
Chebyshev polynomials of the first and second kinds by their three-term recurrences
Definition
Let be the set of formal real polynomials of Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials. Associate to every an eventually zero coefficient sequence : use its displayed finite coefficient list and extend it by zeros when , and put for every when . Do the same for , with coefficients . Define coefficientwise and define by the convolution coefficients
using the real finite sum of Finite sums and finite products, by recursion. In either construction, discard trailing zero coefficients; if every coefficient is zero, the result is the zero polynomial. Scalar multiplication and subtraction are the corresponding coefficientwise operations. Thus these formulas define operations on the formal coefficient-list objects, independently of evaluation.
Write and , and define
Apply The recursion theorem to the set , first with initial value and then with initial value , always using the function . This gives unique pair sequences . Define and to be the first coordinates of and , respectively. Since the first coordinate of is , the second coordinate of is and the second coordinate of is . Consequently
for every . These unique sequences are the Chebyshev polynomials of the first and second kinds.
Degrees and leading coefficients of the Chebyshev polynomials
Statement
For , has degree and leading coefficient , while has degree and leading coefficient . The conventions and prerequisite facts used below are recorded in Chebyshev polynomials of the first and second kinds by their three-term recurrences, The principle of mathematical induction, Integer powers .
Facts & Assumptions
Given: A natural .
Chebyshev polynomials of the first and second kinds by their three-term recurrences defines , , and , , .
Proof
The initial values in [L1] give the asserted degrees and leading coefficients at (and the recurrence needs the consecutive base indices ).
Assume the degree and leading-coefficient assertions at consecutive indices.
In each recurrence of [L1], times the degree- term has degree , whereas the subtracted predecessor has degree . Thus no leading-term cancellation is possible, and the next leading coefficients are for and for .
This proves the stated degree and leading-coefficient formulas at every index.
and for every
Statement
For every and real , In particular, for and , . The conventions and prerequisite facts used below are recorded in Chebyshev polynomials of the first and second kinds by their three-term recurrences, The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, The principle of mathematical induction.
Facts & Assumptions
Given: A natural and a real .
Proof
The two identities follow directly from the initial polynomial values at and .
Assume the identities at and .
The recurrences and the addition formulas give the usual second-order recurrences for and .
Hence the identities hold at , so induction proves them for every natural ; substituting gives the stated alternating values.
Finite binomial formulas for and
Statement
For every and real , The conventions and prerequisite facts used below are recorded in The addition formulas for sine and cosine, Pascal's rule , and the hockey-stick identity , The set of -element subsets and the binomial coefficient , Finite sums and finite products, by recursion, Integer powers , The principle of mathematical induction.
Facts & Assumptions
Given: A natural and real .
The addition formulas for sine and cosine gives the formulas for and for all real .
Pascal's rule , and the hockey-stick identity gives for all natural .
Proof
At the two displayed finite sums give and .
Assume the two formulas at .
Apply [L1] to and insert the two induction sums. Collecting the coefficient of each monomial leaves the sum of the two adjacent binomial coefficients.
By [L2], those adjacent sums are exactly ; even contribute to cosine with sign and odd contribute to sine with sign . This proves both formulas at without using complex numbers.
For , is the minimax monic polynomial of degree on
Statement
For , the polynomial is monic of degree and for every monic real polynomial of degree , Equality is attained by . The conventions and prerequisite facts used below are recorded in Chebyshev polynomials of the first and second kinds by their three-term recurrences, Degrees and leading coefficients of the Chebyshev polynomials, and for every , Signs, monotonicity intervals, and ranges of sine and cosine, A nonzero real polynomial of degree has no more than distinct real roots, Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials, Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value, Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, and Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and .
Facts & Assumptions
Given: A natural and a monic polynomial of degree .
Degrees and leading coefficients of the Chebyshev polynomials says that has degree and leading coefficient .
and for every gives and for .
Signs, monotonicity intervals, and ranges of sine and cosine says that cosine has range and is strictly decreasing on .
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and gives a zero between opposite signs of a continuous real-valued function.
A nonzero real polynomial of degree has no more than distinct real roots bounds the number of distinct real roots by the degree.
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value makes the maximum of on the nonempty compact interval exist once is continuous.
Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function states that every real polynomial function is continuous.
Proof
By [L1], is monic of degree . Put for . By [L3], , and [L2] gives .
For each , [L3] supplies with ; [L2] then gives . Equality holds at every , so .
By [L7], and hence are continuous, so [L6] makes the displayed maximum well-defined. Suppose, for contradiction, that it is . Then has degree at most . At the successive points , the values of have the opposite alternating signs to , hence are nonzero and alternate.
By [L7], is continuous, so [L4] gives a root of in each disjoint interval . Thus has at least distinct roots, contradicting [L5] because step 2.2 makes nonzero of degree at most . The contradiction proves the lower bound, while step 2.1 proves equality for .
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.