-
Notifications
You must be signed in to change notification settings - Fork 308
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat: the Chebyshev polynomials C and S #13195
base: master
Are you sure you want to change the base?
Conversation
This PR/issue depends on: |
@[simp] | ||
theorem C_one : C R 1 = X := rfl | ||
|
||
theorem C_neg_one : C R (-1) = X := (by ring : X * 2 - X = X) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Not a big fan of that proof - does something like this work?
theorem C_neg_one : C R (-1) = X := (by ring : X * 2 - X = X) | |
theorem C_neg_one : C R (-1) = X := by | |
unfold C | |
ring |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It doesn't. Why don't you like the proof?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
How about show X * 2 - X = x by ring
?
PR summary 97e7841748Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
It looks like you have a merge conflict (which is why this PR does not appear in the review queue any more). |
We define the rescaled Chebyshev polynomials$C_n$ and $S_n$ (also known as the Vieta–Lucas and Vieta–Fibonacci polynomials, respectively). They are related to the Chebyshev polynomials $T_n$ and $U_n$ by the formulas $C_n(2x) = 2T_n(x)$ and $S_n(2x) = U_n(x)$ . Most theorems about $T_n$ and $U_n$ have analogues involving $C_n$ and $S_n$ .
We prove that$C_n$ and $S_n$ are special cases of the Dickson polynomials (though unlike general Dickson polynomials, they are defined for every integer $n$ , not just natural numbers).
These polynomials are necessary to state a formula for$(r_1 r_2)^m v$ , where $v \in V$ is an element of a module, $r_1, r_2 \in GL(V)$ are reflections, and $m$ is an integer. The formula will be used to define and construct reflection representations of a Coxeter group over an arbitrary commutative ring, not necessarily having an invertible 2. See #13291.