Sequences of Levy Transformations and Multi-Wro'nski Determinant Solutions of the Darboux S

合集下载

高三英语阅读理解文章结构题单选题30题

高三英语阅读理解文章结构题单选题30题

高三英语阅读理解文章结构题单选题30题1.The author starts the passage with a question to _____.A.attract readers' attentionB.provide background informationC.introduce the main topicD.show the importance of the issue答案:A。

本题考查文章开头以问题开头的作用。

选项A,以问题开头通常是为了吸引读者的注意力,让读者产生好奇心从而继续阅读文章。

例如“Have you ever wondered why the sky is blue?”这样的问题会引发读者思考并想知道答案,进而继续阅读文章。

选项B,提供背景信息一般不是以问题开头的主要作用。

选项C,问题不一定直接引入主题,可能只是引起兴趣后再引入主题。

选项D,以问题开头不一定直接表明问题的重要性。

2.The first paragraph of the article begins with a story. This is to _____.A.make the article more interestingB.support the main argumentC.give an exampleD.provide historical context答案:A。

以故事开头通常是为了使文章更有趣,吸引读者。

比如以一个有趣的小故事开头,能让读者更容易投入到文章中。

选项B,故事开头不一定直接支持主要论点。

选项C,故事开头不一定是为了举例说明。

选项D,一般故事开头不是为了提供历史背景。

3.The article starts with a quote to _____.A.emphasize the author's pointB.show the author's knowledgeC.inspire readersD.provide an expert opinion答案:A。

初三英语哲学思考问题单选题40题

初三英语哲学思考问题单选题40题

初三英语哲学思考问题单选题40题1. When we think about the nature of reality, which of the following statements is correct?A. Reality is only what we can see.B. Reality is determined by our thoughts.C. Reality is independent of human perception.D. Reality changes based on our feelings.答案:C。

本题主要考查对现实本质的哲学理解。

选项A 过于局限,现实不仅仅是我们能看到的。

选项B 是主观唯心主义观点,不符合客观事实。

选项C 符合唯物主义观点,现实是独立于人类感知而存在的。

选项D 现实不会仅仅因为我们的感受而改变。

2. What is the essence of philosophy according to the basic concepts?A. The study of history.B. The exploration of science.C. The reflection on fundamental questions of life and existence.D. The analysis of language.答案:C。

哲学的本质是对生命和存在的基本问题进行反思。

选项 A 历史研究并非哲学的本质。

选项 B 科学探索也不是哲学的本质核心。

选项D 语言分析只是哲学的一个方面,而非本质。

3. In the philosophical view, which one is true about truth?A. Truth is relative and changes over time.B. Truth is absolute and never changes.C. Truth depends on personal belief.D. Truth is something that cannot be known.答案:A。

猪的基因序列英语作文

猪的基因序列英语作文

猪的基因序列英语作文Title: The Genomic Blueprint of Pigs: Unraveling the Genetic Sequence。

Pigs, as essential livestock animals, have been a cornerstone of human civilization for thousands of years. Their genetic makeup holds the key to understanding various aspects of their biology, evolution, and potential applications in agriculture and biomedicine. In this essay, we delve into the intricate world of pig genomics, exploring the significance of their genetic sequence andits implications.Introduction to Pig Genomics:The field of genomics, particularly pig genomics, encompasses the study of the entire genetic material of pigs, including their DNA sequence, gene structure, and function. The completion of the pig genome sequencing project in 2012 marked a significant milestone inunderstanding the genetic blueprint of these animals. With approximately 2.7 billion base pairs, the pig genome is comparable in size to the human genome, comprising a complex network of genes and regulatory elements.Genetic Diversity and Evolution:The genetic diversity among pig breeds is extensive, reflecting centuries of selective breeding by humans for various traits such as meat quality, disease resistance, and reproductive performance. By analyzing the genetic variation present within and between different pig populations, researchers can reconstruct the evolutionary history of pigs and uncover the genetic basis of traitsthat have been shaped by natural selection and artificial selection.Functional Genomics:Functional genomics aims to decipher the functions of genes and their interactions within biological systems. Through techniques such as transcriptomics, proteomics, andmetabolomics, scientists can elucidate how genes are expressed, regulated, and ultimately contribute to the phenotype of an organism. In pigs, functional genomics studies have provided insights into important biological processes such as growth, development, immunity, and reproduction.Applications in Agriculture:The knowledge gained from pig genomics has practical implications for agricultural practices aimed at improving pig breeding, production efficiency, and disease management. Genomic selection, for instance, allows breeders toidentify superior individuals for breeding based on their genetic potential for desirable traits, leading to accelerated genetic progress and increased productivity. Additionally, genomic technologies enable the detection of genetic markers associated with disease resistance,enabling more targeted breeding strategies to mitigate the impact of infectious diseases in pig populations.Biomedical Relevance:Beyond agriculture, pig genomics has relevance in biomedical research, particularly in the field of comparative genomics and xenotransplantation. Pigs share physiological and anatomical similarities with humans, making them valuable models for studying human diseases and developing novel therapies. By editing pig genomes using advanced gene editing techniques such as CRISPR-Cas9, researchers can generate pig models with genetic modifications that mimic human disease conditions, facilitating the development of new treatments and therapies.Challenges and Future Directions:Despite the significant progress in pig genomics, several challenges remain, including the identification of functional elements within the genome, understanding the complex regulatory networks that govern gene expression, and addressing ethical considerations associated with genetic manipulation in pigs. Future research efforts will likely focus on integrating genomic data with other omicsdata sets, developing innovative breeding strategies, and advancing genome editing technologies to further harness the potential of pig genomics in agriculture, medicine, and beyond.Conclusion:In conclusion, the genomic sequence of pigs holds immense promise for advancing our understanding of pig biology, evolution, and applications in agriculture and biomedicine. By unraveling the complexities of the pig genome, scientists can unlock new opportunities for enhancing pig breeding, improving production efficiency, and addressing global challenges such as food security and human health. The journey of exploration into pig genomics continues to evolve, promising exciting discoveries and innovations in the years to come.。

《孟德尔随机化研究指南》中英文版

《孟德尔随机化研究指南》中英文版

《孟德尔随机化研究指南》中英文版全文共3篇示例,供读者参考篇1Randomized research is a vital component of scientific studies, allowing researchers to investigate causal relationships between variables and make accurate inferences about the effects of interventions. One of the most renowned guides for conducting randomized research is the "Mendel Randomization Research Guide," which provides detailed instructions and best practices for designing and implementing randomized controlled trials.The Mendel Randomization Research Guide offers comprehensive guidance on all aspects of randomized research, from study design and sample selection to data analysis and interpretation of results. It emphasizes the importance of randomization in reducing bias and confounding effects, thus ensuring the validity and reliability of study findings. With clear and practical recommendations, researchers can feel confident in the quality and rigor of their randomized research studies.The guide highlights the key principles of randomization, such as the use of random assignment to treatment groups, blinding of participants and researchers, and intent-to-treat analysis. It also discusses strategies for achieving balance in sample characteristics and minimizing the risk of selection bias. By following these principles and guidelines, researchers can maximize the internal validity of their studies and draw accurate conclusions about the causal effects of interventions.In addition to the technical aspects of randomized research, the Mendel Randomization Research Guide also addresses ethical considerations and practical challenges that researchers may face. It emphasizes the importance of obtaining informed consent from participants, protecting their privacy and confidentiality, and ensuring the safety and well-being of study subjects. The guide also discusses strategies for overcoming common obstacles in randomized research, such as recruitment and retention issues, data collection problems, and statistical challenges.Overall, the Mendel Randomization Research Guide is a valuable resource for researchers looking to improve the quality and validity of their randomized research studies. By following its recommendations and best practices, researchers can conductstudies that produce reliable and actionable findings, advancing scientific knowledge and contributing to evidence-based decision making in various fields.篇2Mendel Randomization Study GuideIntroductionMendel Randomization Study Guide is a comprehensive and informative resource for researchers and students interested in the field of Mendel randomization. This guide provides anin-depth overview of the principles and methods of Mendel randomization, as well as practical advice on how to design and conduct Mendel randomization studies.The guide is divided into several sections, each covering a different aspect of Mendel randomization. The first section provides a brief introduction to the history and background of Mendel randomization, tracing its origins to the work of Gregor Mendel, the father of modern genetics. It also discusses the theoretical foundations of Mendel randomization and its potential applications in causal inference.The second section of the guide focuses on the methods and techniques used in Mendel randomization studies. This includesa detailed explanation of how Mendel randomization works, as well as guidelines on how to select instrumental variables and control for potential confounders. It also discusses the strengths and limitations of Mendel randomization, and provides practical tips on how to deal with common challenges in Mendel randomization studies.The third section of the guide is dedicated to practical considerations in Mendel randomization studies. This includes advice on how to design a Mendel randomization study, collect and analyze data, and interpret the results. It also provides recommendations on how to report Mendel randomization studies and publish research findings in scientific journals.In addition, the guide includes a glossary of key terms and concepts related to Mendel randomization, as well as a list of recommended readings for further study. It also includes case studies and examples of Mendel randomization studies in practice, to illustrate the principles and techniques discussed in the guide.ConclusionIn conclusion, the Mendel Randomization Study Guide is a valuable resource for researchers and students interested in Mendel randomization. It provides a comprehensive overview ofthe principles and methods of Mendel randomization, as well as practical advice on how to design and conduct Mendel randomization studies. Whether you are new to Mendel randomization or looking to deepen your understanding of the field, this guide is an essential reference for anyone interested in causal inference and genetic epidemiology.篇3"Guide to Mendelian Randomization Studies" English VersionIntroductionMendelian randomization (MR) is a method that uses genetic variants to investigate the causal relationship between an exposure and an outcome. It is a powerful tool that can help researchers to better understand the underlying mechanisms of complex traits and diseases. The "Guide to Mendelian Randomization Studies" provides a comprehensive overview of MR studies and offers practical guidance on how to design and carry out these studies effectively.Chapter 1: Introduction to Mendelian RandomizationThis chapter provides an overview of the principles of Mendelian randomization, including the assumptions andlimitations of the method. It explains how genetic variants can be used as instrumental variables to estimate the causal effect of an exposure on an outcome, and outlines the key steps involved in conducting an MR study.Chapter 2: Choosing Genetic InstrumentsIn this chapter, the guide discusses the criteria for selecting appropriate genetic instruments for Mendelian randomization. It covers issues such as the relevance of the genetic variant to the exposure of interest, the strength of the instrument, and the potential for pleiotropy. The chapter also provides practical tips on how to search for suitable genetic variants in public databases.Chapter 3: Data Sources and ValidationThis chapter highlights the importance of using high-quality data sources for Mendelian randomization studies. It discusses the different types of data that can be used, such asgenome-wide association studies and biobanks, and offers advice on how to validate genetic instruments and ensure the reliability of the data.Chapter 4: Statistical MethodsIn this chapter, the guide explains the various statistical methods that can be used to analyze Mendelian randomization data. It covers techniques such as inverse variance weighting, MR-Egger regression, and bi-directional Mendelian randomization, and provides guidance on how to choose the most appropriate method for a given study.Chapter 5: Interpretation and ReportingThe final chapter of the guide focuses on the interpretation and reporting of Mendelian randomization results. It discusses how to assess the strength of causal inference, consider potential biases, and communicate findings effectively in research papers and presentations.ConclusionThe "Guide to Mendelian Randomization Studies" is a valuable resource for researchers who are interested in using genetic data to investigate causal relationships in epidemiological studies. By following the guidance provided in the guide, researchers can enhance the rigor and validity of their Mendelian randomization studies and contribute to a better understanding of the determinants of complex traits and diseases.。

T.W. ANDERSON (1971). The Statistical Analysis of Time Series. Series in Probability and Ma

T.W. ANDERSON (1971). The Statistical Analysis of Time Series. Series in Probability and Ma

425 BibliographyH.A KAIKE(1974).Markovian representation of stochastic processes and its application to the analysis of autoregressive moving average processes.Annals Institute Statistical Mathematics,vol.26,pp.363-387. B.D.O.A NDERSON and J.B.M OORE(1979).Optimal rmation and System Sciences Series, Prentice Hall,Englewood Cliffs,NJ.T.W.A NDERSON(1971).The Statistical Analysis of Time Series.Series in Probability and Mathematical Statistics,Wiley,New York.R.A NDRE-O BRECHT(1988).A new statistical approach for the automatic segmentation of continuous speech signals.IEEE Trans.Acoustics,Speech,Signal Processing,vol.ASSP-36,no1,pp.29-40.R.A NDRE-O BRECHT(1990).Reconnaissance automatique de parole`a partir de segments acoustiques et de mod`e les de Markov cach´e s.Proc.Journ´e es Etude de la Parole,Montr´e al,May1990(in French).R.A NDRE-O BRECHT and H.Y.S U(1988).Three acoustic labellings for phoneme based continuous speech recognition.Proc.Speech’88,Edinburgh,UK,pp.943-950.U.A PPEL and A.VON B RANDT(1983).Adaptive sequential segmentation of piecewise stationary time rmation Sciences,vol.29,no1,pp.27-56.L.A.A ROIAN and H.L EVENE(1950).The effectiveness of quality control procedures.Jal American Statis-tical Association,vol.45,pp.520-529.K.J.A STR¨OM and B.W ITTENMARK(1984).Computer Controlled Systems:Theory and rma-tion and System Sciences Series,Prentice Hall,Englewood Cliffs,NJ.M.B AGSHAW and R.A.J OHNSON(1975a).The effect of serial correlation on the performance of CUSUM tests-Part II.Technometrics,vol.17,no1,pp.73-80.M.B AGSHAW and R.A.J OHNSON(1975b).The influence of reference values and estimated variance on the ARL of CUSUM tests.Jal Royal Statistical Society,vol.37(B),no3,pp.413-420.M.B AGSHAW and R.A.J OHNSON(1977).Sequential procedures for detecting parameter changes in a time-series model.Jal American Statistical Association,vol.72,no359,pp.593-597.R.K.B ANSAL and P.P APANTONI-K AZAKOS(1986).An algorithm for detecting a change in a stochastic process.IEEE rmation Theory,vol.IT-32,no2,pp.227-235.G.A.B ARNARD(1959).Control charts and stochastic processes.Jal Royal Statistical Society,vol.B.21, pp.239-271.A.E.B ASHARINOV andB.S.F LEISHMAN(1962).Methods of the statistical sequential analysis and their radiotechnical applications.Sovetskoe Radio,Moscow(in Russian).M.B ASSEVILLE(1978).D´e viations par rapport au maximum:formules d’arrˆe t et martingales associ´e es. Compte-rendus du S´e minaire de Probabilit´e s,Universit´e de Rennes I.M.B ASSEVILLE(1981).Edge detection using sequential methods for change in level-Part II:Sequential detection of change in mean.IEEE Trans.Acoustics,Speech,Signal Processing,vol.ASSP-29,no1,pp.32-50.426B IBLIOGRAPHY M.B ASSEVILLE(1982).A survey of statistical failure detection techniques.In Contribution`a la D´e tectionS´e quentielle de Ruptures de Mod`e les Statistiques,Th`e se d’Etat,Universit´e de Rennes I,France(in English). M.B ASSEVILLE(1986).The two-models approach for the on-line detection of changes in AR processes. In Detection of Abrupt Changes in Signals and Dynamical Systems(M.Basseville,A.Benveniste,eds.). Lecture Notes in Control and Information Sciences,LNCIS77,Springer,New York,pp.169-215.M.B ASSEVILLE(1988).Detecting changes in signals and systems-A survey.Automatica,vol.24,pp.309-326.M.B ASSEVILLE(1989).Distance measures for signal processing and pattern recognition.Signal Process-ing,vol.18,pp.349-369.M.B ASSEVILLE and A.B ENVENISTE(1983a).Design and comparative study of some sequential jump detection algorithms for digital signals.IEEE Trans.Acoustics,Speech,Signal Processing,vol.ASSP-31, no3,pp.521-535.M.B ASSEVILLE and A.B ENVENISTE(1983b).Sequential detection of abrupt changes in spectral charac-teristics of digital signals.IEEE rmation Theory,vol.IT-29,no5,pp.709-724.M.B ASSEVILLE and A.B ENVENISTE,eds.(1986).Detection of Abrupt Changes in Signals and Dynamical Systems.Lecture Notes in Control and Information Sciences,LNCIS77,Springer,New York.M.B ASSEVILLE and I.N IKIFOROV(1991).A unified framework for statistical change detection.Proc.30th IEEE Conference on Decision and Control,Brighton,UK.M.B ASSEVILLE,B.E SPIAU and J.G ASNIER(1981).Edge detection using sequential methods for change in level-Part I:A sequential edge detection algorithm.IEEE Trans.Acoustics,Speech,Signal Processing, vol.ASSP-29,no1,pp.24-31.M.B ASSEVILLE, A.B ENVENISTE and G.M OUSTAKIDES(1986).Detection and diagnosis of abrupt changes in modal characteristics of nonstationary digital signals.IEEE rmation Theory,vol.IT-32,no3,pp.412-417.M.B ASSEVILLE,A.B ENVENISTE,G.M OUSTAKIDES and A.R OUG´E E(1987a).Detection and diagnosis of changes in the eigenstructure of nonstationary multivariable systems.Automatica,vol.23,no3,pp.479-489. M.B ASSEVILLE,A.B ENVENISTE,G.M OUSTAKIDES and A.R OUG´E E(1987b).Optimal sensor location for detecting changes in dynamical behavior.IEEE Trans.Automatic Control,vol.AC-32,no12,pp.1067-1075.M.B ASSEVILLE,A.B ENVENISTE,B.G ACH-D EVAUCHELLE,M.G OURSAT,D.B ONNECASE,P.D OREY, M.P REVOSTO and M.O LAGNON(1993).Damage monitoring in vibration mechanics:issues in diagnos-tics and predictive maintenance.Mechanical Systems and Signal Processing,vol.7,no5,pp.401-423.R.V.B EARD(1971).Failure Accommodation in Linear Systems through Self-reorganization.Ph.D.Thesis, Dept.Aeronautics and Astronautics,MIT,Cambridge,MA.A.B ENVENISTE and J.J.F UCHS(1985).Single sample modal identification of a nonstationary stochastic process.IEEE Trans.Automatic Control,vol.AC-30,no1,pp.66-74.A.B ENVENISTE,M.B ASSEVILLE and G.M OUSTAKIDES(1987).The asymptotic local approach to change detection and model validation.IEEE Trans.Automatic Control,vol.AC-32,no7,pp.583-592.A.B ENVENISTE,M.M ETIVIER and P.P RIOURET(1990).Adaptive Algorithms and Stochastic Approxima-tions.Series on Applications of Mathematics,(A.V.Balakrishnan,I.Karatzas,M.Yor,eds.).Springer,New York.A.B ENVENISTE,M.B ASSEVILLE,L.E L G HAOUI,R.N IKOUKHAH and A.S.W ILLSKY(1992).An optimum robust approach to statistical failure detection and identification.IFAC World Conference,Sydney, July1993.B IBLIOGRAPHY427 R.H.B ERK(1973).Some asymptotic aspects of sequential analysis.Annals Statistics,vol.1,no6,pp.1126-1138.R.H.B ERK(1975).Locally most powerful sequential test.Annals Statistics,vol.3,no2,pp.373-381.P.B ILLINGSLEY(1968).Convergence of Probability Measures.Wiley,New York.A.F.B ISSELL(1969).Cusum techniques for quality control.Applied Statistics,vol.18,pp.1-30.M.E.B IVAIKOV(1991).Control of the sample size for recursive estimation of parameters subject to abrupt changes.Automation and Remote Control,no9,pp.96-103.R.E.B LAHUT(1987).Principles and Practice of Information Theory.Addison-Wesley,Reading,MA.I.F.B LAKE and W.C.L INDSEY(1973).Level-crossing problems for random processes.IEEE r-mation Theory,vol.IT-19,no3,pp.295-315.G.B ODENSTEIN and H.M.P RAETORIUS(1977).Feature extraction from the encephalogram by adaptive segmentation.Proc.IEEE,vol.65,pp.642-652.T.B OHLIN(1977).Analysis of EEG signals with changing spectra using a short word Kalman estimator. Mathematical Biosciences,vol.35,pp.221-259.W.B¨OHM and P.H ACKL(1990).Improved bounds for the average run length of control charts based on finite weighted sums.Annals Statistics,vol.18,no4,pp.1895-1899.T.B OJDECKI and J.H OSZA(1984).On a generalized disorder problem.Stochastic Processes and their Applications,vol.18,pp.349-359.L.I.B ORODKIN and V.V.M OTTL’(1976).Algorithm forfinding the jump times of random process equation parameters.Automation and Remote Control,vol.37,no6,Part1,pp.23-32.A.A.B OROVKOV(1984).Theory of Mathematical Statistics-Estimation and Hypotheses Testing,Naouka, Moscow(in Russian).Translated in French under the title Statistique Math´e matique-Estimation et Tests d’Hypoth`e ses,Mir,Paris,1987.G.E.P.B OX and G.M.J ENKINS(1970).Time Series Analysis,Forecasting and Control.Series in Time Series Analysis,Holden-Day,San Francisco.A.VON B RANDT(1983).Detecting and estimating parameters jumps using ladder algorithms and likelihood ratio test.Proc.ICASSP,Boston,MA,pp.1017-1020.A.VON B RANDT(1984).Modellierung von Signalen mit Sprunghaft Ver¨a nderlichem Leistungsspektrum durch Adaptive Segmentierung.Doctor-Engineer Dissertation,M¨u nchen,RFA(in German).S.B RAUN,ed.(1986).Mechanical Signature Analysis-Theory and Applications.Academic Press,London. L.B REIMAN(1968).Probability.Series in Statistics,Addison-Wesley,Reading,MA.G.S.B RITOV and L.A.M IRONOVSKI(1972).Diagnostics of linear systems of automatic regulation.Tekh. Kibernetics,vol.1,pp.76-83.B.E.B RODSKIY and B.S.D ARKHOVSKIY(1992).Nonparametric Methods in Change-point Problems. Kluwer Academic,Boston.L.D.B ROEMELING(1982).Jal Econometrics,vol.19,Special issue on structural change in Econometrics. L.D.B ROEMELING and H.T SURUMI(1987).Econometrics and Structural Change.Dekker,New York. D.B ROOK and D.A.E VANS(1972).An approach to the probability distribution of Cusum run length. Biometrika,vol.59,pp.539-550.J.B RUNET,D.J AUME,M.L ABARR`E RE,A.R AULT and M.V ERG´E(1990).D´e tection et Diagnostic de Pannes.Trait´e des Nouvelles Technologies,S´e rie Diagnostic et Maintenance,Herm`e s,Paris(in French).428B IBLIOGRAPHY S.P.B RUZZONE and M.K AVEH(1984).Information tradeoffs in using the sample autocorrelation function in ARMA parameter estimation.IEEE Trans.Acoustics,Speech,Signal Processing,vol.ASSP-32,no4, pp.701-715.A.K.C AGLAYAN(1980).Necessary and sufficient conditions for detectability of jumps in linear systems. IEEE Trans.Automatic Control,vol.AC-25,no4,pp.833-834.A.K.C AGLAYAN and R.E.L ANCRAFT(1983).Reinitialization issues in fault tolerant systems.Proc.Amer-ican Control Conf.,pp.952-955.A.K.C AGLAYAN,S.M.A LLEN and K.W EHMULLER(1988).Evaluation of a second generation reconfigu-ration strategy for aircraftflight control systems subjected to actuator failure/surface damage.Proc.National Aerospace and Electronic Conference,Dayton,OH.P.E.C AINES(1988).Linear Stochastic Systems.Series in Probability and Mathematical Statistics,Wiley, New York.M.J.C HEN and J.P.N ORTON(1987).Estimation techniques for tracking rapid parameter changes.Intern. Jal Control,vol.45,no4,pp.1387-1398.W.K.C HIU(1974).The economic design of cusum charts for controlling normal mean.Applied Statistics, vol.23,no3,pp.420-433.E.Y.C HOW(1980).A Failure Detection System Design Methodology.Ph.D.Thesis,M.I.T.,L.I.D.S.,Cam-bridge,MA.E.Y.C HOW and A.S.W ILLSKY(1984).Analytical redundancy and the design of robust failure detection systems.IEEE Trans.Automatic Control,vol.AC-29,no3,pp.689-691.Y.S.C HOW,H.R OBBINS and D.S IEGMUND(1971).Great Expectations:The Theory of Optimal Stop-ping.Houghton-Mifflin,Boston.R.N.C LARK,D.C.F OSTH and V.M.W ALTON(1975).Detection of instrument malfunctions in control systems.IEEE Trans.Aerospace Electronic Systems,vol.AES-11,pp.465-473.A.C OHEN(1987).Biomedical Signal Processing-vol.1:Time and Frequency Domain Analysis;vol.2: Compression and Automatic Recognition.CRC Press,Boca Raton,FL.J.C ORGE and F.P UECH(1986).Analyse du rythme cardiaque foetal par des m´e thodes de d´e tection de ruptures.Proc.7th INRIA Int.Conf.Analysis and optimization of Systems.Antibes,FR(in French).D.R.C OX and D.V.H INKLEY(1986).Theoretical Statistics.Chapman and Hall,New York.D.R.C OX and H.D.M ILLER(1965).The Theory of Stochastic Processes.Wiley,New York.S.V.C ROWDER(1987).A simple method for studying run-length distributions of exponentially weighted moving average charts.Technometrics,vol.29,no4,pp.401-407.H.C S¨ORG¨O and L.H ORV´ATH(1988).Nonparametric methods for change point problems.In Handbook of Statistics(P.R.Krishnaiah,C.R.Rao,eds.),vol.7,Elsevier,New York,pp.403-425.R.B.D AVIES(1973).Asymptotic inference in stationary gaussian time series.Advances Applied Probability, vol.5,no3,pp.469-497.J.C.D ECKERT,M.N.D ESAI,J.J.D EYST and A.S.W ILLSKY(1977).F-8DFBW sensor failure identification using analytical redundancy.IEEE Trans.Automatic Control,vol.AC-22,no5,pp.795-803.M.H.D E G ROOT(1970).Optimal Statistical Decisions.Series in Probability and Statistics,McGraw-Hill, New York.J.D ESHAYES and D.P ICARD(1979).Tests de ruptures dans un mod`e pte-Rendus de l’Acad´e mie des Sciences,vol.288,Ser.A,pp.563-566(in French).B IBLIOGRAPHY429 J.D ESHAYES and D.P ICARD(1983).Ruptures de Mod`e les en Statistique.Th`e ses d’Etat,Universit´e deParis-Sud,Orsay,France(in French).J.D ESHAYES and D.P ICARD(1986).Off-line statistical analysis of change-point models using non para-metric and likelihood methods.In Detection of Abrupt Changes in Signals and Dynamical Systems(M. Basseville,A.Benveniste,eds.).Lecture Notes in Control and Information Sciences,LNCIS77,Springer, New York,pp.103-168.B.D EVAUCHELLE-G ACH(1991).Diagnostic M´e canique des Fatigues sur les Structures Soumises`a des Vibrations en Ambiance de Travail.Th`e se de l’Universit´e Paris IX Dauphine(in French).B.D EVAUCHELLE-G ACH,M.B ASSEVILLE and A.B ENVENISTE(1991).Diagnosing mechanical changes in vibrating systems.Proc.SAFEPROCESS’91,Baden-Baden,FRG,pp.85-89.R.D I F RANCESCO(1990).Real-time speech segmentation using pitch and convexity jump models:applica-tion to variable rate speech coding.IEEE Trans.Acoustics,Speech,Signal Processing,vol.ASSP-38,no5, pp.741-748.X.D ING and P.M.F RANK(1990).Fault detection via factorization approach.Systems and Control Letters, vol.14,pp.431-436.J.L.D OOB(1953).Stochastic Processes.Wiley,New York.V.D RAGALIN(1988).Asymptotic solutions in detecting a change in distribution under an unknown param-eter.Statistical Problems of Control,Issue83,Vilnius,pp.45-52.B.D UBUISSON(1990).Diagnostic et Reconnaissance des Formes.Trait´e des Nouvelles Technologies,S´e rie Diagnostic et Maintenance,Herm`e s,Paris(in French).A.J.D UNCAN(1986).Quality Control and Industrial Statistics,5th edition.Richard D.Irwin,Inc.,Home-wood,IL.J.D URBIN(1971).Boundary-crossing probabilities for the Brownian motion and Poisson processes and techniques for computing the power of the Kolmogorov-Smirnov test.Jal Applied Probability,vol.8,pp.431-453.J.D URBIN(1985).Thefirst passage density of the crossing of a continuous Gaussian process to a general boundary.Jal Applied Probability,vol.22,no1,pp.99-122.A.E MAMI-N AEINI,M.M.A KHTER and S.M.R OCK(1988).Effect of model uncertainty on failure detec-tion:the threshold selector.IEEE Trans.Automatic Control,vol.AC-33,no12,pp.1106-1115.J.D.E SARY,F.P ROSCHAN and D.W.W ALKUP(1967).Association of random variables with applications. Annals Mathematical Statistics,vol.38,pp.1466-1474.W.D.E WAN and K.W.K EMP(1960).Sampling inspection of continuous processes with no autocorrelation between successive results.Biometrika,vol.47,pp.263-280.G.F AVIER and A.S MOLDERS(1984).Adaptive smoother-predictors for tracking maneuvering targets.Proc. 23rd Conf.Decision and Control,Las Vegas,NV,pp.831-836.W.F ELLER(1966).An Introduction to Probability Theory and Its Applications,vol.2.Series in Probability and Mathematical Statistics,Wiley,New York.R.A.F ISHER(1925).Theory of statistical estimation.Proc.Cambridge Philosophical Society,vol.22, pp.700-725.M.F ISHMAN(1988).Optimization of the algorithm for the detection of a disorder,based on the statistic of exponential smoothing.In Statistical Problems of Control,Issue83,Vilnius,pp.146-151.R.F LETCHER(1980).Practical Methods of Optimization,2volumes.Wiley,New York.P.M.F RANK(1990).Fault diagnosis in dynamic systems using analytical and knowledge based redundancy -A survey and new results.Automatica,vol.26,pp.459-474.430B IBLIOGRAPHY P.M.F RANK(1991).Enhancement of robustness in observer-based fault detection.Proc.SAFEPRO-CESS’91,Baden-Baden,FRG,pp.275-287.P.M.F RANK and J.W¨UNNENBERG(1989).Robust fault diagnosis using unknown input observer schemes. In Fault Diagnosis in Dynamic Systems-Theory and Application(R.Patton,P.Frank,R.Clark,eds.). International Series in Systems and Control Engineering,Prentice Hall International,London,UK,pp.47-98.K.F UKUNAGA(1990).Introduction to Statistical Pattern Recognition,2d ed.Academic Press,New York. S.I.G ASS(1958).Linear Programming:Methods and Applications.McGraw Hill,New York.W.G E and C.Z.F ANG(1989).Extended robust observation approach for failure isolation.Int.Jal Control, vol.49,no5,pp.1537-1553.W.G ERSCH(1986).Two applications of parametric time series modeling methods.In Mechanical Signature Analysis-Theory and Applications(S.Braun,ed.),chap.10.Academic Press,London.J.J.G ERTLER(1988).Survey of model-based failure detection and isolation in complex plants.IEEE Control Systems Magazine,vol.8,no6,pp.3-11.J.J.G ERTLER(1991).Analytical redundancy methods in fault detection and isolation.Proc.SAFEPRO-CESS’91,Baden-Baden,FRG,pp.9-22.B.K.G HOSH(1970).Sequential Tests of Statistical Hypotheses.Addison-Wesley,Cambridge,MA.I.N.G IBRA(1975).Recent developments in control charts techniques.Jal Quality Technology,vol.7, pp.183-192.J.P.G ILMORE and R.A.M C K ERN(1972).A redundant strapdown inertial reference unit(SIRU).Jal Space-craft,vol.9,pp.39-47.M.A.G IRSHICK and H.R UBIN(1952).A Bayes approach to a quality control model.Annals Mathematical Statistics,vol.23,pp.114-125.A.L.G OEL and S.M.W U(1971).Determination of the ARL and a contour nomogram for CUSUM charts to control normal mean.Technometrics,vol.13,no2,pp.221-230.P.L.G OLDSMITH and H.W HITFIELD(1961).Average run lengths in cumulative chart quality control schemes.Technometrics,vol.3,pp.11-20.G.C.G OODWIN and K.S.S IN(1984).Adaptive Filtering,Prediction and rmation and System Sciences Series,Prentice Hall,Englewood Cliffs,NJ.R.M.G RAY and L.D.D AVISSON(1986).Random Processes:a Mathematical Approach for Engineers. Information and System Sciences Series,Prentice Hall,Englewood Cliffs,NJ.C.G UEGUEN and L.L.S CHARF(1980).Exact maximum likelihood identification for ARMA models:a signal processing perspective.Proc.1st EUSIPCO,Lausanne.D.E.G USTAFSON, A.S.W ILLSKY,J.Y.W ANG,M.C.L ANCASTER and J.H.T RIEBWASSER(1978). ECG/VCG rhythm diagnosis using statistical signal analysis.Part I:Identification of persistent rhythms. Part II:Identification of transient rhythms.IEEE Trans.Biomedical Engineering,vol.BME-25,pp.344-353 and353-361.F.G USTAFSSON(1991).Optimal segmentation of linear regression parameters.Proc.IFAC/IFORS Symp. Identification and System Parameter Estimation,Budapest,pp.225-229.T.H¨AGGLUND(1983).New Estimation Techniques for Adaptive Control.Ph.D.Thesis,Lund Institute of Technology,Lund,Sweden.T.H¨AGGLUND(1984).Adaptive control of systems subject to large parameter changes.Proc.IFAC9th World Congress,Budapest.B IBLIOGRAPHY431 P.H ALL and C.C.H EYDE(1980).Martingale Limit Theory and its Application.Probability and Mathemat-ical Statistics,a Series of Monographs and Textbooks,Academic Press,New York.W.J.H ALL,R.A.W IJSMAN and J.K.G HOSH(1965).The relationship between sufficiency and invariance with applications in sequential analysis.Ann.Math.Statist.,vol.36,pp.576-614.E.J.H ANNAN and M.D EISTLER(1988).The Statistical Theory of Linear Systems.Series in Probability and Mathematical Statistics,Wiley,New York.J.D.H EALY(1987).A note on multivariate CuSum procedures.Technometrics,vol.29,pp.402-412.D.M.H IMMELBLAU(1970).Process Analysis by Statistical Methods.Wiley,New York.D.M.H IMMELBLAU(1978).Fault Detection and Diagnosis in Chemical and Petrochemical Processes. Chemical Engineering Monographs,vol.8,Elsevier,Amsterdam.W.G.S.H INES(1976a).A simple monitor of a system with sudden parameter changes.IEEE r-mation Theory,vol.IT-22,no2,pp.210-216.W.G.S.H INES(1976b).Improving a simple monitor of a system with sudden parameter changes.IEEE rmation Theory,vol.IT-22,no4,pp.496-499.D.V.H INKLEY(1969).Inference about the intersection in two-phase regression.Biometrika,vol.56,no3, pp.495-504.D.V.H INKLEY(1970).Inference about the change point in a sequence of random variables.Biometrika, vol.57,no1,pp.1-17.D.V.H INKLEY(1971).Inference about the change point from cumulative sum-tests.Biometrika,vol.58, no3,pp.509-523.D.V.H INKLEY(1971).Inference in two-phase regression.Jal American Statistical Association,vol.66, no336,pp.736-743.J.R.H UDDLE(1983).Inertial navigation system error-model considerations in Kalmanfiltering applica-tions.In Control and Dynamic Systems(C.T.Leondes,ed.),Academic Press,New York,pp.293-339.J.S.H UNTER(1986).The exponentially weighted moving average.Jal Quality Technology,vol.18,pp.203-210.I.A.I BRAGIMOV and R.Z.K HASMINSKII(1981).Statistical Estimation-Asymptotic Theory.Applications of Mathematics Series,vol.16.Springer,New York.R.I SERMANN(1984).Process fault detection based on modeling and estimation methods-A survey.Auto-matica,vol.20,pp.387-404.N.I SHII,A.I WATA and N.S UZUMURA(1979).Segmentation of nonstationary time series.Int.Jal Systems Sciences,vol.10,pp.883-894.J.E.J ACKSON and R.A.B RADLEY(1961).Sequential and tests.Annals Mathematical Statistics, vol.32,pp.1063-1077.B.J AMES,K.L.J AMES and D.S IEGMUND(1988).Conditional boundary crossing probabilities with appli-cations to change-point problems.Annals Probability,vol.16,pp.825-839.M.K.J EERAGE(1990).Reliability analysis of fault-tolerant IMU architectures with redundant inertial sen-sors.IEEE Trans.Aerospace and Electronic Systems,vol.AES-5,no.7,pp.23-27.N.L.J OHNSON(1961).A simple theoretical approach to cumulative sum control charts.Jal American Sta-tistical Association,vol.56,pp.835-840.N.L.J OHNSON and F.C.L EONE(1962).Cumulative sum control charts:mathematical principles applied to their construction and use.Parts I,II,III.Industrial Quality Control,vol.18,pp.15-21;vol.19,pp.29-36; vol.20,pp.22-28.432B IBLIOGRAPHY R.A.J OHNSON and M.B AGSHAW(1974).The effect of serial correlation on the performance of CUSUM tests-Part I.Technometrics,vol.16,no.1,pp.103-112.H.L.J ONES(1973).Failure Detection in Linear Systems.Ph.D.Thesis,Dept.Aeronautics and Astronautics, MIT,Cambridge,MA.R.H.J ONES,D.H.C ROWELL and L.E.K APUNIAI(1970).Change detection model for serially correlated multivariate data.Biometrics,vol.26,no2,pp.269-280.M.J URGUTIS(1984).Comparison of the statistical properties of the estimates of the change times in an autoregressive process.In Statistical Problems of Control,Issue65,Vilnius,pp.234-243(in Russian).T.K AILATH(1980).Linear rmation and System Sciences Series,Prentice Hall,Englewood Cliffs,NJ.L.V.K ANTOROVICH and V.I.K RILOV(1958).Approximate Methods of Higher Analysis.Interscience,New York.S.K ARLIN and H.M.T AYLOR(1975).A First Course in Stochastic Processes,2d ed.Academic Press,New York.S.K ARLIN and H.M.T AYLOR(1981).A Second Course in Stochastic Processes.Academic Press,New York.D.K AZAKOS and P.P APANTONI-K AZAKOS(1980).Spectral distance measures between gaussian pro-cesses.IEEE Trans.Automatic Control,vol.AC-25,no5,pp.950-959.K.W.K EMP(1958).Formula for calculating the operating characteristic and average sample number of some sequential tests.Jal Royal Statistical Society,vol.B-20,no2,pp.379-386.K.W.K EMP(1961).The average run length of the cumulative sum chart when a V-mask is used.Jal Royal Statistical Society,vol.B-23,pp.149-153.K.W.K EMP(1967a).Formal expressions which can be used for the determination of operating character-istics and average sample number of a simple sequential test.Jal Royal Statistical Society,vol.B-29,no2, pp.248-262.K.W.K EMP(1967b).A simple procedure for determining upper and lower limits for the average sample run length of a cumulative sum scheme.Jal Royal Statistical Society,vol.B-29,no2,pp.263-265.D.P.K ENNEDY(1976).Some martingales related to cumulative sum tests and single server queues.Stochas-tic Processes and Appl.,vol.4,pp.261-269.T.H.K ERR(1980).Statistical analysis of two-ellipsoid overlap test for real time failure detection.IEEE Trans.Automatic Control,vol.AC-25,no4,pp.762-772.T.H.K ERR(1982).False alarm and correct detection probabilities over a time interval for restricted classes of failure detection algorithms.IEEE rmation Theory,vol.IT-24,pp.619-631.T.H.K ERR(1987).Decentralizedfiltering and redundancy management for multisensor navigation.IEEE Trans.Aerospace and Electronic systems,vol.AES-23,pp.83-119.Minor corrections on p.412and p.599 (May and July issues,respectively).R.A.K HAN(1978).Wald’s approximations to the average run length in cusum procedures.Jal Statistical Planning and Inference,vol.2,no1,pp.63-77.R.A.K HAN(1979).Somefirst passage problems related to cusum procedures.Stochastic Processes and Applications,vol.9,no2,pp.207-215.R.A.K HAN(1981).A note on Page’s two-sided cumulative sum procedures.Biometrika,vol.68,no3, pp.717-719.B IBLIOGRAPHY433 V.K IREICHIKOV,V.M ANGUSHEV and I.N IKIFOROV(1990).Investigation and application of CUSUM algorithms to monitoring of sensors.In Statistical Problems of Control,Issue89,Vilnius,pp.124-130(in Russian).G.K ITAGAWA and W.G ERSCH(1985).A smoothness prior time-varying AR coefficient modeling of non-stationary covariance time series.IEEE Trans.Automatic Control,vol.AC-30,no1,pp.48-56.N.K LIGIENE(1980).Probabilities of deviations of the change point estimate in statistical models.In Sta-tistical Problems of Control,Issue83,Vilnius,pp.80-86(in Russian).N.K LIGIENE and L.T ELKSNYS(1983).Methods of detecting instants of change of random process prop-erties.Automation and Remote Control,vol.44,no10,Part II,pp.1241-1283.J.K ORN,S.W.G ULLY and A.S.W ILLSKY(1982).Application of the generalized likelihood ratio algorithm to maneuver detection and estimation.Proc.American Control Conf.,Arlington,V A,pp.792-798.P.R.K RISHNAIAH and B.Q.M IAO(1988).Review about estimation of change points.In Handbook of Statistics(P.R.Krishnaiah,C.R.Rao,eds.),vol.7,Elsevier,New York,pp.375-402.P.K UDVA,N.V ISWANADHAM and A.R AMAKRISHNAN(1980).Observers for linear systems with unknown inputs.IEEE Trans.Automatic Control,vol.AC-25,no1,pp.113-115.S.K ULLBACK(1959).Information Theory and Statistics.Wiley,New York(also Dover,New York,1968). K.K UMAMARU,S.S AGARA and T.S¨ODERSTR¨OM(1989).Some statistical methods for fault diagnosis for dynamical systems.In Fault Diagnosis in Dynamic Systems-Theory and Application(R.Patton,P.Frank,R. Clark,eds.).International Series in Systems and Control Engineering,Prentice Hall International,London, UK,pp.439-476.A.K USHNIR,I.N IKIFOROV and I.S AVIN(1983).Statistical adaptive algorithms for automatic detection of seismic signals-Part I:One-dimensional case.In Earthquake Prediction and the Study of the Earth Structure,Naouka,Moscow(Computational Seismology,vol.15),pp.154-159(in Russian).L.L ADELLI(1990).Diffusion approximation for a pseudo-likelihood test process with application to de-tection of change in stochastic system.Stochastics and Stochastics Reports,vol.32,pp.1-25.T.L.L A¨I(1974).Control charts based on weighted sums.Annals Statistics,vol.2,no1,pp.134-147.T.L.L A¨I(1981).Asymptotic optimality of invariant sequential probability ratio tests.Annals Statistics, vol.9,no2,pp.318-333.D.G.L AINIOTIS(1971).Joint detection,estimation,and system identifirmation and Control, vol.19,pp.75-92.M.R.L EADBETTER,G.L INDGREN and H.R OOTZEN(1983).Extremes and Related Properties of Random Sequences and Processes.Series in Statistics,Springer,New York.L.L E C AM(1960).Locally asymptotically normal families of distributions.Univ.California Publications in Statistics,vol.3,pp.37-98.L.L E C AM(1986).Asymptotic Methods in Statistical Decision Theory.Series in Statistics,Springer,New York.E.L.L EHMANN(1986).Testing Statistical Hypotheses,2d ed.Wiley,New York.J.P.L EHOCZKY(1977).Formulas for stopped diffusion processes with stopping times based on the maxi-mum.Annals Probability,vol.5,no4,pp.601-607.H.R.L ERCHE(1980).Boundary Crossing of Brownian Motion.Lecture Notes in Statistics,vol.40,Springer, New York.L.L JUNG(1987).System Identification-Theory for the rmation and System Sciences Series, Prentice Hall,Englewood Cliffs,NJ.。

微生物来源的α-L-阿拉伯呋喃糖苷酶的研究进展

微生物来源的α-L-阿拉伯呋喃糖苷酶的研究进展

陈金玲,杨杰,魏真. 微生物来源的α-L-阿拉伯呋喃糖苷酶的研究进展[J]. 食品工业科技,2024,45(6):343−351. doi:10.13386/j.issn1002-0306.2023040108CHEN Jinling, YANG Jie, WEI Zhen. Research Progress of α-L-Arabinofuranosidase from Microorganisms[J]. Science and Technology of Food Industry, 2024, 45(6): 343−351. (in Chinese with English abstract). doi: 10.13386/j.issn1002-0306.2023040108· 专题综述 ·微生物来源的α-L-阿拉伯呋喃糖苷酶的研究进展陈金玲1,2,杨 杰1,2,魏 真1,2,3,*(1.江苏海洋大学,江苏省海洋生物资源与环境重点实验室,江苏连云港 222005;2.江苏省海洋生物产业技术协同创新中心,江苏连云港 222005;3.江苏省海洋资源开发研究院(连云港),江苏连云港 222005)摘 要:α-L-阿拉伯呋喃糖苷酶(Alpha-L-arabinofuranosidase ,α-L-AFase )属于糖苷水解酶类,主要功能是水解阿拉伯木聚糖中的阿拉伯糖取代基,并与其他水解酶协同促进半纤维素的降解,从而改善半纤维素的生物转化率。

本文综述了近年来微生物来源α-L-AFase 的酶学特性、性质改良、结构、催化机制和协同作用效应等方面的研究进展,发现不同微生物来源的α-L-AFase 的理化性质、分子结构和催化机制均存在着多样性,重组表达的方法能有效改善α-L-AFase 的活性和稳定性,且α-L-AFase 与其他半纤维素水解酶的协同催化作用使底物的转化效率显著提高。

计量经济学中英文词汇对照

计量经济学中英文词汇对照

Common variance Common variation Communality variance Comparability Comparison of bathes Comparison value Compartment model Compassion Complement of an event Complete association Complete dissociation Complete statistics Completely randomized design Composite event Composite events Concavity Conditional expectation Conditional likelihood Conditional probability Conditionally linear Confidence interval Confidence limit Confidence lower limit Confidence upper limit Confirmatory Factor Analysis Confirmatory research Confounding factor Conjoint Consistency Consistency check Consistent asymptotically normal estimate Consistent estimate Constrained nonlinear regression Constraint Contaminated distribution Contaminated Gausssian Contaminated normal distribution Contamination Contamination model Contingency table Contour Contribution rate Control

Vitali’s theorem and WWKL

Vitali’s theorem and WWKL

VITALI’S THEOREM AND WWKLDOUGLAS K.BROWNMARIAGNESE GIUSTOSTEPHEN G.SIMPSONAbstract.Continuing the investigations of X.Yu and others,westudy the role of set existence axioms in classical Lebesgue mea-sure theory.We show that pairwise disjoint countable additivityfor open sets of reals is provable in RCA0.We show that sev-eral well-known measure-theoretic propositions including the VitaliCovering Theorem are equivalent to WWKL over RCA0.1.IntroductionThe purpose of Reverse Mathematics is to study the role of set ex-istence axioms,with an eye to determining which axioms are needed in order to prove specific mathematical theorems.In many cases,it is shown that a specific mathematical theorem is equivalent to the set existence axiom which is needed to prove it.Such equivalences are often proved in the weak base theory RCA0.RCA0may be viewed as a kind of formalized constructive or recursive mathematics,with full clas-sical logic but severely restricted comprehension and induction.The program of Reverse Mathematics has been developed in many publica-tions;see for instance[5,10,11,12,20].In this paper we carry out a Reverse Mathematics study of some aspects of classical Lebesgue measure theory.Historically,the subject of measure theory developed hand in hand with the nonconstructive, set-theoretic approach to mathematics.Errett Bishop has remarked that the foundations of measure theory present a special challenge to the constructive mathematician.Although our program of Reverse Mathematics is quite different from Bishop-style constructivism,we feel that Bishop’s remark implicitly raises an interesting question:Which nonconstructive set existence axioms are needed for measure theory?VITALI’S THEOREM AND WWKL 2This paper,together with earlier papers of Yu and others [21,22,23,24,25,26],constitute an answer to that question.The results of this paper build upon and clarify some early results of Yu and Simpson.The reader of this paper will find that familiarity with Yu–Simpson [26]is desirable but not essential.We begin in section 2by exploring the extent to which measure theory can be developed in RCA 0.We show that pairwise disjoint countable additivity for open sets of reals is provable in RCA 0.This is in contrast to a result of Yu–Simpson [26]:countable additivity for open sets of reals is equivalent over RCA 0to a nonconstructive set existence axiom known as Weak Weak K¨o nig’s Lemma (WWKL).We show in sections 3and 4that several other basic propositions of measure theory are also equivalent to WWKL over RCA 0.Finally in section 5we show that the Vitali Covering Theorem is likewise equivalent to WWKL over RCA 0.2.Measure Theory in RCA 0Recall that RCA 0is the subsystem of second order arithmetic with∆01comprehension and Σ01induction.The purpose of this section is toshow that some measure-theoretic results can be proved in RCA 0.Within RCA 0,let X be a compact separable metric space.We define C (X )= A,the completion of A ,where A is the vector space of rational “polynomials”over X under the sup-norm, f =sup x ∈X |f (x )|.For the precise definitions within RCA 0,see [26]and section III.E of Brown’s thesis [4].The construction of C (X )within RCA 0is inspired by the constructive Stone–Weierstrass theorem in section 4.5of Bishop and Bridges [2].It is provable in RCA 0that there is a natural one-to-one correspondence between points of C (X )and continuous functions f :X →R which are equipped with a modulus of uniform continuity ,that is to say,a function h :N →N such that for all n ∈N and x ,y ∈Xd (x,y )<12n .Within RCA 0we define a measure (more accurately,a nonnegative Borel probability measure)on X to be a nonnegative bounded linear functional µ:C (X )→R such that µ(1)=1.(Here µ(1)denotes µ(f ),f ∈C (X ),f (x )=1for all x ∈X .)For example,if X =[0,1],the unit interval,then there is an obvious measure µL :C ([0,1])→R given by µL (f )= 10f (x )dx ,the Riemann integral of f from 0to 1.We refer to µL as Lebesgue measure on [0,1].There is also the obvious generalization to Lebesgue measure µL on X =[0,1]n ,the n -cube.VITALI’S THEOREM AND WWKL 3Definition 2.1(measure of an open set).This definition is made in RCA 0.Let X be any compact separable metric space,and let µbe any measure on X .If U is an open set in X ,we defineµ(U )=sup {µ(f )|f ∈C (X ),0≤f ≤1,f =0on X \U }.Within RCA 0this supremum need not exist as a real number.(Indeed,the existence of µ(U )for all open sets U is equivalent to ACA 0over RCA 0.)Therefore,when working within RCA 0,we interpret assertions about µ(U )in a “virtual”or comparative sense.For example,µ(U )≤µ(V )is taken to mean that for all >0and all f ∈C (X )with 0≤f ≤1and f =0on X \U ,there exists g ∈C (X )with 0≤g ≤1and g =0on X \V such that µ(f )≤µ(g )+ .See also [26].Some basic properties of Lebesgue measure are easily proved in RCA 0.For instance,it is straightforward to show that the Lebesgue measure of the union of a finite set of pairwise disjoint open intervals is equal to the sum of the lengths of the intervals.We define L 1(X,µ)to be the completion of C (X )under the L 1-norm given by f 1=µ(|f |).(For the precise definitions,see [5]and[26].)In RCA 0we see that L 1(X,µ)is a separable Banach space,but to assert within RCA 0that points of the Banach space L 1(X,µ)represent measurable functions f :X →R is problematic.We shall comment further on this question in section 4below.Lemma 2.2.The following is provable in RCA 0.If U n ,n ∈N ,is a sequence of open sets,then µ∞ n =0U n ≥lim k →∞µ k n =0U n .Proof.Trivial.Lemma 2.3.The following is provable in RCA 0.If U 0,U 1,...,U k is a finite,pairwise disjoint sequence of open sets,then µ k n =0U n ≥k n =0µ(U n ).Proof.Trivial.An open set is said to be connected if it is not the union of two disjoint nonempty open sets.Let us say that a compact separable metric space X is nice if for all sufficiently small δ>0and all x ∈X ,the open ballB (x,δ)={y ∈X |d (x,y )<δ}VITALI’S THEOREM AND WWKL4 is connected.Such aδis called a modulus of niceness for X.For example,the unit interval[0,1]and the n-cube[0,1]n are nice, but the Cantor space2N is not nice.Theorem2.4(disjoint countable additivity).The following is prov-able in RCA0.Assume that X is nice.If U n,n∈N,is a pairwise disjoint sequence of open sets in X,thenµ∞n=0U n=∞n=0µ(U n).Proof.Put U= ∞n=0U n.Note that U is an open set.By Lemmas2.2and2.3,we have in RCA0thatµ(U)≥ ∞n=0µ(U n).It remainsto prove in RCA0thatµ(U)≤ ∞n=0µ(U n).Let f∈C(X)be suchthat0≤f≤1and f=0on X\U.It suffices to prove thatµ(f)≤∞n=0µ(U n).Claim1:There is a sequence of continuous functions f n:X→R, n∈N,defined by f n(x)=f(x)for all x∈U n,f n(x)=0for all x∈X\U n.To prove this in RCA0,recall from[6]or[20]that a code for a continuous function g from X to Y is a collection G of quadruples (a,r,b,s)with certain properties,the idea being that d(a,x)<r im-plies d(b,g(x))≤s.Also,a code for an open set U is a collection of pairs(a,r)with certain properties,the idea being that d(a,x)<r im-plies x∈U.In this case we write(a,r)<U to mean that d(a,b)+r<s for some(b,s)belonging to the code of U.Now let F be a code for f:X→R.Define a sequence of codes F n,n∈N,by putting(a,r,b,s) into F n if and only if1.(a,r,b,s)belongs to F and(a,r)<U n,or2.(a,r,b,s)belongs to F and b−s≤0≤b+s,or3.b−s≤0≤b+s and(a,r)<U m for some m=n.It is straightforward to verify that F n is a code for f n as required by claim1.Claim2:The sequence f n,n∈N,is a sequence of elements of C(X). To prove this in RCA0,we must show that the sequence of f n’s has a sequence of moduli of uniform continuity.Let h:N→N be a modulus of uniform continuity for f,and let k be so large that1/2k is a modulus of niceness for X.We shall show that h :N→N defined by h (m)=max(h(m),k)is a modulus of uniform continuity for all of the f n’s.Let x,y∈X and m∈N be such that d(x,y)<1/2h (m). To show that|f n(x)−f n(y)|<1/2m,we consider three cases.Case1:VITALI’S THEOREM AND WWKL5 x,y∈U n.In this case we have|f n(x)−f n(y)|=|f(x)−f(y)|<1VITALI’S THEOREM AND WWKL 6From (1)we see that for each >0there exists k such that µ(f )− ≤ kn =0µ(f n ).Thus we haveµ(f )− ≤kn =0µ(f n )≤k n =0µ(U n )≤∞ n =0µ(U n ).Since this holds for all >0,it follows that µ(f )≤ ∞n =0µ(U n ).Thus µ(U )≤ ∞n =0µ(U n )and the proof of Theorem 2.4is complete.Corollary 2.5.The following is provable in RCA 0.If (a n ,b n ),n ∈N is a sequence of pairwise disjoint open intervals,then µL ∞ n =0(a n ,b n ) =∞ n =0|a n −b n |.Proof.This is a special case of Theorem 2.4.Remark 2.6.Theorem 2.4fails if we drop the assumption that X is nice.Indeed,let µC be the familiar “fair coin”measure on the Cantor space X =2N ,given by µC ({x |x (n )=i })=1/2for all n ∈N and i ∈{0,1}.It can be shown that disjoint finite additivity for µC is equivalent to WWKL over RCA 0.(WWKL is defined and discussed in the next section.)In particular,disjoint finite additivity for µC is not provable in RCA 0.3.Measure Theory in WWKL 0Yu and Simpson [26]introduced a subsystem of second order arith-metic known as WWKL 0,consisting of RCA 0plus the following axiom:if T is a subtree of 2<N with no infinite path,thenlim n →∞|{σ∈T |length(σ)=n }|VITALI’S THEOREM AND WWKL 7see also Sieg [18].In this sense,every mathematical theorem provable in WKL 0or WWKL 0is finitistically reducible in the sense of Hilbert’s Program;see [19,6,20].Remark 3.2.The study of ω-models of WWKL 0is closely related to the theory of 1-random sequences,as initiated by Martin-L¨o f [16]and continued by Kuˇc era [7,13,14,15].At the time of writing of [26],Yu and Simpson were unaware of this work of Martin-L¨o f and Kuˇc era.The purpose of this section and the next is to review and extend the results of [26]and [21]concerning measure theory in WWKL 0.A measure µ:C (X )→R on a compact separable metric space X is said to be countably additive if µ∞ n =0U n =lim k →∞µ k n =0U n for any sequence of open sets U n ,n ∈N ,in X .The following theorem is implicit in [26]and [21].Theorem 3.3.The following assertions are pairwise equivalent over RCA 0.1.WWKL.2.(countable additivity)For any compact separable metric space Xand any measure µon X ,µis countably additive.3.For any covering of the closed unit interval [0,1]by a sequence of open intervals (a n ,b n ),n ∈N ,we have ∞n =0|a n −b n |≥1.Proof.That WWKL implies statement 2is proved in Theorem 1of [26].The implication 2→3is trivial.It remains to prove that statement 3implies WWKL.Reasoning in RCA 0,let T be a subtree of 2<N with no infinite path.PutT ={σ i |σ∈T,σ i /∈T,i <2}.For σ∈2<N put lh(σ)=length of σanda σ=lh(σ)−1n =0σ(n )2lh(σ).Note that |a σ−b σ|=1/2lh(σ).Note also that σ,τ∈2<N are incompa-rable if and only if (a σ,b σ)∩(a τ,b τ)=∅.In particular,the intervals (a τ,b τ),τ∈ T,are pairwise disjoint and cover [0,1)except for some of the points a σ,σ∈2<N .Fix >0and put c σ=a σ− /4lh(σ),d σ=a σ+ /4lh(σ).Then the open intervals (a τ,b τ),τ∈ T,(c σ,d σ),VITALI’S THEOREM AND WWKL 8σ∈2<N and (1− ,1+ )form a covering of [0,1].Applying statement 3,we see that the sum of the lengths of these intervals is ≥1,i.e. τ∈ T12lh(τ)=1.From this,equation (2)follows easily.Thus we have proved that state-ment 3implies WWKL.This completes the proof of the theorem.It is possible to take a somewhat different approach to measure the-ory in RCA 0.Note that the definition of µ(U )that we have given (Definition 2.1)is extensional in RCA 0.This means that if U and V contain the same points then µ(U )=µ(V ),provably in RCA 0.An alternative approach is the intensional one,embodied in Definition 3.4below.Recall that an open set U is given in RCA 0as a sequence of basic open sets.In the case of the real line,basic open sets are just intervals with rational endpoints.Definition 3.4(intensional Lebesgue measure).We make this defini-tion in RCA 0.Let U = (a n ,b n ) n ∈N be an open set in the real line.The intensional Lebesgue measure of U is defined by µI (U )=lim k →∞µL k n =0(a n ,b n ) .Theorem 3.5.It is provable in RCA 0that intensional Lebesgue mea-sure µI is countably additive on open sets.In other words,if U n ,n ∈N ,is a sequence of open sets,then µI∞ n =0U n =lim k →∞µI k n =0U n .Proof.This is immediate from the definitions,since ∞n =0U n is defined as the union of the sequences of basic open intervals in U n ,n ∈N .Returning now to WWKL 0,we can prove that intensional Lebesgue measure concides with extensional Lebesgue measure.In fact,we have the following easy result.Theorem 3.6.The following assertions are pairwise equivalent over RCA 0.VITALI’S THEOREM AND WWKL91.WWKL.2.µI(U)=µL(U)for all open sets U⊆[0,1].3.µI is extensional on open sets.In other words,for all open setsU,V⊆[0,1],if∀x(x∈U↔x∈V)thenµI(U)=µI(V).4.For all open sets U⊇[0,1],we haveµI(U)≥1.Proof.This is immediate from Theorems3.3and3.5.4.More Measure Theory in WWKL0In this section we show that a good theory of measurable functions and measurable sets can be developed within WWKL0.Wefirst consider pointwise values of measurable functions.Our ap-proach is due to Yu[21,24].Let X be a compact separable metric space and letµ:C(X)→R be a positive Borel probability measure on X.Recall that L1(X,µ)is defined within RCA0as the completion of C(X)under the L1-norm.In what sense or to what extent can we prove that a point of the Banach space L1(X,µ)gives rise to a function f:X→R?In order to answer this question,recall that f∈L1(X,µ)is given by a sequence f n∈C(X),n∈N,which converges to f in the L1-norm; more preciselyf n−f n+1 1≤12nfor all n,and|f m(x)−f m (x)|≤12k.VITALI’S THEOREM AND WWKL10 Then for x∈C fnand m ≥m≥n+2k+2we have|f m(x)−f m (x)|≤m −1i=m|f i(x)−f i+1(x)|≤∞i=n+2k+2|f i(x)−f i+1(x)|≤12k.We need a lemma:Lemma4.2.The following is provable in RCA0.For f∈C(X)and >0,we haveµ({x|f(x)> })≤ f 1/ .Proof.Put U={x|f(x)> }.Note that U is an open set.If g∈C(X),0≤g≤1,g=0on X\U,then we have g≤|f|, hence µ(g)=µ( g)≤µ(|f|)= f 1,henceµ(g)≤ f 1/ .Thus µ(U)≤ f 1/ and the lemma is proved.Using this lemma we haveµ(X\C fnk )=µx∞i=n+2k+2|f i(x)−f i+1(x)|>12i=1VITALI’S THEOREM AND WWKL 11hence by countable additivityµ(X \C f n )≤∞ k =0µ(X \C f nk )≤∞k =012n .This completes the proof of Proposition 4.1.Remark 4.3(Yu [21]).In accordance with Proposition 4.1,forf = f n n ∈N ∈L 1(X,µ)and x ∈ ∞n =0C f n ,we define f (x )=lim n →∞f n (x ).Thus we see thatf (x )is defined on an F σset of measure 1.Moreover,if f =g in L 1(X,µ),i.e.if f −g 1=0,then f (x )=g (x )for all x in an F σset of measure 1.These facts are provable in WWKL 0.We now turn to a discussion of measurable sets within WWKL 0.We sketch two approaches to this topic.Our first approach is to identify measurable sets with their characteristic functions in L 1(X,µ),accord-ing to the following definition.Definition 4.4.This definition is made within WWKL 0.We say that f ∈L 1(X,µ)is a measurable characteristic function if there exists a sequence of closed setsC 0⊆C 1⊆···⊆C n ⊆...,n ∈N ,such that µ(X \C n )≤1/2n for all n ,and f (x )∈{0,1}for all x ∈ ∞n =0C n .Here f (x )is as defined in Remark 4.3.Our second approach is more direct,but in its present form it applies only to certain specific situations.For concreteness we consider only Lebesgue measure µL on the unit interval [0,1].Our discussion can easily be extended to Lebesgue measure on the n -cube [0,1]n ,the “fair coin”measure on the Cantor space 2N ,etc .Definition 4.5.The following definition is made within RCA 0.Let S be the Boolean algebra of finite unions of intervals in [0,1]with rational endpoints.For E 1,E 2∈S we define the distanced (E 1,E 2)=µL ((E 1\E 2)∪(E 2\E 1)),the Lebesgue measure of the symmetric difference of E 1and E 2.Thus d is a pseudometric on S ,and we define S to be the compact separable metric space which is the completion of S under d .A point E ∈ S is called a Lebesgue measurable set in [0,1].VITALI’S THEOREM AND WWKL 12We shall show that these two approaches to measurable sets (Defi-nitions 4.4and 4.5)are equivalent in WWKL 0.Begin by defining an isometry χ:S →L 1([0,1],µL )as follows.For 0≤a <b ≤1defineχ([a,b ])= f n n ∈N ∈L 1([0,1],µL )where f n (0)=f n (a )=f n (b )=f n (1)=0and f n a +b −a 2n +1=1and f n ∈C ([0,1])is piecewise linear otherwise.Thus χ([a,b ])is a measurable characteristic function corresponding to the interval [a,b ].For 0≤a 1<b 1<···<a k <b k ≤1defineχ([a 1,b 1]∪···∪[a k ,b k ])=χ([a 1,b 1])+···+χ([a k ,b k ]).It is straightforward to prove in RCA 0that χextends to an isometryχ: S→L 1([0,1],µL ).Proposition 4.6.The following is provable in WWKL 0.If E ∈ Sis a Lebesgue measurable set,then χ(E )is a measurable characteristic function in L 1([0,1],µL ).Conversely,given a measurable characteristic function f ∈L 1([0,1],µL ),we can find E ∈ Ssuch that χ(E )=f in L 1([0,1],µL ).Proof.It is straightforward to prove in RCA 0that for all E ∈ S , χ(E )is a measurable characteristic function.For the converse,let f be a measurable characteristic function.By Definition 4.4we have that f (x )∈{0,1}for all x ∈ ∞n =0C n .ByProposition 4.1we have |f (x )−f 3n +3(x )|<1/2n for all x ∈C f n .Put U n ={x ||f 3n +3(x )−1|<1/2n }and V n ={x ||f 3n +3(x )|<1/2n }.Then for n ≥1,U n and V n are disjoint open sets.Moreover C n ∩C f n ⊆U n ∪V n ,hence µL (U n ∪V n )≥1−1/2n −1.By countable additivity(Theorem 3.3)we can effectively find E n ,F n ∈S such that E n ⊆U n and F n ⊆V n and µL (E n ∪F n )≥1−1/2n −2.Put E = E n +5 n ∈N .It is straightforward to show that E belongs to S and that χ(E )=f in L 1([0,1],µL ).This completes the proof.Remark 4.7.We have presented two notions of Lebesgue measurable set and shown that they are equivalent in WWKL 0.Our first notion (Definition 4.4)has the advantage of generality in that it applies to any measure on a compact separable metric space.Our second no-tion (Definition 4.5)is advantageous in other ways,namely it is more straightforward and works well in RCA 0.It would be desirable to find a single definition which combines all of these advantages.VITALI’S THEOREM AND WWKL 135.Vitali’s TheoremLet S be a collection of sets.A point x is said to be Vitali covered by S if for all >0there exists S ∈S such that x ∈S and the diameter of S is less than .The Vitali Covering Theorem in its simplest form says the following:if I is a sequence of intervals which Vitali covers an interval E in the real line,then I contains a countable,pairwise disjoint set of intervals I n ,n ∈N ,such that ∞n =0I n covers E except for a set of Lebesgue measure 0.The purpose of this section is to show that various forms of the Vitali Covering Theorem are provable in WWKL 0and in fact equivalent to WWKL over RCA 0.Throughout this section,we use µto denote Lebesgue measure.Lemma 5.1(Baby Vitali Lemma).The following is provable in RCA 0.Let I 0,...,I n be a finite sequence of intervals.Then we can find a pair-wise disjoint subsequence I k 0,...,I k m such thatµ(I k 0∪···∪I k m )≥1VITALI’S THEOREM AND WWKL 14I =[2a −b,2b −a ].)Thusµ(I 0∪···∪I n )≤µ(I k 0∪···∪I k m )≤µ(I k 0)+···+µ(I k m )=3µ(I k 0)+···+3µ(I k m )=3µ(I k 0∪···∪I k m )and the lemma is proved.Lemma 5.2.The following is provable in WWKL 0.Let E be an in-terval,and let I n ,n ∈N ,be a sequence of intervals.If E ⊆ ∞n =0I n ,then µ(E )≤lim k →∞µ k n =0I n .Proof.If the intervals I n are open,then the desired conclusion follows immediately from countable additivity (Theorem 3.3).Otherwise,fix >0and let I n be an open interval with the same midpoint as I n andµ(I n )=µ(I n )+µ(E \A ).(3)VITALI’S THEOREM AND WWKL 15To prove the claim,use Lemma 5.2and the Vitali property to find a finite set of intervals J 1,...,J l ∈I such that J 1,...,J l ⊆E \A andµ(E \(A ∪J 1∪···∪J l ))<13µ(J 1∪···∪J l ).We then have µ(E \(A ∪I 1∪···∪I k ))<212µ(E \A )≤212µ(E \A )=34nµ(E ).Then by countable additivity we have µ E \∞ n =1A n =0and the lemma is proved.Remark 5.4.It is straightforward to generalize the previous lemma to the case of a Vitali covering of the n -cube [0,1]n by closed balls or n -dimensional cubes.In the case of closed balls,the constant 3in the Baby Vitali Lemma 5.1is replaced by 3n .Theorem 5.5.The Vitali theorem for the interval [0,1](as stated in Lemma 5.3)is equivalent to WWKL over RCA 0.Proof.Lemma 5.3shows that,in RCA 0,WWKL implies the Vitali theorem for intervals.It remains to prove within RCA 0that the Vitali theorem for [0,1]implies WWKL.Instead of proving WWKL,we shall prove the equivalent statement 3.3.3.Reasoning in RCA 0,suppose thatVITALI’S THEOREM AND WWKL 16(a n ,b n ),n ∈N ,is a sequence of open intervals which covers [0,1].Let I be the countable set of intervals (a nki ,b nki )= a n +i k(b n −a n ) where i,k,n ∈N and 0≤i <k .Then I is a Vitali covering of [0,1].By the Vitali theorem for intervals,I contains a sequence of pairwise disjoint intervals I m ,m ∈N ,such that µ ∞ m =0I m ≥1.By disjoint countable additivity (Corollary 2.5),we have∞m =0µ(I m )≥1.From this it follows easily that∞n =0|a n −b n |≥1.Thus we have 3.3.3and our theorem is proved.We now turn to Vitali’s theorem for measurable sets.Recall our discussion of measurable sets in section 4.A sequence of intervals I is said to almost Vitali cover a Lebesgue measurable set E ⊆[0,1]if for all >0we have µL (E \O )=0,where O = {I |I ∈I ,diam(I )< }.Theorem 5.6.The following is provable in WWKL 0.Let E ⊆[0,1]be a Lebesgue measurable set with µ(E )>0.Let I be a sequence of intervals which almost Vitali covers E .Then I contains a pairwise disjoint sequence of intervals I n ,n ∈N ,such that µ E \∞ n =0I n =0.Proof.The proof of this theorem is similar to that of Lemma 5.3.The only modification needed is in the proof of the claim.Recall from Definition 4.5that E =lim n →∞E n where each E n is a finite union of intervals in [0,1].Fix m so large thatµ((E \E m )∪(E m \E ))<1VITALI’S THEOREM AND WWKL 17andµ(E m \(A ∪J 1∪···∪J l ))<136µ(E \A )<236µ(E \A )≤236µ(E \A )<236µ(E \A )=3,The Baire category theorem in weak subsystems of second order arith-metic ,Journal of Symbolic Logic 58(1993),557–578.7.O.Demuth and A.Kuˇc era,Remarks on constructive mathematical analysis ,[3],1979,pp.81–129.8.H.-D.Ebbinghaus,G.H.M¨u ller,and G.E.Sacks (eds.),Recursion Theory Week ,Lecture Notes in Mathematics,no.1141,Springer-Verlag,1985,IX +418pages.VITALI’S THEOREM AND WWKL189.Harvey Friedman,unpublished communication to Leo Harrington,1977.10.Harvey Friedman,Stephen G.Simpson,and Rick L.Smith,Countable algebraand set existence axioms,Annals of Pure and Applied Logic25(1983),141–181.11.,Randomness and generalizations offixed point free functions,[1],1990, pp.245–254.15.,Subsystems of Second Order Arithmetic,Perspectives in Mathematical Logic,Springer-Verlag,1998,XIV+445pages.21.Xiaokang Yu,Measure Theory in Weak Subsystems of Second Order Arithmetic,Ph.D.thesis,Pennsylvania State University,1987,vii+73pages.22.,Riesz representation theorem,Borel measures,and subsystems of sec-ond order arithmetic,Annals of Pure and Applied Logic59(1993),65–78. 24.,A study of singular points and supports of measures in reverse mathe-matics,Annals of Pure and Applied Logic79(1996),211–219.26.Xiaokang Yu and Stephen G.Simpson,Measure theory and weak K¨o nig’slemma,Archive for Mathematical Logic30(1990),171–180.E-mail address:dkb5@,giusto@dm.unito.it,simpson@ The Pennsylvania State University。

  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
j =1....,N
For any partition of M = m1 + m2 + · · · + mN , we construct a multi-Wro´ nski matrix W1 (m1 ) W2 (m2 ) W := . . . . WN (mN ) Now we are ready to present the following:
which are compatible equations by means of the equations satisfied by ξk and Hk . 3
3. Using Crum type ideas [1] one can iterate this Levy transformation. However now there is a difference with respect to the iteration of the Darboux transformation of the 1-dimensional Schr¨ odinger equation: we have N different elementary Levy’s transformations {Li }i=1,...,N . If one performs less than N iterations or more than N iterations, say Li1 · · · LiM with {1, . . . , N } ⊂ {i1 , . . . , iM }, one gets non symmetric formulae in which the initial β ’s and its derivatives appear explicitly. However, if in the latter case we have {1, . . . , N } ⊂ {i1 , . . . , iM }, that is we have perform at least one Levy transformation in each spatial direction we obtain formulae only in terms of Wro´ nski determinants of the wave functions with no β ’s appearing explicitly. To present our main result, we introduce some convenient notations. First i we define ∂i := ∂/∂ui . Second, for any set of functions {ξj }i=1,...,M we denote
A Darboux type transformation for this system was found by Levy [10, 5, 9]. In fact, in [10] the transformation is constructed only for two-dimensional surfaces, N = 2, being the Darboux equations in this case trivial and Levy 2
j =1,...,M
by Wj (n) the following Wro´ nski matrix 1 ξj ∂j ξ 1 j 1 M Wj (n) := Wj (ξj , . . . , ξj ) := . . .
2 ξj 2 ∂j ξj . . .
... ...
M ξj M ∂j ξj . . .
involving suitable P -dimensional vectors X i , tangent to the coordinate lines. The so called Lam´ e coefficients satisfy ∂Hj = βij Hi , ∂ui i, j = 1, . . . , N, i = j, (3)
arXiv:dg-ga/9707013v1 21 Jul 1997
Sequences of Levy Transformations and Multi-Wro´ nski Determinant Solutions of the Darboux System
Q. P. Liu∗† and Manuel Ma˜ nas‡ Departamento de F´ ısica Te´ orica, Universidad Complutense, E28040-Madrid, Spain.
Ω(ξ, H ) Hi [1] = − , ξi Hk [1] = Hk − βik Ω(ξ, H ) , ξi
1 ∂X i ∂ξi ξi − Xi , X i [1] = ξi ∂ui ∂ui 1 X k [1] = (ξi X k − ξk X i ), ξi

n−1 1 n−1 M 2 ∂j ξ j ∂ n−1 ξ j . . . ∂j ξj
.
Theorem. Given M functions {ξij } i=1,...,N and X i = (Xi1 , . . . , XiP )t , i = 1, . . . , N , all of them solutions of (2) and Hi , i = 1, . . . , N , solutions of (3), for given βij , then new solutions X i [M ], Hi [M ] and βij [M ] are defined by: Xiℓ [M ] = where Xℓ i = W vℓ , ∂imi ξi ∂imi Xiℓ 4 Xℓ i , |W| Hi [M ] = − |Hi | , |W| βij [M ] = − |Wij | , |W|
On leave of absence from Beijing Graduate School, CUMT, Beijing 100083, China Supported by Beca para estancias temporales de doctores y tecn´ ologos extranjeros en Espa˜ na: SB95-A01722297 ‡ Partially supported by CICYT: proyecto PB95–0401
only presents the transformation for the points of the surface. However, in [9] the Levy transformation is extended to the first non trivial case of Darboux equations, namely N = 3. The extension to arbritary N is straightforward and reads as follows. Given a solution ξj of ∂ξj = βjk ξk , ∂uk for each of the N possible directions in the coordinate space there is a corresponding Levy transformation that reads for the i-th case: x[1] = x − Ω(ξ, H ) X i, ξi
and the points of the surface x can be found by means of ∂x = X i Hi , ∂ui i = 1, . . . , N, (4)
which is equivalent to the more standard Laplace equation ∂2x ∂ ln Hi ∂ x ∂ ln Hj ∂ x = + , ∂ui ∂uj ∂uj ∂ui ∂ui ∂uj i, j = 1, . . . , N, i = j.


1
1. The interaction between Soliton Theory and Geometry is a growing subject. In fact, many systems that appear by geometrical considerations have been studied independently in Soliton Theory, well-known examples include the Liouville and sine-Gordon equations which characterize minimal and pseudo-spherical surfaces, respectively. Another relevant case is given by the the Darboux equations that were solved 12 years ago in its matrix ¯–dressing, by Zakharov and Manakov [14]. generalization, using the ∂ In this note we want to iterate a transformation that preserves the Darboux equations which is known as Levy transformation [10]. 2. The Darboux equations ∂βij = βik βkj , i, j, k = 1, . . . , N, ∂uk
Abstract Sequences of Levy transformations for the Darboux system of conjugates nets in multidimensions are studied. We show that after a suitable number of Levy transformations, with at least a Levy transformation in each direction, we get closed formulae in terms of multiWro´ nski determinants. These formulae are for the tangent vectors, Lam` e coefficients, rotation coefficients and points of the surface.
相关文档
最新文档