Trig Identity Verifier
Enter the two sides of a candidate identity as expressions in x. The verifier evaluates both at a battery of test points scattered across (0, 2π); if they agree everywhere to within tolerance the identity is reported as verified, otherwise a counterexample is shown.
Frequently asked questions
Is a verified identity really a proof?
No — agreement at many test points is strong empirical evidence but not a formal proof. A purely symbolic identity proof requires manipulating both sides through known identities; that is a separate, much harder task.
Why use sampling instead of symbolic manipulation?
Trig identity simplification is genuinely hard and not unique; numeric sampling catches almost every real-world identity mistake quickly and reliably, and it provides a concrete counterexample when the candidate fails.
What sample points are used?
About a dozen values spread across (0, 2π), avoiding obvious singularities. The tolerance is relative so the test scales with the magnitude of the expressions.