Parametric equation 2026-10-13
A parametric equation expresses coordinates as functions of one or more independent parameters. For example, , describes a circle; multiple parameters describe surfaces. A smooth curve is a differentiable single-parameter realization. A reparametrization changes the parameter without changing the geometric image.
Complete the square in the real-valued complex plane equation:
Dividing by gives center and radius
If the radicand is zero, the locus is the single point , a degenerate circle. If it is negative, the locus is empty. The absolute value of is essential even when .
For the requested sketch, the five centers and radii are respectively , , , and , all centers on the real axis.
Figure 1.
Five complex-plane circle loci, including the radius-zero point at alpha equals one
. Details.
The original PDF's map is ; the converted TeX drops the conjugate on its denominator. Write , so . This is the reflection symmetry of a complex circle equation. It fixes and satisfies
Thus it maps every point of the circle into the same circle. Conversely, for any point on that circle, also lies on it and . This proves , including the surjectivity required by the question.
For any three nonempty circles, fix . The triangle inequality gives, for every ,
Taking the maximum over proves the requested inequality.
For centers and radii , the maximum separation of two circles is bounded above by . If the centers differ, choose and , where , to attain the bound. If the centers coincide, any unit gives opposite points attaining . Therefore
The function is not a metric on positive-radius circles, since , even though it satisfies this triangle-type inequality.
Work in the based CW homotopy category. A homotopy-invariant functor depends on a map only through its based homotopy class. In a sequence of pointed sets, exactness at the middle means that the preceding image equals the inverse image of the distinguished point; it does not imply injectivity or surjectivity at the ends. For groups this is the familiar image-equals-kernel condition. A half-exact functor preserves such middle exactness on the appropriate elementary sequence.
For a contravariant functor , the relevant elementary sequence is a cofibration . Half-exactness is
exact at . One should not silently turn this into a short exact sequence. In particular, arbitrary group actions and pointed sets at low degrees are not interchangeable with abelian groups.
The basic contravariant example is , often called a cohomotopy-type functor. Suppose a map becomes null-homotopic on . A chosen null-homotopy extends it over the cone attached to , giving a map from the topological mapping cone to . Conversely every such extension restricts to a null-homotopic map on . Since the topological mapping cone of a subcomplex inclusion models , this proves half-exactness, rather than merely asserting it.
Repeating the topological mapping cone construction gives the Puppe sequence
Contravariant mapping into gives
This is exact as pointed sets. An H-group structure on , for example a loop space with path concatenation, provides group structures; repeated looping gives abelian group structures in the usual ranges. The suspension-loop adjunction explains the shifted terms and their compatibility.
The covariant counterpart is , with ordinary homotopy groups obtained from . Its natural elementary sequence is a homotopy fiber sequence , not an arbitrary cofibration. A map whose composite to is null-homotopic, together with that null-homotopy, determines a map into the homotopy fibre. Conversely a fibre map projects to such a null composite. This proves exactness of at the middle. Adding the loop terms produces the homotopy long exact sequence. For a Serre fibration, its ordinary fibre supplies the same homotopy information.
This variance distinction matters. Include one circle, generated by , in , with other generator . The quotient is the second circle. The kernel of is the normal closure of , which contains . The image of the included circle is only the cyclic subgroup generated by , and does not contain that reduced word. Thus covariant is not half-exact on this cofibration. Fibre and cofibre statements cannot be swapped just by reversing notation.
Reduced cohomology gives group-valued contravariant examples. For an abelian coefficient group , the degree- functor is represented by an Eilenberg–MacLane space:
Its cofibration exact sequence continues as . Ordinary homotopy groups are instead covariant, with decreasing group degree across a fibre connecting map. These are the two complementary representable patterns, maps out of a test object and maps into a representing object.
Brown's representability theorem makes the contravariant pattern structural. A reduced contravariant homotopy functor on based CW complexes is represented by a CW complex if it converts arbitrary wedges to products and satisfies the Mayer-Vietoris weak-pullback gluing axiom. The latter says that compatible classes on two subcomplexes extend to their union. It contains more information than the single kernel statement of half-exactness. Consequently half-exactness alone is not a representability criterion. In a representing functor these axioms are natural: a map on a wedge is a family of based maps, while compatible maps on an intersection can be adjusted by a homotopy and glued across a homotopy pushout.
A reduced generalized cohomology theory with the usual wedge axiom supplies these axioms degree by degree. Its representing spaces have by suspension compatibility, assembling an Omega-spectrum. Thus generalized cohomology can be expressed as , while represented homology is . The appearance of mapping into a spectrum in one case and smashing with it in the other is another form of the same variance distinction.
There is a literal duality after stabilization and a finiteness restriction. Here a finite based CW complex is identified with its suspension spectrum. For a finite spectrum , let be its Spanier-Whitehead dual. Then and for finite spectra. Duality reverses a cofibre triangle into a fibre triangle. In particular,
This turns a cohomology calculation on a finite object into a homology calculation on its dual, and vice versa. It is Spanier-Whitehead duality, not a claim that the full category of ordinary spaces is self-dual.
Half-exactness is the local image–kernel property; fibres and cofibres, representability, and finite stable duality explain how that property organizes homotopy and cohomology. The distinctions between variance, pointed sets and groups, and finite stable objects and arbitrary spaces are essential to using the duality correctly.
True. In a connected sum of knots, a bracket smoothing state from each summand contributes a state of the joined diagram. Joining the two distinguished state circles reduces their total count by one, so the factors multiply. The smoothing weights also multiply and the writhe of a link diagram adds. Thus the Jones polynomial of a connected sum is
False as written for arbitrary links. The two-component unlink has a diagram with no crossings but
The correct connected-diagram statement does hold, in particular for every knot diagram. If count the all- and all- bracket smoothing state circles, changing smoothings increases the circle count by at most . The maximum and minimum exponents therefore lie between and . This gives the Kauffman bracket breadth bound . For a connected projection, the Turaev surface has Euler characteristic , so the bound is . Writhe of a link diagram normalization changes only a monomial, and divides the breadth by four, giving .
For a diagram with projection components, sum the same Euler characteristic inequality over the components. Then and the Jones polynomial breadth bound for a disconnected diagram is . The extra is indispensable, as the unlink shows.
Put . The reduced Kauffman bracket is the Laurent polynomial determined by , , and the crossing expansion . Fix the A smoothing so that a positive curl has multiplier ; rotating the local crossing interchanges the smoothing descriptions. Equivalently, its bracket smoothing states give
where and count its A and B smoothings and is the number of state circles. Resolving all crossings proves that the recursive rules define the same polynomial independently of the order of expansion.
Under a positive Reidemeister move of type I, the two resolutions give times the straight strand; the negative curl gives . Thus the bracket itself is not an unframed link invariant. For type II, use the adjacent cap-cup generator of the Temperley-Lieb algebra, with . The crossing and its inverse are and , and
For type III, and the analogous reversed relation give
Hence the bracket is invariant under types II and III.
For an oriented diagram, let be its writhe of a link diagram, the sum of its signed crossings. Types II and III preserve writhe of a link diagram, while a positive or negative curl changes it by one or minus one. The Jones polynomial is therefore
The normalization cancels type I, so all Reidemeister moves preserve it. It is a Laurent polynomial in ; its breadth means the largest occurring t exponent minus the smallest, including half-integral exponents for links.
The Jones polynomial skein relation follows directly from the same normalization. Write for the bracket of the oriented smoothing and for the other smoothing. The local expansions are and , while . Consequently
Substituting gives
The other smoothing has cancelled, so the identity applies with exactly the oriented local convention in the PDF.
To form the connected sum of knots , remove a short unknotted arc from each oriented knot in two disjoint balls and join the remaining endpoints by a pair of parallel arcs respecting the orientations. Equivalently, a sphere meeting a knot in two points cuts it into two one-string tangles; close each by an arc in the sphere to recover its summands. Sliding the small joining balls along the knots shows that the isotopy type does not depend on these choices. The unknot is the identity for this operation. A prime knot is a nontrivial knot such that every expression has an unknot summand.
The Seifert algorithm supplies a Seifert surface for every oriented knot: smooth the crossings in their oriented directions, span the resulting Seifert circles by disks at different heights, and restore each crossing with a half-twisted band. If needed, join components by tubes away from the boundary. Thus the set of surface genera is a nonempty subset of the nonnegative integers and has a minimum, so exists.
We first prove additivity of Seifert genus, which also supplies a terminating measure for decomposition. Joining minimal Seifert surfaces along their boundary arcs gives . For the reverse inequality, let be a minimal-genus Seifert surface for the sum and a splitting sphere of a knot. Arrange transverse intersection so that consists of one arc joining the two boundary-intersection points and some circles, with the number of circles minimal among genus-minimizing surfaces.
Each circle separates the sphere into two disks; since it is disjoint from the intersection arc, one disk contains neither marked endpoint. Choose an innermost such circle and its disk , whose interior misses . If its boundary were essential in , compressing along would lower the genus of its component with boundary K: for a nonseparating curve genus drops by one, and for a separating essential curve the removed boundaryless side has positive genus. This contradicts minimal genus. Its boundary therefore bounds a disk in . Replace that disk by a small push-off of , removing the intersection circle without changing genus or boundary, again contradicting minimal intersection. Thus no circles remain.
Cutting along its single intersection arc gives two connected surfaces with boundaries the two summand knots after the closing arcs are added. Euler characteristic shows that their genera add to . Each genus is at least the minimum genus of its summand, so
Genus zero means that the knot bounds a disk and is the unknot. Every nontrivial knot therefore has positive genus. Induct on this nonnegative integer: a nontrivial nonprime knot splits into two nontrivial summands, each with strictly smaller genus by the equality above, and induction decomposes both into primes. This proves every knot is a finite connected sum of prime knots, with the unknot the empty sum.
The same induction does not follow from the three suggested replacements. For crossing number of a knot, joining minimal diagrams gives only subadditivity; a reverse inequality giving strict descent for every nontrivial summand is not provided by this argument. The Jones polynomial of a connected sum does make its breadth of a Laurent polynomial additive, but the needed implication that zero breadth forces the unknot is the Jones unknot detection problem. For the Alexander polynomial, even this implication is false: nontrivial untwisted Whitehead doubles have Alexander polynomial one and hence breadth zero. The decisive genus property is both additivity and the exact characterization if and only if is the unknot.
For uniqueness use complete decomposing sphere systems for a knot. Cut each system and cap the marked boundary spheres with straight arcs; the resulting oriented factors are prime knots. Compare two systems in transverse position, and use the prime-ball exchange lemma to simplify their intersection. Choose an innermost intersection circle bounding a disk in a sphere of one system and lying in a prime-factor ball of the other. If the disk misses the knotted arc it cuts off an empty ball. If it meets the arc once it cuts the prime factor into two knots, so one is an unknot. Replace the old ball by the side carrying the same prime factor, perturb its boundary slightly, and remove that intersection circle. This preserves the unordered factors: the discarded empty or trivial ball merely changes the joining arc, and any intervening capped boundaries still carry their original factors. If the chosen disk contains both marked points, take another innermost disk without marked points, or the complementary disk when the intersection circle is the only one.
Iteration yields an innermost prime-factor ball disjoint from both systems. Its arc has no nontrivial further decomposition, so it represents one factor in each. The boundary can be included in both systems using the same ball exchange; replace its arc by a straight boundary arc and remove this common factor. Induction on the number of factors matches the remaining factors. When the systems already have no intersections, start directly with an innermost ball and the same removal step. All replacements preserve the arc orientation, so the match is of oriented knots, not only unoriented types. Hence the prime decomposition of knots is unique up to reordering and oriented link isotopy.