Non-highest weight representations of the current algebra $hat{so}(1,n)$, and Laplace Opera
高二英语数学建模方法单选题20题
高二英语数学建模方法单选题20题1.In the process of mathematical modeling, the factor that determines the outcome is called_____.A.independent variableB.dependent variableC.control variableD.extraneous variable答案:B。
本题考查数学建模中的基本术语。
独立变量(independent variable)是指在实验或研究中被研究者主动操纵的变量;因变量dependent variable)是指随着独立变量的变化而变化的变量,在数学建模中决定结果的因素通常是因变量;控制变量(control variable)是指在实验中保持不变的变量;无关变量(extraneous variable)是指与研究目的无关,但可能会影响研究结果的变量。
2.The statement “The value of y depends on the value of x” can be represented by a mathematical model where y is the_____.A.independent variableB.dependent variableC.control variableD.extraneous variable答案:B。
在“y 的值取决于x 的值”这句话中,y 是随着x 的变化而变化的变量,所以y 是因变量。
3.In a mathematical model, the variable that is held constant toobserve the effect on other variables is_____.A.independent variableB.dependent variableC.control variableD.extraneous variable答案:C。
奈奎斯特定理的英文
奈奎斯特定理的英文The Nyquist Theorem, also known as the Nyquist Sampling Theorem, is a fundamental principle in the field of signal processing and telecommunications. It was first formulated by Harry Nyquist in 1928 and later expanded upon by Claude Shannon in his groundbreaking work on information theory.The theorem states that in order to perfectly reconstruct a continuous-time signal from its samples, the sampling rate must be at least twice the highest frequency present in the signal. This minimum rate is referred to as the Nyquist rate. If the sampling rate falls below this threshold, a phenomenon known as aliasing occurs, where the sampled signal becomes a distorted version of the original signal.The importance of the Nyquist Theorem lies in its application to digital signal processing, where analog signals must be converted into digital form for processing and storage. By adhering to the theorem's guidelines, engineers can ensure that the digital representation of an analog signal is accurate and free from aliasing.In practice, the Nyquist Theorem has implications for a wide range of technologies, from audio recording and broadcasting to medical imaging and seismology. It is a cornerstone concept that underpins the design of sampling systems and the development of anti-aliasing filters, which are used to prevent aliasing before the sampling process.The theorem also has a direct impact on the capacity of communication channels. In digital communication systems, understanding the relationship between the sampling rate and the frequency content of signals is crucial for maximizing the amount of information that can be transmitted without error.In summary, the Nyquist Theorem is a foundational principle that guides the process of sampling and reconstructing signals in digital systems. It ensures that high-quality digital representations of analog signals can be achieved, provided that the sampling rate is sufficiently high. This theorem has far-reaching applications and continues to be a key concept in the advancement of digital technology.。
Lie algebras, in Infinite-dimensional Lie algebras and groups, Adv. Ser. in Math. Phys. 7,
C1;1;k g ' L0;k (0)
L1;k (1)
M1;k (1): Combining Theorem 4.6 and the statement (ii), we obtain the statement (i). Q.E.D.
References
H0 (g(0; 1; 1); L0 ;k (0)
Department of Mathematics, Faculty of Science, Kyoto University, Kyoto 606-8502, Japan. Department of Mathematics, Faculty of Science, Osaka University,
[KK] Kac V.G. and Kazhdan D.A., Structure of representations with highest weight of in nite dimensional Lie algebras, Adv. in Math. 34, (1979), 97{108. [KnPZ] Knizhnik V. G., Polyakov A. M. and Zamolodchikov A.B., Fractal structure in 2D quantum gravity, Mod. Phys. Lett. A 3, (1988), 819{826. [KW1] Kac V.G. and Wakimoto M., Modular invariant representations of in nite dimensional Lie algebras and superalgebras, Proc. Natl. Acad. Soc., 35, (1988), 4956{4960. [KW2] Kac V.G. and Wakimoto M., Classi cation of modular invariant representations of ane Lie algebras, in In nite-dimensional Lie algebras and groups, Adv. Ser. in Math. Phys. 7, (1989), 138{177. [KWn] Kac V. G. and Wang W., Vertex operator superalgebras and their representations, Mathematical aspects of conformal and topological eld theories and quantum groups, 161{191, Contemp. Math. 175, Amer. Math. Soc. Providence, RI, (1994). [Mal] Malikov F.G., Verma modules over Kac-Moody algebras of rank 2, Leningrad Math. J., 2, No. 2, (1991), 269{286. [MFF] Malikov F.G., Feigin B.L. and Fuks D.B., Singular vectors in Verma modules over KacMoody algebras, Funkts. Anal. Prilozhen., 20, No. 2, (1988), 25{37. [MW] Mathieu P. and Walton M.A., Fractional-level Kac-Moody Algebras and Nonunitary Coset Conformal Theories, Prog. Theor. Phys. 102, (1990), 229-254. [MP] Moody R.V. and Pianzola A., Lie algebras with triangular decompositions, Wiley-Interscience Publ., New York, 1995. [P] Polyakov A. M., Quantum Gravity in two dimensions, Mod. Phys. Lett. A 2, (1987), 893-898. [Ray] Ray U., A Characterization of Lie superalgebras for a certain class of graded Lie superalgebras, preprint,to appear in Jour. Alg. [RW] Rocha-Caridi A. and Wallach N.R., Highest weight modules over graded Lie algebras: resolutions, ltrations and character formulas, Trans. Amer. Math. Soc. 20, (1983), 133{162. [TUY] Tsuchiya A., Ueno K. and Yamada Y., Conformal eld theory on moduli family of stable curves with gauge symmetry, in Integrable systems in quantum eld theory and statistical mechanics, Adv. Stud. Pure Math. 19, (1989), 459-566. [V] Verlinde E., Fusion rules and modular transformations in 2D conformal eld theory, Nucl. Phys. B 300, (1998), 360-376. (K. Iohara) (Y. Koga)
统计学术语中英文对照
统计学术语中英文对照Absolute deviation 绝对离差Absolute number 绝对数Absolute residuals 绝对残差Acceleration array 加速度立体阵Acceleration in an arbitrary direction 任意方向上的加速度Acceleration normal 法向加速度Acceleration space dimension 加速度空间的维数Acceleration tangential 切向加速度Acceleration vector 加速度向量Acceptable hypothesis 可接受假设Accumulation 累积Accuracy 准确度Actual frequency 实际频数Adaptive estimator 自适应估计量Addition 相加Addition theorem 加法定理Additivity 可加性Adjusted rate 调整率Adjusted value 校正值Admissible error 容许误差Aggregation 聚集性Alternative hypothesis 备择假设Among groups 组间Amounts 总量Analysis of correlation 相关分析Analysis of covariance 协方差分析Analysis of regression 回归分析Analysis of time series 时间序列分析Analysis of variance 方差分析Angular transformation 角转换ANOVA (analysis of variance)方差分析ANOVA Models 方差分析模型Arcing 弧/弧旋Arcsine transformation 反正弦变换Area under the curve 曲线面积AREG 评估从一个时间点到下一个时间点回归相关时的误差ARIMA 季节和非季节性单变量模型的极大似然估计Arithmetic grid paper 算术格纸Arithmetic mean 算术平均数Arrhenius relation 艾恩尼斯关系Assessing fit 拟合的评估Associative laws 结合律Asymmetric distribution 非对称分布Asymptotic bias 渐近偏倚Asymptotic efficiency 渐近效率Asymptotic variance 渐近方差Attributable risk 归因危险度Attribute data 属性资料Attribution 属性Autocorrelation 自相关Autocorrelation of residuals 残差的自相关Average 平均数Average confidence interval length 平均置信区间长度Average growth rate 平均增长率Bar chart 条形图Bar graph 条形图Base period 基期Bayes' theorem Bayes定理Bell-shaped curve 钟形曲线Bernoulli distribution 伯努力分布Best-trim estimator 最好切尾估计量Bias 偏性Binary logistic regression 二元逻辑斯蒂回归Binomial distribution 二项分布Bisquare 双平方Bivariate Correlate 二变量相关Bivariate normal distribution 双变量正态分布Bivariate normal population 双变量正态总体Biweight interval 双权区间Biweight M-estimator 双权M估计量Block 区组/配伍组BMDP(Biomedical puter programs) BMDP统计软件包Boxplots 箱线图/箱尾图Breakdown bound 崩溃界/崩溃点Canonical correlation 典型相关Caption 纵标目Case-control study 病例对照研究Categorical variable 分类变量Catenary 悬链线Cauchy distribution 柯西分布Cause-and-effect relationship 因果关系Cell 单元Censoring 终检Center of symmetry 对称中心Centering and scaling 中心化和定标Central tendency 集中趋势Central value 中心值CHAID -χ2 Automatic Interaction Detector 卡方自动交互检测Chance 机遇Chance error 随机误差Chance variable 随机变量Characteristic equation 特征方程Characteristic root 特征根Characteristic vector 特征向量Chebshev criterion of fit 拟合的切比雪夫准则Chernoff faces 切尔诺夫脸谱图Chi-square test 卡方检验/χ2检验Choleskey deposition 乔洛斯基分解Circle chart 圆图Class interval 组距Class mid-value 组中值Class upper limit 组上限Classified variable 分类变量Cluster analysis 聚类分析Cluster sampling 整群抽样Code 代码Coded data 编码数据Coding 编码Coefficient of contingency 列联系数Coefficient of determination 决定系数Coefficient of multiple correlation 多重相关系数Coefficient of partial correlation 偏相关系数Coefficient of production-moment correlation 积差相关系数Coefficient of rank correlation 等级相关系数Coefficient of regression 回归系数Coefficient of skewness 偏度系数Coefficient of variation 变异系数Cohort study 队列研究Column 列Column effect 列效应Column factor 列因素bination pool 合并binative table 组合表mon factor 共性因子mon regression coefficient 公共回归系数mon value 共同值mon variance 公共方差mon variation 公共变异munality variance 共性方差parability 可比性parison of bathes 批比较parison value 比较值partment model 分部模型passion 伸缩plement of an event 补事件plete association 完全正相关plete dissociation 完全不相关plete statistics 完备统计量pletely randomized design 完全随机化设计posite event 联合事件posite 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 对照Controlled experiments 对照实验Conventional depth 常规深度Convolution 卷积Corrected factor 校正因子Corrected mean 校正均值Correction coefficient 校正系数Correctness 正确性Correlation coefficient 相关系数Correlation index 相关指数Correspondence 对应Counting 计数Counts 计数/频数Covariance 协方差Covariant 共变Cox Regression Cox回归Criteria for fitting 拟合准则Criteria of least squares 最小二乘准则Critical ratio 临界比Critical region 拒绝域Critical value 临界值Cross-over design 交叉设计Cross-section analysis 横断面分析Cross-section survey 横断面调查Crosstabs 交叉表Cross-tabulation table 复合表Cube root 立方根Cumulative distribution function 分布函数Cumulative probability 累计概率Curvature 曲率/弯曲Curvature 曲率Curve fit 曲线拟和Curve fitting 曲线拟合Curvilinear regression 曲线回归Curvilinear relation 曲线关系Cut-and-try method 尝试法Cycle 周期Cyclist 周期性D test D检验Data acquisition 资料收集Data bank 数据库Data capacity 数据容量Data deficiencies 数据缺乏Data handling 数据处理Data manipulation 数据处理Data processing 数据处理Data reduction 数据缩减Data set 数据集Data sources 数据来源Data transformation 数据变换Data validity 数据有效性Data-in 数据输入Data-out 数据输出Dead time 停滞期Degree of freedom 自由度Degree of precision 精密度Degree of reliability 可靠性程度Degression 递减Density function 密度函数Density of data points 数据点的密度Dependent variable 应变量/依变量/因变量Dependent variable 因变量Depth 深度Derivative matrix 导数矩阵Derivative-free methods 无导数方法Design 设计Determinacy 确定性Determinant 行列式Determinant 决定因素Deviation 离差Deviation from average 离均差Diagnostic plot 诊断图Dichotomous variable 二分变量Differential equation 微分方程Direct standardization 直接标准化法Discrete variable 离散型变量DISCRIMINANT 判断Discriminant analysis 判别分析Discriminant coefficient 判别系数Discriminant function 判别值Dispersion 散布/分散度Disproportional 不成比例的Disproportionate sub-class numbers 不成比例次级组含量Distribution free 分布无关性/免分布Distribution shape 分布形状Distribution-free method 任意分布法Distributive laws 分配律Disturbance 随机扰动项Dose response curve 剂量反应曲线Double blind method 双盲法Double blind trial 双盲试验Double exponential distribution 双指数分布Double logarithmic 双对数Downward rank 降秩Dual-space plot 对偶空间图DUD 无导数方法Duncan's new multiple range method 新复极差法/Duncan新法Effect 实验效应Eigenvalue 特征值Eigenvector 特征向量Ellipse 椭圆Empirical distribution 经验分布Empirical probability 经验概率单位Enumeration data 计数资料Equal sun-class number 相等次级组含量Equally likely 等可能Equivariance 同变性Error 误差/错误Error of estimate 估计误差Error type I 第一类错误Error type II 第二类错误Estimand 被估量Estimated error mean squares 估计误差均方Estimated error sum of squares 估计误差平方和Euclidean distance 欧式距离Event 事件Event 事件Exceptional datapoint 异常数据点Expectation plane 期望平面Expectation surface 期望曲面Expected values 期望值Experiment 实验Experimental sampling 试验抽样Experimental unit 试验单位Explanatory variable 说明变量Exploratory data analysis 探索性数据分析Explore Summarize 探索-摘要Exponential curve 指数曲线Exponential growth 指数式增长EXSMOOTH 指数平滑方法Extended fit 扩充拟合Extra parameter 附加参数Extrapolation 外推法Extreme observation 末端观测值Extremes 极端值/极值F distribution F分布F test F检验Factor 因素/因子Factor analysis 因子分析Factor Analysis 因子分析Factor score 因子得分Factorial 阶乘Factorial design 析因试验设计False negative 假阴性False negative error 假阴性错误Family of distributions 分布族Family of estimators 估计量族Fanning 扇面Fatality rate 病死率Field investigation 现场调查Field survey 现场调查Finite population 有限总体Finite-sample 有限样本First derivative 一阶导数First principal ponent 第一主成分First quartile 第一四分位数Fisher information 费雪信息量Fitted value 拟合值Fitting a curve 曲线拟合Fixed base 定基Fluctuation 随机起伏Forecast 预测Four fold table 四格表Fourth 四分点Fraction blow 左侧比率Fractional error 相对误差Frequency 频率Frequency polygon 频数多边图Frontier point 界限点Function relationship 泛函关系Gamma distribution 伽玛分布Gauss increment 高斯增量Gaussian distribution 高斯分布/正态分布Gauss-Newton increment 高斯-牛顿增量General census 全面普查GENLOG (Generalized liner models) 广义线性模型Geometric mean 几何平均数Gini's mean difference 基尼均差GLM (General liner models) 通用线性模型Goodness of fit 拟和优度/配合度Gradient of determinant 行列式的梯度Graeco-Latin square 希腊拉丁方Grand mean 总均值Gross errors 重大错误Gross-error sensitivity 大错敏感度Group averages 分组平均Grouped data 分组资料Guessed mean 假定平均数Half-life 半衰期Hampel M-estimators 汉佩尔M估计量Happenstance 偶然事件Harmonic mean 调和均数Hazard function 风险均数Hazard rate 风险率Heading 标目Heavy-tailed distribution 重尾分布Hessian array 海森立体阵Heterogeneity 不同质Heterogeneity of variance 方差不齐Hierarchical classification 组内分组Hierarchical clustering method 系统聚类法High-leverage point 高杠杆率点HILOGLINEAR 多维列联表的层次对数线性模型Hinge 折叶点Histogram 直方图Historical cohort study 历史性队列研究Holes 空洞HOMALS 多重响应分析Homogeneity of variance 方差齐性Homogeneity test 齐性检验Huber M-estimators 休伯M估计量Hyperbola 双曲线Hypothesis testing 假设检验Hypothetical universe 假设总体Impossible event 不可能事件Independence 独立性Independent variable 自变量Index 指标/指数Indirect standardization 间接标准化法Individual 个体Inference band 推断带Infinite population 无限总体Infinitely great 无穷大Infinitely small 无穷小Influence curve 影响曲线Information capacity 信息容量Initial condition 初始条件Initial estimate 初始估计值Initial level 最初水平Interaction 交互作用Interaction terms 交互作用项Intercept 截距Interpolation 内插法Interquartile range 四分位距Interval estimation 区间估计Intervals of equal probability 等概率区间Intrinsic curvature 固有曲率Invariance 不变性Inverse matrix 逆矩阵Inverse probability 逆概率Inverse sine transformation 反正弦变换Iteration 迭代Jacobian determinant 雅可比行列式Joint distribution function 分布函数Joint probability 联合概率Joint probability distribution 联合概率分布K means method 逐步聚类法Kaplan-Meier 评估事件的时间长度Kaplan-Merier chart Kaplan-Merier图Kendall's rank correlation Kendall等级相关Kinetic 动力学Kolmogorov-Smirnove test 柯尔莫哥洛夫-斯米尔诺夫检验Kruskal and Wallis test Kruskal及Wallis检验/多样本的秩和检验/H检验Kurtosis 峰度Lack of fit 失拟Ladder of powers 幂阶梯Lag 滞后Large sample 大样本Large sample test 大样本检验Latin square 拉丁方Latin square design 拉丁方设计Leakage 泄漏Least favorable configuration 最不利构形Least favorable distribution 最不利分布Least significant difference 最小显著差法Least square method 最小二乘法Least-absolute-residuals estimates 最小绝对残差估计Least-absolute-residuals fit 最小绝对残差拟合Least-absolute-residuals line 最小绝对残差线Legend 图例L-estimator L估计量L-estimator of location 位置L估计量L-estimator of scale 尺度L估计量Level 水平Life expectance 预期期望寿命Life table 寿命表Life table method 生命表法Light-tailed distribution 轻尾分布Likelihood function 似然函数Likelihood ratio 似然比line graph 线图Linear correlation 直线相关Linear equation 线性方程Linear programming 线性规划Linear regression 直线回归Linear Regression 线性回归Linear trend 线性趋势Loading 载荷Location and scale equivariance 位置尺度同变性Location equivariance 位置同变性Location invariance 位置不变性Location scale family 位置尺度族Log rank test 时序检验Logarithmic curve 对数曲线Logarithmic normal distribution 对数正态分布Logarithmic scale 对数尺度Logarithmic transformation 对数变换Logic check 逻辑检查Logistic distribution 逻辑斯特分布Logit transformation Logit转换LOGLINEAR 多维列联表通用模型Lognormal distribution 对数正态分布Lost function 损失函数Low correlation 低度相关Lower limit 下限Lowest-attained variance 最小可达方差LSD 最小显著差法的简称Lurking variable 潜在变量Main effect 主效应Major heading 主辞标目Marginal density function 边缘密度函数Marginal probability 边缘概率Marginal probability distribution 边缘概率分布Matched data 配对资料Matched distribution 匹配过分布Matching of distribution 分布的匹配Matching of transformation 变换的匹配Mathematical expectation 数学期望Mathematical model 数学模型Maximum L-estimator 极大极小L 估计量Maximum likelihood method 最大似然法Mean 均数Mean squares between groups 组间均方Mean squares within group 组内均方Means (pare means) 均值-均值比较Median 中位数Median effective dose 半数效量Median lethal dose 半数致死量Median polish 中位数平滑Median test 中位数检验Minimal sufficient statistic 最小充分统计量Minimum distance estimation 最小距离估计Minimum effective dose 最小有效量Minimum lethal dose 最小致死量Minimum variance estimator 最小方差估计量MINITAB 统计软件包Minor heading 宾词标目Missing data 缺失值Model specification 模型的确定Modeling Statistics 模型统计Models for outliers 离群值模型Modifying the model 模型的修正Modulus of continuity 连续性模Morbidity 发病率Most favorable configuration 最有利构形Multidimensional Scaling (ASCAL) 多维尺度/多维标度Multinomial Logistic Regression 多项逻辑斯蒂回归Multiple parison 多重比较Multiple correlation 复相关Multiple covariance 多元协方差Multiple linear regression 多元线性回归Multiple response 多重选项Multiple solutions 多解Multiplication theorem 乘法定理Multiresponse 多元响应Multi-stage sampling 多阶段抽样Multivariate T distribution 多元T分布Mutual exclusive 互不相容Mutual independence 互相独立Natural boundary 自然边界Natural dead 自然死亡Natural zero 自然零Negative correlation 负相关Negative linear correlation 负线性相关Negatively skewed 负偏Newman-Keuls method q检验NK method q检验No statistical significance 无统计意义Nominal variable 名义变量Nonconstancy of variability 变异的非定常性Nonlinear regression 非线性相关Nonparametric statistics 非参数统计Nonparametric test 非参数检验Nonparametric tests 非参数检验Normal deviate 正态离差Normal distribution 正态分布Normal equation 正规方程组Normal ranges 正常X围Normal value 正常值Nuisance parameter 多余参数/讨厌参数Null hypothesis 无效假设Numerical variable 数值变量Objective function 目标函数Observation unit 观察单位Observed value 观察值One sided test 单侧检验One-way analysis of variance 单因素方差分析Oneway ANOVA 单因素方差分析Open sequential trial 开放型序贯设计Optrim 优切尾Optrim efficiency 优切尾效率Order statistics 顺序统计量Ordered categories 有序分类Ordinal logistic regression 序数逻辑斯蒂回归Ordinal variable 有序变量Orthogonal basis 正交基Orthogonal design 正交试验设计Orthogonality conditions 正交条件ORTHOPLAN 正交设计Outlier cutoffs 离群值截断点Outliers 极端值OVERALS 多组变量的非线性正规相关Overshoot 迭代过度Paired design 配对设计Paired sample 配对样本Pairwise slopes 成对斜率Parabola 抛物线Parallel tests 平行试验Parameter 参数Parametric statistics 参数统计Parametric test 参数检验Partial correlation 偏相关Partial regression 偏回归Partial sorting 偏排序Partials residuals 偏残差Pattern 模式Pearson curves 皮尔逊曲线Peeling 退层Percent bar graph 百分条形图Percentage 百分比Percentile 百分位数Percentile curves 百分位曲线Periodicity 周期性Permutation 排列P-estimator P估计量Pie graph 饼图Pitman estimator 皮特曼估计量Pivot 枢轴量Planar 平坦Planar assumption 平面的假设PLANCARDS 生成试验的计划卡Point estimation 点估计Poisson distribution 泊松分布Polishing 平滑Polled standard deviation 合并标准差Polled variance 合并方差Polygon 多边图Polynomial 多项式Polynomial curve 多项式曲线Population 总体Population attributable risk 人群归因危险度Positive correlation 正相关Positively skewed 正偏Posterior distribution 后验分布Power of a test 检验效能Precision 精密度Predicted value 预测值Preliminary analysis 预备性分析Principal ponent analysis 主成分分析Prior distribution 先验分布Prior probability 先验概率Probabilistic model 概率模型probability 概率Probability density 概率密度Product moment 乘积矩/协方差Profile trace 截面迹图Proportion 比/构成比Proportion allocation in stratified random sampling 按比例分层随机抽样Proportionate 成比例Proportionate sub-class numbers 成比例次级组含量Prospective study 前瞻性调查Proximities 亲近性Pseudo F test 近似F检验Pseudo model 近似模型Pseudosigma 伪标准差Purposive sampling 有目的抽样QR deposition QR分解Quadratic approximation 二次近似Qualitative classification 属性分类Qualitative method 定性方法Quantile-quantile plot 分位数-分位数图/Q-Q图Quantitative analysis 定量分析Quartile 四分位数Quick Cluster 快速聚类Radix sort 基数排序Random allocation 随机化分组Random blocks design 随机区组设计Random event 随机事件Randomization 随机化Range 极差/全距Rank correlation 等级相关Rank sum test 秩和检验Rank test 秩检验Ranked data 等级资料Rate 比率Ratio 比例Raw data 原始资料Raw residual 原始残差Rayleigh's test 雷氏检验Rayleigh's Z 雷氏Z值Reciprocal 倒数Reciprocal transformation 倒数变换Recording 记录Redescending estimators 回降估计量Reducing dimensions 降维Re-expression 重新表达Reference set 标准组Region of acceptance 接受域Regression coefficient 回归系数Regression sum of square 回归平方和Rejection point 拒绝点Relative dispersion 相对离散度Relative number 相对数Reliability 可靠性Reparametrization 重新设置参数Replication 重复Report Summaries 报告摘要Residual sum of square 剩余平方和Resistance 耐抗性Resistant line 耐抗线Resistant technique 耐抗技术R-estimator of location 位置R估计量R-estimator of scale 尺度R估计量Retrospective study 回顾性调查Ridge trace 岭迹Ridit analysis Ridit分析Rotation 旋转Rounding 舍入Row 行Row effects 行效应Row factor 行因素RXC table RXC表Sample 样本Sample regression coefficient 样本回归系数Sample size 样本量Sample standard deviation 样本标准差Samplingerror 抽样误差SAS(Statistical analysis system ) SAS统计软件包Scale 尺度/量表Scatter diagram 散点图Schematic plot 示意图/简图Score test 计分检验Screening 筛检SEASON 季节分析Second derivative 二阶导数Second principal ponent 第二主成分SEM (Structural equation modeling) 结构化方程模型Semi-logarithmic graph 半对数图Semi-logarithmic paper 半对数格纸Sensitivity curve 敏感度曲线Sequential analysis 贯序分析Sequential data set 顺序数据集Sequential design 贯序设计Sequential method 贯序法Sequential test 贯序检验法Serial tests 系列试验Short-cut method 简捷法Sigmoid curve S形曲线Sign function 正负号函数Sign test 符号检验Signed rank 符号秩Significance test 显著性检验Significant figure 有效数字Simple cluster sampling 简单整群抽样Simple correlation 简单相关Simple random sampling 简单随机抽样Simple regression 简单回归simple table 简单表Sine estimator 正弦估计量Single-valued estimate 单值估计Singular matrix 奇异矩阵Skewed distribution 偏斜分布Skewness 偏度Slash distribution 斜线分布Slope 斜率Smirnov test 斯米尔诺夫检验Source of variation 变异来源Spearman rank correlation 斯皮尔曼等级相关Specific factor 特殊因子Specific factor variance 特殊因子方差Spectra 频谱Spherical distribution 球型正态分布Spread 展布SPSS(Statistical package for the social science) SPSS统计软件包Spurious correlation 假性相关Square root transformation 平方根变换Stabilizing variance 稳定方差Standard deviation 标准差Standard error 标准误Standard error of difference 差别的标准误Standard error of estimate 标准估计误差Standard error of rate 率的标准误Standard normal distribution 标准正态分布Standardization 标准化Starting value 起始值Statistic 统计量Statistical control 统计控制Statistical graph 统计图Statistical inference 统计推断Statistical table 统计表Steepest descent 最速下降法Stem and leaf display 茎叶图Step factor 步长因子Stepwise regression 逐步回归Storage 存Strata 层(复数)Stratified sampling 分层抽样Stratified sampling 分层抽样Strength 强度Stringency 严密性Structural relationship 结构关系Studentized residual 学生化残差/t化残差Sub-class numbers 次级组含量Subdividing 分割Sufficient statistic 充分统计量Sum of products 积和Sum of squares 离差平方和Sum of squares about regression 回归平方和Sum of squares between groups 组间平方和Sum of squares of partial regression 偏回归平方和Sure event 必然事件Survey 调查Survival 生存分析Survival rate 生存率Suspended root gram 悬吊根图Symmetry 对称Systematic error 系统误差Systematic sampling 系统抽样Tags 标签Tail area 尾部面积Tail length 尾长Tail weight 尾重Tangent line 切线Target distribution 目标分布Taylor series 泰勒级数Tendency of dispersion 离散趋势Testing of hypotheses 假设检验Theoretical frequency 理论频数Time series 时间序列Tolerance interval 容忍区间Tolerance lower limit 容忍下限Tolerance upper limit 容忍上限Torsion 扰率Total sum of square 总平方和Total variation 总变异Transformation 转换Treatment 处理Trend 趋势Trend of percentage 百分比趋势Trial 试验Trial and error method 试错法Tuning constant 细调常数Two sided test 双向检验Two-stage least squares 二阶最小平方Two-stage sampling 二阶段抽样Two-tailed test 双侧检验Two-way analysis of variance 双因素方差分析Two-way table 双向表Type I error 一类错误/α错误Type II error 二类错误/β错误UMVU 方差一致最小无偏估计简称Unbiased estimate 无偏估计Unconstrained nonlinear regression 无约束非线性回归Unequal subclass number 不等次级组含量Ungrouped data 不分组资料Uniform coordinate均匀坐标Uniform distribution 均匀分布Uniformly minimum variance unbiased estimate 方差一致最小无偏估计Unit 单元Unordered categories 无序分类Upper limit 上限Upward rank 升秩Vague concept 模糊概念Validity 有效性VARP (Variance ponent estimation) 方差元素估计Variability 变异性Variable 变量Variance 方差Variation 变异Varimax orthogonal rotation 方差最大正交旋转Volume of distribution 容积W test W检验Weibull distribution 威布尔分布Weight 权数Weighted Chi-square test 加权卡方检验/Cochran检验Weighted linear regression method 加权直线回归Weighted mean 加权平均数Weighted mean square 加权平均方差Weighted sum of square 加权平方和Weighting coefficient 权重系数Weighting method 加权法W-estimation W估计量W-estimation of location 位置W估计量Width 宽度Wilcoxon paired test 威斯康星配对法/配对符号秩和检验Wild point 野点/狂点Wild value 野值/狂值Winsorized mean 缩尾均值Withdraw 失访Youden's index 尤登指数Z test Z检验Zero correlation 零相关Z-transformation Z 变换。
Small degree representations of finite Chevalley groups in defining characteristic
Small degree representations offinite Chevalley groups in defining characteristicFrank L¨u beckAugust24,2000AbstractWe determine for all simple simply connected reductive linear algebraic groups defined over afinitefield all irreducible representations in their defining character-istic of degree below some bound.These also give the small degree projective rep-resentations in defining characteristic for the correspondingfinite simple groups.For large rank our bound is proportional to and for rank much higher.The small rank cases are based on extensive computer calculations.1IntroductionIn this note we give lists of projective representations of simple Chevalley groups in their defining characteristic.There are two types of results.First we determine for groups of rank all such representations of degree smaller or equal some bound depending on the type(e.g.,100000for type).In particular this contains a complement to the tables of representations in non-defining characteristic up to degree250given in[7].These data are produced using a collection of computer programs developed by the author.Then we determine for groups of classical type of rank all representations of degree at most for type,respectively for the other types.For large there is a small list and for small this range is easily covered by our tables mentioned above. This extends results by Kleidman and Liebeck[11,5.4.11].Wefix some notation for the whole paper.Let be afinite twisted or non-twisted simple Chevalley group in characteristic.There is an associated connected reductive simple algebraic group over of simply connected type,a Frobenius endomorphism of,a with and an such that:—is defined over via.—For the group of-fixed points with center we have.—is the quotient of the universal covering group of by the-part of its center.So,asking for the projective representations of in characteristic is the same as asking for the representations of in characteristic.These can be constructed by restricting certain representations,called highest weight representations,of the alge-braic group to.This is explained in Section2.In Section3we shortly describe how our computer programs for computing weight multiplicities work.In Section4we describe our main results consisting of lists of small degree representations for groups12Frank L¨u beckof rank at most11.The lists are printed in Appendix6.Finally,in Section5we consider groups of larger rank.Acknowledgements.I wish to thank Kay Magaard,Gunter Malle and Gerhard Hißfor useful discussions about the topic of this note.2Representations in defining characteristicThere are several well readable introductions to this topic,for example Humphreys’survey[9].A detailed reference is Jantzen’s book[10].We recall some of the basic facts.For of simply connected type of rank as in the introduction let be a maximal torus of,its character group and its co-character group.Let be a set of simple roots for this root system andthe coroot corresponding to,.Viewing as Euclidean space we define the fundamental weights as the dual basis of. This is a-basis of(because is simply connected).There is a partial ordering on defined by if and only if is a non-negative linear combination of simple roots.A weight is called dominant if it is a non-negative linear combination of the fundamental weights.The Weyl group of,generated by the reflections along the,acts on.Under this action each -orbit on contains a unique dominant weight.From now on let be afinite dimensional-module over.Considering this as-module there is a direct sum decomposition into weight spaces such that acts by multiplication with on.The set of with is called the set of weights of.The set of weights of is a union of -orbits and for,we have.The following basic results are due to Chevalley.Theorem2.1Let be as above.(a)If is irreducible then the set of weights of contains a(unique)element such that for all weights of we have.This is called the highest weight of ,it is dominant and we have.(b)An irreducible-module is determined up to isomorphism by its highest weight.(c)For each dominant weight there is an irreducible-module with highest weight.A dominant weight is called-restricted iffor.The following result of Steinberg shows how all highest weight modules of can be constructed out of those with-restricted highest weights.Theorem2.2(Steinberg’s tensor product theorem)Let be the Frobenius auto-morphism of,raising elements to their-th power.Twisting the-action on a -module with,,we get a new-module which we denote by.If are-restricted weights thenSmall degree representations in defining characteristic3 Finally we need to recall the relation between the irreducible modules of the alge-braic group and those of thefinite group.This is nicely described by Steinberg in[16,13.3,11.6].Theorem2.3Let and be as in the introduction.We define a subset of dom-inant weights.If is not a Suzuki or Ree group(i.e.,not of type,or )then for.In the case of Suzuki and Ree groups we defineif is a short root(note that is the square root of an odd power of or,respectively,in these cases).Then the restrictions of the-modules with to form a set of pairwise inequivalent representatives of all equivalence classes of irreducible-modules.These results show that the dimensions of the irreducible representations of the groups over are easy to obtain if we know the dimensions of the representa-tions of the algebraic groups for-restricted weights.3Computation of weight multiplicitiesIn this section we sketch how we compute the degree of the representation for given root datum of,highest weight and prime.For almost all it is the same as for the algebraic group over the complex numbers with same root datum,respectively its Lie algebra.In these cases the degree can be computed by a formula of Weyl,see[8, 24.3].In the other cases no formula is known.But in principle there is an algorithm to compute the degree.This is described in[8,Exercise2of26.4]and goes back to Burgoyne[2].This was also used in[6]to handle some cases in exceptional groups. The idea is to construct a so-called Weyl module generically over the integers. By base change this leads to a module for any with the given root datum over any ring,which has as a highest weight.Over or over for almost all this is irreducible and so isomorphic to.In general is a quotient of.To construct one considers the universal enveloping algebra of the com-plex Lie algebra corresponding to the given root datum.It contains a-lattice,the Kostant-form of,which is defined via a Chevalley basis of the Lie algebra.Up to equivalence there is a unique irreducible highest weight representation for with highest weight.Let be a vector of weight(this is unique up to scalar).Then we set.Wefix an ordering of the set of positive roots.Then and have -bases labeled by sequences of non-negative integers.Applying such a basis element of to a vector of weight we get a vector of weight(and similarly for basis vectors of).So,decomposingaccording to the weight spaces,we can describe generating sets of by all non-negative linear combinations of positive roots which are equal to.There is a non-degenerate bilinear form on which can be described via this generating system.Different weight spaces are orthogonal with respect to this form.Let be two coefficient vectors as above such that the corresponding linear combination of the positive roots is the same.Then is again of weight and one defines.4Frank L¨u beckSince the form is nondegenerate we can compute the rank of a weight latticeby computing the rank of the matrix where and are running through all non-negative linear combinations of positive roots for.The dimension of the weight space of is the rank of modulo.The coefficients can be computed by simplifying the element with the help of the commutator relations in,see[8,25.].These involve the structure con-stants for a Chevalley basis of the corresponding Lie algebra which can be computed as described in[3,4.2].In principle this allows the determination of for all,and.But in practice these computations can become very long,already in small examples.There are technical problems like the question how to apply commutator relations most effi-ciently in order to compute the integers.Different strategies change the number of steps in the calculation considerably.But the main problem is that the generating sets for the weight spaces as described above are very ually the number of non-negative linear combinations of positive roots which yield is much larger than the dimension of.By a careful choice of the ordering of the positive roots one can reduce the linear combinations to consider,because for manywith there is a such thatis not a weight of(and hence).But the main improvement we get by using results of Jantzen and Andersen, see[10,II.8.19].The so-called Jantzen sum formula expresses the determinant of the Gram matrix of the bilinear form on the lattice in terms of weight multi-plicities of various with.The weight multiplicities of these can be efficiently computed by Freudenthal’s formula,see[8,22.3].In particular the formula gives exactly the set of primes for which the Weyl module is not isomorphic to .In rare cases it happens that a prime divides such a determinant exactly once-then we know without further calculations that.Using these determinants we compute only parts of the matrices correspond-ing to a subset of its rows and columns until the submatrix has the full rankand the product of its elementary divisors is equal to the known determinant.Then clearly the rank of modulo is the same as the rank of this submatrix modulo.With this approach we never need submatrices of of much larger dimension than.(In[6]the consideration of the matrices was substituted by com-puting somewhat smaller matrices using the action of parabolic subalgebras in cases where has a non-trivial stabilizer in,but these matrices were still big compared to the dimension of the weight spaces.)Of course,our method is limited to representa-tions where no single weight space has a dimension of more than a few thousand.Actually we can also compute by our approach the Jantzenfiltrations of the Weyl modules,see[10,II.8],since we compute the elementary divisors of the matrices and not just their rank.To do this one also needs a sophisticated algorithm to compute the exact elementary divisors of Gram matrices of this size.We developed the algorithm described in see[12]for this purpose.We have a collection of computer programs for doing the calculations described above,which are based on the computer algebra system GAP[14]and the package CHEVIE[5].They are currently in a usable but still experimental state.It is planned to improve their efficiency,to extend their functionality and to put this into a package which will be made available to other users.We postpone a much more detailed version of this very sketchy section until this package is ready.Small degree representations in defining characteristic5 4Representations of small degree for groups of small rankFrom Theorem2.2we see how to construct any highest weight representationof from those with-restricted weights by twisting withfield automorphisms and tensoring.Assume now we are given the type of an irreducible root system and a number .We consider the groups over with this root system for all at once.We want tofind for all primes all-restricted dominant weights such that the highest weight representation of the group over has degree smaller or equal.Our main tool to restrict this question to afinite number of to consider is the following result by Premet,see[13].Recall from Section2that the set of weights of is a union of-orbits and that each-orbit contains a unique representative which is dominant.Theorem4.1If the root system of has different root lengths we assume thatand if is of type we also assume.Then the set of weights of is the union of the-orbits of dominant weights with.The length of the-orbit of a dominant weight is easy to compute by the following remark,see[8,10.3B]for a proof.Remark4.2Let be a dominant weight.Then the stabilizer in the Weyl group of is the parabolic subgroup generated by the reflections along the simple roots for which.Here is an algorithm forfinding a set of candidate highest weights for representa-tions of of rank at most a given bound.Algorithm4.3Input:An irreducible root system and an.Output:A set of dominant weights which contains all such that there is a prime with-restricted and a group over corresponding to the given root system with highest weight representation of degree at most.—To handle the exceptions in Premet’s theorem we put all-,respectively-restricted weights into,if the root system has roots of different lengths.—If not yet considered we compute for all-restricted weights a lower bound for the dimension of for any corresponding by counting the number of its weights (using4.1and4.2).If the bound is at most we put this weight into.—We choose a linear function which takes positive values on the simple roots,(and hence on the fundamental weights).Then we determine recursively all dominant weights with growing value of and compute for them a lower bound for as above.If it is at most we put the weight into. We proceed until wefind an interval such that for all and such that for all dominant with the dimension of is bigger than.Proof.We show that all with have dimension for any:This is clear for which were considered during the algorithm.Thosewhich were not considered are not-restricted and so one coefficient.But then is also a dominant weight(an expression of as linear combination6Frank L¨u beckof the fundamental weights is given by the-th column of the Cartan matrix of theroot system of,this matrix contains’s on the diagonal and non-positive numberselsewhere).We have.Repeating this step recursively for the smaller weight we must eventuallyfind a dominant weight which is-restrictedand not in or for which.Since the orbit lengths of dominant weights already sum up to more than the same holds for.The algorithm stops since for any given bound there are onlyfinitely many dominant weights with less than smaller dominant weights.(If a coefficient of as above is bigger than,,then we have seen that are also dominant for.)In Table1wefix some bound for each irreducible root system of rank at most,respectively in case.Table1:MMType3007001000200040005000700080001000012000 MType200030004000500010000150001800020000 MFor each irreducible root system with rank at most11we used the defined aboveas input for Algorithm4.3.For each weight in the output set and for all primes for which is-restricted we computed the exact weight multiplicities of using the techniques described in Section3.Actually we stopped such a computation whenever we found that thefinal dimension will be larger than.The bounds were chosen such that the results presented below could be com-puted interactively with our programs within about two days using10computers in parallel.The types,,were added upon request of Gunter Malle,who asked to cover in this note all representations of degree for a specific application.Here is our main result.Theorem4.4For any type of root system and number as given in Table1and all primes the Tables6.5to6.52list the-restricted weights such that the representa-tion of the algebraic group over has degree at most.The exact degree of is also given.Furthermore we describe the centers of the groups and the action of the fundamental weights on the center in6.2.This allows to determine the kernels of the representations.The Frobenius-Schur indicators in case are given by6.3.As mentioned above we have actually computed the exact weight multiplicities for the representations appearing in the tables of Section6.It would take too much space to print this in detail but the results are available upon request from the author.Small degree representations in defining characteristic7 The types considered above do not include,i.e.,.The reason is that this case is easy to describe systematically.This seems to be well known but also follows immediately from4.1since all weight multiplicities are at most in this case, see[8,7.2].Remark4.5If is of type then the representation with has degree.For odd the center of is non-trivial and of order.It is contained in the kernel of if and only if is even.5Representations of small degree for groups of large rankIn this section we consider classical groups of large rank.We prove the following result.Theorem5.1Let be of classical type and be the rank of.Set if is of type and otherwise.If then all-restricted weights such that the highest weight representation of has dimension at most are given in the following table.The table also includes the dimensions of these modules.(Note that the case of type and is included in case and.)The fundamental weights are labeled as explained in6.1.type,all,allallallallallNote that the corresponding result for of rank is included in Theorem4.4.8Frank L¨u beckProof.Wefirst prove that the weights which don’t appear in our table correspond to representations of degree larger than.(Case,)Let be a dominant weight.If somethen the-stabilizer of is contained in a reflection subgroup of type, see4.2.Hence,the-orbit of and so is at leastFor and we have.If and then the stabilizer of is contained in a reflection group of type,whose index is for all.This shows that only weights with at most one non-zero coefficient,either or ,can appear in our list.If then,as explained in the proof of4.3,is also a dominant weight.But this has coefficient ing the estimate as above for this smaller weight and Premet’s theorem4.1(note that the considered now is not-restricted)we see again that.A similar argument shows that for weights in our list.So,the only weights which could(and actually do)lead to degrees are,, and.(Case)Here wefind the relevant with very similar arguments as in case and.(Case)Because of the symmetry of the Dynkin diagram the weights and must describe representations of equal degree(in fact they are dual to each other).We can again use very similar arguments as above tofind the relevant weights for our list.(Here we rule out andby observing.)It remains to determine the exact degrees of the in our table.Probably they are known to the experts but we could notfind references for all cases.Type and and for the other types are contained in[11,5.4.11]and[8,25.5,Ex.8].We include a proof for the degrees of and in types,and following hints of K.Magaard and G.Hiß.The idea is to use explicit modules.For all types we know the-modules ,.These are the natural modules of, ,or,respectively.We determine the constituents offor.Note that for these types is self-dual.Since the caseis covered by the references above(is not-restricted),we assume in the rest of the proof that is odd.We will use the following general remarks.If is an indecomposable-module then has the trivial module as direct summand if and only if(here denotes the dual module).In that case there is exactly one trivial direct summand, see[1,3.1.9]for a proof.If is a basis of then has two submodules with basisand with basis.Since we have.(Case)Let,be a basis of the natural symplectic module such that for the symplectic form we have,and for all.Then the vectoris invariant under the symplectic group.If this vector must span the unique trivial direct summand mentioned above.Small degree representations in defining characteristic9 The group contains a subgroup isomorphic to.An element acts on the subspace of spanned by and by its inverse on the subspace spanned by.Hence restricted to this subgroup is isomorphic to.Restricting the representation to this subgroup we find the decomposition, see[4,I,12.].Using the known degrees for case,we see that this contains at most trivial constituents.The similar restriction to a subgroup of type shows by induction that one irreducible constituent of has degree at least .Comparing degrees we see that the three non-trivial constituents in the restriction to must lie in a single constituent of.To summarize,we have at most one non-trivial and two trivial constituents.If there are trivial constituents then one must be in the sockle,i.e.,there must be an invariant vector.This can only be the one we see in the-summand of the restriction to.We can write down such a vector and check that it is not invariant under the whole group ,apply an element which does not leave the space spanned by invariant. We have proved that is irreducible.We can argue very similarly for.If wefind that it is a direct sum of an irreducible and the trivial module found above.If wefind that there is one non-trivial constituent,exactly one trivial constituent in the sockle and at most two trivial constituents.Since in this case the trivial constituent in the sockle is not a direct summand there must be a second trivial constituent in the head,by duality.If has a highest weight vector then is contained in and has weight.Hence.The other constituents of the tensor product must correspond to dominant weights smaller than,there are only two of them,and.We get that the non-trivial constituent of is isomorphic to.(Case)This can be handled by almost exactly the same arguments as the case .Here the trivial submodule is contained in.(Case)In this case we consider the restrictions of to subgroups of type,.This leads to decompositions.Comparing this decomposition for and or,respectively,and using the results for type and in-duction we see as in type that has only one non-trivial and maybe a few trivial constituents.There is an such that and.The decomposition above for this shows that there are at most two trivial constituents.Furthermore,as in type wefind a trivial submodule.Either this is a direct summand(if)then it is the only trivial constituent or otherwise there is a second constituent in the head of .The argument for is again very similar.Thisfinishes the proof.It would be interesting if the degrees in our list could be determined more sys-tematically in the framework of highest weight modules.Then one could work out systematically generalizations of Theorem5.1where the bound is substituted by anyfixed polynomial in.Checking that the statement in Theorem5.1is also true for of type and ,we get the following Corollary.This completes the list in[7]which gives all representations of in non-defining characteristic of degree at most.Corollary5.2For any simple over wefind all-restricted weights of such that has degree in the tables given in Theorems4.4and5.1.10Frank L¨u beck6Appendix:Tables for groups of rank at most 11In this section we give the detailed lists for Theorem 4.4.We start by introducing some notation and describe the centers of the groups and the action of the fundamental weights on the center.6.1Ordering of fundamental weightsFor the irreducible types of root systems we choose the following ordering for thesimple roots ,the corresponding corootsand the fundamental weights ,.(We show the Dynkin diagrams with the node of labeled by .)14571457214145432126.2Action of fundamental weights on the center ofWe give for each irreducible type of root system the values of for in the center of .To compute this we use that is contained in a maximal torus of .Such a is isomorphic to and consists of those withfor all .So,we have to solve a system of equations given by the Cartan matrix of the root system.We denote an element whose multiplicative order is .For we write for the maximal divisor of prime to .For elements we write.is cyclic of order .For the generator we have(,odd)is cyclic of order for odd and for .There is a generator such that(,even)is elementary abelian of order with if is odd and if.There are generators and such that.Here is the element such that.()is cyclic of order if and if.There is a generator such that.()is trivial.6.3Frobenius-Schur indicatorsIf is odd we can determine the Frobenius-Schur indicators of the representations in our lists using a result of Steinberg,see[15,Lemmas78and79].If is of type or of type with odd or of type then the representations and,where the permutation is given by the auto-morphism of order two of the Dynkin diagram,are dual to each other.For other all are self-dual.If is self-dual(and recall that is odd)then its Frobenius-Schur indicator is ‘+’if has no element of order.Otherwise it is the sign of where is the only element of order in,respectively in case with even.This can be computed by6.2.6.4An exampleAs an example how to read the data in this Appendix,let us determine all irreducible representations in defining characteristic for groups of type Spin, which have degree:We apply Theorems2.2and2.3.Wefirst need to compute all factorizations of into factors which appear as degrees in6.22.Although many divisors of appear as degree the only factorization is.Now we have a closer look at6.22.If then there is no irreducible representation of degree.And the listed representations of degree do not correspond to-restricted weights.So,in charac-teristic there are no irreducible representations of this degree.The same conclusion holds for.In this case there is no irreducible represen-tation of degree.If there is of degree and of degree.Ifwefind for any,,the irreducible representationrestricted to of degree.Furthermore we see in6.22 that and have degree.For larger there is no representation of degree in our list.We onlyfindand in case also.In all cases where we have found representations is odd and so the center of and of is of ing6.2we see that for the non-trivial element in the center we have and for.Applying this to the representations found above wefind that only in case is not faithful.From6.3we see that this is also the only representation with Frobenius-Schur indicator‘+’.The others have indicator‘-’.In type the representations andare dual to each other,in particular they have the same dimension.In6.5to6.20we save some space by only including one of such a pair of representations.6.5Case,(Recall the remark before6.5.)deg deg deg6.6Case,(Recall the remark before6.5.)deg deg deg6.7Case,(Recall the remark before6.5.)deg deg deg6.8Case,(Recall the remark before6.5.)deg deg deg6.9Case,(Recall the remark before6.5.)deg deg deg6.10Case,(Recall the remark before6.5.)deg deg deg1(00000000)all966(00010001)22079(10000011)2,3,59(00000001)all966(00010001)32304(00001100)336(00000010)all990(00000012)all2352(00001010)245(00000002)all1008(00001001)52385(00100010)379(10000001)31050(00010001)2,32394(00100010)280(10000001)31135(01000010)72520(00000200)384(00000100)all1214(01000010)22691(00100010)7 126(00001000)all1215(01000010)2,72700(00100010)2,3,7 156(00000011)31278(00000013)52772(00000102)5 165(00000003)all1287(00000005)all2844(00000021)3 240(00000011)31359(10000011)32907(00002000)3 306(01000001)21395(10000003)112922(00000022)5 315(01000001)21440(10000003)112970(00000021)3 387(10000002)51461(01000002)33003(00000006)all 396(10000002)51540(01000002)33060(00010010)5 414(00000020)31554(00000200)33139(00011000)3 495(00000004)all1764(00000110)23168(00000013)5 504(00000101)21864(20000002)113318(00001010)5 540(00000020)31890(00000102)53402(00001010)2,5 630(00000101)21890(00000110)2,33414(02000001)3 684(00100001)71943(20000002)53465(00100002)all 720(00100001)71944(20000002)5,113654(00001002)3 882(00000110)32034(10000011)23744(00010010)3 882(00001001)52043(10000011)53780(00010010)3,5。
代数中常用英语词汇
(0,2) 插值||(0,2) interpolation0#||zero-sharp; 读作零井或零开。
0+||zero-dagger; 读作零正。
1-因子||1-factor3-流形||3-manifold; 又称“三维流形”。
AIC准则||AIC criterion, Akaike information criterionAp 权||Ap-weightA稳定性||A-stability, absolute stabilityA最优设计||A-optimal designBCH 码||BCH code, Bose-Chaudhuri-Hocquenghem codeBIC准则||BIC criterion, Bayesian modification of the AICBMOA函数||analytic function of bounded mean oscillation; 全称“有界平均振动解析函数”。
BMO鞅||BMO martingaleBSD猜想||Birch and Swinnerton-Dyer conjecture; 全称“伯奇与斯温纳顿-戴尔猜想”。
B样条||B-splineC*代数||C*-algebra; 读作“C星代数”。
C0 类函数||function of class C0; 又称“连续函数类”。
CA T准则||CAT criterion, criterion for autoregressiveCM域||CM fieldCN 群||CN-groupCW 复形的同调||homology of CW complexCW复形||CW complexCW复形的同伦群||homotopy group of CW complexesCW剖分||CW decompositionCn 类函数||function of class Cn; 又称“n次连续可微函数类”。
Cp统计量||Cp-statisticC。
NETGEAR N750 Wireless Dual Band Gigabit Router - P
Performance & UseThe NETGEAR Difference - WNDR4300Overview• Faster WiFi speed 300+450 – Up to 750 Mbps †• WiFi range for medium to large homes• Wirelessly access & share USB hard drive & printer • R eadySHARE ® Cloud**—Access & share USB hard drive remotely• ReadySHARE ® Cloud—remote USB access • Apple Time Machine ® compatible • Expand TiVo ® Storage to shared USB drive • ReadySHARE PrinterN750 Wireless Dual Band Gigabit Router—Premium EditionData Sheet WNDR4300The NETGEAR N750 Wireless Dual Band Gigabit Router – Premium Edition (WNDR4300) offers big features for big homes. This router delivers high-performance wireless speeds of up to 300+450 Mbps and the perfect router for medium to large homes with multiple connected devices. The WNDR4300 delivers the speed and reliability needed for applications such as multiple HD video streaming, multi-player gaming and a secure and reliable connection to the Internet. Simultaneous dual band dramatically reduces interference that can cause dropped connections. With four Gigabit Ethernet ports, the WNDR4300 delivers ultra-fast wired connections and includes advanced features such as DLNA ready for playing your media on DLNA TVs and game consoles, ReadySHARE ® Cloud for wireless access and sharing a USB hard drive remotely, ReadySHARE ® Printer for wireless access and sharing a USB printer, and Apple Time Machine compatibility and NETGEAR genie ® home network manager for easy installation and home network management.• Home network manager• Makes any printer AirPrint ® compatible to print from an iPad ® or iPhone ®• MyMedia ™—Find & play media files in your network• EZ Mobile connect—Scan QR code to connect to your home network • For PC, Mac ®, iPhone ®, iPad ®, & Android ™ devicesNETGEAR genie ® Home Networking SimplifiedN750 Wireless Dual Band Gigabit Router—Premium EditionData Sheet WNDR4300Speed makes video streaming better. Speed makes online gaming more fun. Speed makes all your devices really go. And anyplace you need speed, with NETGEAR you got it. Fast download speeds up to 750 Mbps. WiFi with dual band technology providing whole home coverage. Everything you need for a fast connected home.Relive memories and share them with others. Find photos, videos and music stored on a shared USB hard drive and enjoy them on your DLNA TV right from your couch. If it's secure and shared storage access you want NETGEAR has easy ways to do it.Stay connected—with your devices, your media, and your friends. Simultaneous Dual Band WiFi provides two separate WiFi networks—2.4GHz for legacy devices and 5GHz which is less interference-prone for media streaming. Theadvanced QoS technology provides higher priority for media streaming application for smoother HD video streaming and low latency online gaming.SpeedSharingReliable ConnectionsWiFi RangeFASTER WIFI—Up to 300+450 Mbps † DLNA ®—Find & play your media o n DLNA TVs & game consoles SIMULTANEOUS DUAL BAND—Reduces interference for betterconnections to more WiFi devicesRANGE—For medium to large homesGIGABIT WIRED—Ideal for HD gaming & videoREADYSHARE® USB ACCESS— W irelessly access & share USB storageADVANCED QoS—Optimized for smooth HD streaming & gamingREADYSHARE® PRINTER—Wirelessly access & share a USB printer TIME MACHINE® COMPATIBLE— Automatic Mac backup to connected USB hard drive, wirelesslyREADYSHARE® CLOUD— Access & share files on a USB hard driveremotelyBest WiFi Speed Best WiFi Range Share & stream your movies, music, photos Enjoy high-performance connectivity throughout your home Homes come in all shapes and sizes. The NETGEARN750 Wireless Dual Band Gigabit Router provides WiFi connectivity throughout your home for all your Internet enabled devices.N750 Wireless Dual Band Gigabit Router—Premium EditionData Sheet WNDR4300NETGEAR makes it easy to do more with your digital devices. Manage your network with genie ® App— a personal, icon-based dashboard that can control and monitor all your devices. Or, use Push ‘N’Connect to add devices to your WiFi network with a push of a button. And the simple browser-based installation with no CD makes router installation easy using an iPad, tablet, smartphone, or computer.Keep your Internet browsing experience safe andsecure with the free parental controls. It allows you to limit access to certain web sites at certain times. For example no social networking or gaming site access after dinner time. Guest networks create a completely separate WiFi network for your guests’ devices, ensuring they do not have access to your home network or to the shared USB hard drive with all your personal data. Secure WiFi connections offer the highest level of WPA/WPA2 security.With the N750 Wireless Dual Band Gigabit Router—Premium Edition, create a powerful home network for applications such as streaming HD video and multi-player gaming, fast, reliable connection to the Internet and a secure wireless connection.Ease Of UseSecurityApplicationsEASY INSTALL—Easy setup for iPad ®, tablets, smartphones & computersPARENTAL CONTROLS—Safer web surfing for all your connected devicesEMAIL, CHAT, SURF, MUSIC, VIDEO—Enjoy a fast, reliable and secure wireless connection to the InternetNETGEAR GENIE ® APP—Personal dashboard to monitor, control & repair your home networkGUEST NETWORK ACCESS—Separate & secure access for guestsO NLINE GAMING—Optimized for multi-player gaming with no lags PUSH ‘N’ CONNECT —Easy push button WiFi connections (WPS)WIFI & POWER ON/OFF —Convenient power savingsSECURE WIFI CONNECTIONS—Highest level wireless security with WPA/WPA2HD STREAMING—Enjoy high quality HD streamingSimple network management Safeguard your network Ideal UsesMULTIPLE HD STREAMING—Optimized for a smooth, lag-free multiple HD streaming experienceN750 Wireless Dual Band Gigabit Router—Premium EditionData Sheet WNDR4300Connection DiagramUSB 2.0 PortWiFi On/O(front of product)Push ‘N’ Connect with WPS(front of product)Gigabit Ethernet connects to PCs, Mac computers andnotebooksReadySHARE USB access (connects to external,flash, or pen drives)Connects to cable/DSL modem Connects to power Power on/o buttonThis product is packaged with a limited warranty, the acceptance of which is a condition of sale. This product has been tested for quality assurance and it or its components may have been recycled.** ReadySHARE Cloud Service is free until September 1, 2015 with purchase of WNDR4300 Router. Thereafter, annual fees or surcharges may apply.†Maximum wireless signal rate derived from I EEE standard 802.11 specifications. Actual data throughput and wireless coverage will vary. Network conditions and environmental factors, including volume of network traffic, interference, and building construction may lower actual data throughput and wireless coverage. NETGEAR makes no express or implied representations or warranties about this product’s compatibility with any future standards.NETGEAR, the NETGEAR Logo, ReadySHARE, and NETGEAR genie, are trademarks and/or registered trademarks of NETGEAR, Inc. and/or subsidiaries in the United States and/or other countries. Other brand names mentioned herein are for identification purposes only and may be trademarks of their respective holder(s). Information is subject to change without notice. ©2013 NETGEAR, Inc. All rights reserved.NETGEAR,Inc.350E.PlumeriaDrive,SanJose,CA95134-1911USA,1-888-NETGEAR(638-4327),E-mail:****************,D-WNDR4300-1N750 Wireless Dual Band Gigabit Router—Premium EditionData Sheet Package Contents• N 750 Wireless Dual Band Gigabit Router—Premium Edition (WNDR4300)• Ethernet cable• Power adapter, localized to country of sale • Quick install guidePhysical Specifications• Dimensions: 218 x 160 x 35 mm (8.58 x 6.29 x 1.37 in)• Weight: 0.45 kg (.99 lbs)Warranty• Warranty localized to country of saleSupport• 24/7 basic technical support provided for 90 days from date of purchaseTechnical Specifications• W iFi Boost with high powered radio amplifiers • W iFi Transmitters/Receivers (Tx/Rx) - 2x2 (2.4GHz) + 2x2 (5GHz)• Memory: 128 MB Flash and 128 MB RAM • Advanced Quality of Service (QoS)• IPv6 Support (Internet Protocol Version 6)Standards• One (1) USB 2.0 port • I EEE ® 802.11 b/g/n 2.4 GHz • IEEE 802.11 a/n 5.0 GHz• Five (5) 10/100/1000 (1 WAN and 4 LAN) Gigabit Ethernet ports with auto-sensing technologySystem Requirements• B roadband (cable, DSL) Internet service and modem with Ethernet connection • M icrosoft® Windows 7, 8, Vista®, XP®, 2000, Mac OS®, UNIX®, or Linux®• M icrosoft® Internet Explorer® 5.0, Firefox® 2.0, Safari® 1.4, or Google Chrome™ 11.0 browsers or higher • L aptop with 3x3 450 Mbps adapter like Centrino® 6300/5300 for maximum performance • U se with an N900 Wireless Dual Band USB Adapter (WNDA4100) for maximum performanceSecurity• WiFi Protected Access ® (WPA/WPA2—PSK)• Double firewall protection (SPI and NAT firewall)• Denial-of-service (DoS) attack preventionWNDR4300。
卡西欧 IT-G500 手持设备说明书
CASIO IT-G500All-in-one The High-spec Handheld Device for all Applications500The new CASIO IT-G 500: Extremely robust, comfortably ergonomic and just as high-performance as it is multifunctional! A Robust All-in-one Handheld DeviceThe Device at a Glance:Large 4.3” touchscreen (WVGA: 480 x 800 pixels)Ligthweight at 270 g, with an IP 67 protection rating and the ability to withstand drops from heights of up to 1.5 m Ergonomic housing design that is extremely easy to hold Windows® Embedded Handheld 6.5ARM® Cortex® A 9 dual-core processor (1.5 GHz) 3G communication functionality (HSPA and UMTS) WLAN IEEE 802.11 a/b/g/n and Bluetooth TM 4.0 Digital camera (5 MP) with LED flash Built-in RFID/NFC readerHigh-speed laser scanner or 2D CMOS imager, angled by 25° for enhanced ergonomicsApplication Example: Proof of Delivery for a Courier ServiceUsing the CASIO IT-G 500, the delivery agent is able to scan the identification code of the delivered packages quickly and securely. The built-in scanner and the three trigger buttons allow the operator to work comfortably and effortlessly at all times. The device vibrates noticeably to confirm that the scan has been performed successfully. This closes the data capture process. Then the customer can confirm the receipt by providing a signature on the display.500The Best of Both WorldsThe best features from two proven product lines and inno-vative new developments have been combined to create the CASIO IT-G 500. The device is convenient to use, features an excellent 4.3” touch-screen display and achieves the highest levels of performance and durability – all-in-one!The various ranges of CASIO business handheld products are renowned for comfort, ergonomics and performance. The CASIO series targets at the industry, logistics and service sectors. They guarantee the highest level of resistance to external influen-ces and provide the best results with regards to mobile data collection in the fields of transportation logistics, storage and production. In developing the current IT-G 500 model range, CASIO has incorporated state-of-the-art technology for op-timum ease of use in an extremely robust unit with specifi-cations that exceed those of most proven handheld devices.A Focus on Ergonomics: Human-centred DesignThe ergonomic shape, the low weight and the special non-slip grip surface show CASIOs focus on the users operations.Extremely Robust yet ErgonomicThe CASIO IT-G 500 has been developed in accordance with the guidelines of ISO 9241-210 and reflects the principle of human-centred design. Even though the stylish device may not immediately appear highly resistant, it resists to any challenge posed by day-to-day use in rough conditions.The lightweight housing is produced, using durable plastics and can withstand drops onto concrete from a height of 1.5 metres. The device also offers optimum protection against dust and wa-ter according to the IP 67 protection class. It is fully functional at temperatures between -20 °C and +50 °C. Come rain or shine – or even at extremely cold temperatures – the CASIO IT-G 500 has the ideal features to prove its strength in the long-term when used in a tough day-to-day working environment. The non-slip surface at the rear of the device and the special shape of the different battery compartment covers allow the device to be operated easily and without efforts.Pleasantly Easy-to-useWeighing only around 270 g, the versatile and well-balanced device is easy to hold and can be operated like a smartphone via the large 4.3” touch screen. Users can control the device in one of two practical ways – either by using their fingertips or a pen on the display, or by using the convenient keypad which allows data to be entered swiftly. The three trigger buttons for the scanner (on the left, right and centre) facili-tate the use by either left or right-handed people.A Unique DisplayBoasting a 480 x 800 pixel screen, the WVGA display provides a 23% larger user interface for information compa-red with a conventional VGA display.The special display technology from CASIO ensures that the touch-screen can with-stand abrupt impacts and does not break. The display is approximately ten timesmore robust than normal screens.23% Larger Displayand Extremely Robust!Lightweight: Only 270 Grams !500Application Example: Process Optimisation through Photographic Documentation of Loading Conditions Using the built in digital camera of the CASIO IT-G500, the dispatch employee is able to capture the loading process for the lorry in order to ensure it has been loaded safely and in accordance with the regulations. The high sensitivity of the lens, the LED flash and the autofocus function ensure sharp images. They can be immediately transferred wirelessly to the central database. Transportation companies and courier services can provide their customers a track and trace of their goods in a timely, detailed and comprehensive manner.Optimum Equipment for Every TaskThanks to a choice between seven models, the most econo-mical type of the IT-G500 series can be used for each speci-fic task without compromises. One group features a built-in laser scanner, while another is equipped with a CMOSimager. Additionally, both groups are able to achieve quickmobile web access with WLAN or if required, through theuse of WWAN with SIM cards. The table on page 6 indica-tes which models have a built-in a digital camera, RFID/NFC functionality.Signature Capture Directly on the ScreenThe scratch-resistant surface of the touch-screen allows handwritten input, such as confirming a receipt via signature.High-speed Scanner or CMOS Imager Whether a laser scanner for 1D codes or an imager for com-mon 2D codes is required, depends on the application. Both reading modules have an extremely high-performance. They are even able to detect damaged codes very quickly and confirm the positive read by emitting an optical or acoustic signal. The device can vibrate which is especially useful in noisy environments. Due to the increased reading range, the imager module features an autofocus function and a clear laser aiming point.On all models the scanner head is angled downwards by approx. 25 degrees. This makes the operation even easier. By angling the scanner in this way the device is more com-fortable to hold. It allows the user to see the display du-ring the scanning process. Three trigger buttons reduce the amount of finger movement to a minimum.RFID/NFC, Digital Camera and GPS The common protocols in the field of Contactless Smart Cards and Near Field Communication (NFC) are supported.The integrated camera suits perfectly to create pictures for quality control and damage recording. This data can be combined with the GPS coordinates.500On the Way Across all NetworksFor fast data communication, Bluetooth® (4.0), WLAN (IEEE 802.11 a/b/g/n) and 3G WWAN (HSPA and UMTS) are availa-ble. The USB interface or the contacts at the bottom of the housing can be used to connect the device to vehicle cradles and to docking stations (Ethernet and/or USB). For SIM cards and microSD cards covered slots are built into the device. The integrated microphone and speaker allow the user to make voice calls as well as recording voice memos.The Ideal Handheld Device for the Industry, Logistics, Retail and Service SectorsIn connection with the robust and ergonomic design, the numerous practical features set new standards. They also represent a benchmark with regards to user acceptance and a high level of investment security.Ready for Demanding ApplicationsThe CASIO IT-G 500 handheld device is equipped with a powerful ARM® Cortex® A 9 dual-core processor (1.5 GHz). Together with the large memory (512 MB RAM and 4 GB ROM), the device provides a high performance.The device is powered by Microsoft® Windows Embedded Handheld® 6.5. It is extremely easy to integrate the mobile devices into existing applications and standard solutions. The combination of innovative hardware and a proven ope-rating system means that the device represents a secure investment over many years and it is suitable for a great number of demanding applications.Back view (scanner version)Left view (scanner version)with 3 battery cover versions cover (type Ergo)Battery 1.850 mAh HA-D20BAT-AHand belt Expansion portTop: laser scanner Top: CMOS imagerFlat and additional expansion details(details on the right)Ergo Ergo L Docking contactsNon-slip surface Battery cover, flat, 5 piecesHA-P22FBC Ethernet cradle (charging function)Dual battery chargerHA-D32DCHGAC Adaptor 220 / 5 V, 3.5 A AD-S42120C-N5220 / 5 V, 3.0 AAD-S15050B-N5USB cradle (charging function)HA-P60IOCharging cradle (no communication)HA-P30CHGBattery 3.700 mAh HA-D21LBAT-A500CASIO Europe GmbH - Mobile Industrial SolutionsCasio-Platz 1 - D-22848 Norderstedt - Phone: +49 40 52 86 5 407 eMail:**********************Windows® and Windows® Embedded Handheld 6.5 are registered trademarks of the Microsoft Corporation, USA. MIFARE is a registered trademarks of the NXP B.V. The BLUETOOTH TM trademark is owned by Bluetooth SIG, Inc., U.S.A. and licensed to CASIO Computer Co., Ltd.. Other Product- and company names are either trade-marks or registered trademarks of the respective owners. The design and specifications may be varied without notice. The color display of pictures may vary from the actu-al colors. Screen images are simulated representations. The specifications in the table above are as of February 2015, and are subject to change without further notice.。
高级英语unit4-everyday-use-知识点梳理
Unit 4 Everyday use for your grandmammaWhat is a plot?If an author writes, "The king died and then the queen died," there is no plot for a story. But by writing, "The king d and then the queen died of grief," the writer has provided a plot line for a story.A plot is a causal sequence of events, the "why" for the things that happen in the story. The plot draws the reader the character's lives and helps the reader understand the choices that the characters make.The Structure of a plot1.Exposition - introduction of themain characters and setting2.Rising Action - one (or more)characters in crisis3.Climax - point of highest emotion;turning point4.Falling Action - resolution ofcharacter’s crisis5.Denouement (outcome) - “untyingof plot treads”; resolutionNarration NarratorFirst-person narration; third-person narrationNarrator ≠ authorThe titleThe meaning of the title requires the reader to read deeper within the short story. The phraseabout the question whether or not heritage should be preserved and displayed or integrated into everyday life. “Everyday Use” pertains not only to the quilt, but more so to people's culture and heritage and how they choo it.The themeThe main theme in the story concerns the characters’ connections to their ancestral roots.Dee Johnson b elieves t hat she is affirming her African h eritage b y changing h er name, her mannerisms, and her appearance, even though her family has lived in the United States for several generations.The themedated by her new image as “Wangero”. Their own connection Maggie and Mrs. Johnson are confused and intimiheritage rest on their memories of their mothers and grandmothers; they prefer to remember them for who they w individuals, not as members of a particular race.Because of their differing viewpoints, they place different values on some old quilts and other objects in the home The backgroundBy the 1960s, f ollowing the success o f civil rights l eaders like M artin L uther King, Jr. and Malcolm X, some A frican Americans began to take pride in their heritage as a way of gaining their esteem, forging a group identity, and cre platform for greater political power.Known as “black pride” or Black Nationalism, these ideas encouraged many young African Americans to le their cul tural ancestry, grow their hair into “Afros”, dress in traditional African clothing, and reject Cultural nationalismCultural n ationalism was founded o n the belief that blacks a nd whites h ave separate v alues, h istories, intellectual traditions and lifestyles and therefore that in reality, there are two separate Americas.Cultural nationalism was often expressed a as a conceptual and aesthetic return to the motherland (rarely an actu return), a recognition of the African r oots that blacks i n America h ad begun to forget as a result o f slavery, b iased education and stereotyped representations in the mass media.nationalism,Ron Karenga, one of the strongest voices in favor of culturalIn his article, "Black Cultural Nationalism,"writes,"Let our art remind us of our distaste for the enemy, our love for each other, and our commitment to the revolutionary struggle that will be fought with the rhythmic reality of a permanent revolution"Cultural nationalism on a visual level was expressed in the same way, by the wearing of brightly colored African c such as dashikis, and the adaptation of the Afro hair style, both symbolic representations of the important relation between Blacks in America and their African roots.Mama (Ms Johnson)The narrator of the story.She is a middle-aged or older African-American woman living with her younger daughter, Maggie.Although poor, she is strong and independent, and takes great pride in her way of life.She is over weight, and built more like a man than a woman. She has strong hands that are worn from a lifetime o work.MaggieDee’s sister who was badly burned by a fire when she was young.She has low self-confidence and becomes uncomfortable when Dee is around.Maggie contrasts Dee by showing a special regard for her immediate family.DeeMrs. Johnson’s older daughter.She is attractive, sophisticated, and well-educated.She is also very selfish, bold, and overly confident.Wangero because she wants to be a bigger part of her culture. When she returns home, she insists her family calls herThe only reason she wants this is because it’s suddenly the new trend.the historical presentThe historical present (sometimes dramatic present) refers to the employment of the present tense when narrating events. i t is used in fiction, for “hot news” (as in headlines), and in everyday c onversation. In conversation, it isgo).tell, write, and s ay (and in colloquial uses,particularly common with “verbs of communication” such asThe historical present has the effect of making past events more vivid.P1: the yard that Maggie and I made so clean and wavywavy: having regular curvesA wavy line has a series of regular curves along it.Here in the text the word describes the marks in wavy patterns on the clay ground left by the broom.P1: It is like an extended living room.Extended: enlargedP1: When the hard clay is swept cleanA fine-grained, firm earthy material that is plastic when wet and hardens when heated, consisting primarily of hydr silicates of aluminum and widely used in making bricks, tiles, and pottery.粘土,泥土P1: the fine sand around the edges lined with tiny, irregular groovesFine: thin, in small particlesGroove nouna long narrow cut in the surface of sth hard:沟、槽Cut a groove 3 cm from the top of the piece of wood.P1: sit and look up into the elm tree榆树P2: homely and ashamed of the burn scarsugly. Say she is plain o r homely.)Not handsome or beautiful: plain, unattractive. (Never say a woman or a girl ishomely furniture)Of a plain and unsophisticated nature: artless, unadorned, unpolished. (homely skills)Of or relating to the family or household: domestic, household. (P2: eying her sister with a mixture of envy and awesuggest the feelings of the person who looks.Look at and w atch d on’tTo eye means to look carefully, suspiciously, or thoughtfully, with fear, doubt, envy, desire, etc.P2: eying her sister with a mixture of envy and awenoun [U] feelings of respect and slight fear; feelings of being very impressed by sth/sb:awe and respectHe speaks of her with awe.be / stand in awe of sb/sth to admire sb/sth and be slightly frightened of them/it:While Diana was in awe of her grandfather, she adored her grandmotheramazement, wonderP2: She thinks her sister has held life always in the palm of one hand, that "no" is a word the world never learned to say to her..The world has satisfied her sister’s every desireHer sister has a firm control of life.P3: the child who has "made it" is confrontedTo have made i t: if you make it, you are successful in achieving sth. Difficult, or in s urviving through a very difficult period.I believe I have the talent to make it.You are brave and courageous. You can make it.P3: the child who has "made it" is confrontedthe economic problems confronting the1 (of problems or a difficult situation) to appear and need to be dealt with by sb:country3 to face sb so that they cannot avoid seeing and hearing you, especially in an unfriendly or dangerous situation:Thiswas the first time he had confronted an armed robber.P3: her own mother and father, tottering in weakly from backstage.1. [usually +a dv./ prep.] to walk or move with weak unsteady steps, especially because you are drunk or ill/sick; stag She managed to totter back to her seat.the tottering walls of the castle2 to be weak and seem likely to fall:out大声讲!没人能把你怎么样。
重参数化卷积 英语
重参数化卷积英语The term "reparameterization convolution" refers to a technique used in deep learning and specifically in convolutional neural networks (CNNs). In the context of CNNs, reparameterization convolution is a method that aims to improve the efficiency and effectiveness of the convolutional layers by reparameterizing the filters or weights in a way that reduces the computational cost and memory usage while maintaining or even improving the performance of the network.In reparameterization convolution, the traditional convolutional filters are transformed or restructured in a manner that allows for more efficient computation. This can involve techniques such as factorizing the filters into smaller components, using low-rank approximations, or applying other mathematical transformations to the filter parameters. By doing so, the number of parameters in the network can be reduced, leading to faster training and inference times, as well as lower memory requirements.One common approach to reparameterization convolutionis the use of depthwise separable convolutions, which decompose the standard convolution into two separate layers: a depthwise convolution that filters input channels separately, followed by a pointwise convolution that combines the outputs of the depthwise convolution. This separation of the spatial and channel-wise filtering helpsin reducing the number of parameters and the computational cost, particularly in mobile and embedded applicationswhere resource constraints are a concern.Reparameterization convolution has gained attention in the deep learning community due to its potential for improving the efficiency of CNNs, particularly in scenarios where computational resources are limited. By rethinkingthe parameterization of convolutional layers, researchers and practitioners aim to strike a balance between model complexity and computational efficiency, ultimately leading to more scalable and deployable deep learning models.In summary, reparameterization convolution is atechnique in deep learning that involves rethinking the parameterization of convolutional layers to make them more efficient in terms of computational cost and memory usage, without sacrificing the performance of the network. It encompasses various methods such as depthwise separable convolutions and other reparameterization strategies aimed at reducing the number of parameters and improving the overall efficiency of convolutional neural networks.。
量子Loop代数Uq(L(sl2))的单权模
第62卷 第2期吉林大学学报(理学版)V o l .62 N o .22024年3月J o u r n a l o f J i l i nU n i v e r s i t y (S c i e n c eE d i t i o n )M a r 2024d o i :10.13413/j .c n k i .jd x b l x b .2023345量子L o o p 代数U q (L (s l2))的单权模吴青云,谭易兰,夏利猛(江苏大学数学科学学院,江苏镇江212013)摘要:用构造的方法解决量子L o o p 代数U q (L (s l 2))具有一个一维权空间的单权模的结构问题,得到了任意一个具有一维权空间的单权模必同构于U q (L (s l 2))的四类单权模之一.此外,还构造了一类权空间维数为2的既非最高权也非最低权的量子L o o p 代数U q (L (s l 2))的单权模.关键词:量子L o o p 代数;权模;单模;D e n s e 模中图分类号:O 152.5 文献标志码:A 文章编号:1671-5489(2024)02-0256-07S i m p l eW e i g h tM o d u l e s o f Q u a n t u mL o o p A l g e b r a U q (L (s l2))WU Q i n g y u n ,T A N Y i l a n ,X I A L i m e n g(S c h o o l o f M a t h e m a t i c a lS c i e n c e s ,J i a n g s uU n i v e r s i t y ,Z h e n j i a n g 212013,J i a n gs uP r o v i n c e ,C h i n a )A b s t r a c t :T h e s t r u c t u r a l p r o b l e m o f s i m p l ew e i g h tm o d u l e sw i t hao n e -d i m e n s i o n a lw e i g h t s p a c e i n t h e q u a n t u mL o o p a l g e b r a U q (L (s l2))w a s s o l v e d b y u s i n g a c o n s t r u c t i o nm e t h o d ,a n d i tw a s o b t a i n e d t h a t a n y s i m p l ew e i g h tm o d u l ew i t ha o n e -d i m e n s i o n a lw e i g h t s p a c em u s t b e i s o m o r p h i c t o o n e o f t h e f o u r c l a s s e s o f s i m p l ew e i g h tm o d u l e s o f U q (L (s l 2)).I n a d d i t i o n ,a c l a s s o f s i m p l ew e i g h tm o d u l e s o f t h e q u a n t u m L o o p a l g e b r a U q (L (s l2))w i t h w e i g h ts p a c ed i m e n s i o no f2,w h i c h w a sn e i t h e rt h e h i g h e s tw e i g h t n o r t h e l o w e s tw e i g h t ,w a s c o n s t r u c t e d .K e yw o r d s :q u a n t u m L o o p a l g e b r a ;w e i g h tm o d u l e ;s i m p l em o d u l e ;D e n s em o d u l e 收稿日期:2023-08-20.第一作者简介:吴青云(1999 ),女,汉族,硕士研究生,从事李理论的研究,E -m a i l :2212102047@s t m a i l .u js .e d u .c n .通信作者简介:谭易兰(1981 ),男,汉族,博士,副教授,从事李理论的研究,E -m a i l :t a n y a n l a n @u js .e d u .c n .基金项目:国家自然科学基金(批准号:12171155).1 引言与主要结果设g 是复数域上的有限维单李代数,Y a n g i a n 代数Y (g )和量子仿射代数U q (g^)组成了两族重要的仿射型量子群.U q (g ^)是由一族生成元和一系列生成关系构成的具有单位元的结合代数,U q (g ^)商去由中心元C 生成的双边理想后得到的商代数记为U q (L (g)).其代数结构和表示理论在数学和物理中都有重要的理论意义和应用价值.例如,U q (L (g ))模可用于构造量子Y a n g -B a x t e r 方程的三角解[1].关于U q (L (g ))模的研究是量子群表示理论的重要问题之一[2-3].目前,U q (L (g))模的研究主要集中在最高权模,包括有限维不可约模㊁局部W e y l 模㊁K R (K i r i l l o w -R e s h e t i k h i n )模和素表示(P r i m e r e p r e s e n t a t i o n s )[4-8].而U q (L (s l 2))的表示理论在U q (L (g ))的研究中具有重要作用.本文目标是分类U q (L (s l 2))的一类单权模.从U q (s l2)的D e n s e 模出发[9],构造一类既不是最高权也不是最低权的无限维U q (L (s l 2))单权模,然后分类具有一个一维权空间的U q (L (s l 2))单权模.本文主要结果如下:定理1 设V 是U q (L (s l2))存在一个一维权空间的单权模,则V 必与下列模中的某个模同构:1)有限维单模;2)无限维最高权单模;3)无限维最低权单模;4)D e n s e 模V (μ,τ,b μ).此外,本文还通过构造一个权空间均为二维的U q (L (s l2))模,给出该模不可约的充分条件,以说明本文主要结果中一维权空间的限定条件必不可少.2 预备知识首先给出量子L o o p 代数U q (L (s l2))的定义.定义1[10] 设q 不是单位根,量子L o o p 代数U q (L (s l2))是一个有单位元1的结合代数,它的生成元为x ʃk (k ɪℤ),h ʃk (k ɪℤ-{0})和K ʃ1,且满足生成关系:K K -1=K -1K =1, K h k =h kK ,K x ʃk K -1=q ʃ2x ʃk , [h k ,h l ]=0,[h k ,x ʃl ]=ʃ1k[2k ]qx ʃk +l ,(1)[x +k ,x -l ]=1q -q -1(ψk +l -ϕk +l ).(2)x ʃk +1x ʃl -q ʃ2x ʃl x ʃk +1=q ʃ2x ʃk x ʃl +1-x ʃl +1x ʃk ,(3)这里[m ]q =q m-q -m q -q-1,且ψk +l 和ϕk +l 满足ðɕk =0ψkuk=K e x p (q -q -1)ðɕk =1h ku {}k,ðɕk =0ϕ-k u-k =K -1e x p (q -q -1)ðɕk =1h -ku -{}k .由定义1和数学归纳法,易证如下引理.引理1 U q (L (s l2))可由K ʃ1,h ʃ1和x ʃ0生成.命题1[10] 1)由K ,x +0和x -0生成的子代数与U q (s l2)同构;2)映射ρN :U q (L (s l 2))ңU q (s l 2), x +k q -k a k K k e +,x k -q -k a k e -Kk 是一个满同态.引理2[10] U q (L (s l2))作为H o p f 代数,满足余乘关系:Δ(x +0)=x +0췍K +1췍x +0, Δ(x -0)=x -0췍1+K -1췍x -0,Δ(x -1)=x -1췍1+K 췍x -1, Δ(x +-1)=x +-1췍K -1+1췍x +-1,Δ(K )=K 췍K , Δ(h 1)=h 1췍1+1췍h 1-(q 2-q -2)x +0췍x -1,Δ(K -1)=K -1췍K -1, Δ(h -1)=h -1췍1+1췍h -1-(q 2-q -2)x +-1췍x -0. 下面介绍U q (L (s l 2))的表示理论,首先介绍U q (L (s l 2))的最高权模.本文记U q (L (s l2))的元素x 在其模V 上的作用为x .v ,这里v ɪV .定义2[10] 设V 是U q (L (s l 2))的一个模.如果存在非零向量w ɪV ,使得U q (L (s l 2)).w =V ,且满足:x +k .w =0, ψk .w =d +k w (k ɪℕ), ϕk .w =d -k w (k ɪℕ-), d +0d -0=1,则称V 是U q (L (s l2))的最高权模,d ={d ʃk k ɪℤ}为V 的最高权.最低权模的定义可类似给出,只需将x +k .w =0改为x -k .w =0.定义3[10] 定义U q (L (s l 2))的V e r m a 模M (d )为U q (L (s l2))模商去由x +k (k ɪℤ),ψk -d +k ㊃1(k ȡ0),ϕk -d +k ㊃1(k ɤ0)所有系数生成的左理想.下面给出刻画U q (L (s l2))有限维单模的结构.752 第2期吴青云,等:量子L o o p 代数U q (L (s l2))的单权模852吉林大学学报(理学版)第62卷命题2[10]U q(L(s l2))的有限维单模是最高权模,U q(L(s l2))的最高单权模是有限维的当且仅当存在常系数非零的多项式P,且满足:ðɕk=0d+k u k=q d e g P P(q-2u)P(u),ðɕk=0d--k u-k=q d e g P P(q-2u)P(u).定义4[10]对任意的aɪℂ,W1(a)=s p a n{w0,w1}是U q(L(s l2))的二维单权模,这里w0是最高权向量.有限生成元在W1(a)上的作用下有x+0.w0=0,x+-1.w0=0,x-1.w0=a w1,x-0.w0=w1,x+0.w1=w0,x+-1.w1=a-1w0,x-1.w1=0,x-0.w1=0,K.w0=q w0,h1.w0=q-1a w0,h-1.w0=-q a-1w0,K.w1=q-1w1,h1.w1=-q a w1,h-1.w1=q-1a-1w1.定义5[11]设V是一个U q(L(s l2))模,若Vμ={vɪV K.v=μ.v},V=췍Vμ,其中μɪℂ,则称V 是U q(L(s l2))的权模.由U q(L(s l2))生成元间的定义关系,易得如下引理.引理3设V是U q(L(s l2))的权模,若vɪVμ,则由定义关系可得h k.vɪVμ,x+k.vɪVμ+2和x-k.vɪVμ-2.由文献[9]中定义3.1.3和命题3.1.7,通过同构易得如下命题.命题3对任意的μ,τɪℂ,nɪℕ,U q(s l2)在向量空间W(μ,τ)=s p a nℂ{vμ+2k,kɪℤ}上的作用K.vμ+2k=μq2k vμ+2k,x+0.vμ+2k=aμ+2k vμ+2k+2,x-0.vμ+2k=vμ+2k-2,定义了U q(s l2)的D e n s e模结构,其中aμ+2k=1(q-q-1)2(τ-(μq2k+1+μ-1q-2k-1)).当μʂq n,nɪℕ时,W(μ,τ)不可约.3U q(L(s l2))的D e n s e模由命题1可知,U q(s l2)的D e n s e模W是一个U q(L(s l2))模.由引理1可知,U q(L(s l2))由Kʃ1, hʃ1和xʃ0生成.因此只要再确定hʃ1在vμ+2k上的作用,即可确定U q(L(s l2))-模W的结构.因为W权空间均为1维,所以不妨设h1.vμ+2k=bμ+2k vμ+2k,h-1.vμ+2k=cμ+2k vμ+2k.定理2hʃ1作用的系数均可由bμ确定.证明:在式(1)中k分别取1和-1,并将等式两边分别作用在权向量vμ+2k上,得[2]q x+1.vμ+2k=aμ+2k(bμ+2k+2-bμ+2k)vμ+2k+2,[2]q x-1.vμ+2k=(bμ+2k-bμ+2k-2)vμ+2k-2,[2]q x+-1.vμ+2k=aμ+2k(cμ+2k+2-cμ+2k)vμ+2k+2,[2]q x--1.vμ+2k=(cμ+2k-cμ+2k-2)vμ+2k-2.在式(2)中k,l分别取-1和1,并将等式两边分别作用在权向量vμ+2k上,比较vμ+2k的系数,可得(bμ+2k-bμ+2k-2)(cμ+2k-cμ+2k-2)=(q+q-1)2.(4)类似地,在式(3)中k分别取0和-2,l取0,可得(bμ+2k+4-bμ+2k+2)=q2(bμ+2k+2-bμ+2k),(5)(cμ+2k+4-cμ+2k+2)=q-2(cμ+2k+2-cμ+2k).(6)在式(2)中k,l分别取0和1,再结合式(5),可得(aμ+2k-2-q2aμ+2k)(bμ+2k-bμ+2k-2)=[2]qμq2k bμ+2k.(7)在式(2)中k,l分别取0和1,再结合式(6),可得(aμ+2k-2-q-2aμ+2k)(cμ+2k-cμ+2k-2)=-[2]qμ-1q-2k cμ+2k.(8)由命题3,易见aμ+2k-2-q2aμ+2k-[2]qμq2k=aμ+2k-4-q2aμ+2k-2.结合式(7),即可得(a μ+2k -4-q 2a μ+2k -2)b μ+2k =(a μ+4k -4-q 2a μ+4k -2)b μ.利用式(4),不难证明a μ+2k -4-q 2a μ+2k -2ʂ0.由此可得b μ+2k =a μ+4k -4-q 2a μ+4k -2a μ+2k -4-q 2a μ+2k -2b μ=1+q (q +q -1)μ(1-q 2k )(q -q -1)(a μ+2k -4-q 2a μ+2k -2æèçöø÷)b μ.最后,结合式(4),(8),得c μ+2k =-(a μ+2k -2-q 2a μ+2k )(a μ+2k -2-q -2a μ+2k )b μ+2k .结论得证.注1 U q (L (s l2))的D e n s e 模由3个元素μ,τ,b μɪℂ且μʂq n,n ɪℕ确定,记为V (μ,τ,b μ).4 主要结果的证明设V 是U q (L (s l 2))的单权模,且存在V μ满足V μ=s p a n {w 0}.由于U q (L (s l2))的有限维单模㊁最高权单模和最低权单模均具有一维权空间,因此不妨设V 不属于上述三类.于是有d i m (V μ-2)>0和d i m (V μ+2)>0.引理4 存在u ɪV μ-2,使得x +0.u =w 0.证明:反证法.假设对任意u ɪV μ-2,都有x +0.u ʂw 0.因为d i m (V μ)=1,所以对任意u ɪV μ-2,有x +0.u =0.通过数学归纳法易证得对任意k ɪℤ,x +k .u =0.因此对任意0ʂu ɪV μ-2,都有w 0∉U q (L (s l 2)).u ʂ0,则U q (L (s l2)).u 是V 的一个真子模,与V 是单模矛盾.故假设不真,结论得证.由x +k .V μ-2⊆V μ,h m .V μ⊆V μ,K .V μ⊆V μ并结合d i m (V μ)=1,可得以下推论.推论1 对任意k ɪℤ,m ɪℤ-{0},都有x +k .u =a k w 0,x +0h m .u =b m w 0和x +0K .u =b 0w 0,其中a k ,b m ,b 0ɪℂ,u 满足引理4.为证w 1是K 和h k 的公共权向量,先证以下引理.引理5 对任意k ɪℤ,都有x +k .w 0=c k w 1,其中c k ɪℂ.证明:首先用数学归纳法对k ȡ0的情形进行证明.1)当k =0时,显然有x +0.w 0=w 1.2)当k =1时,x +1.w 0=x +1x +0.u =q 2x +0x +1.u =q 2a 1x +0.w 0=q 2a 1w 1=c 1w 1. 3)假设当0ɤn ɤk ,n ɪℤ时,均有x +n .w 0=c nw 1,则x +k +1.w 0=x +k +1x +0.u =(q 2x +0x +k +1+q 2x +k x +1-x +1x +k ).u .利用推论1,得x +k +1.w 0=q 2a k +1x +0.w 0+q 2a 1x +k .w 0-a k x +1.w 0,结合上述1),2)和假设条件,得x +k +1.w 0=c k +1w 1.同理可证k ɤ0时,也满足x +k .w 0=c kw 1.证毕.命题4 对任意k ɪℤ-{0},都有h k .w 1=d k w 1,其中d k ɪℂ.证明:首先由定义关系,计算得h k .w 1=h k (x 0)2.u =[h k ,(x 0)2].u +(x 0)2h k .u =1k [2k ]q x +k .w 0+1k [2k ]q x +0x +k .u +x +0(x +0h k .u ).利用推论1,得h k .w 1=1k [2k ]q x +k .w 0+1k[2k ]q a k x +0.w 0+b k x +0.w 0.结合引理5,结论得证.952 第2期吴青云,等:量子L o o p 代数U q (L (s l2))的单权模同理于上述结果,存在非零向量v ɪV μ+2满足w 0=x -0.v .取w -1=x -0.w 0=(x -0)2.v ʂ0.可得如下结论,证明略.命题5 1)对任意k ɪℤ,都有x -k .w 0=e k w -1,其中e k ɪℂ;2)对任意k ɪℤ-{0},都有h k .w -1=f k w -1,其中f k ɪℂ.取w 2=x +0.w 1=(x +0)2.w 0ʂ0,用w 0替换引理5和命题4中的u ,即可得如下结论.引理6 1)对任意k ɪℤ,都有x +k .w 1=fk w 2,其中f k ɪℂ;2)对任意k ɪℤ-{0},都有h k .w 2=gk w 2,其中g k ɪℂ.取w -2=x -0.w -1=(x -0)2.w 0ʂ0,用w 0替换命题5中的v ,即可得如下结论.引理7 1)对任意k ɪℤ,都有x -k .w -1=p k w -2,其中p k ɪℂ;2)对任意k ɪℤ-{0},都有h k .w -2=qk w -2,其中q k ɪℂ.依此类推,可得以下命题.命题6 对任意k ɪℤ-{0},n ɪℤ,都有h k .w n =l k w n ,其中l k ɪℂ.下面证明定理1.设V 是U q (L (s l 2))的具有一个一维权空间的单权模.因为U q (L (s l2))的最高(低)权单模的最高(低)权空间是一维的,所以U q (L (s l2))的有限维单模㊁最高权单模或最低权单模都是具有一个一维权空间的单权模.不妨设V 不属于这三类中的任意一类.设V μ=s p a n ℂ{w 0},记w -n =(x -0)n .w 0,w n =(x +0)n .w 0,设W =s p a n ℂ{ ,w -2,w -1,w 0,w 1,w 2,}.显然有W ⊆V .下证W 是U q (L (s l 2))模.因为U q (L (s l2))可由K ʃ1,h ʃ1和x ʃ0生成,所以只需证W 在K ʃ1,h ʃ1和x ʃ0的作用下稳定即可.1)W 在K ʃ1的作用下稳定.显然有K .w k =μq 2k w k ,K -1.w k =μ-1q -2kw k .2)W 在h ʃ1的作用下稳定.由命题6可得h 1.w k =l 1w k ,h -1.w k =l -1w k .3)W 在x ʃ0的作用下稳定.在x +0的作用下,对w k (k ɪℕ+)已经满足稳定,故证w -k (k ɪℕ+)在x +0作用下稳定即可.①当k =1时,x +0.w -1=x +0x -0.w 0=[x +0,x -0].w 0+x -0x +0.w 0=[x +0,x -0].w 0+x -0.w 1,结合式(2)中k ,l 均取0的情况,计算得[x +0,x -0].w 0=μ-μ-1q -q-1w 0.由d i m (V μ)=1易得x -0.w 1=t w 0,t ɪℂ.因此x +0.w -1=μ-μ-1q -q-1+æèçöø÷t w 0.②假设当1ɤn ɤk 时,均有x +0.w -n =t nw -n +1,x +.w -k -1=x +0x -0.w -k =[x +0,x -0].w -k +x -0x +.w -k =μq -2k -μ-1q -2k q -q -1+t æèçöø÷k w -k ,因此通过数学归纳法可证w -k (k ɪℕ+)在x +0作用下稳定.同理,可证W 在x -0的作用下稳定.综上可知W 是U q (L (s l2))模,则W 是V 的子模.因为V 是单模,所以V =W =s p a n ℂ{ ,w -2,w -1,w 0,w 1,w 2,}.由假设知V 不是最高权单模或最低权单模.由上述证明可知,对任意的k ɪℤ,w k ʂ0.因此作为子代数U q (s l 2)的模,V 是D e n s e 单权模,故V ≅V (μ,τ,b μ).定理1得证.5 U q (L (s l2))一类权空间维数为2的权模下面构造U q (L (s l2))的一类权空间维数均为2的单权模U ,并给出模U 不可约的充分条件,从而说明定理1中的限定条件是不可缺的.设U =V (μ,τ,b μ)췍W 1(a ),其中μ,τɪℂ且μʂq n,n ɪℕ,则U 是U q (L (s l 2))权模,权空间为U μ+2k +1=s p a n {v μ+2k +2췍w 1,v μ+2k 췍w 0}.062 吉林大学学报(理学版) 第62卷引理8 设V 是U 的非零子模,若U μ+2k +1⊆V ,则V =U .证明:由U μ+2k +1⊆V ,V 是U 的非零子模,可得x +0U μ+2k +1,x -0U μ+2k +1⊆V ,x +0.(v μ+2k +2췍w 1)=x +0.v μ+2k +2췍K .w 1+v μ+2k +2췍x +0.w 1=a μ+2k +2q -1(v μ+2k +4췍w 1)+v μ+2k +2췍w 0,x +0.(v μ+2k 췍w 0)=x +0.v μ+2k 췍K .w 0+v μ+2k 췍x +0.w 0=a μ+2k q (v μ+2k +2췍w 0),x -0.(v μ+2k +2췍w 1)=x -0.v μ+2k +2췍w 1+K -1.v μ+2k +2췍x -0.w 1=v μ+2k 췍w 1,x -0.(v μ+2k 췍w 0)=x -0.v μ+2k 췍w 0+K -1.v μ+2k 췍x -0.w 0=v μ+2k -2췍w 0+q -μ-2k v μ+2k 췍w 1,由上述计算可得U μ+2k +3⊆V 和U μ+2k -1⊆V ,即U ⊆V .由V 是U 的非零子模,得V ⊆U .因此V =U ,证毕.定理3 若b μʂq -1a 2(a μ-2-q 2a μ)(τ-τ2-4),则U =V (μ,τ,b μ)췍W 1(a )不可约.证明:反证法.假设U 是可约的,则U 存在真子模V ,V 的权空间V μ+2k +1=V ɘU μ+2k +1.由引理8可得d i m (V μ+2k +1)ɤ1,且存在k ɪℤ,使得d i m (V μ+2k +1)=1.因此,不妨设k =0.设v =m v μ+2췍w 1+n v μ췍w 0ɪV μ+1,计算得h 1.v =(m (b μ+2-q a )-n (q 2-q -2)a a μ)v μ+2췍w 1+n (b μ+q -1a )v μ췍w0.由d i m (v μ+1)=1得m (b μ+2-b μ-q a -q -1a )=n (q 2-q -2)a a μ,(9)由定义简单计算得x -0.v =(m +n μ-1)(v μ췍w 1)+n v μ-2췍w 0,h 1.(x -0.v )=((m +n μ-1)(b μ-q a )-n (q 2-q -2)a a μ-2)v μ췍w 1+n (b μ-2+q -1a )v μ-2췍w 0.由d i m (v μ-1)ɤ1得(m +n μ-1)(b μ-b μ-2-q a -q -1a )=n (q 2-q -2)a a μ-2.(10)设b μ-b μ-2-q a -q -1a (q 2-q -2)a a μ-2=t ,则式(9),(10)可以分别改写为m (q 2a μ-2t +q )=n a μ, (m +n μ-1)t =n .利用消元法得a μq 2a μ-2t +q =1t -μ-1,通分化简得q 2a μ-2t 2+(q +μa μ-q 2μa μ-2)t -μq =0.利用求根公式,计算得t =μτʃμτ2-42q (q -q -1)a μ-2-1(q -q -1)a μ-2.再代回计算得b μ+2-b μ=q 2(q 2-q -2)a a μ-2t +q 2(q +q -1)a =q (q +q -1)a μ2(τʃτ2-4).结合式(7),易得b μ=q -1a 2(a μ-2-q 2a μ)(τ-τ2-4).与条件矛盾,故假设不真.结论得证.参考文献[1] J I M B O M.A q -D i f f e r e n c eA n a l o g u e o f U (g)a n d t h eY a n g -B a x t e r E q u a t i o n [J ].L e t t e r s i nM a t h e m a t i c a l P h y s i c s ,1985,10(1):63-69.[2] C HA R IV ,P R E S S L E Y A.A G u i d e t oQ u a n t u m G r o u p s [M ].C a m b r i d g e :C a m b r i d g eU n i v e r s i t y Pr e s s ,1994:162 第2期吴青云,等:量子L o o p 代数U q (L (s l2))的单权模262吉林大学学报(理学版)第62卷392-403.[3] D R I N F E L D V G.A N e wR e a l i z a t i o n o fY a n g i a n s a n d o fQ u a n t i z e dA f f i n eA l g e b r a s[J].D o k l a d y A k a d e m i iN a u kS S S R,1987,296(1):13-17.[4] C HA R IV,P R E S S L E YA.W e y lM o d u l e s f o r C l a s s i c a l a n dQ u a n t u m A f f i n eA l g e b r a s[J].R e p r e s e n t a t i o nT h e o r yo f t h eA m e r i c a n M a t h e m a t i c a l S o c i e t y,2001,5(9):191-223.[5] H E R N A N D E ZD.T h eK i r i l l o v-R e s h e t i k h i nC o n j e c t u r e a n dS o l u t i o n s o f T-S y s t e m s[J].J o u r n a l Für d i eR e f i n e u n dA n g e w a n c l t eM a t h e m a t i k,2006,181(8):63-87.[6] B R I T O M,C HA R IV,MO U R A A.D e m a z u r e M o d u l e so fL e v e lT w oa n dP r i m eR e p r e s e n t a t i o n so fQ u a n t u mA f f i n e s l n+1[J].J o u r n a l o f t h e I n s t i t u t e o fM a t h e m a t i c s o f J u s s i e u,2018,17(1):75-105.[7] B R I T O M,C HA R IV,V E N K A T E S H R.Q u a n t u m A f f i n eA l g e b r a s,G r a d e dL i m i t sa n dF l a g s[J].J o u r n a l o ft h e I n d i a n I n s t i t u t e o f S c i e n c e,2022,102(3):1001-1031.[8] L E C L E R CB.Q u a n t u m L o o p A l g e b r a s,Q u i v e r V a r i e t i e s,a n d C l u s t e r A l g e b r a s[R]//S K OWR O N S K I A,Y AMA G A T A K.R e p r e s e n t a t i o n so fA l g e b r a sa n d R e l a t e d T o p i c s,E M SS e r i e so fC o n g r e s sR e p o r t s.T o k y o:E M SP r e s s,2010:117-152.[9]杨冬梅.无限维不可分解的U q(s l2)-模的分类[D].北京:北京工业大学,2005.(Y A N GD M.C l a s s i f i c a t i o no fI n f i n i t e l y D i m e n s i o n a l i nD e c o m p o s a b l e U q(s l2)M o d u l e s[D].B e i j i n g:B e i j i n g U n i v e r s i t y o fT e c h n o l o g y,2005.)[10] C HA R IV,P R E S S L E Y A.Q u a n t u m A f f i n e A l g e b r a s[J].C o mm u n i c a t i o n si n M a t h e m a t i c a lP h y s i c s,1991,142(2):261-283.[11] B R I T T E N D,L A U M,L E M I R E F.W e i g h t M o d u l e sf o rC u r r e n t A l g e b r a s[J].J o u r n a lo f A l g e b r a,2005,440(1):245-263.(责任编辑:李琦)。
非极大值一致 nms的工作流程英语
非极大值一致 nms的工作流程英语Non-Maximum Suppression (NMS)。
Non-maximum suppression (NMS) is a technique used in object detection to remove redundant bounding boxes that overlap with each other. It aims to retain only the most confident bounding boxes that are likely to contain the object of interest.Workflow of Non-Maximum Suppression.The workflow of NMS involves the following steps:1. Input: NMS takes as input a set of bounding boxes and their corresponding confidence scores.2. Sort Confidence Scores: The bounding boxes are sorted in descending order of their confidence scores.3. Iterate Over Bounding Boxes: The algorithm iteratesover the bounding boxes in descending order of their confidence scores.4. Select Best Bounding Box: The bounding box with the highest confidence score is selected as the best bounding box.5. Calculate Overlap: For each subsequent bounding box in the iteration, the algorithm calculates the overlap between it and the best bounding box.6. Suppress Overlapping Boxes: If the overlap between a subsequent bounding box and the best bounding box exceeds a predefined threshold, the subsequent bounding box is suppressed and removed from the list of bounding boxes.7. Repeat Until No Overlap: Steps 5 and 6 are repeated until there are no more overlapping bounding boxes.8. Output: The output of NMS is a set of non-overlapping bounding boxes that represent the most confident object detections.Threshold Selection.The threshold used for overlap calculation is crucialfor the effectiveness of NMS. A low threshold can result in excessive suppression, while a high threshold may lead to missed detections. The optimal threshold value depends on the specific object detection task and the size of the bounding boxes.Variations of Non-Maximum Suppression.There are several variations of the basic NMS algorithm, including:Soft NMS: This variation allows for partialsuppression of overlapping bounding boxes, preserving bounding boxes with lower confidence scores but higher overlap.Adaptive NMS: This variation adjusts the suppression threshold based on the size of the bounding boxes toaccommodate scale variations.Weighted NMS: This variation assigns weights to the bounding boxes based on their confidence scores and spatial locations to prioritize suppression of less important bounding boxes.Applications of Non-Maximum Suppression.NMS is widely used in object detection and computer vision applications, such as:Object localization.Image classification.Facial detection.Pedestrian detection.Vehicle detection.Scene understanding.Additional Notes:NMS is a greedy algorithm, meaning it makes locally optimal decisions at each step without considering thelong-term impact on the result.NMS can be computationally expensive for large sets of bounding boxes.Alternative approaches to NMS for removing redundant bounding boxes include grouping and clustering techniques.。
【齐泽克】我们还生活在世界上吗
......• Do We Still Live in a World? •.............Slavoj ZizekIn his seminar on The Ethics of Psychoanalysis, Lacan invokes the "point of the apocalypse," the impossible saturation of the Symbolic by the Real of jouissance, the full immersion into massive jouissance. The same point can be made in Nietzschean terms - what is effectively Nietzsche’s eternal return of the same? Does it stand for the factual repetition, for the repetition of the past which should be willed as it was, or for a Benjaminiam repetition, areturn-reactualization of that which was lost in the past occurrence, of its virtual excess, of its redemptive potential? There are good reasons to read it as the heroic stance of endorsing factual repetition: recall how Nietzsche emphatically points out that, when faced with every event of my life, even the most painful one, I should gather the strength to joyfully will for it to return eternally. If we read the thought of eternal return in this way, then Giorgio Agamben’s evocation of the holoc aust as the conclusive argument against the eternal return retains its full weight: who can will it to return eternally? What, however, if we reject the notion of the eternal return of the same as the repetition of the reality of the past, insofar as it relies on an all too primitive notion of the past, on the reduction of the past to the one-dimensional reality of "what really happened," which erases the virtual dimension of the past? If we read the eternal return of the same as the redemptive repetition of the past virtuality? In this case, applied to the nightmare of the holocaust, the Nietzschean eternal return of the same means precisely that one should will the repetition of the potential which was lost through the reality of the holocaust, the potential whose non-actualization opened up the space for the holocaust to occur.In order to grasp properly what takes place here, one has to take a detour through what Lacan called la jouissance de l’Autre– what is this mysterious jouissance? Imagine (a real clinical case, though) two love partner who excite each other by verbalizing, telling to each other, their innermost sexual fantasies to such a degree that they reach full orgasm without touching, just as the effect of "mere talking." The result of such excess of intimacy is not difficult to guess: after such a radical mutual exposure, they will no longer be able to maintain their amorous link – too much was being said, or, rather, the spoken word, the big Other, was too directly flooded by jouissance, so the two are embarrassed by each other’s presence and slowly drift apart, start to avoid each other’s presence. THIS, not a full perverse orgy, is the true excess: not "practicing your innermost fantasies instead of just talking about them," but, precisely, TALKING about them, allowing them to invade the medium of the big Other to such an extent that one can literally "fuck with words," that the elementary, constitutive, barrier between language and jouissance breaksdown. Measured by this standard, the most extreme "real orgy" is a poor substitute.And it is this dimension of the jouissance of the Other that is threatened by the prospect of "pure" jouissance. Is such a short-circuit not the basic and most disturbing feature of consuming drugs to generate experience of enjoyment? What drugs promise is a purely autistic jouissance, a jouissance accessible without the detour through the Other (of the symbolic order) –jouissance generated not by fantasmatic representations, but by directly attacking our neuronal pleasure-centers? It is in this precise sense that drugs involve the suspension of symbolic castration, whose most elementary meaning is precisely that jouissance is only accessible through the medium of (as mediated by) symbolic representation. This brutal Real of jouissance is the obverse of the infinite plasticity of imagining, no longer constrained by the rules of reality. Significantly, the experience of drugs encompasses both these extremes: on the one hand, the Real of noumenal (non-schematized) jouissance which by-passes representations; on the other hand, the wild proliferation of fantasizing (recall the proverbial reports on how, after taking a drug, you imagine scenes you never thought you were able to access – new dimensions of shapes, colors, smells...).There is, however, another problem with the eternal return of the same. What would the digital virtualization of our lives, the shift of our identity from hardware to software, our change from finite mortals to "undead" virtual entities able to persist indefinitely, migrating from one to another material support, in short: the passage from human to posthuman, mean in Nietzschean terms? Is this posthumanity a version of the eternal return? Is the digital posthuman subject a version (a historical actualization) of the Nietzschean "overman"? Or is this digital version of posthumanity a version of what Nietzsche called Last Man? What if it is, rather, the point of indistinction of the two, and, as such, a signal of the limitation of Nietzsche’s thou ght? In other words, is the eternal return rooted in the human finitude (since the gap between virtuality and actuality only persists from the horizon of finitude), or does it stand for our uncoupling from finitude?When today’s subjectivity is celebrated as rootless, migratory, nomadic, hybrid, etc., does not digitalization provide the ultimate horizon of this migration, that of the fateful shift of hardware into software, i.e., of cutting the link that attaches a mind to its fixed material embodiment (a single individual’s brain), and of downloading the entire content of a mind into a computer, with the possibility of the mind turning into a software that can indefinitely migrate from one to another material embodiment and thus acquiring a kind of undeadness. The metempsychosis, the migration of souls, thus becomes a question of technology. The idea is that "we are entering aregime as radically different from our human past as we humans are from the lower animals": by uploading yourself into a computer, you become "anything you like. You can be big or small; you can be lighter than air; you can walk through walls." [1] In the good old Freudian terms, we thus get rid of the minimum of resistance that defines (our experience of) reality, and enter the domain in which pleasure principle reigns unconstrained, with no concessions to the reality principle, or, as David Pearce put it in his quite appropriately titled book The Hedonistic Imperative:/.../ nanotechnology and genetic engineering will eliminate aversive experience from the living world. Over the next thousand years or so, the biological substrates of suffering will be eradicated completely," since we shall achieve "the neuro-chemical precision engineering of happiness for every sentient organism on the planet. [2](Note the Buddhist overtones of this passage!) And, of course, since one of the definition of being-human is that disposing of shit is a problem, part of this new posthumanity will also be that dirt and shit will disappear:/.../ a superman must be cleaner than a man. In the future, our plumbing (of the thawed as well as the newborn) will be more hygienic and seemly. Those who choose to will consume only zero-residue foods, with excess water all evaporating via the pores. Alternatively, modified organs may occasionally expel small, dry compact residues. [3]Next comes the confused functions of our orifices: is the multi-purpose mouth" not "awkward and primitive"? – "An alien would find it most remarkable that we had an organ combining the requirements of breathing, ingesting, tasting, chewing, biting, and on occasion fighting, helping to threat needles, yelling, whistling, lecturing, and grimacing" – not to mention kissing, licking and sucking, thioralerotic confusion… Is the ultimate target here not penis itself, with its embarrassing overlapping of the highest (insemination) with the lowest (urination)?With the prospect of the biogenetic manipulation of human physical and psychic features, the notion of "danger" inscribed into modern technology, elaborated by Heidegger, turned into a common currency. Heidegger emphasizes how the true danger is not the physical self-destruction of humanity, the threat that something will go terribly wrong with biogenetic interventions, but, precisely, that NOTHING will go wrong, that genetic manipulations will function smoothly – at this point, the circle will in a way be closed and the specific openness that characterizes being-human abolished. That is to say, is the Heideggerian danger /Gefahr/ not precisely the danger that the ontic will "swallow" the ontological (with the reduction of man, the Da /here/ of Being, to just another object of science)? Do we not encounter hereagain the formula of fearing the impossible: what we fear is that what cannot happen (since the ontological dimension is irreducible to the ontic) will nonetheless happen… And the same point is made in more common terms by cultural critics from Fukuyama and Habermas to McKibben worried about how the latest techno-scientific developments (which potentially made the human species able to redesign and redefine itself) will affect ourbeing-human –the call we hear is best encapsulated by the title of McKibben’s book: "enough." [4] Humanity as a collective subject has to put a limit and freely renounce further "progress" in this direction. McKibben endeavors to empirically specify this limit: somatic genetic therapy is still this side of the enough point, one can pr actice it without leaving behind the world as we’ve known it, since we just intervene into a body formed in the old "natural" way; germline manipulations lie on the other side, in the world beyond meaning. When we manipulate psychic and bodily properties of individuals before they are even conceived, we pass the threshold into full-fledged planning, turning individuals into products, preventing them from experiencing themselves as responsible agents who have to educate/form themselves by the effort of focusing their will, thus obtaining the satisfaction of achievement - such individuals no longer relate to themselves as responsible agents… The insufficiency of this reasoning is double. First, as Heidegger would have put it, the survival of being-human of humans cannot depend on an ontic decision of humans. Even if we try to define the limit of the permissible in this way, the true catastrophe already happened: we already experience ourselves as in principle manipulable, we just freely renounce to fully deploy these potentials. But the crucial point is that, not only will with biogenetic planning our universe of meaning disappear, i.e., not only are the utopian descriptions of the digital paradise wrong, since they imply that meaning will persist; the opposite, negative, descriptions of the "meaningless" universe of technological self-manipulation is also the victim of a perspective fallacy, it also measures the future with inadequate present standards. That is to say, the future of technological self-manipulation only appears as "deprived of meaning" if measured by (or, rather, from within the horizon of) the traditional notion of what a meaningful universe is. Who knows what this "posthuman" universe will reveal itself to be "in itself"? What if there is no singular and simple answer, what if the contemporary trends (digitalization, biogeneticself-manipulation) open themselves up to a multitude of possible symbolizations? What if the utopia – the pervert dream of the passage from hardware to software of a subjectivity freely floating between different embodiments - and the dystopia - the nightmare of humans voluntarily transforming themselves into programmed beings - are just the positive and the negative of the same ideological fantasy? What if it is only and precisely this technological prospect that fully confronts us with the most radical dimension of our finitude?Today’s politics is more and more the politics of jouissance, concerned with the ways of soliciting or controlling and regulating jouissance. Is the entire of opposition between the liberal/tolerant West and the fundamentalist Islam not condensed in the opposition between, on the one side, the woman’s right to free sexuality, inclusive of the freedom to display/expose oneself and provoke/disturb man, and, on the other side, the desperate male attempts to eradicate or, at least, keep under control this threat (recall the ridiculous Taliban prohibition of metal heels for women – as if, even if women are entirely covered with cloth, the clinging sound of their heels would still provoke men)? And, of course, both sides ideologically/morally mystify their position: for the liberal West, the right to provocatively expose oneself to male desire is legitimized as the right to freely dispose of one’s body and to enjoy it as one wants, while for Islam, the control of feminine sexuality is, of course, legitimized as the defense of woman’s dignity against the threat of being reduced to an object of male sexual exploitation. So while, when the French State prohibited women to wear veils in the school, one can claim that, in this way, they were enabled to dispose of their body, one can also point out how the true traumatic point for the critics of Muslim "fundamentalism" was that there were women who did not participate in the game of making their bodies disposable for sexual seduction, for the social circulation/exchange involved in it. In one way or another, all other issues relate to this one: gay marriage and their right to adopt children, divorce, abortion… What the two opposite attitudes share is the extreme disciplinary approach, which is in each case differently directed: "fundamentalists" regulate in detail the feminineself-presentation to prevent sexual provocation; PC feminist liberals impose a no less severe regulation of behavior aimed at containing different forms of harassment.In some "radical" circles in the US, a proposal to "rethink" the rights of necrophiliacs (those who desire to have sex with dead bodies) recently started to circulate – why should they be deprived of it? So the idea was formulated that, in the same way people sign permission for their organs to be use for medical purposes in the case of their sudden death, one should also allow them to sign the permission for their bodies to be given to necrophiliacs to play with them… Is this proposal not the perfect exemplification of how the PC stance realizes Kierkegaard’s old insight into how the only good neighbor is a dead neighbor? A dead neighbor – a corpse – is the ideal sexual partner of a "tolerant" subject trying to avoid any harassment: by definition, a corpse cannot be harassed; at the same time, a dead body DOES NOT ENJOY, so the disturbing threat of the excess-enjoyment to the subject playing with the corpse is also eliminated...However, one should add a qualification here. What we have today is not so much the POLITICS of jouissance but, more precisely, the REGULATION(administration) of jouissance which is stricto sensu post-political. Jouissance is in itself limitless, the obscure excess of the unnameable, and the task is to regulate this excess. The clearest sign of the reign of biopolitics is the obsession with the topic of "stress": how to avoid stressful situations, how to "cope" with them. "Stress" is our name for the excessive dimension of life, for the "too-muchness" to be kept under control. (For this reason, today, more than ever, the gap that separates psychoanalysis from therapy imposes itself in all its brutality: if one wants therapeutic improvement, one will effectively get a much faster and efficient help from a combination of behavioral-cognitivist therapies and chemical treatment (pills).How, then, are we to draw the line of distinction between the two excesses: the excess of the Fascist spectacle, of its passion with regard to the "normal" bourgeois life, or, today, the excess that pertains to "normal" capitalist reproduction itself, its constant self-revolutionizing; and the excess of Life itself? This duality reflects itself in the ambiguous status of the "undead": undeadness is simultaneously the name for the excess of drive AND the name for the vampyric pseudo-excess covering up the fact that "we are not really alive." Perhaps, the way to distinguish the constitutive ontological excess from the obscene excess-supplement is, again, by means of the logic of non-all, i.e., with regard to its relationship to the presupposed "normality": the obscene excess is the excess of exception which sustains "normality," while the radical ontological excess is a "pure" excess, excess to nothing, the paradox of an excess "as such," of something which is in itself excessive, with no presupposed normality.The superego imperative to enjoy thus functions as the reversal of Kant’s Du kannst, denn du sollst! (You can, because you must!) – it relies on a "You must because you can!". That is to say, the superego aspect of today’s"non-repressive" hedonism (the constant provocation we are exposed to, enjoining us to go to the end and explore all modes of jouissance) resides in the way permitted jouissance necessarily turns into obligatory jouissance. However, the question here is: does the capitalist injunction to enjoy effectively aim at soliciting jouissance in its excessive character, or are we ultimately rather dealing with a kind of universalized pleasure-principle, with a life dedicated to pleasures? In other words, are the injunctions to have a good time, to acquire self-realization and self-fulfilment, etc., not precisely injunctions to AVOID the excessive jouissance, to find a kind of homeostatic balance? Are Dalai-Lama’s advices not advices how to maintain a balanced "proper measure" and avoid the disturbing extremes? The situation is here more complex: the problem is that, although the immediate and explicit injunction calls for the rule of pleasure-principle that would maintain homeostasis, the effective functioning of the injunction explodes these constraints into a striving towards excessive enjoyment.Addendum on Badiou and his Logics of Worlds (Logiques des mondes)There is no final solution on the horizon today, Capital is here to stay, all we can hope for is a temporary truce. That is to say, undoubtedly worse that this deadlock would have been a pseudo Deleuzian celebration of the successful revolt of the multitude.There is a nice Hitchcockian detail in Finding Nemo: when the monstrous daughter of the dentist enters her father's office in which there is the aquarium with fishes, the music is that of the murder scene from Psycho. The link is more refined than the idea that the girl is a horror to small helpless animals: at the scene's end, Nemo escapes by being thrown into the wash basin hole. This is his passage from the world of the humans to his own life world (he ends up in the sea close to the building, where he rejoins his father), and we all know the key role of the motif of the hole in which water disappears in Psycho (the fade out of the water disappearing in this hole to Marion's dead eye, etc.). The hole in the wash basin thus functions as a secret passage way between the two totally disparate universes, the human one and the one of the fishes. This is true multiculturalism, this acknowledgement that the only way to pass to the Other's world is through what, in our world, appears as the shit exit, as the hole into the dark domain, excluded from our everyday reality, into which excrements disappear. The radical disparity of the two worlds is noted in a series of details-say, when the father dentist catches the small Nemo into his net, he thinks he saved Nemo, from certain death, failing to perceive that what made Nemo so terrified that he appeared on the brink of death was his own presence... However, the wager of the notion of Truth is that this obscene-unnameable link, secret channel, between worlds is not enough: there is a genuine "universal" Truth that cuts across the multitude of worlds. Badiou's elaboration of the topic of world, the "logic of worlds" comes from his deeper insight into capitalism. The concept of world was necessitated by the need to think the unique status of the capitalist universe as worldless. He declares that our time is "devoid of world," [5] showing a distinct perception of how to understand the notion of capitalist globalization. Capitalism is the first socio-economic order which de-totalizes meaning: it is not global at the level of meaning (there is no global "capitalist world view," no "capitalist civilization'' proper, the fundamental lesson of globalization is precisely that capitalism can accommodate itself to all civilizations, from Christian to Hindu and Buddhist); its global dimension can only be formulated at the level of truth without meaning, as the "real" of the global market mechanism. Consequently, insofar as capitalism already enacts the rupture between meaning and truth, it can be opposed at two levels: either at the level ofmeaning (conservative reactions to re-frame capitalism into some social field of meaning, to contain its self-propelling movement within the confines of a system of shared "values'' which cement a "community" in its "organic unity") , or to question the real of capitalism with regard to its truth-outside meaning (what, basically, Marx did).Another problem arises apropos truth: if, for Badiou, the truth event is always local, the truth of a determinate historical world, how are we to formulate the truth of a worldless universe? Is, as Toscano seems to indicate, this the reason why, 'in spite of his acknowledgment of the "ontological" break introduced by capitalism, Badiou avoids the topic of anti-Capitalist struggle, even ridiculing its main form today (the anti-globalization movement), and continues to define the emancipatory struggle in strictly political terms, as the struggle against (liberal) democracy as today's predominant ideologico-political form? "Today the enemy is not called Empire or Capital. It is called Democracy." [6] Alberto Toscano's critique of Badiou at this point nonetheless falls short:In this respect, we disagree with Badiou's strong claim /.../ This is emphatically not because we think that Badiou's attack on the fetishism of democracy is problematic, but rather because we contend that despite chattering battalions of smug idolaters and renegade ideologues Badiou overestimates the inhibiting force, as an 'ideological, or subjective, formalization,' of the liberal democratic notion of equality. It is not the principle of democratic representation that hampers the political emancipation of subjects, but rather the deep-seated conviction that there is no alternative to the rule of profit. The cynicism of today's 'democratic' subjects, who know full well that they play a negligible role in the management of the commons and are entirely aware of the sham nature of the apparatuses of representation, is founded on the perceived inevitability of capitalism, not vice versa. [7]What one should add here, in defence of Badiou, is that it is not directly "the deep seated conviction that there is no alternative to the rule of profit" which "hampers the political emancipation of subjects": what prevents the radical questioning of capitalism itself is precisely the belief in the democratic form of the struggle against capitalism. Here, Lenin's stance against "economism" as well as against "pure" politics is crucial today, apropos of the split attitude towards economy in (what remains of) the Left: on the one hand, the "pure politicians" who abandon economy as the site of struggle and intervention; on the other hand, the economists, fascinated by the functioning of today's global economy, who preclude any possibility of a political intervention proper. Today, more than ever, we should here return to Lenin: yes, economy is the key domain, the battle will be decided there, one has to break the spell of the global capitalism but the intervention should be properly political, noteconomic. Today, when everyone is "anticapitalist," up to the Hollywood "socio-critical" conspiracy movies (from The Enemy of the State to The Insider) in which the enemy are the big corporations with their ruthless pursuit of profit, the signifier "anticapitalism" has lost its subversive sting. What one should problematize is rather the self-evident opposite of this "anticapitalism": the trust in the democratic substance of the honest Americans to break up the conspiracy. this is the hard kernel of today's global capitalist universe, its true Master Signifier: democracy. And are the latest statements of Negri and Hardt not a kind of unexpected confirmation of this Badiou's insight? Following a paradoxical necessity, their very (focusing on) anti-capitalism led them to acknowledge the revolutionary force of capitalism, so that, as they put it recently, one no longer needs to fight capitalism, because capitalism is already in itself generating communist potentials-the "becoming-communist of capitalism," to put it in Deleuzian terms...What we are dealing with here is another version of the Lacanian il n'y a pas de rapport...: if, for Lacan, there is no sexual relationship, then, for Marxism proper, there is no relationship between economy and politics, no"meta-language" enabling us to grasp from the same neutral standpoint the two levels, although-or, rather, because-these two levels are inextricably intertwined. The "political" class struggle takes place in the midst of economy (recall that the very last paragraph of Capital III, where the text abruptly stops, tackles the class struggle), while, at the same time, the domain, of economy serves as the key enabling us to decode political struggles. No wonder that the structure of this impossible relationship is that of the Moebius band: first, we have to progress from the political spectacle to its economic infrastructure; then, in the second step, we have to confront the irreducible dimension of the political struggle in the very heart of the economy.It is this parallax gap that also accounts for the two irreducible dimensions of modernity: "political" is the logic of domination, of regulative control ("biopolitics," "administered world"); "economic" is the logic of the incessant integration of the surplus, of constant "deterritorialization." The resistance to the Political domination refers to the "supernumerary" element which cannot be accounted for in the terms of the political order but how are we to formulate resistance to the economic logic of reproduction through excess? (And, let us not forget, this excess is strictly correlative to the excess of power itself over its "official" representative function.) The Leftist dream throughout the XXth century was activated through the subordination of the economic to the political (State control of the process of production). In their last works, Negri and Hardt seem to succumb to the opposite temptation, to shifting the focus on economic struggle, in which one can rely on State.And therein resides the deadlock of Badiou's politics, after he proclaimed the。
Unitarizable highest weight representations for affine Kac-Moody algebras
UNITARIZABLE HIGHEST WEIGHT REPRESENTATIONS FORAFFINE KAC-MOODY ALGEBRASJuan J. García-Escudero and Miguel Lorente.Departamento de Física, Universidad de Oviedo33007 Oviedo, Spain.AbstractThe main purpose of this work is to review the results obtained recently concerning the unitarization of highest weight representations for affine Kac-Moody algebras following the work of Jakobsen and Kac.1. IntroductionIn the past two decades interest on infinite dimensional Lie algebras has increased for both mathematicians and physicists.The main purpuse of this work is to review the results obtained recently concerning the unitarization of highest weight representations for affine Kac-Moody algebras following the works of Jakobsen and Kac.2. The Affine Kac-Moody Algebras Let g be a finite dimensional semisimple complex Lie algebra with Chevalley basis H α , E α , F α with α belonging to the set of simple roots. The elements of the so-called Cartan matrix A are defined byA jk = αk H αj =j j , j , k = 1, 2, … lwhere αj , αk = B h αj , h αk , B ( , ) being the Killing form of g and h α an element of the Cartan subalgebra h which is assigned uniquely to each root α ∈ ∆ by the requirement that B (h α , h ) = α(h ) for all h ∈ hThe elements in the Chevalley basis satisfyH αj , E αk = A jk E αk , H αj , F αk = –A jk F αkE αj ,F αk = δjk H αjfor all αj , αk ∈ ∆Every finite dimensional semisimple complex Lie algebra can be constructed from its Cartan matrix A which satisfies the following propierties.a) A ii = 2 ∀i , i = 1, … , l ,b) A ij = 0, –1, –2, or –3 if i ≠ j , i , j = 1, … , l ,c) A ij = 0 if and only if A ji = 0d) det A and all proper principal minors of A are positive.The starting point on the construction of infinite dimensional Kac-Moody algebras is the definition of a generalized Cartan-Matrix with elementsA ij i ,j ∈ I , I = 0, 1 … , l satisfyinga) A ii = 2 ∀i ∈ Ib) for i ≠ j A ij is either zero or a negative integerc) A ij = 0 if and only if A ji = 0A Lie algebra whose Cartan matrix is a generalized Cartan matrix is called a Kac-Moody algebra ([1],[2]). A Kac-Moody algebra is affine if its generalized Cartan matrix is such that det A = 0 and all the proper principal minors of A are positive.In the following we restrict ourselves to the affine case.For a Kac-Moody algebra the Cartan subalgebra h is divided into two parts h = h ' ⊕ h " .The basis elements of h' are H αj j ∈ I and h " is the one-dimensional complementary subspace of h ' in h generated by the element d .The center C in the affine case is one-dimensional. Every element of C is amultiple of h δ where δ is defined by the following conditionδ (h ) = 0 for h ∈ h 'δ (d ) = 1 for d ∈ h "The Cartan subalgebra h has dimension l + 2. In order to obtain a basis for h * we need l +2 linear functionals. We have αk (k = 0, … l ), then we must define another linear functional Λ0:Λ0 , αk =α0 , α0 i f k = 0 i f k = 1, 2, … l Λ0 , δ = 2 α0 , α0 There exists two types of affine complex Kac-Moody algebras: Untwisted and Twisted. The untwisted ones g (1) may be constructed starting from any simplecomplex Lie algebra. The twisted affine Kac-Moody algebras g (q) (q = 2,3) can all be constructed as subalgebras of certain of these untwisted algebras.i) Untwisted affine Kac-Moody algebras Let g be a simple complex Lie algebra of rank l . A realization of the complex untwisted affine Kac-Moody algebra g (1) is given by g 1 = ¢c ⊕ ¢d ⊕ z j ⊗ g∑j ∈Z with the following conmutation relationsz j ⊗ a , z k ⊗ b = z j +k ⊗ a , b + j δj ,–k B a , b c ∀a ,b ∈ gz j ⊗ a , c = 0d , z j ⊗ a = j z j ⊗ ad , c = 0The l + 2 –dimensional Cartan subalgebra is η1 = ¢c ⊕ ¢d ⊕ ¢ 1 ⊗ h αk ∑k =1lWe can decompose η1 = η' ⊕ η'' with η' = ¢c ⊕ ¢ 1 ⊗ h αk∑k =1land η'' = ¢d . A basis for η'* can be constructed with the elements αk (corresponding to H αk ≡ 1 ⊗ h αk j = 1, … l ) and δ = α0 – γr (corresponding to the centergenerator c ) where γr is the extension of the highest root. We can take as basis element for η''* the linear functional Λ0 (corresponding to the element d ).In this way the Killing form B (1) ( , ) for the untwisted case is B1 H αj , H αk = αj , αk j , k = 1, … , l B 1 c , H αk = δ , αk = 0 k = 1, … , l B 1 c , c = δ , δ= 0 B1 d , d = Λ0 , Λ0 = 0 B1 d , H αj = Λ0 , αj = 0 j = 1, … , l B 1 d , c === 1The set of roots can be divided into two subsets: real roots (satisfying (α,α) > 0)and imaginary roots (with (α,α) ≤ 0)a) Real Roots:i) Extensions of positive roots on g i.e.α 1 ⊗ h αk = α h αkk = 1, 2, … , lα c = α d = 0ii) Roots j δ + α , j = ±1, ±2, … is the extension of any non-zero root αof g .The basis elements of g j δ+α can be taken as e j δ + α = z j ⊗ e α j = 0, ±1, ±2, … and where e α is an element of the Lie algebra g in a Cartan-Weyl basis. We have dim g j δ + α = 1b) Imaginary Roots: j δ , j = ±1, ±2, …The basis elements of g j δ are e j δ k = z j ⊗ h αkk = 1, … l , j = ±1, ±2, … . Inthis case dim g j δ = l .The complete set of Untwisted affine Kac-Moody algebras is (see Appendix).A l 1 l = 1, 2, … ,B l 1 l = 3, 4, … ,C l 1 l = 2, 3, …D l 1 l = 4, 5, … ,E 61 , E 71 , E 81 ,F 41 ,G 21ii) Twisted Affine Kac-Moody algebrasLet g be a simple complex Lie algebra and τ a rotation of the set of roots of g .If the rotation τ is not an element of the Weyl group of g then there exist an associated outer automorphism ψτ such that ψτ h α = h τα. We have τq = 1 and also ψτq = 1 with q = 2,3. The eigenvalues ofψτ are e 2πip /q , p = 0, 1, … q – 1 . Let g p qbe the eigenspace corresponding to the eigenvalue e 2πip /q . The Twisted Affine Kac-Moody algebra is then:The sets of real and imaginary roots are in this case:a) Real Roots: j δ + α , j mod q = p and α extensions of elements of ∆p q , p = 0, 1, … , q – 1b) Imaginary Roots: j δ , j = ±1, ±2, …The Twisted Kac-Moody algebras can be labeled in the following way (see Appendix):A l 2 l ≥ 1 A l –12 l ≥ 3 D l 2 l ≥ 2E 62 D 43 3. Highest Weight Representations. The Contravariant Hermitian FormWe can take a basis for an untwisted affine Kac-Moody algebra g (1) as ([1]):e0 = z ⊗ F γ r ƒ0 = z –1 ⊗ E γ r h 0 =– 1 ⊗ H γ re i = 1 ⊗ E i ƒi = 1 ⊗ F i h i = 1 ⊗ H i i = 1, … , l ,where γr is the highest positive root. From this basis we can constructA subset ∆+ of ∆ is called a set of positive roots if the following propierties are satisfiedg 1 = ¢c ⊕ ¢d ⊕ z j ⊗ g ∑j ∈Zi) If α , β∈∆+ and α + β∈∆ then α + β∈∆+ii) If α∈∆ then either α or –αbelongs to ∆+iii) If α∈∆+ then –α∉∆+For each set of positive roots we may construct a Borel subalgebrab =⊕gαα∈∆+∪0 . A subalgebra p ⊂ g such that b ⊂ p is called a parabolicsubalgebra.Let U(g) denote the universal enveloping algebra of g and let ω be an antilinear anti-involution of g i.e.ωx , y=ωy ,ωx andωλx=λωx such thatg = p + ωpAn antilinear anti-involution ω of g is called consistent if ∀α∈∆,ω gα= g–α. When ω e i = F i and ω h i =h i (i = 0, … l) then ωis called the compact antilinear anti-involution and is denoted by ωcLet now Λ: p →¢ be a 1- dimensional representation of p. A representation Π: g → gl V is called a highest weight representation with highest weight Λ if there exists a vector ϑΛ∈ V satisfyinga)Πu gϑΛ= Vb)ΠxϑΛ=ΛxϑΛ∀x ∈pAn Hermitian form H on V such thatHϑΛ,ϑΛ=1HΠg u , v=H u ,Πωg v∀g ∈ g ; u,v ∈ Vis called contravariant. When H is positive semi-definite, Π is said to be unitarizable.In the following we construct the Hermitian form H ([4]). We choose a subspace n ⊂ g such that g = p ⊕ n . Then we have U g= n U g⊕ U p . Let β be the proyection on the second sumand. Let Λ be a 1-dimensional representation of aparabolic subalgebra pb as in the integrablerepresentations case) satisfying Λβu=∀u ∈ U g.Let pΛ=x ∈ p Λx =0. The spaceMp,ωΛ=U g U g pΛdefines a representation of g on M p ,ω Λ via left multiplication that is called a(generalized) Verma module and that is a highest weight representation. In addition it can be shown that there exists a unique contravariant hermitian form defined by H u , v = Λβ ω v u for u ,v ∈ U gwhich is independent of the choice of p .Let I (Λ) denote the Kernel of H on M p ,ω Λ . Then H is nondegenerate on the highest weight moduleL p ,ω Λ = M ΛI ΛIn the following we will give for each of the unitarizable representations(integrable, elementary and exceptional) the choice of p and ω for which the hermitian form is nondegenerate and positive definite.4. Integrable representationsLet Πst = α0, … αl be the standard set of simple roots (one possible realization is given in the Appendix). The standard set of positive roots is∆+st = k i αi ∑ / k i = 0, 1, 2, … αi ∈ Πst and the corresponding Borel subalgebra is denoted by b st :b st = ¢c ⊕ 1 ⊗ b ⊕ z ⊗ g ⊕ z 2 ⊗ g ⊕ … =+ span z k ⊗ h i k ≥ 0, i = 0, … l ⊕ span z k ⊗ e i k ≥ 0, i = 0, … l ⊕⊕ span z k ⊗ f i k > 0, i = 0, … lLet ω = ωc and let Λ : b st→ ¢ be a 1-dimensional representation of b st defined by Λ e i = 0 Λ h i = m i ∈ Z + i = 0, … lThese representations are called the integrable highest weight representations. In particular if g is finite-dimensional, these are the finite dimensional representations.The fundamental weight Λ0, Λ1, … Λl are such thatΛj H k == δjkΛj d = 0 j , k = 0, … lIn this way given the fundamental weight of a finite dimensional Lie algebra gΛj H k==δjk j , k =1,… lwe can construct the fundamental weights of the Kac-Moody algebra g as extensions of the fundamental weights Λ in the following way:Λj=Λj+µjΛ0µj=–A ok A–1kj∑k=1lA being the Cartan matrix of g and Λ0 the linear functional defined in paragraph 2.Every integrable highest weight representation is unitarizable.5. Elementary representationsWe know that for a finite dimensional simple Lie algebra g an infinite dimensional highest weight representation is unitarizable only if ω is a consistent antilinear anti-involution corresponding to a hermitian symmetric space (see [6] –[9]).The remaining unitarizable representations can be constructed only for Kac-Moody algebras related to these type of finite dimensional Lie algebras.Let b =⊕gαα∈∆+∪0 be a Borel subalgebra of the finite dimensional Lie algebrag .Consider the parabolic subalgebra (called “natural”)p nat= z n⊗ b =span z n⊗ hi , z n⊗ ei n∈Z , i = … lTake a Cartan decomposition of the Lie algebra g corresponding to a hermitian symmetric space:g = p–⊕ k ⊕ p+,k = k–⊕η⊕ k+where p and k are the subspace and the subalgebra corresponding to non-compact and compact roots respectively.We define an antilinear anti-involution ω of g byω z n ⊗ k i + = z –n ⊗ k i - i = 2, … l , n ∈ Zω z n ⊗ p 1+ = –z –n ⊗ p 1-ω z n ⊗ h i = z –n ⊗ h i i = 0, 1, … ln ∈ Zwhere k 2+, … , k l + belong to k + and where p 1+ belongs to the root space corresponding to the unique simple non compact root. In the previous notatione 1 = p 1+ and e i = k i+ for i = 2, … l.Consider now a set of highest weights Λ1, … , ΛN corresponding to unitarizable highest weight modules for the hermitian symmetric space g (for an explicit calculation see [8] and [9]). Define a representation p nat → ¢ by Λ z k ⊗ x = C i k Λi x∑i =1Nfor x ∈ b and C k i ∈ ¢ with C k i = 1Then the resulting representation is called “elementary” and it is unitarizable.6. Exceptional representationsAnother class of unitary representations (called “exceptional”) are constructed in this paragraph for the Kac-Moody algebra z k ⊗ su n ,1 k ∈ Z , n ≥ 1 .Let g = su n ,1 and let be a Cartan decomposition g = k ⊕ p . Thenη = k 1 ∩ η ⊕ R h c where k 1 =h c belongs to the center of g .We take a realization of g = z k ⊗ su n ,1 in terms of matricesa ij zi ,j = 0, … n . The matrix elements are of the form a z = a n e in θ∑n ∈Zwithz = e i θz = a n e in θ∑n ∈Z . Letp = a ij z ∈ g a ij = 0 if i > j be the parabolic subalgebra. The antilinear anti-involution acts in this case as ω z k ⊗ h c : ω a 00 z = a 00 z –1 ω z k ⊗ p +: ω a 0j z = –a j 0 z –1 j = 1, … n ω z k ⊗ k 1 : ω a ij z = a ji z –1 i , j = 1, … nDefine a representation Λ : p → ¢ byΛaijz=0 i , j =1,… nΛa0jz=0 j =1,… nΛa00z=–a00e iθ dµθ=–ϕa00z s1where µθ is a positive mesure defined in the unit circle s1 and infinitely supported.It can be shown (see [4]) that the hermitian form H (we remind that it is completely determined by giving ω , p and a representation of p) is positive definite and then the corresponding representation in the space L p,ω (L) is unitary.7.The only remaining possibility in order to complete the set of all unitarizable representations for affine Kac-Mooey algebras is the corresponding to the highest component of a tensor product of an elementary with an exceptional representation for z k⊗ su n,1 (see [5]).APPENDIXIn the following we give the set of simple roots for the affine Kac-Moody algebras in a Cartesian coordinate basis having in mind that the scalar product induced by the Killing form in the space η* is not euclidean ([3]):Given v = v i e i w = w i e i i = 1, … n .v ,w = v i w i ∑i =1n –2+ v n –1 w n + v n w n –1where e i denoter the basis vector with 1 in the position i and zero elsewhere.Untwisted Affine Kac-Moody AlgebrasA 1(1):α0α1α0 = –e 1 + e 2 + e 4α1 = e 1 – e 2δ = e 4A l (1) l ≥ 2:α0α1α2αl-1αlα0 = –e 1 + e l +1 + e l +3αi = e i – e i +1 i = 1, … l δ = e l +3B l (1) l ≥ 3:α1α2α3αl-2αl-1αlαα0 = –e 1 – e 2 + e l +2αi = e i – e i +1 i = 1, … l –1αl = e l δ = e l +2C l (1) l ≥ 2:α0α1α2αl-1αlα0 = –2e 1 + e l +2αi = e i – e i +1 i = 1, … l –1αl = 2e l δ = e l +2D l (1) l ≥ 4:α1ll-1α0 = –e 1 – e 2 + e l +2αi = e i – e i +1 i = 1, … l –1αl = e l –1 + e l δ = e l +2E 6(1)α1α2α3α5α4α0 = 12– e 1 – e 2 – e 3 – e 4 – e 5 + e 6 + e 7 – e 8 + 2e 10α1 = 12e 1 – e 2 – e 3 – e 4 – e 5 – e 6 – e 7 + e 8αi = – e i –1 + e i i = 2, 3, 4, 5α6 = e 1 + e 2 δ = e 10E 7(1)α0α1α2α3α5α4α6α0 = e 7 – e 8 + e 10α1 = 12e 1 – e 2 – e 3 – e 4 – e 5 – e 6 – e 7 + e 8αi = – e i –1 + e i i = 2, 3, 4, 5, 6α7 = e 1 + e 2 δ = e 10E 8(1)α0α1α2α3α5α4α6α7α0 = – e 7 – e 8 + e 10α1 = 12e 1 – e 2 – e 3 – e 4 – e 5 – e 6 – e 7 + e 8αi = – e i –1 + e i i = 2, 3, 4, 5, 6, 7α8 = e 1 + e 2 δ = e 10F 4(1)01234α0 = – e 1 – e 2 + e 6αi = e i +1 – e i +2 i = 1, 2α3 = e 4α4 = 12e 1 – e 2 –e 3 – e 4δ = e 6G 2(1)α0 = e 1 + e 2 – 2e 3 + e 5α1 = – 2e 1 + e 2+ e 3 α2 = e 1 – e 2δ = e 5Twisted Affine Kac-Moody AlgebrasA 2(2)1Outer automorphismRootsα12α0 = – e 1 + e 3 + 12e 5τ α′1 = α′2α1 = 12e 1 – e 3τ α′2 = α′1δ = 12e 5A 2l (2) l ≥ 2004l-1lOuter automorphismRootsα'1α'2α'2l-1α'2lα0 = – e 1 + e 2l +1 + 12e 2l +3τα′k = α′2l +1–k αi =i – e i +1 + e 2l –i +1 – e 2l –i +2 i = 1,…, l –1k = 1, 2, … lαl =l – e l +2δ = 12e 2l +3A 2l –1(2) l ≥ 3α1α2αl-1αlOuter automorphismRootsα'1α'2α'2l-1α'2lα0 = e 1 – e 2 + e 2l –1 + e 2l + e 2l +2τ α′k = α′2l–k k = 1, … , l –1αi =i – e i +1 + e 2l –i – e 2l –i +1i = 1, …, lτ α′l = α′lαl = e l – e l +1δ = 12e 2l +2D l +1(2) l ≥ 2α1α2αl-1αlα0Outer automorphismRootslα'l-1α'α0 = – e 1 + 12e l +3τ α′k = α′k k = 1, 2, … , l –1αi = e i – e i +1 i = 1, … , l –1τ α′l = α′l +1αl = e l τ α′l +1 = α′lδ = 12e l+3E 6(2)α1α2α3α4α0Outer automorphismRootsα'12345α'α'α'α'τ α′k = α′6–k k = 1, 2, … , 5α0 = e 5 + e 6 + e 7 – e 8 + e 10τ α′6 = α′6α1 =1 – e 2 – e 3 – 3e 4 +e 5 – e 6 – e 7 + e 8α2 = e 1 + e 2 – e 3 + e 4α3 = – e 2 + e 3α4 = e 1 + e 2δ = 12e 10D 4(3)α0α1α2Outer automorphismRoots4'3'τ α′1= α′3α0 = 2e 1 – e 2 – e 3 + e 6τ α′2= α′2α1 =1 – e 2 + 2e 3τ α′3 = α′4α2 = e 2 – e 3τ α′4 = α′1δ = 13e 6References[1] KAC, V.G. Infinite dimensional Lie algebras ; Cambridge University Press third edition,Cambridge 1990.[2] CORNWELL, J.F. Group Theory in Physics , Vol III. Academic Press (1989).[3] GODDARD, P and OLIVE, D. Kac-Moody and Virasoro algebras in relation to Quantum Physics.Int. J. Mod. Phys. A 1 (1986).[4] JAKOBSEN, H.P. and KAC, V. A new class of unitarizable highest weight representations ofinfinite dimensional Lie algebras, in Non-Linear Equations in Classical and Quantum Field Theory (ed. N. Sánchez). Lect. Notes in Phys. # 226, Springer Verlag (1985).[5] JAKOBSEN, H.P. and KAC, V. A new class of unitarizable highest weight representations ofinfinite dimensional Lie algebras II. J. Funct. Anal. 82 (1989).[6] JAKOBSEN, H.P. Hermitian Symmetric Spaces and their Unitary Highest Weight Modules. J.Funct. Anal. 52 (1983).[7] ENRIGHT, T; HOWE, R.; WALLACH, N. A classification of Unitary Highest Weight Modules,in Representation Theory of Reductive Groups (ed. P. Trombi) Progress in Math.40. Birkhaüser, Boston (1983).[8] GARCÍA-ESCUDERO, J. and LORENTE, M. Highest Weight Unitary Modules for Non-CompactGroups and Applications to Physical Problems, in Symmetries in Science V (ed.B. Gruber et al.) Plenum Publishing. New York (1991).[9] GARCÍA-ESCUDERO, J. and LORENTE, M. Classification of Unitary Highest WeightRepresentations for Non-compact Real Forms. J. Math. Phys. 31 nº 4 (1990).。
40U-P 机柜现场准备指南说明书
Site Preparation Guide40U-P CabinetSite Preparation GuideRev. 04June 2020This Site Preparation Guide contains information about the 40U-P cabinet. Topics include:•About this guide (2)•Tools required (2)•Environmental requirements (2)•Air quality requirements (2)•Fire suppressant disclaimer (3)•Shock and Vibration (3)•Cabinet Clearance (4)•Cabinet stabilizing (4)•Site floor load-bearing requirements (5)•Casters and leveling feet (6)•Power requirements (7)•Package dimension and clearance (9)•Your next step (10)•If you need help (10)About this guideThis document includes information on:•Environmental requirements○Temperature○Weight○Altitude○Air Quality•Shock and vibration•Cabinet clearance•Cabinet stabilizing•Site floor load-bearing requirements•Casters and leveling feet•Power requirements•Package dimensions and clearanceThe illustrations in this guide are examples only. Depending on what your ordered, your configuration may lookTools required•Scissors•Mechanical Lift or Pallet JackEnvironmental requirements•+15°C to +32°C (59°F to 89.6°F) site temperature.*A fully configured cabinet (with six 30A single-phase line cords) may produce up to 49,100 BTUs per hour. Calculate the BTUs for yourconfiguration at •40% to 55% relative humidity*•The 40U-P weighs 198 KG (435); a cabinet fully configured with EMC products can weigh approximately 1,182 kg (2600 pounds).Make sure your flooring can safely support your configuration. Calculate the minimum load-bearing requirements for your site using the product-specific weights for your system components at •0 to 2439 meters (0 to 8,000 feet) above sea level operating altitude*•LAN and telephone connections for remote service and system operation* Recommended operating parameters. Contents of the cabinet may be qualified outside these limits; refer to the product-specific documentation for system specifications.Air quality requirementsThe products are designed to be consistent with the requirements of the American Society of Heating, Refrigeration and Air Conditioning Engineers (ASHRAE) Environmental Standard Handbook and the most current revision of Thermal Guidelines for Data Processing Environments, Second Edition, ASHRAE 2009b.Cabinets are best suited for Class 1 datacom environments, which consist of tightly controlled environmental parameters, including temperature, dew point, relative humidity and air quality. These facilities house mission-critical equipment and are typically fault-tolerant, including the air conditioners.The data center should maintain a cleanliness level as identified in ISO 14664-1, class 8 for particulate dust and pollution control. The air entering the data center should be filtered with a MERV 11 filter or better. The air within the data center should be continuously filtered with a MERV 8 or better filtration system. In addition, efforts should be maintained to prevent conductive particles, such as zinc whiskers, from entering the facility.The allowable relative humidity level is 20 to 80% non condensing, however, the recommended operating environment range is 40 to 55%. For data centers with gaseous contamination, such as high sulfur content, lower temperatures and humidity are recommended to minimize the risk of hardware corrosion and degradation. In general, the humidity fluctuations within the data center should be minimized. It is also recommended that the data center be positively pressured and have air curtains on entry ways to prevent outside air contaminants and humidity from entering the facility.2For facilities below 40% relative humidity, it is recommended to use grounding straps when contacting the equipment to avoid the risk of Electrostatic discharge (ESD), which can harm electronic equipment.As part of an ongoing monitoring process for the corrosiveness of the environment, it is recommended to place copper and silver coupons (per ISA 71.04-1985, Section 6.1 Reactivity), in airstreams representative of those in the data center. The monthly reactivity rate of the coupons should be less than 300 Angstroms. When monitored reactivity rate is exceeded, the coupon should be analyzed for material species and a corrective mitigation process put in place.Storage time (unpowered) recommendation: do not exceed 6 consecutive months of unpowered storage.Fire suppressant disclaimerFire prevention equipment in the computer room should always be installed as an added safety measure. A fire suppression system is the responsibility of the customer. When selecting appropriate fire suppression equipment and agents for the data center, choose carefully. An insurance underwriter, local fire marshal, and local building inspector are all parties that you should consult during the selection a fire suppression system that provides the correct level of coverage and protection.Equipment is designed and manufactured to internal and external standards that require certain environments for reliable operation. We do not make compatibility claims of any kind nor do we provide recommendations on fire suppression systems. It is not recommended to position storage equipment directly in the path of high pressure gas discharge streams or loud fire sirens so as to minimize the forces and vibration adverse to system integrity.The previous information is provided on an “as is” basis and provides no representations, warranties, guarantees orShock and VibrationProducts have been tested to withstand the shock and random vibration levels. The levels apply to all three axes and should be measured with an accelerometer on the equipment enclosures within the cabinet and shall not exceed:Platform condition Response measurement levelNon operational shock10 G’s, 7 ms durationOperational shock 3 G’s, 11 ms durationNon operational random vibration0.40 Grms, 5–500 Hz, 30 minutesOperational random vibration0.21 Grms, 5–500 Hz, 10 minutesSystems that are mounted on an approved package have completed transportation testing to withstand the following shock and vibrations in the vertical direction only and shall not exceed:Packaged system condition Response measurement levelTransportation shock10 G’s, 12ms durationTransportation random vibration• 1.15 Grms• 1 hour Frequency range 1–200 Hz3Cabinet ClearanceThis cabinet ventilates from front to back; you must provide adequate clearance to service and cool the system. Depending on component-specific connections within the cabinet,15-foot extension power cords are required.Figure 1. Cabinet ClearanceThe illustrations in this guide are examples only. Depending on what your ordered, your cabinet may look somewhatCabinet stabilizingIf you intend to secure the optional stabilizer brackets to your site floor, prepare the location for the mounting bolts. (The additional brackets help to prevent the cabinet from tipping while you service cantilevered levels, or from rolling during minor seismic events.) The brackets provide three levels of protection for stabilizing the unit:•Anti-tip bracket - Use this bracket to provide an extra measure of anti-tip security. One or two kits may be used. For cabinets with components that slide, we recommend that you use two kits.All measurements are in inches.EMC2853•Anti-move bracket - Use this bracket to permanently fasten the unit to the floor.4Seismic restraint bracket - Use this bracket to provide the highest protection from moving or tipping.•All measurements are in inches.EMC2856Site floor load-bearing requirementsInstall the cabinet in raised or non-raised floor environments capable of supporting at least 1,180kg (2,600 lbs.) per cabinet. Your system may weigh less, but requires extra floor support margin to accommodate equipment upgrades and/or reconfiguration.In a raised floor environment:•24 x 24 inch or (60 x 60 cm) heavy-duty, concrete filled steel floor tiles are recommended.•Use only floor tiles and stringers rated to withstand:○concentrated loads of two casters or leveling feet, each weighing up to 1,000 lb (454 kg).○minimum static ultimate load of 3,000 lb (1,361 kg).○rolling loads of 1,000 (454) kg). On floor tiles that do not meet the 1,000 lb rolling load rating, use coverings such a plywood to protect floors during system roll.•Position adjacent cabinets with no more than two casters or leveling feet on a single floor tile.5•Cutouts in 24 x 24 in tiles must be no more that 8 inches (20.3 cm) wide by 6 inches (15.3 cm) deep, and centered on the tiles, 9inches (22.9 cm) from the front and rear and 8 inches (20.3 cm) from the sides. Since cutouts will weaken the tile, you can minimize deflection by adding pedestal mounts adjacent to the cutout; the number and placement of additional pedestal mounts relative to a cutout must be in accordance with the floor tile manufacture's recommendations.When positioning the cabinet, take care to avoid moving a caster into a floor tile cutout.Ensure that the combined weight of any other objects in the data center does not compromise the structural integrity of the raised floor and/or the subfloor (non-raised floor).We recommend that a certified data center design consultant inspect your site to ensure that the floor is capable of supporting thesystem and surrounding weight . Note that actual cabinet weight depends on your specific product configuration; you can calculate your total using the tools available at Casters and leveling feetThe cabinet bottom includes four caster wheels. The front wheels are fixed; the two rear casters swivel in a 1.75-inch diameter. Swivel position of the caster wheels will determine the load-bearing points on your site floor, but does not affect the cabinet footprint. Once youhave positioned, leveled, and stabilized the cabinet, the four leveling feet determine the final load-bearing points on your site floor.CL3627FrontRear viewRear viewNote: Some items in the views are removed for clarity.(see detail A)Dimension 3.620 to center of caster wheel from this surfaceDetail A(right front corner)1.750Caster swivel diameterDetail B Bottom view Leveling feetAll measurements are in inches.The customer is ultimately responsible for ensuring that the data center floor on which the system is to be configured is 6Power requirementsDepending on the cabinet configuration and input ac power source, single or three-phase, the cabinet requires two to 12 independent power sources. To determine your site requirements, use the published technical specifications and device rating labels. This will helpprovide the current draw of the devices in each rack. The total current draw for each rack can then be calculated. For Dell EMC products,visit the "Dell EMC Power Calculator" on the web at .Table 1. Single-phase power connection requirementsSpecificationNorth American3 wire connection (2 L and 1 G)aInternational and Australian 3 wire connection (1 L, 1 N, and 1 G)Input nominal voltage200 - 240 V ac +/- 10% L - L nom 220 - 240 V ac +/- 10% L - L nomFrequency 50 - 60 Hz 50 - 60 HzCircuit breakers 30 A 32 A Power zonesTwo TwoPower requirements at site (minimum to maximum)•One to six 30 A, single-phase drops per zone•Each rack requires a minimum of two drops to a maximum of 12 drops. This will bedetermined by the system configuration and the power needs for that configuration.a.L = line phase, N = neutral, G = groundTable 2. Single-phase AC power input connector optionsSingle-phase rack connector optionsCustomer AC source interface receptacleSiteNEMA L6-30P NEMA L6-30RNorth America and JapanRussellstoll 3750DPRussellstoll 9C33U0North America and JapanIEC-309 332P6IEC-309 332C6InternationalCLIPSAL 56PA332CLIPSAL 56CSC332AustraliaTable 3. Three-phase AC power connection requirementsSpecificationNorth American (Delta)4 wire connection (3 L and 1 G)aInternational and Australian (Wye)5 wire connection (3 L, 1 N, and 1 G)Input nominal voltage 200 - 240 V ac +/- 10% L - L nom 220 - 240 V ac +/- 10% L - N nom Frequency 50 - 60 Hz 50 - 60 Hz Circuit breakers50 A32 A7Table 3. Three-phase AC power connection requirements (continued)a.L = line phase, N = neutral, G = groundTable 4. Three-phase Delta-type AC power input connector optionsThree-phase Delta rack connector optionsCustomer AC source interface receptacleSiteRussellstoll 9P54U2Russellstoll 9C54U2North America and InternationalHubbell CS-8365CHubbell CS-8364CNorth AmericaTable 5. Three-phase Wye-type AC power input connector optionsThree-phase Wye rack connector options Customer AC source interface receptacleSite GARO P432-6GARO S432-6InternationalHubbell L22-30PHubbell L22-30RNorth AmericaFly Lead Customer Receptacle International8Table 5. Three-phase Wye-type AC power input connector options (continued)Three-phase Wye rack connector options Customer AC source interface receptacle SitePackage dimension and clearanceMake certain your doorways and elevators are wide enough and tall enough to accommodate the shipping pallet and cabinet. Use a mechanical lift or pallet jack to position the packaged cabinet in its final location.EMC28369Your next stepFollow the illustrated instructions printed on the outside of the shipping unit to remove the cardboard packing material; cut the shipping straps and corner tape, then remove the top cover and tape.Refer to the 40U-P Cabinet Unpacking and Setup Guide located on for instructions on:•attaching the unloading ramp,•releasing the cabinet from the pallet,•unloading the cabinet•setting up the cabinet in your environment, and•repackaging shipping material.If you need helpFor questions about technical support and service, contact you service provider.For questions about upgrades, contact your sales office.10Notes, cautions, and warningsA NOTE indicates important information that helps you make better use of your product.A CAUTION indicates either potential damage to hardware or loss of data and tells you how to avoid the problem.A WARNING indicates a potential for property damage, personal injury, or death.© 2018 - 2020 Dell Inc. or its subsidiaries. All rights reserved. Dell, EMC, and other trademarks are trademarks of Dell Inc. or its subsidiaries. Other trademarks may be trademarks of their respective owners.。
On Moduli of G-bundles over Curves for exceptional G
a rXiv:alg-ge o m/979025v22Oct1997On Moduli of G-bundles over Curves for exceptional G Christoph Sorger 1.Introduction Let G be a simple and simply connected complex Lie group,g its Lie algebra.In the following,I remove the restriction “G is of classical type or G 2”made on G in the papers of Beauville,Laszlo and myself [L-S],[B-L-S]on the moduli of principal G-bundles on a curve.As I will just “patch”the missing technical points,this note should be seen as an appendix to the above cited papers.Let M G ,X be the stack of G-bundles on the smooth,connected and projective algebraic curve X of genus g .If ρ:G →SL r is a representation of G,denote by D ρthe pullback of the determinant bundle [D-N]under the morphism M G ,X →M SL r ,X defined by extension of the structure group.Associate to G the number d (G)and the representation ρ(G)as follows:Type of G B r (r ≥3)D r (r ≥4)E 7F 4d (G)22126ρ(G)̟1̟1̟7̟4Theorem1.2.—Let G be semi-simple andτ∈π1(G).Then MτG,X is locally factorial if and only if G is special in the sens of Serre.Note that dim H0(M E8,X ,L)=dim B E8,X(1;p;0)=1has the somehow sur-prising consequence that the stack M E8,Xand(for g(X)≥2)the normal varietyM E8,Xhave a canonical hypersurface.I would like to thank C.Teleman for pointing out that a reference I used in a previous version of this paper was incomplete and mention his preprint[T],which contains a different,topological approach to theorem1.1.2.Conformal Blocks(2.1)Affine Lie algebras.Let g be a simplefinite dimensional Lie algebra of rank r over C.Let P be the weight lattice,P+be the subset of dominant weights and(̟i)i=1,...,r be the fundamental weights.Given a dominant weightλ,we denote L(λ)the associated simple g-module with highest weightλ.Finally(,)will be the Cartan-Killing form normalized such that for the highest rootθwe have(θ,θ)=2. Let L g=g⊗C C((z))be the loop algebra of g and L g be the central extension of L g (2.1.1)0- L g-0defined by the2-cocycle(X⊗f,Y⊗g)→(X,Y)Res0(gd f).Fix an integerℓ.Call a representation of L g of levelℓif the center acts by multiplication byℓ.The theory of affine Lie algebras affirms that the irreducible and integrable representations of L g are classified by the dominant weights belonging to Pℓ={λ∈P+/(λ,θ)≤ℓ}.Forλ∈Pℓ,denote Hℓ(λ)the associated representation.(2.2)Definition of conformal blocks.Fix an integer(the level)ℓ≥0.Let (X,p=(p1,...,p n))and suppose that the points are labeled byλ{p}and L X g be the Lie algebra g⊗O(X∗).We have a morphism on Lie algebras L X g→L g by associating to X⊗f the element X⊗ˆf,whereˆf is the Laurent developpement of f at p.By the residue theorem,the restriction to L X g of the central extension(2.1.1)splits and we may see L X g as a Lie subalgebra of L g.In particuler,the L g-module Hℓ(0)may be seen as a L X g-module.In addition,we may consider the g-modules L(λi)as a L X g-modules by evaluation at p i.The vector space of conformal blocks is defined as follows:(2.2.1)B G,X(ℓ;p)=[Hℓ(0)⊗C L(λ1)⊗C...C L(λn)]LX gwhere[]LX gmeans that we take co-invariants.It is known([T-U-Y]or[S],2.5.1) that these vector spaces arefinite-dimensional.Important properties are as follows:a)dim B G,P(ℓ;p1;0)=11b)If one adds a non-singular point q∈X,then the spaces B G,X(ℓ;p)and B G,X(ℓ;p,0)are canonically isomorphic([S],2.3.2).c)Suppose X is singular in c and let X→X be a partial desingularization of c.Let a and b be the points of X over c.Then there is a canonical isomorphismB G,X(ℓ;p,µ,µ∗)∼→B G,X(ℓ;p)µ∈Pℓd)The dimension of B G,X(ℓ;p)does not change when(X;pγ,α′)dzwhereγ∈LG(R),α=(α′,s)∈ L g(R)and(,)is the R((z))-bilinear extension of the Cartan-Killing form.The main tool we use is that if¯π: L g→End(H)is an integral highest weight representation,then for R a C-algebra andγ∈LG(R)there is,locally over Spec(R),an automorphism uγof H R=H⊗C R,unique up to R∗, such thatH(3.2.1)is commutative for anyα∈ L g(R)([L-S],Prop.4.3).By the above,the representation¯πmay be“integrated”to a(unique)algebraic projective representation of LG,i.e.that there is a morphism of C-groupsπ:LG→PGL(H)whose derivate coincides with¯πup to homothety.Indeed,thanks to the unicity property the automorphisms u associated locally toγglue together to define an elementπ(γ)∈PGL(H)(R)and still because of the unicity property,πdefines a morphism of C-groups.The assertion on the derivative is consequence of(3.2.1).We apply this to the basic representation H1(0)of L g.Consider the central extension (3.2.2)1-GL(H1(0))-1.The pull back of(3.2.2)to LG defines a central extension to which we refer as the canonical central extension of LG:LG-1(3.2.3)1-A basic fact is that the extension(3.2.3)splits canonically over L+G([L-S],4.9), hence we may define a line bundle on the homogeneous space Q G= LG/ L+G via the character G m×L+G→G m defined by thefirst projection.Then this line bundle(1)its dual.generates Pic(Q G)([L-S],4.11);we denote by O QG(3.3)By([L-S],6.2)the forgetful morphism Pic L(Q G)→Pic(Q G)is injec-X G(1)admits a L X G-linearization tive,and moreover(loc.cit.,6.4),the line bundle O QGif and only if the restriction of the central extension(3.2.3)to L X G splits.It is shown in[L-S]that this is indeed the case for classical G and G2by directly constructing(1).In one case the existence of the line bundles on M G,X which pull back to O QGsplitting can be proved directly:Proposition3.4.—The restriction of the central extension(3.2.3)to L X G splits for G=E8.Proof:Let H=H1(0).It suffices to show that the representation¯π:L X g→End(H) integrates to an algebraic representationπ:L X G→GL(H),which in turn will follow from the fact that in the caseγ∈L X G(R)we can normalize the automorphism uγof(3.2.1).Indeed,the commutativity of(3.2.1)shows that coinvariants are mapped to coinvariants under uγ.For g=e8,ℓ=1andλ=0,we know by(2.3)that these spaces are1-dimensional,hence we may choose uγ(in a unique way)such that it induces the identity on coinvariants.α-E6⊂γ-E8.On the level of Picard groups we deducePic(Q E8)˜f∗β-Pic(QE6)f∗̟8|F4:Pic(M SL248,X )f∗̟86(3.6)Proof of theorem1.2:According to([B-L-S],13)it remains to prove that M G,X is not locally factorial for G=F4,E6,E7or E8.In order to see this we consider again the tower(3.5.1)with additionally the natural inclusion Spin8⊂References[B-L-S]A.Beauville,szlo,and C.Sorger.The Picard group of the Moduli of G-bundles on a Curve.To appear in Compostio Math.,1996.[D-N]J.-M.Drezet and M.S.Narasimhan.Groupe de Picard des vari´e t´e s de modules de fibr´e s semi-stables sur les courbes alg´e briques.Invent.Math.,97(1):53–94,1989.[K-N]S.Kumar and M.S.Narasimhan.Picard group of the moduli spaces of G-bundles.Math.Ann.,308(1):155–173,1997.[L-S]szlo and C.Sorger.The line bundles on the moduli of parabolic G-bundles over curves and their sections.Ann.Sci.´Ecole Norm.Sup.(4),30(4):499–525,1997.[S] formule de Verlinde.Ast´e risque,237:Exp.No.794,3,87–114,1996.S´e minaire Bourbaki,Vol.1994/95.[T]C.Teleman.Borel-Weil-Bott theory on the moduli stack of G-bundles over a curve.To appear in Inv.Maths.[T-U-Y]A.Tsuchiya,K.Ueno,and Y.Yamada.Conformalfield theory on universal family of stable curves with gauge symmetries.Adv.Studies in Pure Math.,19:459–566,1989.Christoph SorgerInstitut de math´e matiques–CP7012Universit´e Paris72,place JussieuF-75251PARIS Cedex05。
世界上最高处的小岛三本书读后感
世界上最高处的小岛三本书读后感英文版Reflections on Reading "Three Books from the Highest Island in the World"As I finished the final page of "Three Books from the Highest Island in the World," I found myself lost in a sea of thoughts and reflections. This remarkable book, penned by an anonymous author, takes readers to a journey that is both exciting and thought-provoking.The book opens with a vivid description of the island, perched atop the world's tallest mountain range. This island, isolated and serene, is home to a trio of ancient books that hold the secrets of the universe. As the story unfolds, we meet a group of adventurers who embark on a perilous quest to retrieve these books.What I found most intriguing about this book is its blend of adventure and philosophy. The author masterfully weavestogether the excitement of the journey with profound insights into life, love, and the meaning of existence. The characters, each unique and well-developed, serve as mirrors reflecting our own fears, dreams, and aspirations.The island, with its serene beauty and mysteries, serves as a powerful metaphor for our inner selves. The books, each containing profound wisdom, are not just physical objects but also representations of our untapped potential and the infinite knowledge within us.The author's use of language is beautiful and evocative, painting vivid pictures in the reader's mind. The narrative flows seamlessly, keeping the reader engaged and curious. The ending, though bittersweet, leaves a lasting impact, leaving the reader to ponder the meanings and lessons learned from the journey.In conclusion, "Three Books from the Highest Island in the World" is a must-read for anyone who loves adventure, philosophy, or simply a good story. It not only takes us to theedge of the world but also to the depths of our own hearts and minds.中文版《世界上最高处的小岛三本书》读后感反思当我读完这本名为《世界上最高处的小岛三本书》的书时,我发现自己陷入了一片思绪的海洋。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
ψ ja dγ,
Γ
ξ jb dγ ] = f abc
˜ ψ ξ jc dγ + k
ψ ′ ξdγ ;
and in particular, taking a closed path, parametrised by θ, and ψ, ξ of the form einθ , we get that Fourier coefficients of currents satisfy commutation relations of a Kac-moody algebra. In our case, the algebra is so(1, n), which is a real form of a complex algebra; still it can be promoted to a Kac-Moody-like loop algebra in the usual way; it is generated by ei ⊗R P (s), with ei ∈ so(1, n), P (s) Laurent polynomials, and the ˜ (ei , ej ) Res( dP G), where (., .) bracket [ei ⊗ P (s), ej ⊗ G(s)] = [ei , ej ] ⊗ P (s)G(s) + k ds is an invariant symmetric form on so(1, n); this form is not positive-definite. Highest weight module for such loop algebra is not unitary. If we think about boundary states, those associated with the boundary of world sheet disk, say states associated to a circle, we cannot deduce from analyticity that the state must be highest weight, as functions {einθ } on a circle, unlike functions {z n } at the origin, are equally good for positive or negative n, and in fact there are two possible candidates for representations: one non-unitary highest weight, and another unitary, not highest weight. Non highest weight representations are little studied in the framework of the conformal field theory; in particular, there is no meaningful way to have a Sugawara construction of the Virasoro algebra; instead, it is quite natural to get certain infinite dimensional laplacians in the universal enveloping algebra.
Abstract We constructed canonical non-highest weight unitary irreducible representation of so(1, n) current algebra as well as canonical non-highest weight nonunitary representations, We constructed certain Laplacian operators as elements of the universal enveloping algebra, acting in representation space. We speculated about a possible relation of those Laplacians with the loop operator for the Yang-Mills.
∞ −∞
(2)
tn tm Exp[−(t2 + 1/t2 )] dt
It is obviously positive definite and (e[n], e[m]) depends only from n + m We can and will consider other scalar products where mutiplication by s is not self-adjoint. Example: intoduce a sclar product (e[n], e[m]) = δn,m α(y irreducible representation of so(1, n) loop algebra and unitary action of operators in universal enveloping algebra
2.1
We introduce a space s of real valued functions on a circle, which is a vector space over real numbers with basis {e[n] ≡ sn }n∈Z , and with some positive definite inner product (e[n], e[m]) = F [n, m] (1) F [n, m] = F [m, n]; F [n, m] ∈ R+ , extended by linearity to the whole space. Usual multiplication of functions give rise to a product, e[n] · e[m] = e[m + n]. If we want multiplications by s ≡ e[1] and s−1 ≡ e[−1] to be self-adjoint operators (e[n], s · e[m]) = (s · e[n], e[m]) (e[n], s−1 · e[m]) = (s−1 · e[n], e[m]), then from ( 1) we have a condition F [n, m + 1] = F [n + 1, m]. Therefore in this case we should have ˜ [n + m, n − m mod 2] F [n, m] = F where n mod 2 is 0 for even n and 1 for odd n. Such scalar products exist: Example: consider the inner product (e[n], e[m]) =
hep-th
arXiv:hep-th/9903169v4 4 Jan 2000
Non-highest weight representations of the current algebra so(1, n), and Laplace Operators.
M. Zyskin
∗
March, 1999
∗
IHES, Le Bois-Marie 35, route de Chartres F-91440, Bures-sur-Yvette, France; zyskin@ihes.fr
1
1
Introduction
Recently, there was a lot of interest in string theories on AdS and other manifolds with boundaries, and to their relationship to Yang Mills quantum field theories on the boundary. String theory on AdS has a symmetry group, corresponding to isometries of target space, whose bosonic part is SO (1, n). There should be conserved Noether currents corresponding to such symmetries. Also, such string theories should be described by conformal field theories. If the conformal field theory is unitary, the currents are holomorphic, and give rise to a Kac-Moody algebra. From analyticity on world sheet, the space of states in such conformal theory, associated to points on worldsheet, should be in highest weight modules of the Kac Moody algebra, and then there is a Virasoro algebra coming via the Sugawara construction [8]. Namely, the currents are (closed) one forms on the world sheet ja (.)µ dxµ , the integrals of which over paths gives conserved charges, with values in Lie algebra; and ”equal time” commutation relations of currents should be such as to reproduce the Lie algebra commutators of charges; if we integrate the current over a path Γ on world sheet with weights ψ (γ ), γ ∈ Γ, and use commutation relations for currents, we will get [