Compositio Mathematica c Kluwer Academic Publishers Printed in the Netherlands

Description

Compositio Mathematica 112: 183–216, 1998. 183 c 1998 Kluwer Academic Publishers. Printed in the Netherlands. The Picard group of the moduli of G-bundles on a curve ARNAUD BEAUVILLE1,? YVES LASZLO1? and CHRISTOPH SORGER2 ?? 1DMI – Ecole Normale Superieure, (URA 762 du CNRS), 45 rue d'Ulm, F-75230 Paris Cedex 05, France; e-mail: , 2Institut de Mathematiques de Jussieu, (UMR 9994 du CNRS), Univ. Paris 7 – Case Postale 7012, 2 place Jussieu, F-75251 Paris Cedex 05, France; e-mail: Received 30 January 1997; accepted in revised form 14 April 1997 Abstract. Let G be a complex semi-simple group, and X a compact Riemann surface. The moduli space of principal G-bundles on X , and in particular the holomorphic line bundles on this space and their global sections, play an important role in the recent applications of Conformal Field Theory to algebraic geometry. In this paper we determine the Picard group of this moduli space when G is of classical or G2 type (we consider both the coarse moduli space and the moduli stack). Mathematics Subject Classifications (1991): Primary: 14H60; Secondary: 14F05, 14L30.

• standard represen- tation


• canonical projec- tion


• group


• moduli space when


• over


• conformal field


• connected

Sujets

• Institut de Mathématiques de Jussieu
• Connected

Informations

• Publié par: pefav
• Nombre de lectures: 13
• Langue: English

Extrait

Theπ-calculusasatheoryinlinearlogic: Preliminaryresults ∗ DaleMiller ComputerScienceDepartment UniversityofPennsylvania Philadelphia,PA19104-6389USA [e-mail] October29,1992 Abstract Theagentexpressionsoftheπ-calculuscanbetranslatedintoatheoryoflinearlogicin suchawaythatthereflectiveandtransitiveclosureofπ-calculus(unlabeled)reductionis identifiedwith“entailed-by”.Underthistranslation,parallelcompositionismappedtothe multiplicativedisjunct(“par”)andrestrictionismappedtouniversalquantification.Prefixing, non-deterministicchoice(+),replication(!),andthematchguardareallrepresentedusing non-logicalconstants,whicharespecifiedusingasimpleformofaxiom,calledhereaprocess clause.TheseprocessclausesresembleHornclausesexceptthattheymayhavemultipleconclu- sions;thatis,theirheadsmaybetheparofatomicformulas.Suchmultipleconclusionclauses areusedtoaxiomatizecommunicationsamongagents.Giventhistranslation,itisnatureto asktowhatextentprooftheorycanbeusedtounderstandthemeta-theoryoftheπ-calculus. Wepresentsomepreliminaryresultsalongthislineforπ 0 ,the“propositional”fragmentofthe π-calculus,whichlacksrestrictionandvaluepassing(π 0 isasubsetofCCS).Usingideasfrom proof-theory,weintroduceco-agentsandshowthattheycanspecifysometestingequivalences forπ 0 .Ifnegation-as-failure-to-proveispermittedasaco-agentcombinator,thentestingequiv- alencebasedonco-agentsyieldsobservationalequivalenceforπ 0 .Thislatterresultfollowsfrom observingthatco-agentsdirectlyrepresentformulasintheHennessy-Milnermodallogic. 1Introduction Inthispaperweaddressthequestion“Canweviewagivenprocesscalculusasalogic?”This isdifferent(althoughcertainlyrelated)tothequestion“Canlogicbeusedtocharacterizeagiven processcalculus?”Suchaquestionwouldviewlogicasanauxiliarylanguagetothatoftheprocess calculus:forexample,theHennessy-MilnerlogichassucharelationshiptoCCS.Ourapproachhere willbetouselogicmoreimmediatelybytryingtomatchcombinatorsofthegivenprocesscalculus directlytologicalconnectivesand,ifacombinatorfailstomatch,tryingtoaxiomatizeditdirectly anduniformlyinlogic. Forourpurposeshere,weshallconsideraformalsystemtobealogicifithasasequentcalculus presentationthatadmitsacut-eliminationtheorem.Ofcourse,thisdefinitionoflogicisnotformal unlessformaldefinitionsofsequentcalculiandcut-eliminationareprovided.Weshallnotattempt ∗ ThispaperappearsintheProceedingsofthe1992WorkshoponExtensionstoLogicProgramming,editedbyE. LammaandP.Mello,LectureNotesinComputerScience,Springer-Verlag. 1