<< Chapter < Page | Chapter >> Page > |
Example 2.4 Consider . As shown in example [link] , has a singularity at the origin.
First Blow-up
In this equation, x 2 is the exceptional divisor while is what is called the proper transform . Note that the proper transform is tangent to the exceptional divisor.
Second Blow-up
In this equation, t 2 and s 3 are exceptional divisors while is the proper transform. Note that the proper transform intersects two exceptional divisors at one point.
Third Blow-up
In this equation, r 2 and s 6 are exceptional divisors while is the proper transform. Note that the proper transform is now resolved.
Definition 2.5 The multiplicity of the exceptional divisor is the highest degree of the factored variables of the equation provided after a blow-up substitution. We denote the multiplicity of the exceptional divisor as C i .
Example 2.6 Using the blow-up sequence in Example [link] , we can see that , , and .
Definition 2.7 When blowing-up, we track the result of the series of substitutions leading up to and including that blow-up on the original differential form (in our examples ). Note that the change of variables formula will always contribute an additional power to the higher degree variable of the differential form. The multiplicity of the canonical divisor is the highest degree of the factored variables of the differential form. We denote the multiplicity of the canonical divisor as K i .
Example 2.8 Using the blow-up sequence in Example [link] , we start with . After the first blow-up, the change of variables gives us the differential form . After the second blow-up, the differential form is . After the third blow-up, the differential form is . We can see that , , and .
Definition 2.9 Given a normal crossings blow-up sequence with multiplicities of the canonical divisor and the exceptional divisor known, we calculate . The log canonical threshold of the function is the infimum of the set of α i for all i . We denote the log canonical threshold of a function f at a singularity p as .
Example 2.10 Using the blow-up sequence in Example [link] , we can see that , , and . Thus, .
The proof of the Theorem [link] relies heavily on continued fractions. In this section we recall some basic facts about continued fractions and prove some Lemmas about them relevant to the theorem. Consider the rational number . First, using the Euclidean algorithm, we write:
The continued fraction of is
This can be abbreviated with the standard notation for continued fractions: . Since is a rational number, we know that the continued fraction expression will eventually terminate, meaning that there exists a smallest positive integer δ such that .
We call the convergent of . Note that the convergent equals . We will then rearrange the variables of the continued fraction convergents so that they are in the form of a simple fraction. For example, we will rearrange the second convergent of to be ; the third convergent will become ; etc. Once the convergent is in this final form, we will denote the numerator of this expression h v and the denominator of this expression k v . Denote by A v . Notice that , since the convergent is the entire continued fraction.
Notification Switch
Would you like to follow the 'The art of the pfug' conversation and receive update notifications?