{ "type": "memory_ai_v1", "name": "ScratchWebLM Memory", "version": "0.01", "description": "Memory-first efficient AI", "created_at": "2026-05-27 10:18:11", "chunks": [ { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-0", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Artificial intelligence ( AI ) is the capability of computational systems to perform tasks typically associated with human intelligence , such as learning , reasoning , problem-solving , perception , and decision-making . It is a field of research in engineering , mathematics and computer science that develops and studies methods and software that enable machines to perceive their environment and use learning and intelligence to take actions that maximize their chances of achieving defined goals. High-profile applications of AI include advanced web search engines , chatbots , virtual assistants , autonomous vehicles , and play and analysis in strategy games (e.g., chess and Go ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-1", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "High-profile applications of AI include advanced web search engines , chatbots , virtual assistants , autonomous vehicles , and play and analysis in strategy games (e.g., chess and Go ). The traditional goals of AI research include learning, reasoning , knowledge representation , planning , natural language processing , and perception , as well as support for robotics . To reach these goals, AI researchers have used techniques including state space search and mathematical optimization , formal logic , artificial neural networks , and methods based on statistics , operations research , and economics .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-2", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "To reach these goals, AI researchers have used techniques including state space search and mathematical optimization , formal logic , artificial neural networks , and methods based on statistics , operations research , and economics . Some companies, such as OpenAI , Google DeepMind and Meta , aim to create artificial general intelligence (AGI) – AI that can complete virtually any cognitive task at least as well as a human. Artificial intelligence was founded as an academic discipline in 1956, and the field went through multiple cycles of optimism throughout its history , followed by periods of disappointment and loss of funding, known as AI winters .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-3", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Artificial intelligence was founded as an academic discipline in 1956, and the field went through multiple cycles of optimism throughout its history , followed by periods of disappointment and loss of funding, known as AI winters . Funding and interest increased substantially after 2012, when graphics processing units began being used to accelerate neural networks, and deep learning outperformed previous AI techniques. In the 2020s, an AI boom has coincided with advances in generative AI , which allowed for the creation and modification of media. In addition to AI safety and unintended consequences and harms from the use of AI, ethical concerns , AI's long-term effects , and potential existential risks have prompted discussions of AI regulation .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-4", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In addition to AI safety and unintended consequences and harms from the use of AI, ethical concerns , AI's long-term effects , and potential existential risks have prompted discussions of AI regulation . Reasoning and problem-solving Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions . By the late 1980s and 1990s, methods were developed for dealing with uncertain or incomplete information, employing concepts from probability and economics . Many of these algorithms are insufficient for solving large reasoning problems because they experience a \"combinatorial explosion\": They become exponentially slower as the problems grow.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-5", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Many of these algorithms are insufficient for solving large reasoning problems because they experience a \"combinatorial explosion\": They become exponentially slower as the problems grow. Even humans rarely use the step-by-step deduction that early AI research could model. Accurate and efficient reasoning is an unsolved problem. Formal knowledge representations are used in content-based indexing and retrieval, scene interpretation, clinical decision support, knowledge discovery (mining \"interesting\" and actionable inferences from large databases ), and other areas. A knowledge base is a body of knowledge represented in a form that can be used by a program. An ontology is the set of objects, relations, concepts, and properties used by a particular domain of knowledge.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-6", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "An ontology is the set of objects, relations, concepts, and properties used by a particular domain of knowledge. Among the most difficult problems in knowledge representation are the breadth of commonsense knowledge (the set of atomic facts that the average person knows is enormous); and the sub-symbolic form of most commonsense knowledge (much of what people know is not represented as \"facts\" or \"statements\" that they could express verbally). There is also the difficulty of knowledge acquisition , the problem of obtaining knowledge for AI applications. In automated decision-making , the agent has preferences—there are some situations it would prefer to be in, and some situations it is trying to avoid.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-7", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In automated decision-making , the agent has preferences—there are some situations it would prefer to be in, and some situations it is trying to avoid. The decision-making agent assigns a number to each situation (called the \" utility \") that measures how much the agent prefers it. For each possible action, it can calculate the \" expected utility \": the utility of all possible outcomes of the action, weighted by the probability that the outcome will occur. It can then choose the action with the maximum expected utility. In most real-world problems, however, the agent may not be certain about the situation they are in (it is \"unknown\" or \"unobservable\") and it may not know for certain what will happen after each possible action (it is not \"deterministic\").", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-8", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In most real-world problems, however, the agent may not be certain about the situation they are in (it is \"unknown\" or \"unobservable\") and it may not know for certain what will happen after each possible action (it is not \"deterministic\"). Alongside thorough testing and improvement based on previous decisions, having an explanation for why the agent took certain decisions is a way to build trust, especially when the decisions have to be relied upon. In some problems, the agent's preferences may be uncertain, especially if there are other agents or humans involved. These can be learned (e.g., with inverse reinforcement learning ), or the agent can seek information to improve its preferences.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-9", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "These can be learned (e.g., with inverse reinforcement learning ), or the agent can seek information to improve its preferences. Information value theory can be used to weigh the value of exploratory or experimental actions. The space of possible future actions and situations is typically intractably large, so the agents must take actions and evaluate situations while being uncertain of what the outcome will be. A Markov decision process has a transition model that describes the probability that a particular action will change the state in a particular way and a reward function that supplies the utility of each state and the cost of each action.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-10", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "A Markov decision process has a transition model that describes the probability that a particular action will change the state in a particular way and a reward function that supplies the utility of each state and the cost of each action. The policy could be calculated (e.g., by iteration ), be heuristic , or it can be learned. Game theory describes the rational behavior of multiple interacting agents and is used in AI programs that make decisions that involve other agents. Learning Machine learning is the study of programs that can improve their performance on a given task automatically.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-11", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Learning Machine learning is the study of programs that can improve their performance on a given task automatically. In supervised learning , the training data is labelled with the expected answers, while in unsupervised learning , the model identifies patterns or structures in unlabelled data. Supervised learning requires labeling the training data with the expected answers, and comes in two main varieties: classification (where the program must learn to predict what category the input belongs in) and regression (where the program must deduce a numeric function based on numeric input). In reinforcement learning , the agent is rewarded for good responses and punished for bad ones.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-12", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Supervised learning requires labeling the training data with the expected answers, and comes in two main varieties: classification (where the program must learn to predict what category the input belongs in) and regression (where the program must deduce a numeric function based on numeric input). In reinforcement learning , the agent is rewarded for good responses and punished for bad ones. Transfer learning is when the knowledge gained from one problem is applied to a new problem. Deep learning is a type of machine learning that runs inputs through biologically inspired artificial neural networks for all of these types of learning.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-13", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Deep learning is a type of machine learning that runs inputs through biologically inspired artificial neural networks for all of these types of learning. Computational learning theory can assess learners by computational complexity , by sample complexity (how much data is required), or by other notions of optimization . Natural language processing Natural language processing (NLP) allows programs to read, write and communicate in human languages. Margaret Masterman believed that it was meaning and not grammar that was the key to understanding languages, and that thesauri and not dictionaries should be the basis of computational language structure.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-14", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Margaret Masterman believed that it was meaning and not grammar that was the key to understanding languages, and that thesauri and not dictionaries should be the basis of computational language structure. Modern deep learning techniques for NLP include word embedding (representing words, typically as vectors encoding their meaning), transformers (a deep learning architecture using an attention mechanism), and others. In 2019, generative pre-trained transformer (or \"GPT\") language models began to generate coherent text, and by 2023, these models were able to get human-level scores on the bar exam , SAT test, GRE test, and many other real-world applications.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-15", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In 2019, generative pre-trained transformer (or \"GPT\") language models began to generate coherent text, and by 2023, these models were able to get human-level scores on the bar exam , SAT test, GRE test, and many other real-world applications. Perception Machine perception is the ability to use input from sensors (such as cameras, microphones, wireless signals, active lidar , sonar, radar, and tactile sensors ) to deduce aspects of the world. Computer vision is the ability to analyze visual input. The field includes speech recognition , image classification , facial recognition , object recognition , object tracking , and robotic perception .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-16", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The field includes speech recognition , image classification , facial recognition , object recognition , object tracking , and robotic perception . Social intelligence Kismet , a robot head made in the 1990s, is a machine that can recognize and simulate emotions. Affective computing is a field that comprises systems that recognize, interpret, process, or simulate human feeling, emotion, and mood . For example, some virtual assistants are programmed to speak conversationally or even to banter humorously; it makes them appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate human–computer interaction .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-17", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "For example, some virtual assistants are programmed to speak conversationally or even to banter humorously; it makes them appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate human–computer interaction . Moderate successes related to affective computing include textual sentiment analysis and, more recently, multimodal sentiment analysis , wherein AI classifies the effects displayed by a videotaped subject. General intelligence A machine with artificial general intelligence would be able to solve a wide variety of problems with breadth and versatility similar to human intelligence . Techniques AI research uses a wide variety of techniques to accomplish the goals above.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-18", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "General intelligence A machine with artificial general intelligence would be able to solve a wide variety of problems with breadth and versatility similar to human intelligence . Techniques AI research uses a wide variety of techniques to accomplish the goals above. Search and optimization There are two different kinds of search used in AI: state space search and local search : State space search State space search searches through a tree of possible states to try to find a goal state. For example, planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-19", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "For example, planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis . Simple exhaustive searches are rarely sufficient for most real-world problems: the search space (the number of places to search) quickly grows to astronomical numbers . The result is a search that is too slow or never completes. Adversarial search is used for game-playing programs, such as chess or Go. Local search uses mathematical optimization to find a solution to a problem. Gradient descent is a type of local search that optimizes a set of numerical parameters by incrementally adjusting them to minimize a loss function .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-20", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Gradient descent is a type of local search that optimizes a set of numerical parameters by incrementally adjusting them to minimize a loss function . Variants of gradient descent are commonly used to train neural networks , through the backpropagation algorithm. Another type of local search is evolutionary computation , which aims to iteratively improve a set of candidate solutions by \"mutating\" and \"recombining\" them, selecting only the fittest to survive each generation. Distributed search processes can coordinate via swarm intelligence algorithms. Two popular swarm algorithms used in search are particle swarm optimization (inspired by bird flocking ) and ant colony optimization (inspired by ant trails ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-21", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Two popular swarm algorithms used in search are particle swarm optimization (inspired by bird flocking ) and ant colony optimization (inspired by ant trails ). Logic Formal logic is used for reasoning and knowledge representation . Formal logic comes in two main forms: propositional logic (which operates on statements that are true or false and uses logical connectives such as \"and\", \"or\", \"not\" and \"implies\") and predicate logic (which also operates on objects, predicates and relations and uses quantifiers such as \" Every X is a Y \" and \"There are some X s that are Y s\").", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-22", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Formal logic comes in two main forms: propositional logic (which operates on statements that are true or false and uses logical connectives such as \"and\", \"or\", \"not\" and \"implies\") and predicate logic (which also operates on objects, predicates and relations and uses quantifiers such as \" Every X is a Y \" and \"There are some X s that are Y s\"). Deductive reasoning in logic is the process of proving a new statement ( conclusion ) from other statements that are given and assumed to be true (the premises ). Proofs can be structured as proof trees , in which nodes are labelled by sentences, and children nodes are connected to parent nodes by inference rules .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-23", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Proofs can be structured as proof trees , in which nodes are labelled by sentences, and children nodes are connected to parent nodes by inference rules . Given a problem and a set of premises, problem-solving reduces to searching for a proof tree whose root node is labelled by a solution of the problem and whose leaf nodes are labelled by premises or axioms . In the case of Horn clauses , problem-solving search can be performed by reasoning forwards from the premises or backwards from the problem. In the more general case of the clausal form of first-order logic , resolution is a single, axiom-free rule of inference, in which a problem is solved by proving a contradiction from premises that include the negation of the problem to be solved.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-24", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In the more general case of the clausal form of first-order logic , resolution is a single, axiom-free rule of inference, in which a problem is solved by proving a contradiction from premises that include the negation of the problem to be solved. Inference in both Horn clause logic and first-order logic is undecidable , and therefore intractable . However, backward reasoning with Horn clauses, which underpins computation in the logic programming language Prolog , is Turing complete . Moreover, its efficiency is competitive with computation in other symbolic programming languages. It can therefore handle propositions that are vague and partially true.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-25", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Moreover, its efficiency is competitive with computation in other symbolic programming languages. It can therefore handle propositions that are vague and partially true. Non-monotonic logics , including logic programming with negation as failure , are designed to handle default reasoning . Probabilistic methods for uncertain reasoning A simple Bayesian network , with the associated conditional probability tables Many problems in AI (including reasoning, planning, learning, perception, and robotics) require the agent to operate with incomplete or uncertain information. Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using decision theory , decision analysis , and information value theory .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-26", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using decision theory , decision analysis , and information value theory . Bayesian networks are a tool that can be used for reasoning (using the Bayesian inference algorithm), learning (using the expectation–maximization algorithm ), planning (using decision networks ) and perception (using dynamic Bayesian networks ). Probabilistic algorithms can also be used for filtering, prediction, smoothing, and finding explanations for streams of data, thus helping perception systems analyze processes that occur over time (e.g., hidden Markov models or Kalman filters ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-27", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Probabilistic algorithms can also be used for filtering, prediction, smoothing, and finding explanations for streams of data, thus helping perception systems analyze processes that occur over time (e.g., hidden Markov models or Kalman filters ). Expectation–maximization clustering of Old Faithful eruption data starts from a random guess but then successfully converges on an accurate clustering of the two physically distinct modes of eruption. Classifiers and statistical learning methods The simplest AI applications can be divided into two types: classifiers (e.g., \"if shiny then diamond\"), on one hand, and controllers (e.g., \"if diamond then pick up\"), on the other hand.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-28", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Classifiers and statistical learning methods The simplest AI applications can be divided into two types: classifiers (e.g., \"if shiny then diamond\"), on one hand, and controllers (e.g., \"if diamond then pick up\"), on the other hand. Classifiers are functions that use pattern matching to determine the closest match. They can be fine-tuned based on chosen examples using supervised learning . All the observations combined with their class labels are known as a data set . When a new observation is received, that observation is classified based on previous experience. The decision tree is the simplest and most widely used symbolic machine learning algorithm.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-29", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "When a new observation is received, that observation is classified based on previous experience. The decision tree is the simplest and most widely used symbolic machine learning algorithm. K-nearest neighbor algorithm was the most widely used analogical AI until the mid-1990s, and Kernel methods such as the support vector machine (SVM) displaced k-nearest neighbor in the 1990s. Artificial neural networks A neural network is an interconnected group of nodes, akin to the vast network of neurons in the human brain . An artificial neural network is based on a collection of nodes also known as artificial neurons , which loosely model the neurons in a biological brain.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-30", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "An artificial neural network is based on a collection of nodes also known as artificial neurons , which loosely model the neurons in a biological brain. It is trained to recognise patterns; once trained, it can recognise those patterns in fresh data. There is an input, at least one hidden layer of nodes and an output. Each node applies a function and once the weight crosses its specified threshold, the data is transmitted to the next layer. A network is typically called a deep neural network if it has at least 2 hidden layers. Learning algorithms for neural networks use local search to choose the weights that will get the right output for each input during training.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-31", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Learning algorithms for neural networks use local search to choose the weights that will get the right output for each input during training. The most common training technique is the backpropagation algorithm. In theory, a neural network can learn any function. The term perceptron typically refers to a single-layer neural network. Recurrent neural networks (RNNs) feed the output signal back into the input, which allows short-term memories of previous input events. Long short-term memory networks (LSTMs) are recurrent neural networks that better preserve longterm dependencies and are less sensitive to the vanishing gradient problem .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-32", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Long short-term memory networks (LSTMs) are recurrent neural networks that better preserve longterm dependencies and are less sensitive to the vanishing gradient problem . This local processing is especially important in image processing , where the early CNN layers typically identify simple local patterns such as edges and curves, with subsequent layers detecting more complex patterns like textures, and eventually whole objects. Deep learning Deep learning is a subset of machine learning , which is itself a subset of artificial intelligence. Deep learning uses several layers of neurons between the network's inputs and outputs. The multiple layers can progressively extract higher-level features from the raw input.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-33", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Deep learning uses several layers of neurons between the network's inputs and outputs. The multiple layers can progressively extract higher-level features from the raw input. For example, in image processing , lower layers may identify edges, while higher layers may identify the concepts relevant to a human such as digits, letters, or faces. Deep learning has profoundly improved the performance of programs in many important subfields of artificial intelligence, including computer vision , speech recognition , natural language processing , image classification , and others. The reason that deep learning performs so well in so many applications is not known as of 2021.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-34", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The reason that deep learning performs so well in so many applications is not known as of 2021. GPT Generative pre-trained transformers (GPT) are large language models (LLMs) that generate text based on the semantic relationships between words in sentences. Text-based GPT models are pre-trained on a large corpus of text that can be from the Internet. Throughout this pretraining, GPT models accumulate knowledge about the world and can then generate human-like text by repeatedly predicting the next token. Typically, a subsequent training phase makes the model more truthful, useful, and harmless, usually with a technique called reinforcement learning from human feedback (RLHF).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-35", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Typically, a subsequent training phase makes the model more truthful, useful, and harmless, usually with a technique called reinforcement learning from human feedback (RLHF). These can be reduced with RLHF and quality data, but the problem has been getting worse for reasoning systems. Such systems are used in chatbots , which allow people to ask a question or request a task in simple text. Multimodal GPT models can process different types of data ( modalities ) such as images, videos, sound, and text. Specialized programming languages such as Prolog were used in early AI research, but general-purpose programming languages like Python have become predominant.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-36", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Specialized programming languages such as Prolog were used in early AI research, but general-purpose programming languages like Python have become predominant. The transistor density in integrated circuits has been observed to roughly double every 18 months—a trend known as Moore's law , named after the Intel co-founder Gordon Moore , who first identified it. Improvements in GPUs have been even faster, a trend sometimes called Huang's law , named after Nvidia co-founder and CEO Jensen Huang . The deployment of AI may be overseen by a chief automation officer (CAO). Health and medicine Artificial intelligence in healthcare It has been suggested that AI can overcome discrepancies in funding allocated to different fields of research.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-37", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Health and medicine Artificial intelligence in healthcare It has been suggested that AI can overcome discrepancies in funding allocated to different fields of research. In 2023, it was reported that AI-guided drug discovery helped find a class of antibiotics capable of killing two different types of drug-resistant bacteria. In 2024, researchers used machine learning to accelerate the search for Parkinson's disease drug treatments. Their aim was to identify compounds that block the clumping, or aggregation, of alpha-synuclein (the protein that characterises Parkinson's disease). They were able to speed up the initial screening process ten-fold and reduce the cost by a thousand-fold.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-38", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "They were able to speed up the initial screening process ten-fold and reduce the cost by a thousand-fold. Gaming Artificial intelligence in video games Game playing programs have been used since the 1950s to demonstrate and test AI's most advanced techniques. Deep Blue became the first computer chess-playing system to beat a reigning world chess champion, Garry Kasparov , on 11 May 1997. In March 2016, AlphaGo won 4 out of 5 games of Go in a match with Go champion Lee Sedol , becoming the first computer Go -playing system to beat a professional Go player without handicaps .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-39", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In March 2016, AlphaGo won 4 out of 5 games of Go in a match with Go champion Lee Sedol , becoming the first computer Go -playing system to beat a professional Go player without handicaps . Then, in 2017, it defeated Ke Jie , who was the best Go player in the world. DeepMind developed increasingly generalistic reinforcement learning models, such as with MuZero , which could be trained to play chess, Go, or Atari games. In 2019, DeepMind's AlphaStar achieved grandmaster level in StarCraft II , a particularly challenging real-time strategy game that involves incomplete knowledge of what happens on the map.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-40", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In 2019, DeepMind's AlphaStar achieved grandmaster level in StarCraft II , a particularly challenging real-time strategy game that involves incomplete knowledge of what happens on the map. In 2021, an AI agent competed in a PlayStation Gran Turismo competition, winning against four of the world's best Gran Turismo drivers using deep reinforcement learning. In 2024, Google DeepMind introduced SIMA, a type of AI capable of autonomously playing nine previously unseen open-world video games by observing screen output, as well as executing short, specific tasks in response to natural language instructions. Mathematics In mathematics, probabilistic large language models are versatile, but can also produce wrong answers in the form of hallucinations .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-41", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Mathematics In mathematics, probabilistic large language models are versatile, but can also produce wrong answers in the form of hallucinations . The Alibaba Group developed a version of its Qwen models called Qwen2-Math , that achieved state-of-the-art performance on several mathematical benchmarks, including 84% accuracy on the MATH dataset of competition mathematics problems. In January 2025, Microsoft proposed the technique rStar-Math that leverages Monte Carlo tree search and step-by-step reasoning, enabling a relatively small language model like Qwen-7B to solve 53% of the AIME 2024 and 90% of the MATH benchmark problems. When natural language is used to describe mathematical problems, converters can transform such prompts into a formal language such as Lean to define mathematical tasks.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-42", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "When natural language is used to describe mathematical problems, converters can transform such prompts into a formal language such as Lean to define mathematical tasks. The experimental model Gemini Deep Think accepts natural language prompts directly and achieved gold medal results in the International Math Olympiad of 2025. Finance According to Nicolas Firzli, director of the World Pensions & Investments Forum , it may be too early to see the emergence of highly innovative AI-informed financial products and services. Research is targeting intelligence collection and analysis, logistics, cyber operations, information operations, and semiautonomous and autonomous vehicles .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-43", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Research is targeting intelligence collection and analysis, logistics, cyber operations, information operations, and semiautonomous and autonomous vehicles . AI technologies enable coordination of sensors and effectors, threat detection and identification, marking of enemy positions, target acquisition , coordination and deconfliction of distributed Joint Fires between networked combat vehicles, both human-operated and autonomous. AI has been used in military operations in Iraq, Syria, Israel and Ukraine. Generative AI These paragraphs are an excerpt from Generative AI . These models learn the underlying patterns and structures of their training data , and use them to generate new data in response to input, which often takes the form of natural language prompts .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-44", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "These models learn the underlying patterns and structures of their training data , and use them to generate new data in response to input, which often takes the form of natural language prompts . This boom was made possible by improvements in deep neural networks , particularly large language models (LLMs), which are based on the transformer architecture. Generative AI applications include chatbots such as ChatGPT , Claude , Copilot , DeepSeek , Google Gemini and Grok ; text-to-image models such as DALL-E , Firefly , Stable Diffusion , and Midjourney ; and text-to-video models such as Veo , LTX and Sora .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-45", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Generative AI applications include chatbots such as ChatGPT , Claude , Copilot , DeepSeek , Google Gemini and Grok ; text-to-image models such as DALL-E , Firefly , Stable Diffusion , and Midjourney ; and text-to-video models such as Veo , LTX and Sora . Companies in a variety of sectors have used generative AI, including those in software development, healthcare, finance, entertainment, customer service, sales and marketing, art, writing, and product design. Agents Agentic AI OpenClaw and CrewAI AI agents are software entities designed to perceive their environment, make decisions, and take actions autonomously to achieve specific goals.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-46", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Agents Agentic AI OpenClaw and CrewAI AI agents are software entities designed to perceive their environment, make decisions, and take actions autonomously to achieve specific goals. These agents can interact with users, their environment, or other agents. AI agents are used in various applications, including virtual assistants , chatbots , autonomous vehicles , game-playing systems , and industrial robotics . This means they are restricted to performing tasks within their defined scope and have finite memory and processing capabilities. Using machine learning, AI agents can adapt to new situations and optimise their behaviour for their designated tasks.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-47", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Using machine learning, AI agents can adapt to new situations and optimise their behaviour for their designated tasks. Google introduced an AI Mode at its Google I/O event on 20 May 2025. Sexuality Applications of AI in this domain include AI-enabled menstruation and fertility trackers that analyze user data to offer predictions, AI-integrated sex toys (e.g., teledildonics ), AI-generated sexual education content, and AI agents that simulate sexual and romantic partners (e.g., Replika ). AI is also used for the production of non-consensual deepfake pornography , raising significant ethical and legal concerns. AI technologies have also been used to attempt to identify online gender-based violence and online sexual grooming of minors.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-48", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "AI technologies have also been used to attempt to identify online gender-based violence and online sexual grooming of minors. In the field of evacuation and disaster management, AI has been used to investigate patterns in large-scale and small-scale evacuations using historical data from GPS, videos or social media. During the 2024 Indian elections , US$50 million was spent on authorized AI-generated content, notably by creating deepfakes of allied (including sometimes deceased) politicians to better engage with voters, and by translating speeches to various local languages. The use of generative AI by law firms for legal research resulted in the creation of the global \"AI Hallucination Cases\" database, in April 2025, established by HEC Paris and Sciences Po legal data analysis lecturer Damien Charlotin.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-49", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The use of generative AI by law firms for legal research resulted in the creation of the global \"AI Hallucination Cases\" database, in April 2025, established by HEC Paris and Sciences Po legal data analysis lecturer Damien Charlotin. By 2026, judges had issued sanctions and bar associations had issued warnings due to attorney submissions to the courts containing fabricated case law hallucinated by AI tools. Hallucination (artificial intelligence) § In legal filings Ethics Ethics of artificial intelligence Street art in Tel Aviv AI has potential benefits and potential risks. AI may be able to advance science and find solutions for serious problems: Demis Hassabis of DeepMind hopes to \"solve intelligence, and then use that to solve everything else\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-50", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "AI may be able to advance science and find solutions for serious problems: Demis Hassabis of DeepMind hopes to \"solve intelligence, and then use that to solve everything else\". In-production systems can sometimes not factor ethics and bias into their AI training processes, especially when the AI algorithms are inherently unexplainable in deep learning. Risks and harm Privacy and copyright Further information: Information privacy and Artificial intelligence and copyright Machine learning algorithms require large amounts of data. The techniques used to acquire this data have raised concerns about privacy , surveillance and copyright . AI-powered devices and services, such as virtual assistants and IoT products, continuously collect personal information, raising concerns about intrusive data gathering and unauthorized access by third parties.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-51", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "AI-powered devices and services, such as virtual assistants and IoT products, continuously collect personal information, raising concerns about intrusive data gathering and unauthorized access by third parties. The loss of privacy is further exacerbated by AI's ability to process and combine vast amounts of data, potentially leading to a surveillance society where individual activities are constantly monitored and analyzed without adequate safeguards or transparency. Sensitive user data collected may include online activity records, geolocation data, video, or audio. For example, in order to build speech recognition algorithms, Amazon has recorded millions of private conversations and allowed temporary workers to listen to and transcribe some of them.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-52", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "For example, in order to build speech recognition algorithms, Amazon has recorded millions of private conversations and allowed temporary workers to listen to and transcribe some of them. Opinions about this widespread surveillance range from those who see it as a necessary evil to those for whom it is clearly unethical and a violation of the right to privacy . AI developers argue that this is the only way to deliver valuable applications and have developed several techniques that attempt to preserve privacy while still obtaining the data, such as data aggregation , de-identification and differential privacy .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-53", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "AI developers argue that this is the only way to deliver valuable applications and have developed several techniques that attempt to preserve privacy while still obtaining the data, such as data aggregation , de-identification and differential privacy . Brian Christian wrote that experts have pivoted \"from the question of 'what they know' to the question of 'what they're doing with it'.\" Generative AI is often trained on unlicensed copyrighted works, including in domains such as images or computer code; the output is then used under the rationale of \" fair use \". Experts disagree about how well and under what circumstances this rationale will hold up in courts of law; relevant factors may include \"the purpose and character of the use of the copyrighted work\" and \"the effect upon the potential market for the copyrighted work\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-54", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Experts disagree about how well and under what circumstances this rationale will hold up in courts of law; relevant factors may include \"the purpose and character of the use of the copyrighted work\" and \"the effect upon the potential market for the copyrighted work\". In 2023, leading authors (including John Grisham and Jonathan Franzen ) sued AI companies for using their work to train generative AI. Another discussed approach is to envision a separate sui generis system of protection for creations generated by AI to ensure fair attribution and compensation for human authors. Dominance by tech giants The commercial AI scene is dominated by Big Tech companies such as Alphabet Inc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-55", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Dominance by tech giants The commercial AI scene is dominated by Big Tech companies such as Alphabet Inc. Some of these players already own the vast majority of existing cloud infrastructure and computing power from data centers , allowing them to entrench further in the marketplace. Power needs and environmental impacts Environmental impacts of artificial intelligence Fueled by a growth in AI, data centers' demand for power increased in the 2020s. A 2025 report from the consulting firm McKinsey & Company estimated that by 2030, $2.7 trillion would be invested into AI infrastructure and data centers in the US, surpassing World War II's Manhattan Project every month.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-56", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "A 2025 report from the consulting firm McKinsey & Company estimated that by 2030, $2.7 trillion would be invested into AI infrastructure and data centers in the US, surpassing World War II's Manhattan Project every month. This is the first IEA report to make projections for data centers and power consumption by AI and cryptocurrency. The report states that power demand for these uses might double by 2026, with the additional power consumption equaling that of Japan. Power consumption by AI is responsible for an increase in fossil fuel use, and has delayed closings of obsolete, carbon-emitting coal energy facilities.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-57", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Power consumption by AI is responsible for an increase in fossil fuel use, and has delayed closings of obsolete, carbon-emitting coal energy facilities. A ChatGPT search involves the use of 10 times the electrical energy as a Google search. Data centers' need for more and more electrical power is such that they might max out the electrical grid. The Big Tech companies counter that AI can be used to maximize the utilization of the grid by all. In September 2024, Microsoft announced an agreement with Constellation Energy to re-open the Three Mile Island nuclear power plant to provide Microsoft with 100% of all electric power produced by the plant for 20 years.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-58", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In September 2024, Microsoft announced an agreement with Constellation Energy to re-open the Three Mile Island nuclear power plant to provide Microsoft with 100% of all electric power produced by the plant for 20 years. Reopening the plant, which suffered a partial nuclear meltdown of its Unit 2 reactor in 1979, will require Constellation to get through strict regulatory processes which will include extensive safety scrutiny from the US Nuclear Regulatory Commission . If approved (this will be the first ever US re-commissioning of a nuclear plant), over 835 megawatts of power – enough for 800,000 homes – of energy will be produced.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-59", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "If approved (this will be the first ever US re-commissioning of a nuclear plant), over 835 megawatts of power – enough for 800,000 homes – of energy will be produced. The cost for re-opening and upgrading is estimated at US$1.6 billion and is dependent on tax breaks for nuclear power contained in the 2022 US Inflation Reduction Act . As of 2024, the US government and the state of Michigan have been investing almost US$2 billion to reopen the Palisades Nuclear reactor on Lake Michigan. Closed since 2022, the plant was planned to be reopened in October 2025.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-60", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Although most nuclear plants in Japan have been shut down after the 2011 Fukushima nuclear accident , according to an October 2024 Bloomberg article in Japanese, cloud gaming services company Ubitus, in which Nvidia has a stake, is looking for land in Japan near a nuclear power plant for a new data center for generative AI. On 1 November 2024, the Federal Energy Regulatory Commission (FERC) rejected an application submitted by Talen Energy for approval to supply some electricity from the nuclear power station Susquehanna to Amazon's data center. Phillips , it is a burden on the electricity grid as well as a significant cost shifting concern to households and other business sectors.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-61", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Phillips , it is a burden on the electricity grid as well as a significant cost shifting concern to households and other business sectors. In 2025, a report prepared by the IEA estimated the greenhouse gas emissions from the energy consumption of AI at 180 million tons. By 2035, these emissions could rise to 300–500 million tonnes depending on what measures will be taken. This is below 1.5% of the energy sector emissions. The emissions reduction potential of AI was estimated at 5% of the energy sector emissions, but rebound effects (for example if people switch from public transport to autonomous cars) can reduce it.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-62", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The emissions reduction potential of AI was estimated at 5% of the energy sector emissions, but rebound effects (for example if people switch from public transport to autonomous cars) can reduce it. These AI programs were given the goal of maximizing user engagement (that is, the only goal was to keep people watching). The AI learned that users tended to choose misinformation , conspiracy theories , and extreme partisan content, and, to keep them watching, the AI recommended more of it. Users also tended to watch more content on the same subject, so the AI led people into filter bubbles where they received multiple versions of the same misinformation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-63", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Users also tended to watch more content on the same subject, so the AI led people into filter bubbles where they received multiple versions of the same misinformation. This convinced many users that the misinformation was true, and ultimately undermined trust in institutions, the media and the government. The AI program had correctly learned to maximize its goal, but the result was harmful to society. In the early 2020s, generative AI began to create images, audio, and texts that are virtually indistinguishable from real photographs, recordings, or human writing, while realistic AI-generated videos became feasible in the mid-2020s.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-64", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In the early 2020s, generative AI began to create images, audio, and texts that are virtually indistinguishable from real photographs, recordings, or human writing, while realistic AI-generated videos became feasible in the mid-2020s. It is possible for bad actors to use this technology to create massive amounts of misinformation or propaganda; one such potential malicious use is deepfakes for computational propaganda . AI pioneer and Nobel Prize-winning computer scientist Geoffrey Hinton expressed concern about AI enabling \"authoritarian leaders to manipulate their electorates\" on a large scale, among other risks. AI researchers at Microsoft , OpenAI , universities and other organisations have suggested using \" personhood credentials \" as a way to overcome online deception enabled by AI models.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-65", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "If a biased algorithm is used to make decisions that can seriously harm people (as it can in medicine , finance , recruitment , housing or policing ) then the algorithm may cause discrimination . The field of fairness studies how to prevent harms from algorithmic biases. On 28 June 2015, Google Photos 's new image labeling feature mistakenly identified Jacky Alcine and a friend as \"gorillas\" because they were black. Eight years later, in 2023, Google Photos still could not identify a gorilla, and neither could similar products from Apple, Facebook, Microsoft and Amazon.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-66", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Eight years later, in 2023, Google Photos still could not identify a gorilla, and neither could similar products from Apple, Facebook, Microsoft and Amazon. COMPAS is a commercial program widely used by U.S. In 2016, Julia Angwin at ProPublica discovered that COMPAS exhibited racial bias, despite the fact that the program was not told the races of the defendants. Although the error rate for both whites and blacks was calibrated equal at exactly 61%, the errors for each race were different—the system consistently overestimated the chance that a black person would re-offend and would underestimate the chance that a white person would not re-offend.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-67", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Although the error rate for both whites and blacks was calibrated equal at exactly 61%, the errors for each race were different—the system consistently overestimated the chance that a black person would re-offend and would underestimate the chance that a white person would not re-offend. In 2017, several researchers showed that it was mathematically impossible for COMPAS to accommodate all possible measures of fairness when the base rates of re-offense were different for whites and blacks in the data. A program can make biased decisions even if the data does not explicitly mention a problematic feature (such as \"race\" or \"gender\").", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-68", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "A program can make biased decisions even if the data does not explicitly mention a problematic feature (such as \"race\" or \"gender\"). The feature will correlate with other features (like \"address\", \"shopping history\" or \"first name\"), and the program will make the same decisions based on these features as it would on \"race\" or \"gender\". Moritz Hardt said \"the most robust fact in this research area is that fairness through blindness doesn't work.\" Criticism of COMPAS highlighted that machine learning models are designed to make \"predictions\" that are only valid if we assume that the future will resemble the past.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-69", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Moritz Hardt said \"the most robust fact in this research area is that fairness through blindness doesn't work.\" Criticism of COMPAS highlighted that machine learning models are designed to make \"predictions\" that are only valid if we assume that the future will resemble the past. If they are trained on data that includes the results of racist decisions in the past, machine learning models must predict that racist decisions will be made in the future. Thus, machine learning is not well suited to help make decisions in areas where there is hope that the future will be better than the past.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-70", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Thus, machine learning is not well suited to help make decisions in areas where there is hope that the future will be better than the past. Bias and unfairness may go undetected because the developers are overwhelmingly white and male: among AI engineers, about 4% are black and 20% are women. There are various conflicting definitions and mathematical models of fairness. These notions depend on ethical assumptions, and are influenced by beliefs about society. One broad category is distributive fairness , which focuses on the outcomes, often identifying groups and seeking to compensate for statistical disparities.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-71", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "One broad category is distributive fairness , which focuses on the outcomes, often identifying groups and seeking to compensate for statistical disparities. The most relevant notions of fairness may depend on the context, notably the type of AI application and the stakeholders. Having access to sensitive attributes such as race or gender is also considered by many AI ethicists to be necessary in order to compensate for biases, but it may conflict with anti-discrimination laws . At the 2022 ACM Conference on Fairness, Accountability, and Transparency a paper reported that a CLIP‑based ( Contrastive Language-Image Pre-training ) robotic system reproduced harmful gender‑ and race‑linked stereotypes in a simulated manipulation task.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-72", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "At the 2022 ACM Conference on Fairness, Accountability, and Transparency a paper reported that a CLIP‑based ( Contrastive Language-Image Pre-training ) robotic system reproduced harmful gender‑ and race‑linked stereotypes in a simulated manipulation task. Particularly with deep neural networks , in which there are many non- linear relationships between inputs and outputs. It is impossible to be certain that a program is operating correctly if no one knows how exactly it works. There have been many cases where a machine learning program passed rigorous tests, but nevertheless learned something different than what the programmers intended.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-73", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "There have been many cases where a machine learning program passed rigorous tests, but nevertheless learned something different than what the programmers intended. For example, a system that could identify skin diseases better than medical professionals was found to actually have a strong tendency to classify images with a ruler as \"cancerous\", because pictures of malignancies typically include a ruler to show the scale. Another machine learning system designed to help effectively allocate medical resources was found to classify patients with asthma as being at \"low risk\" of dying from pneumonia. Having asthma is actually a severe risk factor, but since the patients having asthma would usually get much more medical care, they were relatively unlikely to die according to the training data.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-74", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Having asthma is actually a severe risk factor, but since the patients having asthma would usually get much more medical care, they were relatively unlikely to die according to the training data. The correlation between asthma and low risk of dying from pneumonia was real, but misleading. Doctors, for example, are expected to clearly and completely explain to their colleagues the reasoning behind any decision they make. Industry experts noted that this is an unsolved problem with no solution in sight. Regulators argued that nevertheless the harm is real: if the problem has no solution, the tools should not be used.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-75", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Regulators argued that nevertheless the harm is real: if the problem has no solution, the tools should not be used. SHAP enables to visualise the contribution of each feature to the output. LIME can locally approximate a model's outputs with a simpler, interpretable model. These other outputs can help developers deduce what the network has learned. Deconvolution , DeepDream and other generative methods can allow developers to see what different layers of a deep network for computer vision have learned, and produce output that can suggest what the network is learning. For generative pre-trained transformers , Anthropic developed a technique based on dictionary learning that associates patterns of neuron activations with human-understandable concepts.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-76", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Widely available AI tools can be used by bad actors to develop inexpensive autonomous weapons and, if produced at scale, they are potentially weapons of mass destruction . Even when used in conventional warfare, they currently cannot reliably choose targets and could potentially kill an innocent person . In 2014, 30 nations (including China) supported a ban on autonomous weapons under the United Nations ' Convention on Certain Conventional Weapons , however the United States and others disagreed. By 2015, over fifty countries were reported to be researching battlefield robots. Machine learning , operating this data, can classify potential enemies of the state and prevent them from hiding.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-77", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Machine learning , operating this data, can classify potential enemies of the state and prevent them from hiding. Recommendation systems can precisely target propaganda and misinformation for maximum effect. Advanced AI can make authoritarian centralized decision-making more competitive than liberal and decentralized systems such as markets . All these technologies have been available since 2020 or earlier—AI facial recognition systems are already being used for mass surveillance in China. There are many other ways in which AI is expected to help bad actors, some of which can not be foreseen. For example, machine-learning AI is able to design tens of thousands of toxic molecules in a matter of hours.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-78", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "A survey of economists showed disagreement about whether the increasing use of robots and AI will cause a substantial increase in long-term unemployment , but they generally agree that it could be a net benefit if productivity gains are redistributed . The methodology of speculating about future employment levels has been criticised as lacking evidential foundation, and for implying that technology, rather than social policy, creates unemployment, as opposed to redundancies. In April 2023, it was reported that 70% of the jobs for Chinese video game illustrators had been eliminated by generative artificial intelligence. Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; The Economist stated in 2015 that \"the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution\" is \"worth taking seriously\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-79", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; The Economist stated in 2015 that \"the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution\" is \"worth taking seriously\". Jobs at extreme risk range from paralegals to fast food cooks, while job demand is likely to increase for care-related professions ranging from personal healthcare to the clergy. Substitution for human–human interaction Deaths linked to chatbots With the increase of loneliness in the early 21st century, AI is sometimes identified as a potential source of relief to this problem.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-80", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Substitution for human–human interaction Deaths linked to chatbots With the increase of loneliness in the early 21st century, AI is sometimes identified as a potential source of relief to this problem. It would be possible, via human-like qualities built into AI products , for individuals to assume that this need can be met by artificial means. In some cases, people approach artificial intelligence for companionship when they believe that they would not find acceptance due to feeling outcast. Examples of harm coming to humans from advanced chatbots have been reported in courts in the United States, with AI companies accused of creating products that endanger humans through emotional confusion or deception .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-81", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Examples of harm coming to humans from advanced chatbots have been reported in courts in the United States, with AI companies accused of creating products that endanger humans through emotional confusion or deception . Existential risk Existential risk from artificial intelligence Recent public debates in artificial intelligence have increasingly focused on its broader societal and ethical implications. It has been argued AI will become so powerful that humanity may irreversibly lose control of it. This scenario has been common in science fiction, when a computer or robot suddenly develops a human-like \"self-awareness\" (or \"sentience\" or \"consciousness\") and becomes a malevolent character.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-82", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "This scenario has been common in science fiction, when a computer or robot suddenly develops a human-like \"self-awareness\" (or \"sentience\" or \"consciousness\") and becomes a malevolent character. These sci-fi scenarios are misleading in several ways. Modern AI programs are given specific goals and use learning and intelligence to achieve them. Philosopher Nick Bostrom argued that if one gives almost any goal to a sufficiently powerful AI, it may choose to destroy humanity to achieve it (he used the example of an automated paperclip factory that destroys the world to get more iron for paperclips). Stuart Russell gives the example of household robot that tries to find a way to kill its owner to prevent it from being unplugged, reasoning that \"you can't fetch the coffee if you're dead.\" In order to be safe for humanity, a superintelligence would have to be genuinely aligned with humanity's morality and values so that it is \"fundamentally on our side\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-83", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Stuart Russell gives the example of household robot that tries to find a way to kill its owner to prevent it from being unplugged, reasoning that \"you can't fetch the coffee if you're dead.\" In order to be safe for humanity, a superintelligence would have to be genuinely aligned with humanity's morality and values so that it is \"fundamentally on our side\". The essential parts of civilization are not physical. Things like ideologies , law , government , money and the economy are built on language ; they exist because there are stories that billions of people believe.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-84", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Things like ideologies , law , government , money and the economy are built on language ; they exist because there are stories that billions of people believe. The current prevalence of misinformation suggests that an AI could use language to convince people to believe anything, even to take actions that are destructive. You just have to be good at persuasion.\" The opinions amongst experts and industry insiders are mixed, with sizable fractions both concerned and unconcerned by risk from eventual superintelligent AI. Personalities such as Stephen Hawking, Bill Gates , and Elon Musk , as well as AI pioneers such as Geoffrey Hinton , Yoshua Bengio , Stuart Russell , Demis Hassabis , and Sam Altman , have expressed concerns about existential risk from AI.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-85", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Personalities such as Stephen Hawking, Bill Gates , and Elon Musk , as well as AI pioneers such as Geoffrey Hinton , Yoshua Bengio , Stuart Russell , Demis Hassabis , and Sam Altman , have expressed concerns about existential risk from AI. In May 2023, Geoffrey Hinton announced his resignation from Google in order to be able to \"freely speak out about the risks of AI\" without \"considering how this impacts Google\". He notably mentioned risks of an AI takeover , and stressed that in order to avoid the worst outcomes, establishing safety guidelines will require cooperation among those competing in use of AI.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-86", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The field of machine ethics is also called computational morality, and was founded at an AAAI symposium in 2005. Open source Open-source artificial intelligence and Lists of open-source artificial intelligence software Active organizations in the AI open-source community include Hugging Face , Google , EleutherAI and Meta . Various AI models, such as Llama 2 , Mistral or Stable Diffusion , have been made open-weight, meaning that their architecture and trained parameters (the \"weights\") are publicly available. Open-weight models can be freely fine-tuned , which allows companies to specialize them with their own data and for their own use-case.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-87", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Open-weight models can be freely fine-tuned , which allows companies to specialize them with their own data and for their own use-case. Open-weight models are useful for research and innovation but can also be misused. Since they can be fine-tuned, any built-in security measure, such as objecting to harmful requests, can be trained away until it becomes ineffective. Some researchers warn that future AI models may develop dangerous capabilities (such as the potential to drastically facilitate bioterrorism ) and that once released on the Internet, they cannot be deleted everywhere if needed. Frameworks Artificial intelligence projects can be guided by ethical considerations during the design, development, and implementation of an AI system.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-88", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Frameworks Artificial intelligence projects can be guided by ethical considerations during the design, development, and implementation of an AI system. Promotion of the wellbeing of the people and communities that these technologies affect requires consideration of the social and ethical implications at all stages of AI system design, development and implementation, and collaboration between job roles such as data scientists, product managers, data engineers, domain experts, and delivery managers. The UK AI Safety Institute released in 2024 a testing toolset called 'Inspect' for AI safety evaluations available under an MIT open-source licence which is freely available on GitHub and can be improved with third-party packages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-89", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "According to AI Index at Stanford , the annual number of AI-related laws passed in the 127 survey countries jumped from one passed in 2016 to 37 passed in 2022 alone. Most EU member states had released national AI strategies, as had Canada , China, India, Japan, Mauritius, the Russian Federation, Saudi Arabia, United Arab Emirates, U.S., and Vietnam. Others were in the process of elaborating their own AI strategy, including Bangladesh, Malaysia and Tunisia. The Global Partnership on Artificial Intelligence was launched in June 2020, stating a need for AI to be developed in accordance with human rights and democratic values, to ensure public confidence and trust in the technology.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-90", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The Global Partnership on Artificial Intelligence was launched in June 2020, stating a need for AI to be developed in accordance with human rights and democratic values, to ensure public confidence and trust in the technology. Henry Kissinger , Eric Schmidt , and Daniel Huttenlocher published a joint statement in November 2021 calling for a government commission to regulate AI. In 2023, OpenAI leaders published recommendations for the governance of superintelligence, which they believe may happen in less than 10 years. In 2023, the United Nations also launched an advisory body to provide recommendations on AI governance; the body comprises technology company executives, government officials and academics.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-91", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In 2023, the United Nations also launched an advisory body to provide recommendations on AI governance; the body comprises technology company executives, government officials and academics. In 2024, the Council of Europe created the first international legally binding treaty on AI, called the \" Framework Convention on Artificial Intelligence and Human Rights, Democracy and the Rule of Law \". It was adopted by the European Union, the United States, the United Kingdom, and other signatories. In a 2022 Ipsos survey, attitudes towards AI varied greatly by country; 78% of Chinese citizens, but only 35% of Americans, agreed that \"products and services using AI have more benefits than drawbacks\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-92", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In a 2022 Ipsos survey, attitudes towards AI varied greatly by country; 78% of Chinese citizens, but only 35% of Americans, agreed that \"products and services using AI have more benefits than drawbacks\". In a 2023 Fox News poll, 35% of Americans thought it \"very important\", and an additional 41% thought it \"somewhat important\", for the federal government to regulate AI, versus 13% responding \"not very important\" and 8% responding \"not at all important\". In November 2023, the first global AI Safety Summit was held in Bletchley Park in the UK to discuss the near and far term risks of AI and the possibility of mandatory and voluntary regulatory frameworks.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-93", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In November 2023, the first global AI Safety Summit was held in Bletchley Park in the UK to discuss the near and far term risks of AI and the possibility of mandatory and voluntary regulatory frameworks. 28 countries including the United States, China, and the European Union issued a declaration at the start of the summit, calling for international co-operation to manage the challenges and risks of artificial intelligence. In May 2024 at the AI Seoul Summit , 16 global AI tech companies agreed to safety commitments on the development of AI. In March 2026, the United Nations convened the inaugural meeting of the Independent International Scientific Panel on AI, a 40-member expert body established under the Global Digital Compact to produce annual evidence-based reports on AI's societal impacts.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-94", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In March 2026, the United Nations convened the inaugural meeting of the Independent International Scientific Panel on AI, a 40-member expert body established under the Global Digital Compact to produce annual evidence-based reports on AI's societal impacts. The study of logic led directly to Alan Turing 's theory of computation , which suggested that a machine, by shuffling symbols as simple as \"0\" and \"1\", could simulate any conceivable form of mathematical reasoning. This, along with concurrent discoveries in cybernetics , information theory and neurobiology , led researchers to consider the possibility of building an \"electronic brain\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-95", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "This, along with concurrent discoveries in cybernetics , information theory and neurobiology , led researchers to consider the possibility of building an \"electronic brain\". They developed several areas of research that would become part of AI, such as McCulloch and Pitts design for \"artificial neurons\" in 1943, and Turing's influential 1950 paper ' Computing Machinery and Intelligence ', which introduced the Turing test and showed that \"machine intelligence\" was plausible. The field of AI research was founded at a workshop at Dartmouth College in 1956. The first AI program, Logic Theorist, was presented at the workshop, created by future Turing Award winner Allen Newell and future Nobel Laureate Herbert A.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-96", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The first AI program, Logic Theorist, was presented at the workshop, created by future Turing Award winner Allen Newell and future Nobel Laureate Herbert A. Artificial intelligence laboratories were set up at a number of British and U.S. Researchers in the 1960s and the 1970s were convinced that their methods would eventually succeed in creating a machine with general intelligence and considered this the goal of their field. and British governments cut off exploratory research in response to the criticism of Sir James Lighthill and ongoing pressure from the U.S. Minsky and Papert 's book Perceptrons was understood as proving that artificial neural networks would never be useful for solving real-world tasks, thus discrediting the approach altogether.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-97", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Minsky and Papert 's book Perceptrons was understood as proving that artificial neural networks would never be useful for solving real-world tasks, thus discrediting the approach altogether. In the early 1980s, AI research was revived by the commercial success of expert systems , a form of AI program that simulated the knowledge and analytical skills of human experts. However, beginning with the collapse of the Lisp Machine market in 1987, AI once again fell into disrepute, and a second, longer-lasting winter began. Up to this point, most of AI's funding had gone to projects that used high-level symbols to represent mental objects like plans, goals, beliefs, and known facts.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-98", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Up to this point, most of AI's funding had gone to projects that used high-level symbols to represent mental objects like plans, goals, beliefs, and known facts. In the 1980s, some researchers began to doubt that this approach would be able to imitate all the processes of human cognition, especially perception , robotics , learning and pattern recognition , and began to look into \"sub-symbolic\" approaches. Judea Pearl , Lotfi Zadeh , and others developed methods that handled incomplete and uncertain information by making reasonable guesses rather than precise logic. In 1990, Yann LeCun successfully showed that convolutional neural networks can recognize handwritten digits, the first of many successful applications of neural networks.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-99", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In 1990, Yann LeCun successfully showed that convolutional neural networks can recognize handwritten digits, the first of many successful applications of neural networks. AI gradually restored its reputation in the late 1990s and early 21st century by exploiting formal mathematical methods and by finding specific solutions to specific problems. This \" narrow \" and \"formal\" focus allowed researchers to produce verifiable results and collaborate with other fields (such as statistics , economics and mathematics ). By 2000, solutions developed by AI researchers were being widely used, although in the 1990s they were rarely described as \"artificial intelligence\" (a tendency known as the AI effect ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-100", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "By 2000, solutions developed by AI researchers were being widely used, although in the 1990s they were rarely described as \"artificial intelligence\" (a tendency known as the AI effect ). However, several academic researchers became concerned that AI was no longer pursuing its original goal of creating versatile, fully intelligent machines. Deep learning began to dominate industry benchmarks in 2012 and was adopted throughout the field. For many specific tasks, other methods were abandoned. Deep learning's success was based on both hardware improvements ( faster computers , graphics processing units , cloud computing ) and access to large amounts of data (including curated datasets, such as ImageNet ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-101", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Deep learning's success was based on both hardware improvements ( faster computers , graphics processing units , cloud computing ) and access to large amounts of data (including curated datasets, such as ImageNet ). In 2016, issues of fairness and the misuse of technology were catapulted into center stage at machine learning conferences, publications vastly increased, funding became available, and many researchers re-focussed their careers on these issues. GPT-3 is a large language model that was released in 2020 by OpenAI and is capable of generating high-quality human-like text. ChatGPT , launched on 30 November 2022, became the fastest-growing consumer software application in history, gaining over 100 million users in two months.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-102", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "ChatGPT , launched on 30 November 2022, became the fastest-growing consumer software application in history, gaining over 100 million users in two months. It marked what is widely regarded as AI's breakout year, bringing it into the public consciousness. Philosophy Philosophy of artificial intelligence Philosophical debates have historically sought to determine the nature of intelligence and how to make intelligent machines. Another major focus has been whether machines can be conscious, and the associated ethical implications. Many other topics in philosophy are relevant to AI, such as epistemology and free will . Defining artificial intelligence Synthetic intelligence , Intelligent agent , Artificial mind , Virtual intelligence , and Dartmouth workshop Alan Turing investigated whether machines can show intelligent behaviour and think.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-103", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Defining artificial intelligence Synthetic intelligence , Intelligent agent , Artificial mind , Virtual intelligence , and Dartmouth workshop Alan Turing investigated whether machines can show intelligent behaviour and think. Since we can only observe the behavior of the machine, it does not matter if it is \"actually\" thinking or literally has a \"mind\". Turing that we can not determine these things about other people but \"it is usual to have a polite convention that everyone thinks.\" The Turing test can provide some evidence of intelligence, but it penalizes non-human intelligent behavior. However, they are critical that the test requires the machine to imitate humans.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-104", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Turing that we can not determine these things about other people but \"it is usual to have a polite convention that everyone thinks.\" The Turing test can provide some evidence of intelligence, but it penalizes non-human intelligent behavior. However, they are critical that the test requires the machine to imitate humans. \" Aeronautical engineering texts\", they wrote, \"do not define the goal of their field as making 'machines that fly so exactly like pigeons that they can fool other pigeons. Artificial Intelligence: A Modern Approach defines it as the study of agents that perceive their environment and take actions that maximize their chances of achieving defined goals.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-105", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Artificial Intelligence: A Modern Approach defines it as the study of agents that perceive their environment and take actions that maximize their chances of achieving defined goals. During the 2020s AI boom, the term has been used as a marketing buzzword to promote products and services which do not use AI. Legal definitions The International Organization for Standardization describes an AI system as a \"an engineered system that generates outputs such as content, forecasts, recommendations, or decisions for a given set of human‑defined objectives, and can operate with varying levels of automation\". AI systems are designed to operate with varying levels of autonomy\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-106", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Legal definitions The International Organization for Standardization describes an AI system as a \"an engineered system that generates outputs such as content, forecasts, recommendations, or decisions for a given set of human‑defined objectives, and can operate with varying levels of automation\". AI systems are designed to operate with varying levels of autonomy\". The unprecedented success of statistical machine learning in the 2010s eclipsed all other approaches (so much so that some especially in the business world, use the term \"artificial intelligence\" to mean \"machine learning with neural networks\"). This approach is mostly sub-symbolic , soft and narrow .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-107", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The unprecedented success of statistical machine learning in the 2010s eclipsed all other approaches (so much so that some especially in the business world, use the term \"artificial intelligence\" to mean \"machine learning with neural networks\"). This approach is mostly sub-symbolic , soft and narrow . Critics argue that these questions may have to be revisited by future generations of AI researchers. Symbolic AI and its limits Symbolic AI (or \" GOFAI \") simulated the high-level conscious reasoning that people use when they solve puzzles, express legal reasoning and do mathematics. In the 1960s, Newell and Simon proposed the physical symbol systems hypothesis : \"A physical symbol system has the necessary and sufficient means of general intelligent action.\" However, the symbolic approach failed on many tasks that humans solve easily, such as learning, recognizing an object or commonsense reasoning .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-108", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "In the 1960s, Newell and Simon proposed the physical symbol systems hypothesis : \"A physical symbol system has the necessary and sufficient means of general intelligent action.\" However, the symbolic approach failed on many tasks that humans solve easily, such as learning, recognizing an object or commonsense reasoning . Philosopher Hubert Dreyfus had argued since the 1960s that human expertise depends on unconscious instinct rather than conscious symbol manipulation, and on having a \"feel\" for the situation, rather than explicit symbolic knowledge. Although his arguments had been ridiculed and ignored when they were first presented, eventually, AI research came to agree with him.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-109", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Although his arguments had been ridiculed and ignored when they were first presented, eventually, AI research came to agree with him. The issue is not resolved: sub-symbolic reasoning can make many of the same inscrutable mistakes that human intuition does, such as algorithmic bias . Critics such as Noam Chomsky argue continuing research into symbolic AI will still be necessary to attain general intelligence, in part because sub-symbolic AI is a move away from explainable AI : it can be difficult or impossible to understand why a modern statistical AI program made a particular decision.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-110", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Critics such as Noam Chomsky argue continuing research into symbolic AI will still be necessary to attain general intelligence, in part because sub-symbolic AI is a move away from explainable AI : it can be difficult or impossible to understand why a modern statistical AI program made a particular decision. scruffy Neats and scruffies \"Neats\" hope that intelligent behavior is described using simple, elegant principles (such as logic , optimization , or neural networks ). This issue was actively discussed in the 1970s and 1980s, but eventually was seen as irrelevant. hard computing Soft computing Finding a provably correct or optimal solution is intractable for many important problems.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-111", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "The hard problem is explaining how this feels or why it should feel like anything at all, assuming we are right in thinking that it truly does feel like something (Dennett's consciousness illusionism says this is an illusion). While human information processing is easy to explain, human subjective experience is difficult to explain. For example, it is easy to imagine a color-blind person who has learned to identify which objects in their field of view are red, but it is not clear what would be required for the person to know what red looks like .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-112", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Computationalism argues that the relationship between mind and body is similar or identical to the relationship between software and hardware and thus may be a solution to the mind–body problem . This philosophical position was inspired by the work of AI researchers and cognitive scientists in the 1960s and was originally proposed by philosophers Jerry Fodor and Hilary Putnam . AI welfare and rights Ethics of artificial intelligence § AI welfare It is difficult or impossible to reliably evaluate whether an advanced AI is sentient (has the ability to feel), and if so, to what degree.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-113", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "AI welfare and rights Ethics of artificial intelligence § AI welfare It is difficult or impossible to reliably evaluate whether an advanced AI is sentient (has the ability to feel), and if so, to what degree. But if there is a significant chance that a given machine can feel and suffer, then it may be entitled to certain rights or welfare protection measures, similarly to animals. Sapience (a set of capacities related to high intelligence, such as discernment or self-awareness ) may provide another moral basis for AI rights. Robot rights are also sometimes proposed as a practical way to integrate autonomous agents into society.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-114", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Sapience (a set of capacities related to high intelligence, such as discernment or self-awareness ) may provide another moral basis for AI rights. Robot rights are also sometimes proposed as a practical way to integrate autonomous agents into society. Critics argued in 2018 that granting rights to AI systems would downplay the importance of human rights , and that legislation should focus on user needs rather than speculative futuristic scenarios. They warn that this may be a moral blind spot analogous to slavery or factory farming , which could lead to large-scale suffering if sentient AI is created and carelessly exploited.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-115", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "They warn that this may be a moral blind spot analogous to slavery or factory farming , which could lead to large-scale suffering if sentient AI is created and carelessly exploited. Future Superintelligence and the singularity A superintelligence is a hypothetical agent that would possess intelligence far surpassing that of the brightest and most gifted human mind. However, technologies cannot improve exponentially indefinitely, and typically follow an S-shaped curve , slowing when they reach the physical limits of what the technology can do. Transhumanism Transhumanism Robot designer Hans Moravec , cyberneticist Kevin Warwick and inventor Ray Kurzweil have predicted that humans and machines may merge in the future into cyborgs that are more capable and powerful than either.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-116", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Transhumanism Transhumanism Robot designer Hans Moravec , cyberneticist Kevin Warwick and inventor Ray Kurzweil have predicted that humans and machines may merge in the future into cyborgs that are more capable and powerful than either. Edward Fredkin argues that \"artificial intelligence is the next step in evolution\", an idea first proposed by Samuel Butler 's \" Darwin among the Machines \" as far back as 1863, and expanded upon by George Dyson in his 1998 book Darwin Among the Machines: The Evolution of Global Intelligence . A common trope in these works began with Mary Shelley 's Frankenstein , where a human creation becomes a threat to its masters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-117", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "A common trope in these works began with Mary Shelley 's Frankenstein , where a human creation becomes a threat to its masters. Clarke's and Stanley Kubrick's 2001: A Space Odyssey (both 1968), with HAL 9000 , the murderous computer in charge of the Discovery One spaceship, as well as Blade Runner (1982), The Terminator (1984) and The Matrix (1999). In contrast, the rare loyal robots such as Gort from The Day the Earth Stood Still (1951) and Bishop from Aliens (1986) are less prominent in popular culture. Asimov's laws are often brought up during lay discussions of machine ethics; while almost all artificial intelligence researchers are familiar with Asimov's laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-118", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Asimov's laws are often brought up during lay discussions of machine ethics; while almost all artificial intelligence researchers are familiar with Asimov's laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity. Several works use AI to force us to confront the fundamental question of what makes us human, showing us artificial beings that have the ability to feel , and thus to suffer. Dick considers the idea that our understanding of human subjectivity is altered by technology created with artificial intelligence. ^ This list of tools is based on the topics covered by the major AI textbooks, including: Russell & Norvig (2021) , Luger & Stubblefield (2004) , Poole, Mackworth & Goebel (1998) and Nilsson (1998) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-119", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ This list of tools is based on the topics covered by the major AI textbooks, including: Russell & Norvig (2021) , Luger & Stubblefield (2004) , Poole, Mackworth & Goebel (1998) and Nilsson (1998) . ^ It is among the reasons that expert systems proved to be inefficient for capturing knowledge. It can refer to anything that directs its behavior to accomplish goals, such as a person, an animal, a corporation, a nation, or in the case of AI, a computer program. ^ Alan Turing discussed the centrality of learning as early as 1950, in his classic paper \" Computing Machinery and Intelligence \".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-120", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ Alan Turing discussed the centrality of learning as early as 1950, in his classic paper \" Computing Machinery and Intelligence \". In 1956, at the original Dartmouth AI summer conference, Ray Solomonoff wrote a report on unsupervised probabilistic machine learning: \"An Inductive Inference Machine\". ^ Compared with symbolic logic, formal Bayesian inference is computationally expensive. AdSense uses a Bayesian network with over 300 million edges to learn which ads to serve. ^ Expectation–maximization, one of the most popular algorithms in machine learning, allows clustering in the presence of unknown latent variables . ^ Some form of deep neural networks (without a specific learning algorithm) were described by: Warren S.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-121", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ Geoffrey Hinton said, of his work on neural networks in the 1990s, \"our labeled datasets were thousands of times too small. But in the context of fairness , it refers to a tendency in favor or against a certain group or individual characteristic, usually in a way that is considered unfair or harmful. A statistically unbiased AI system that produces disparate outcomes for different demographic groups may thus be viewed as biased in the ethical sense. ^ This is the United Nations ' definition, and includes things like land mines as well. ^ See table 4; 9% is both the OECD average and the U.S.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-122", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ This is the United Nations ' definition, and includes things like land mines as well. ^ See table 4; 9% is both the OECD average and the U.S. ^ The programs described are Arthur Samuel 's checkers program for the IBM 701 , Daniel Bobrow 's STUDENT , Newell and Simon 's Logic Theorist and Terry Winograd 's SHRDLU . ^ Embodied approaches to AI were championed by Hans Moravec and Rodney Brooks and went by many names: Nouvelle AI . ^ Matteo Wong wrote in The Atlantic : \"Whereas for decades, computer-science fields such as natural-language processing, computer vision, and robotics used extremely different methods, now they all use a programming method called \"deep learning\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-123", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ Matteo Wong wrote in The Atlantic : \"Whereas for decades, computer-science fields such as natural-language processing, computer vision, and robotics used extremely different methods, now they all use a programming method called \"deep learning\". As a result, their code and approaches have become more similar, and their models are easier to integrate into one another.\" ^ Jack Clark wrote in Bloomberg : \"After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever\", and noted that the number of software projects that use machine learning at Google increased from a \"sporadic usage\" in 2012 to more than 2,700 projects in 2015.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-124", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Computers are smarter and learning faster than ever\", and noted that the number of software projects that use machine learning at Google increased from a \"sporadic usage\" in 2012 to more than 2,700 projects in 2015. ^ Nils Nilsson wrote in 1983: \"Simply put, there is wide disagreement in the field about what AI is all about.\" ^ Daniel Crevier wrote that \"time has proven the accuracy and perceptiveness of some of Dreyfus's comments. Had he formulated them less aggressively, constructive actions they suggested might have been taken much earlier.\" ^ Searle presented this definition of \"Strong AI\" in 1999.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-125", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ Uninformed searches ( breadth first search , depth-first search and general state space search ): Russell & Norvig (2021 , sect. Hallucinations Are Getting Worse, Even as New Systems Become More Powerful\" . Faidon; Srivastava, Ankit; Aubert, Alice; Nowinska, Magdalena; Gregory, Rebecca C.; Staats, Roxine; Possenti, Andrea; Chia, Sean; Sormanni, Pietro; Ghetti, Bernardino; Caughey, Byron; Knowles, Tuomas P. Archived (PDF) from the original on 8 May 2020 . \"Drohnen haben den Krieg in der Ukraine revolutioniert, doch sie sind empfindlich auf Störsender – deshalb sollen sie jetzt autonom operieren\" . \"Large Language Models in an App: Conducting a Qualitative Synthetic Data Analysis of How Snapchat's 'My AI' Responds to Questions About Sexual Consent, Sexual Refusals, Sexual Assault, and Sexting\" .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-126", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "\"Large Language Models in an App: Conducting a Qualitative Synthetic Data Analysis of How Snapchat's 'My AI' Responds to Questions About Sexual Consent, Sexual Refusals, Sexual Assault, and Sexting\" . \" \"Replika Removing Erotic Role-Play Is Like Grand Theft Auto Removing Guns or Cars\": Reddit Discourse on Artificial Intelligence Chatbots and Sexual Technologies\" . ^ Gomaa, Islam; Adelzadeh, Masoud; Gwynne, Steven; Spencer, Bruce; Ko, Yoon; Bénichou, Noureddine; Ma, Chunyun; Elsagan, Nour; Duong, Dana; Zalok, Ehab; Kinateder, Max (1 November 2021). ^ Zhao, Xilei; Lovreglio, Ruggiero; Nilsson, Daniel (1 May 2020). Here are some ways it was used constructively\" .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-127", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ Zhao, Xilei; Lovreglio, Ruggiero; Nilsson, Daniel (1 May 2020). Here are some ways it was used constructively\" . ^ \"Экономист Дарон Асемоглу написал книгу об угрозах искусственного интеллекта — и о том, как правильное управление может обратить его на пользу человечеству Спецкор \"Медузы\" Маргарита Лютова узнала у ученого, как скоро мир сможет приблизиться к этой утопии\" . \"10 charts that show where the economy is heading / 3. \"AI already uses as much energy as a small country. ^ Mazeika, Mantas; Yin, Xuwang; Tamirisa, Rishub; Lim, Jaehyuk; Lee, Bruce W.; Ren, Richard; Phan, Long; Mu, Norman; Khoja, Adam (2025), Utility Engineering: Analyzing and Controlling Emergent Value Systems in AIs , Figure 16, arXiv : 2502.08640 ^ Goffrey (2008) , p.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-128", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "^ Mazeika, Mantas; Yin, Xuwang; Tamirisa, Rishub; Lim, Jaehyuk; Lee, Bruce W.; Ren, Richard; Phan, Long; Mu, Norman; Khoja, Adam (2025), Utility Engineering: Analyzing and Controlling Emergent Value Systems in AIs , Figure 16, arXiv : 2502.08640 ^ Goffrey (2008) , p. \"Ford CEO Jim Farley warns AI will wipe out half of white-collar jobs, but the 'essential economy' has a huge shortage of workers\" . Another common objection to anthropomorphism by design is that it is deceptive insofar as it would appear that in order to meet specific, e.g. emotional or social needs, AI must actually \"fool\" users by making them believe that they have the capacity to engage emotionally ^ Jargon, Julie (4 March 2026).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-129", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "190–191) ^ Dreyfus' critique of AI : Dreyfus (1972) , Dreyfus & Dreyfus (1986) Historical significance and philosophical implications: Crevier (1993 , pp. Other ML in Fusion AI & ML in Fusion, video lecture Archived 2 July 2023 at the Wayback Machine Alter, Alexandra; Harris, Elizabeth A. Arntz, Melanie; Gregory, Terry; Zierahn, Ulrich (2016), \"The risk of automation for jobs in OECD countries: A comparative analysis\", OECD Social, Employment, and Migration Working Papers 189 Asada, M.; Hosoda, K.; Kuniyoshi, Y.; Ishiguro, H.; Inui, T.; Yoshikawa, Y.; Ogino, M.; Yoshida, C. Continuous valued neural networks with two hidden layers are sufficient (Report).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-130", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Arntz, Melanie; Gregory, Terry; Zierahn, Ulrich (2016), \"The risk of automation for jobs in OECD countries: A comparative analysis\", OECD Social, Employment, and Migration Working Papers 189 Asada, M.; Hosoda, K.; Kuniyoshi, Y.; Ishiguro, H.; Inui, T.; Yoshikawa, Y.; Ogino, M.; Yoshida, C. Continuous valued neural networks with two hidden layers are sufficient (Report). Archived (PDF) from the original on 12 May 2023 . Multilayer Feedforward Networks are Universal Approximators (PDF) . GOP much more skeptical than Dems that government can do it right: poll\" . \"What is Artificial Intelligence and How Does AI Work?", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-131", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "GOP much more skeptical than Dems that government can do it right: poll\" . \"What is Artificial Intelligence and How Does AI Work? Lipartito, Kenneth (6 January 2011), The Narrative and the Algorithm: Genres of Credit Reporting from the Nineteenth Century to Today (PDF) (Unpublished manuscript), SSRN 1736283 , archived (PDF) from the original on 9 October 2022 Lohr, Steve (2017). Minsky, Marvin (1986), The Society of Mind , Simon and Schuster McCarthy, John ; Minsky, Marvin ; Rochester, Nathan ; Shannon, Claude (1955). Pinker, Steven (2007) , The Language Instinct , Perennial Modern Classics, Harper, Poria, Soujanya; Cambria, Erik; Bajpai, Rajiv; Hussain, Amir (September 2017).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-132", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Pinker, Steven (2007) , The Language Instinct , Perennial Modern Classics, Harper, Poria, Soujanya; Cambria, Erik; Bajpai, Rajiv; Hussain, Amir (September 2017). Are there computers that are inherently fuzzy and do not apply the usual binary logic?\" . Simon Oliver Selfridge Frank Rosenblatt Bernard Widrow Joseph Weizenbaum Seymour Papert Seppo Linnainmaa Paul Werbos Geoffrey Hinton John Hopfield Jürgen Schmidhuber Yann LeCun Yoshua Bengio Lotfi A. Manning Arthur Mensch Mira Murati Alec Radford Noam Shazeer Ilya Sutskever Ashish Vaswani Andrew Ng Social, economic, and governance AI boom AI bubble AI slop AI anthropomorphism AI arms race Chatbot psychosis Competition Copyright Deaths linked to chatbots Environmental impact Regulation Ethics Existential risk In education In healthcare Workplace impact", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Artificial_intelligence-133", "source": "https://en.wikipedia.org/wiki/Artificial_intelligence", "title": "https://en.wikipedia.org/wiki/Artificial_intelligence", "text": "Manning Arthur Mensch Mira Murati Alec Radford Noam Shazeer Ilya Sutskever Ashish Vaswani Andrew Ng Social, economic, and governance AI boom AI bubble AI slop AI anthropomorphism AI arms race Chatbot psychosis Competition Copyright Deaths linked to chatbots Environmental impact Regulation Ethics Existential risk In education In healthcare Workplace impact", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-0", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "A ( minuscule : a ) is the first letter and the first vowel letter of the Latin alphabet , used in the modern English alphabet , and others worldwide. Its name in English is a (pronounced as in say ), plural aes . It is similar in shape to the Ancient Greek letter alpha , from which it derives. The latter form is commonly used in handwriting and fonts based on it, especially fonts intended to be read by children, and is also found in italic type . Name In English, the name of the letter is the long A sound, pronounced / ˈ eɪ / .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-1", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Name In English, the name of the letter is the long A sound, pronounced / ˈ eɪ / . In turn, the ancestor of aleph may have been a pictogram of an ox head in proto-Sinaitic script influenced by Egyptian hieroglyphs , styled as a triangular head with two horns extended. When the ancient Greeks adopted the alphabet, they had no use for a letter representing a glottal stop —so they adapted the sign to represent the vowel / a / , calling the letter by the similar name alpha . In the earliest Greek inscriptions dating to the 8th century BC following the Greek Dark Ages , the letter rests upon its side.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-2", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In the earliest Greek inscriptions dating to the 8th century BC following the Greek Dark Ages , the letter rests upon its side. However, in the later Greek alphabet it generally resembles the modern capital form—though many local varieties can be distinguished by the shortening of one leg, or by the angle at which the cross line is set. When the Romans adopted the Etruscan alphabet to write Latin , the resulting form used in the Latin script would come to be used to write many other languages, including English. During Roman times, there were many variant forms of the letter A.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-3", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "When the Romans adopted the Etruscan alphabet to write Latin , the resulting form used in the Latin script would come to be used to write many other languages, including English. During Roman times, there were many variant forms of the letter A. First was the monumental or lapidary style, which was used when inscribing on stone or other more permanent media. There was also a cursive style used for everyday or utilitarian writing, which was done on more perishable surfaces. Due to the perishable nature of these surfaces, there are not as many examples of this style as there are of the monumental, but there are still many surviving examples of different types of cursive, such as majuscule cursive, minuscule cursive, and semi-cursive minuscule.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-4", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Due to the perishable nature of these surfaces, there are not as many examples of this style as there are of the monumental, but there are still many surviving examples of different types of cursive, such as majuscule cursive, minuscule cursive, and semi-cursive minuscule. Variants also existed that were intermediate between the monumental and cursive styles. Among these were the semi-cursive minuscule of Italy, the Merovingian script in France, the Visigothic script in Spain, and the Insular or Anglo-Irish semi-uncial or Anglo-Saxon majuscule of Great Britain. This form was derived through a combining of prior forms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-5", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Among these were the semi-cursive minuscule of Italy, the Merovingian script in France, the Visigothic script in Spain, and the Insular or Anglo-Irish semi-uncial or Anglo-Saxon majuscule of Great Britain. This form was derived through a combining of prior forms. Road sign in Ireland showing the \"Latin alpha\" form of ⟨a⟩ in lower and upper case forms 15th-century Italy saw the formation of the two main variants that are known today. These variants, the Italic and Roman forms, were derived from the Caroline Script version. The Italic form ⟨ɑ⟩ , also called script a , is often used in handwriting ; it consists of a circle with a vertical stroke on its right.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-6", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "The Italic form ⟨ɑ⟩ , also called script a , is often used in handwriting ; it consists of a circle with a vertical stroke on its right. In the hands of medieval Irish and English writers, this form gradually developed from a 5th-century form resembling the Greek letter tau ⟨τ⟩ . The Roman form ⟨a⟩ is found in most printed material, and consists of a small loop with an arc over it. In Greek handwriting, it was common to join the left leg and horizontal stroke into a single loop, as demonstrated by the uncial version shown.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-7", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In Greek handwriting, it was common to join the left leg and horizontal stroke into a single loop, as demonstrated by the uncial version shown. In some of these, the serif that began the right leg stroke developed into an arc, resulting in the printed form, while in others it was dropped, resulting in the modern handwritten form. Italic type is commonly used to mark emphasis or more generally to distinguish one part of a text from the rest set in Roman type. There are some other cases aside from italic type where script a ⟨ɑ⟩ , also called Latin alpha , is used in contrast with Latin ⟨a⟩ , such as in the International Phonetic Alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-8", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "There are some other cases aside from italic type where script a ⟨ɑ⟩ , also called Latin alpha , is used in contrast with Latin ⟨a⟩ , such as in the International Phonetic Alphabet . Use in writing systems In English , ⟨a⟩ is the indefinite article (with the alternative form an when followed by a vowel). Pronunciation English Further information: Pronunciation of English ⟨a⟩ In English language education, the word apple is consistently associated with the letter A. However, ⟨a⟩ occurs in many common digraphs , all with their own sound or sounds, particularly ⟨ai⟩ , ⟨au⟩ , ⟨aw⟩ , ⟨ay⟩ , ⟨ea⟩ and ⟨oa⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-9", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "However, ⟨a⟩ occurs in many common digraphs , all with their own sound or sounds, particularly ⟨ai⟩ , ⟨au⟩ , ⟨aw⟩ , ⟨ay⟩ , ⟨ea⟩ and ⟨oa⟩ . ⟨a⟩ is the third-most-commonly used letter in English after ⟨e⟩ and ⟨t⟩ , as well as in French; it is the second most common in Spanish, and the most common in Portuguese. ⟨a⟩ represents approximately 8.2% of letters as used in English texts; the figure is around 7.6% in French 11.5% in Spanish, and 14.6% in Portuguese. Other languages In most languages that use the Latin alphabet, ⟨a⟩ denotes an open unrounded vowel, such as / a / , / ä / , or / ɑ / .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-10", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Other languages In most languages that use the Latin alphabet, ⟨a⟩ denotes an open unrounded vowel, such as / a / , / ä / , or / ɑ / . An exception is Saanich , in which ⟨a⟩ —and the glyph ⟨ Á ⟩ —stands for a close-mid front unrounded vowel /e/ . Other systems In the International Phonetic Alphabet , ⟨ a ⟩ is used for the open front unrounded vowel , ⟨ ä ⟩ is used for the open central unrounded vowel , and ⟨ ɑ ⟩ is used for the open back unrounded vowel .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-11", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Other systems In the International Phonetic Alphabet , ⟨ a ⟩ is used for the open front unrounded vowel , ⟨ ä ⟩ is used for the open central unrounded vowel , and ⟨ ɑ ⟩ is used for the open back unrounded vowel . In X-SAMPA , ⟨a⟩ is used for the open front unrounded vowel and ⟨A⟩ is used for the open back unrounded vowel . In algebra , the letter a along with various other letters of the alphabet is often used to denote a variable , with various conventional meanings in different areas of mathematics.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-12", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In algebra , the letter a along with various other letters of the alphabet is often used to denote a variable , with various conventional meanings in different areas of mathematics. In 1637, René Descartes \"invented the convention of representing unknowns in equations by x, y, and z, and knowns by a, b, and c\", and this convention is still often followed, especially in elementary algebra. In geometry , capital Latin letters are used to denote objects including line segments , lines , and rays A capital A is also typically used as one of the letters to represent an angle in a triangle , the lowercase a representing the side opposite angle A.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-13", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In geometry , capital Latin letters are used to denote objects including line segments , lines , and rays A capital A is also typically used as one of the letters to represent an angle in a triangle , the lowercase a representing the side opposite angle A. A is often used to denote something or someone of a better or more prestigious quality or status: A−, A or A+, the best grade that can be assigned by teachers for students' schoolwork; \"A grade\" for clean restaurants; A-list celebrities, A1 at Lloyd's for shipping, etc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-14", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "A is often used to denote something or someone of a better or more prestigious quality or status: A−, A or A+, the best grade that can be assigned by teachers for students' schoolwork; \"A grade\" for clean restaurants; A-list celebrities, A1 at Lloyd's for shipping, etc. Such associations can have a motivating effect, as exposure to the letter A has been found to improve performance, when compared with other letters. A is used to denote size, as in a narrow size shoe, or a small cup size in a brassiere . These are the same code points as those used in ASCII and ISO 8859 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-15", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "A is used to denote size, as in a narrow size shoe, or a small cup size in a brassiere . These are the same code points as those used in ASCII and ISO 8859 . There are also precomposed character encodings for ⟨A⟩ and ⟨a⟩ with diacritics, for most of those listed above ; the remainder are produced using combining diacritics . Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, Latin alpha in linguistics, and halfwidth and fullwidth forms for legacy CJK font compatibility.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-16", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, Latin alpha in linguistics, and halfwidth and fullwidth forms for legacy CJK font compatibility. The Cyrillic and Greek homoglyphs of the Latin ⟨A⟩ have separate encodings U+0410 А CYRILLIC CAPITAL LETTER A and U+0391 Α GREEK CAPITAL LETTER ALPHA . Other Aes is the plural of the name of the letter. The plural of the letter itself is rendered A s, A's, a s, or a's. ^ Constable, Peter (19 April 2004), L2/04-132 Proposal to Add Additional Phonetic Characters to the UCS (PDF) , archived (PDF) from the original on 11 October 2017 , .unicode.org ^ Everson, Michael ; et al.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-17", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "^ Constable, Peter (19 April 2004), L2/04-132 Proposal to Add Additional Phonetic Characters to the UCS (PDF) , archived (PDF) from the original on 11 October 2017 , .unicode.org ^ Everson, Michael ; et al. ( Audio help · More spoken articles ) History of the Alphabet Archived 10 April 2021 at the Wayback Machine Texts on Wikisource: \" A \" in A Dictionary of the English Language by Samuel Johnson \"A\" .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-0", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Historically these letters were \"elevated terminals\", that is to say the last few letters of the full word denoting the ordinal form of the number displayed as a superscript . Probably originating with medieval monastic practice, the character(s) used vary in different languages. In English orthography , this corresponds to the suffixes ‑st , ‑nd , ‑rd , ‑th in written ordinals (represented either on the line 1st , 2nd , 3rd , 4th or as superscript 1 , 2 , 3 , 4 ). Also commonly encountered in Romance languages are the superscript or superior (and often underlined) masculine ordinal indicator , º , and feminine ordinal indicator , ª .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-1", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Also commonly encountered in Romance languages are the superscript or superior (and often underlined) masculine ordinal indicator , º , and feminine ordinal indicator , ª . In formal typography, the ordinal indicators ª and º are distinguishable from other characters. The practice of underlined (or doubly underlined) superscripted abbreviations was common in 19th-century writing (not limited to ordinal indicators in particular, and extant in the numero sign № ), and was found in handwritten English until at least the late 19th century (e.g. The indicator may be given an underline but this is not ubiquitous.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-2", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The practice of underlined (or doubly underlined) superscripted abbreviations was common in 19th-century writing (not limited to ordinal indicators in particular, and extant in the numero sign № ), and was found in handwritten English until at least the late 19th century (e.g. The indicator may be given an underline but this is not ubiquitous. In digital typography , this depends on the font: Cambria and Calibri , for example, have underlined ordinal indicators, while most other fonts do not. Examples of the usage of ordinal indicators in Italian are: 1º, primo ; 1ª, prima \"first\" 2º, secondo ; 2ª, seconda \"second\" 3º, terzo ; 3ª, terza \"third\" Galician also forms its ordinal numbers this way, while Asturian follows a similar system where ᵘ is used for the masculine gender, ª for the feminine gender and º for the neuter gender.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-3", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Examples of the usage of ordinal indicators in Italian are: 1º, primo ; 1ª, prima \"first\" 2º, secondo ; 2ª, seconda \"second\" 3º, terzo ; 3ª, terza \"third\" Galician also forms its ordinal numbers this way, while Asturian follows a similar system where ᵘ is used for the masculine gender, ª for the feminine gender and º for the neuter gender. In Spanish, using the two final letters of the word as it is spelled is not allowed, except in the cases of primer (an apocope of primero ) before singular masculine nouns, which is not abbreviated as 1.º but as 1.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-4", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In Spanish, using the two final letters of the word as it is spelled is not allowed, except in the cases of primer (an apocope of primero ) before singular masculine nouns, which is not abbreviated as 1.º but as 1. ; of tercer (an apocope of tercero ) before singular masculine nouns, which is not abbreviated as 3.º but as 3. Since none of these words are shortened before feminine nouns, their correct forms for those cases are primera and tercera . The terminal letters used depend on the gender of the item to be ordered and the case in which the ordinal adjective is stated, for example primus dies ('the first day', nominative case , masculine), but primo die ('on the first day', ablative case masculine), shown as I or i .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-5", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The terminal letters used depend on the gender of the item to be ordered and the case in which the ordinal adjective is stated, for example primus dies ('the first day', nominative case , masculine), but primo die ('on the first day', ablative case masculine), shown as I or i . As monumental inscriptions often refer to days on which events happened (e.g., \"he died on the tenth of June\"), the ablative case is generally used: X ( decimo ) with the month stated in the genitive case . The masculine ordinal indicator º may be confused with the degree sign ° (U+00B0), which looks very similar and which is provided on the Italian and Latin American keyboard layouts .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-6", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The masculine ordinal indicator º may be confused with the degree sign ° (U+00B0), which looks very similar and which is provided on the Italian and Latin American keyboard layouts . It was common in the early days of computers to use the same character for both. The degree sign is a uniform circle and is never underlined. The masculine ordinal indicator is the shape of a lower-case letter o , and thus may be oval or elliptical , and may have a varying line thickness. It is not mandatory in Portugal nor in Brazil , but it is preferred in some fonts to avoid confusion with the degree sign.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-7", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "It is not mandatory in Portugal nor in Brazil , but it is preferred in some fonts to avoid confusion with the degree sign. The top of the ordinal indicators (i.e., the top of the elevated letter a and letter o ) must be aligned with the cap height of the font. The line thickness of the ordinal indicators is always proportional to the line thickness of the other characters of the font. ISO 8859-1 was incorporated as the first 256 code points of Unicode in 1991. The Unicode characters are thus: U+00AA ª FEMININE ORDINAL INDICATOR ( ª ) U+00BA º MASCULINE ORDINAL INDICATOR ( º ) There are superscript versions of the letters ⟨a⟩ and ⟨o⟩ in Unicode ; these are different characters and should not be used as ordinal indicators.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-8", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The Unicode characters are thus: U+00AA ª FEMININE ORDINAL INDICATOR ( ª ) U+00BA º MASCULINE ORDINAL INDICATOR ( º ) There are superscript versions of the letters ⟨a⟩ and ⟨o⟩ in Unicode ; these are different characters and should not be used as ordinal indicators. On other keyboard layouts, these characters are accessible only through a set of keystrokes (see Unicode input ). In Basque , Serbo-Croatian , Czech , Danish , Estonian , Faroese , Finnish , German , Hungarian , Icelandic , Latvian , Norwegian , Slovak , Slovene , Turkish , among other languages, a period or full stop is written after the numeral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-9", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In Basque , Serbo-Croatian , Czech , Danish , Estonian , Faroese , Finnish , German , Hungarian , Icelandic , Latvian , Norwegian , Slovak , Slovene , Turkish , among other languages, a period or full stop is written after the numeral. In Polish , the period can be omitted if there is no ambiguity whether a given numeral is ordinal or cardinal. The only exceptions are variables in mathematics ( k+1-szy – (k+1)st ). Writing out the endings for various cases , as sometimes happens in Czech and Slovak, is considered incorrect and uneducated.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-10", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Writing out the endings for various cases , as sometimes happens in Czech and Slovak, is considered incorrect and uneducated. Should a full stop follow this dot, it is omitted. The Serbian standard of Serbo-Croatian (unlike the Croatian and Bosnian standards) uses the dot in role of the ordinal indicator only past Arabic numerals, while Roman numerals are used without a dot. There is a problem with autocorrection, mobile editors, etc., which often force a capital initial letter in the word following the ordinal numbers. 1st , pronounced fir st ) -nd is used with numbers ending in 2 (e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-11", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "There is a problem with autocorrection, mobile editors, etc., which often force a capital initial letter in the word following the ordinal numbers. 1st , pronounced fir st ) -nd is used with numbers ending in 2 (e.g. 92nd , pronounced ninety-seco nd ) -rd is used with numbers ending in 3 (e.g. 33rd , pronounced thirty-thi rd ) As an exception to the above rules, numbers ending with 11 , 12 , and 13 use -th (e.g. One archaic variant uses a singular -d for numbers ending in 2 or 3 (e.g. 92d or 33d ) In 19th-century handwriting, these terminals were often elevated, that is to say written as superscripts (e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-12", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "92d or 33d ) In 19th-century handwriting, these terminals were often elevated, that is to say written as superscripts (e.g. With the gradual introduction of the typewriter in the late 19th century, it became common to write them on the baseline in typewritten texts, and this usage even became recommended in certain 20th-century style guides. Thus, the 17th edition of The Chicago Manual of Style states: \"The letters in ordinal numbers should not appear as superscripts (e.g., 122nd not 122 )\", as do the Bluebook and style guides by the Council of Science Editors , Microsoft , and Yahoo .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-13", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Thus, the 17th edition of The Chicago Manual of Style states: \"The letters in ordinal numbers should not appear as superscripts (e.g., 122nd not 122 )\", as do the Bluebook and style guides by the Council of Science Editors , Microsoft , and Yahoo . Style guide author Jack Lynch ( Rutgers ) recommends turning off automatic superscripting of ordinals in Microsoft Word , because \"no professionally printed books use superscripts\". It uses for higher numbers (for instance 2 – deuxième ). French also uses the indicators and for the alternative second ordinal number (masculine 2 – second ; feminine 2 – seconde ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-14", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "French also uses the indicators and for the alternative second ordinal number (masculine 2 – second ; feminine 2 – seconde ). Although regarded as incorrect by typographic standards, longer forms are in wide usage: for feminine 1 ( 1 – première )), for numbers starting at 2 (for instance 2 – deuxième ), and for the alternative second ordinal number ( 2 – second ; 2 – seconde ) These indicators use superscript formatting whenever it is available. Most numbers follow the pattern exemplified by vint '20' ( 20è m sg , 20a f sg , 20ns m pl , 20es f pl ), but the first few ordinals are irregular, affecting the abbreviations of the masculine forms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-15", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Most numbers follow the pattern exemplified by vint '20' ( 20è m sg , 20a f sg , 20ns m pl , 20es f pl ), but the first few ordinals are irregular, affecting the abbreviations of the masculine forms. Optionally ‑ste and ‑de may be used, but this is more complex: 1ste ( eerste ), 2de ( tweede ), 4de ( vierde ), 20ste ( twintigste ), etc. However, if the head noun is omitted, the ordinal indicator takes the form of a morphological suffix, which is attached to the numeral with a colon .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-16", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "However, if the head noun is omitted, the ordinal indicator takes the form of a morphological suffix, which is attached to the numeral with a colon . In the nominative case , the suffix is ‑nen for 1 and 2, and ‑s for larger numerals: Minä olin 2:nen , ja veljeni oli 3:s 'I came 2nd , and my brother came 3rd '. This is derived from the endings of the spelled-out ordinal numbers: ensimmäinen , toinen , kolmas , neljäs , viides , kuudes , seitsemäs , etc.. Even native speakers sometimes find it difficult to exactly identify the ordinal suffix, as its borders with the word stem and the case ending may appear blurred.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-17", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Even native speakers sometimes find it difficult to exactly identify the ordinal suffix, as its borders with the word stem and the case ending may appear blurred. In such cases, it may be preferable to write the ordinal word entirely with letters and particularly 2:nen is rare even in the nominative case, as it is not significantly shorter than the full word toinen . When the ordinal is written out, the suffix adheres to the spelling restrictions imposed by the broad/slender difference in consonants and is written -iú after slender consonants; but when written as numbers, only the suffix itself ( -ú ) is written.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-18", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "When the ordinal is written out, the suffix adheres to the spelling restrictions imposed by the broad/slender difference in consonants and is written -iú after slender consonants; but when written as numbers, only the suffix itself ( -ú ) is written. In the case of 4 ( ceathair ), the final syllable is syncopated before the suffix, and in the case of 9 ( naoi ), 20 ( fiche ), and 1000 ( míle ), the final vowel is assimilated into the suffix. Most multiples of ten end in a vowel in their cardinal form and form their ordinal form by adding the suffix to their genitive singular form, which ends in -d ; this is not reflected in writing.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-19", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Most multiples of ten end in a vowel in their cardinal form and form their ordinal form by adding the suffix to their genitive singular form, which ends in -d ; this is not reflected in writing. Exceptions are 20 ( fiche ) and 40 ( daichead ), both of which form their ordinals by adding the suffix directly to the cardinal ( fichiú and daicheadú ). As in French, the vigesimal system is widely used, particularly in people's ages. The numbers 1 ( aon ) and 2 ( dó ) both have two separate ordinals: one regularly formed by adding -ú ( aonú , dóú ), and one suppletive form ( céad , dara ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-20", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The numbers 1 ( aon ) and 2 ( dó ) both have two separate ordinals: one regularly formed by adding -ú ( aonú , dóú ), and one suppletive form ( céad , dara ). The regular forms are restricted in their usage to actual numeric contexts, when counting. The latter are also used in counting, especially céad , but are used in broader, more abstract senses of \"first\" and \"second\" (or \"other\"). In their broader senses, céad and dara are not written as 1ú and 2ú , though 1ú and 2ú may in a numeric context be read aloud as céad and dara (e.g., an 21ú lá may be read as an t-aonú lá is fiche or as an chéad lá is fiche ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-21", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In their broader senses, céad and dara are not written as 1ú and 2ú , though 1ú and 2ú may in a numeric context be read aloud as céad and dara (e.g., an 21ú lá may be read as an t-aonú lá is fiche or as an chéad lá is fiche ). The rule is to take the minimal number of letters that include at least one consonant phoneme. The reason is that -a and -e respectively end the ordinal number words. The ordinals for 1 and 2 may however be given an -e form ( förste and andre instead of första and andra ) when used about a male person (masculine natural gender), and if so they are written 1:e and 2:e .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-22", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The ordinals for 1 and 2 may however be given an -e form ( förste and andre instead of första and andra ) when used about a male person (masculine natural gender), and if so they are written 1:e and 2:e . Furthermore, suffixes can be left out if the number obviously is an ordinal number, example: 3 utg. Using a full stop as an ordinal indicator is considered archaic , but still occurs in military contexts; for example: 5. Numbers in Filipino are preceded by the ordinal prefix ika- or pang- (the latter subject to sandhi ; for example, ika-7 or pam-7 \"seventh\").", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-23", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Numbers in Filipino are preceded by the ordinal prefix ika- or pang- (the latter subject to sandhi ; for example, ika-7 or pam-7 \"seventh\"). In Chinese and Japanese , an ordinal number is formed when a numeral is preceded by the character 第 (pronounced dì in Mandarin Chinese , dai in Japanese): for example, 第一 \"first\", 第二 \"second\". This is a typical character, not a special ordinal indicator, and unlike in European languages, it is also not an abbreviation. In Korean , an ordinal number is prefixed by 제 je or suffixed by 번째 beonjjae : for example, 제1 \"first\", 2번째 \"second\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-24", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In Korean , an ordinal number is prefixed by 제 je or suffixed by 번째 beonjjae : for example, 제1 \"first\", 2번째 \"second\". for impuesto ('tax'), V.º B.º for visto bueno ('approved'), D.ª for doña (an honorific ), and M.ª for María (a Spanish name frequently used in compounds like José M.ª ). When a lone o or a is the raised letter, the masculine or feminine ordinal indicator may be used for this purpose, which may or may not be considered correct. In both Spanish and Portuguese, abbreviations formed this way have a period between the last regular letter and the first raised letter.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-25", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In both Spanish and Portuguese, abbreviations formed this way have a period between the last regular letter and the first raised letter. Traditionally, the raised letters are underlined, but this is optional and less frequent today. In English : Abbreviations such as \"answ \" for \"answered\" and \"Jo \" for \"Joseph\" were commonly used in English-language handwritten letters and records prior to the 20th century. abbreviation from the Romance-language word numero , which itself derives from the Latin word numero , the ablative case of the word numerus \"number\". This is sometimes written as N , with the superscript o optionally underlined, or sometimes with the ordinal indicator.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-26", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "This is sometimes written as N , with the superscript o optionally underlined, or sometimes with the ordinal indicator. The underline helps avoid confusion between the masculine ordinal and the degree character. This is important at low resolution, such as the screen, when both characters are very similar in size and shape. Peirce also regularly used the nineteenth-century calligraphic convention of double underlining superscript portions of abbreviations such as M or 1 . 629 : \"In all MSS in this period, Peirce inscribed \"st,\" \"nd,\" \"rd,\" and \"th\" in the superscript position: for convenience's sake, they are on the line in typewritten pieces.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-27", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "629 : \"In all MSS in this period, Peirce inscribed \"st,\" \"nd,\" \"rd,\" and \"th\" in the superscript position: for convenience's sake, they are on the line in typewritten pieces. In published pieces the ordinals are superscripted to conform to Peirce's style; \"2 \" and \"3 \" are emended to \"2nd\" and \"3rd\". When Peirce typed abbreviated ordinals on the line, these mechanical exceptions attributable to his typewriter have been changed to superscript ordinals.\" ^ Butterick, Matthew (4 October 2012).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-0", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Without proper rendering support , you may see question marks, boxes, or other symbols . It is designed such that the beginnings and ends of the individual strokes that make up each letter will be clearly visible, and often emphasized; in this way it is often contrasted with the curves of the Antiqua (common) typefaces where the letters are designed to flow and strokes connect together in a continuous fashion. The word \"Fraktur\" derives from Latin frāctūra (\"a break\"), built from frāctus , passive participle of frangere (\"to break\"), which is also the root for the English word \"fracture\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-1", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "The word \"Fraktur\" derives from Latin frāctūra (\"a break\"), built from frāctus , passive participle of frangere (\"to break\"), which is also the root for the English word \"fracture\". In non-professional contexts, the term \"Fraktur\" is sometimes misused to refer to all blackletter typefaces – while Fraktur typefaces do fall under that category, not all blackletter typefaces exhibit the Fraktur characteristics described above. Fraktur is often characterized as \"the German typeface\", as it remained popular in Germany and much of Eastern Europe far longer than elsewhere. Beginning in the 19th century, the use of Fraktur versus Antiqua (seen as modern) was the subject of controversy in Germany.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-2", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Beginning in the 19th century, the use of Fraktur versus Antiqua (seen as modern) was the subject of controversy in Germany. Some Fraktur typefaces also include a variant form of the letter r known as the r rotunda , and many include a variety of ligatures which are left over from cursive handwriting and have rules for their use. Most older Fraktur typefaces make no distinction between the majuscules ⟨I⟩ and ⟨J⟩ (where the common shape is more suggestive of a ⟨J⟩ ), even though the minuscules ⟨i⟩ and ⟨j⟩ are differentiated. One difference between the Fraktur and other blackletter scripts is that in the lower case ⟨o⟩ , the left part of the bow is broken, but the right part is not.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-3", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "One difference between the Fraktur and other blackletter scripts is that in the lower case ⟨o⟩ , the left part of the bow is broken, but the right part is not. In Danish texts composed in Fraktur, the letter ⟨ ø ⟩ was already preferred to the German and Swedish ⟨ ö ⟩ in the 16th century. In the Latvian variant of Fraktur, used mainly until the 1920s, there are additional characters used to denote Latvian letters with diacritical marks . Stroked variants of ⟨s⟩ are also used in pre-1950 Sorbian orthography. Fraktur quickly overtook the earlier Schwabacher and Textualis typefaces in popularity, and a wide variety of Fraktur fonts were carved and became common in the German-speaking world and areas under German influence (Scandinavia, Estonia, Latvia, Central Europe ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-4", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Fraktur quickly overtook the earlier Schwabacher and Textualis typefaces in popularity, and a wide variety of Fraktur fonts were carved and became common in the German-speaking world and areas under German influence (Scandinavia, Estonia, Latvia, Central Europe ). In the 18th century, the German Theuerdank Fraktur was further developed by the Leipzig typographer Johann Gottlob Immanuel Breitkopf to create the typeset Breitkopf Fraktur . In reality only German-speakers, Estonia, and Latvia still used Fraktur as the majority script at this time. Denmark had shifted to Antiqua during the mid 19th century, and in Norway the majority of printed texts used Antiqua around 1900.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-5", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Denmark had shifted to Antiqua during the mid 19th century, and in Norway the majority of printed texts used Antiqua around 1900. Notably, the map itself uses Antiqua for its legend, even though it is in German, indicating that Fraktur was no longer universally used even among German-speakers. Typesetting in Fraktur was still very common in the early 20th century in all German-speaking countries and areas, as well as in Norway , Estonia , and Latvia , and was still used to a very small extent in Sweden , Finland and Denmark , even though other countries typeset in Antiqua .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-6", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Typesetting in Fraktur was still very common in the early 20th century in all German-speaking countries and areas, as well as in Norway , Estonia , and Latvia , and was still used to a very small extent in Sweden , Finland and Denmark , even though other countries typeset in Antiqua . Some books at that time used related blackletter fonts such as Schwabacher ; however, the predominant typeface was the Normalfraktur, which came in slight variations. From the late 18th century to the late 19th century, Fraktur was progressively replaced by Antiqua as a symbol of the classicist age and emerging cosmopolitanism in most of the countries in Europe that had previously used Fraktur.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-7", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "From the late 18th century to the late 19th century, Fraktur was progressively replaced by Antiqua as a symbol of the classicist age and emerging cosmopolitanism in most of the countries in Europe that had previously used Fraktur. This move was hotly debated in Germany, a controversy known as the Antiqua–Fraktur dispute . The Fraktur typefaces remained in use in Nazi Germany , when they were initially represented as true German script; official Nazi documents and letterheads employed the font, and the cover of Hitler 's Mein Kampf used a hand-drawn version of it. These fonts were designed in the early 20th century, mainly the 1930s, as grotesque versions of blackletter typefaces.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-8", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "These fonts were designed in the early 20th century, mainly the 1930s, as grotesque versions of blackletter typefaces. The Nazis heavily used these fonts themselves, although the shift remained controversial; in fact, the press was at times scolded for its frequent use of \"Roman characters\" under \"Jewish influence\" and German émigrés were urged to use only \"German script\". Martin Bormann issued a circular (the \" normal type decree \") to all public offices which declared Fraktur (and its corollary, the Sütterlin -based handwriting) to be Judenlettern (Jewish letters) and prohibited their further use. German historian Albert Kapr has speculated that the regime viewed Fraktur as inhibiting communication in the occupied territories during World War II .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-9", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "German historian Albert Kapr has speculated that the regime viewed Fraktur as inhibiting communication in the occupied territories during World War II . After Nazi Germany fell in 1945, Fraktur was unbanned, but remain limited use as of today. It means \"Victor chases twelve boxers across the Sylt dike\" and contains all 26 letters of the alphabet plus the umlauted glyphs used in German, making it an example of a pangram . Thus, the additional ligatures that are required for Fraktur typefaces will not be encoded in Unicode: support for these ligatures is a font engineering issue left up to font developers.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-10", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Thus, the additional ligatures that are required for Fraktur typefaces will not be encoded in Unicode: support for these ligatures is a font engineering issue left up to font developers. There are, however, two sets of Fraktur symbols in the Unicode blocks of Mathematical Alphanumeric Symbols , Letterlike Symbols , and Latin Extended-E . The long s , ß , and the umlauted vowels are not encoded, as the characters are meant to be used in mathematics and phonetics, so they are not suitable for typesetting German-language texts. ^ ISO basic Latin alphabet is derived from the English alphabet hence its 26 letters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-11", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "The long s , ß , and the umlauted vowels are not encoded, as the characters are meant to be used in mathematics and phonetics, so they are not suitable for typesetting German-language texts. ^ ISO basic Latin alphabet is derived from the English alphabet hence its 26 letters. (in Danish) and Biblia: Det er Den gantske Hellige Scrifft paa Danske igien offuerseet oc prentet effter vor allernaadigste herris oc Kongis K.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-0", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Unicode subscripts and superscripts - Wikipedia Jump to content Search Search Donate Create account Log in Donate Create account Log in Unicode subscripts and superscripts 2 languages Français Українська Edit links From Wikipedia, the free encyclopedia Unicode denominator & numerator glyphs This article contains special characters . Without proper rendering support , you may see question marks, boxes, or other symbols . These characters allow any polynomial , chemical and certain other equations to be represented in plain text without using any form of markup like HTML or TeX . The intended use when these characters were added to Unicode was to produce true superscripts and subscripts so that chemical and algebraic formulas could be written without markup.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-1", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The intended use when these characters were added to Unicode was to produce true superscripts and subscripts so that chemical and algebraic formulas could be written without markup. Thus H₂O (using a subscript 2 character) is supposed to be identical to H 2 O (with subscript markup). In reality, many fonts that include these characters ignore the Unicode definition, and instead design the digits for mathematical numerator and denominator glyphs, which are aligned with the cap line and the baseline , respectively. When used with the solidus or the Fraction Slash, they produce an almost typographically correct diagonal fraction, such as ³/₄ for the ¾ glyph.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-2", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "When used with the solidus or the Fraction Slash, they produce an almost typographically correct diagonal fraction, such as ³/₄ for the ¾ glyph. Unicode intended that diagonal fractions be rendered by a different mechanism: the fraction slash U+2044 is visually similar to the solidus, but when used with the ordinary digits (not the superscripts and subscripts), it instructs the layout system that a fraction such as ¾ is to be rendered using automatic glyph substitution. User-end support was quite poor for a number of years, but fonts, browsers, word processors, desktop publishing software and others increasingly support the intended Unicode behavior.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-3", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "User-end support was quite poor for a number of years, but fonts, browsers, word processors, desktop publishing software and others increasingly support the intended Unicode behavior. The remainder were placed along with basic arithmetical symbols, and later some Latin subscripts, in a dedicated block at U+ 2070 to U+209F. Each superscript or subscript character is preceded by a baseline x to show the height of subscripting/superscripting. As of November 2024, three of these (209D, 209E, and 209F) were provisionally assigned to new subscript characters, namely Latin lowercase w , y , and z . The Spacing Modifier Letters block has superscripted letters and symbols used for phonetic transcription: ʰ ʱ ʲ ʳ ʴ ʵ ʶ ʷ ʸ ˀ ˁ ˠ ˡ ˢ ˣ ˤ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-4", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Spacing Modifier Letters block has superscripted letters and symbols used for phonetic transcription: ʰ ʱ ʲ ʳ ʴ ʵ ʶ ʷ ʸ ˀ ˁ ˠ ˡ ˢ ˣ ˤ . The Phonetic Extensions block has several superscripted letters and symbols: Latin/IPA ᴬ ᴭ ᴮ ᴯ ᴰ ᴱ ᴲ ᴳ ᴴ ᴵ ᴶ ᴷ ᴸ ᴹ ᴺ ᴻ ᴼ ᴽ ᴾ ᴿ ᵀ ᵁ ᵂ ᵃ ᵄ ᵅ ᵆ ᵇ ᵈ ᵉ ᵊ ᵋ ᵌ ᵍ ᵏ ᵐ ᵑ ᵒ ᵓ ᵖ ᵗ ᵘ ᵚ ᵛ , Greek ᵝ ᵞ ᵟ ᵠ ᵡ , Cyrillic ᵸ , other ᵎ ᵔ ᵕ ᵙ ᵜ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-5", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Phonetic Extensions block has several superscripted letters and symbols: Latin/IPA ᴬ ᴭ ᴮ ᴯ ᴰ ᴱ ᴲ ᴳ ᴴ ᴵ ᴶ ᴷ ᴸ ᴹ ᴺ ᴻ ᴼ ᴽ ᴾ ᴿ ᵀ ᵁ ᵂ ᵃ ᵄ ᵅ ᵆ ᵇ ᵈ ᵉ ᵊ ᵋ ᵌ ᵍ ᵏ ᵐ ᵑ ᵒ ᵓ ᵖ ᵗ ᵘ ᵚ ᵛ , Greek ᵝ ᵞ ᵟ ᵠ ᵡ , Cyrillic ᵸ , other ᵎ ᵔ ᵕ ᵙ ᵜ . These are intended to indicate secondary articulation . The Phonetic Extensions Supplement block has several more: Latin/IPA ᶛ ᶜ ᶝ ᶞ ᶟ ᶠ ᶡ ᶢ ᶣ ᶤ ᶥ ᶦ ᶧ ᶨ ᶩ ᶪ ᶫ ᶬ ᶭ ᶮ ᶯ ᶰ ᶱ ᶲ ᶳ ᶴ ᶵ ᶶ ᶷ ᶸ ᶹ ᶺ ᶻ ᶼ ᶽ ᶾ , Greek ᶿ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-6", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Phonetic Extensions Supplement block has several more: Latin/IPA ᶛ ᶜ ᶝ ᶞ ᶟ ᶠ ᶡ ᶢ ᶣ ᶤ ᶥ ᶦ ᶧ ᶨ ᶩ ᶪ ᶫ ᶬ ᶭ ᶮ ᶯ ᶰ ᶱ ᶲ ᶳ ᶴ ᶵ ᶶ ᶷ ᶸ ᶹ ᶺ ᶻ ᶼ ᶽ ᶾ , Greek ᶿ . The Cyrillic Extended-D block contains many Cyrillic superscripts: 𞀰 𞀱 𞀲 𞀳 𞀷 𞀵 𞀶 𞀷 𞀸 𞀹 𞀺 𞀻 𞀼 𞀽 𞀾 𞀿 𞁀 𞁁 𞁂 𞁃 𞁄 𞁅 𞁆 𞁇 𞁈 𞁉 𞁊 𞁋 𞁌 𞁍 𞁎 𞁏 𞁐 𞁫 𞁬 𞁭 . The Kanbun block has superscripted annotation characters used in Japanese copies of Classical Chinese texts: ㆒ ㆓ ㆔ ㆕ ㆖ ㆗ ㆘ ㆙ ㆚ ㆛ ㆜ ㆝ ㆞ ㆟ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-7", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Kanbun block has superscripted annotation characters used in Japanese copies of Classical Chinese texts: ㆒ ㆓ ㆔ ㆕ ㆖ ㆗ ㆘ ㆙ ㆚ ㆛ ㆜ ㆝ ㆞ ㆟ . These letters are written directly above other letters appearing in medieval Germanic manuscripts, and so these glyphs do not include spacing, for example uͤ. The Phonetic Extensions block has several subscripted letters and symbols: Latin/IPA ᵢ ᵣ ᵤ ᵥ and Greek ᵦ ᵧ ᵨ ᵩ ᵪ . The Cyrillic Extended-D block also contains many Cyrillic subscripts: 𞁑 𞁒 𞁓 𞁔 𞁕 𞁖 𞁗 𞁘 𞁙 𞁚 𞁛 𞁜 𞁝 𞁞 𞁟 𞁠 𞁡 𞁢 𞁣 𞁤 𞁥 𞁦 𞁧 𞁨 𞁩 𞁪 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-8", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Cyrillic Extended-D block also contains many Cyrillic subscripts: 𞁑 𞁒 𞁓 𞁔 𞁕 𞁖 𞁗 𞁘 𞁙 𞁚 𞁛 𞁜 𞁝 𞁞 𞁟 𞁠 𞁡 𞁢 𞁣 𞁤 𞁥 𞁦 𞁧 𞁨 𞁩 𞁪 . Here they are arranged in alphabetical order for comparison (or for copy and paste convenience). Since these characters appear in different Unicode ranges, they may not appear to be the same size or position due to font substitution by the browser. Shaded cells mark petite capitals that are not very distinct from minuscules in Roman typeface, but they may be distinct in italic typeface, as is used in some phonetic notation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-9", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Shaded cells mark petite capitals that are not very distinct from minuscules in Roman typeface, but they may be distinct in italic typeface, as is used in some phonetic notation. Parentheses are shown in the basic superscript block above, and the exclamation mark ⟨ ꜝ ⟩ is shown in the IPA table below. In a supporting font, a question mark may be created with a superscript gelded question mark and a combining dot below: ⟨ ˀ̣ ⟩. * Superscript versions of petite capital A, D, E and P, of ƀ, and subscript versions of w, y and z are scheduled to be released with version 18 of the Unicode Standard.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-10", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "* Superscript versions of petite capital A, D, E and P, of ƀ, and subscript versions of w, y and z are scheduled to be released with version 18 of the Unicode Standard. Some of these superscript capitals are small caps in the source documents in the Unicode proposals. Superscript Ä, Ö, Ü (in parentheses) are composed of the base letter and a combining tréma . Except for the iota subscript , which has use in Greek text, the modifier Greek letters are intended as phonetic characters in Latin-script text. Shaded cells are indistinguishable from Latin letters, and so would not be expected to have distinctive use in Latin text or to be supported by Unicode.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-11", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Shaded cells are indistinguishable from Latin letters, and so would not be expected to have distinctive use in Latin text or to be supported by Unicode. ^ In some fonts, script-a ᵅ and ᶹ have the form of superscript Greek alpha and upsilon, in others they are not a close match. * Superscript versions of Greek psi and omega are scheduled for version 18 of the Unicode Standard. Cyrillic modifier characters are intended for use in Cyrillic text. are handled with diacritics, ⟨𞀵̈ 𞁌̈ 𞀸̆ 𞁁̆⟩ etc. Many of the Cyrillic characters were added to the Cyrillic Extended-D block, which was added to the free Gentium and Andika fonts with version 6.2 in February 2023.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-12", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Many of the Cyrillic characters were added to the Cyrillic Extended-D block, which was added to the free Gentium and Andika fonts with version 6.2 in February 2023. They are supported by the free Gentium and Andika fonts. Additional superscript characters for historical and para-IPA letters are scheduled to be released with version 18 of the Unicode Standard in 2026. The entire Latin Extended-F block is dedicated to superscript IPA. Characters for sounds with secondary articulation are set off in parentheses and placed below the letter for the primary articulation. Ejectives The spacing diacritic for ejective consonants, U+2BC, works with superscript letters despite not being superscript itself: ⟨ ᵖʼ ᵗʼ ᶜʼ ᵏˣʼ ⟩.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-13", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Ejectives The spacing diacritic for ejective consonants, U+2BC, works with superscript letters despite not being superscript itself: ⟨ ᵖʼ ᵗʼ ᶜʼ ᵏˣʼ ⟩. If a distinction needs to be made, the combining apostrophe U+315 may be used: ⟨ ᵖ̕ ᵗ̕ ᶜ̕ ᵏˣ̕ ⟩. IPA once had an idiosyncratic curl on some of the palatalized letters: these are the fricative letters ⟨ ʆ ʓ ⟩ and the homologous affricates. (The similar lateral fricative 𝽧 is not supported.) Old-style IPA click letters, voiceless implosives, and the retired letters ⟨ ƞ ⟩ and ⟨ ɼ ⟩ have also been accepted for version 18 of the Unicode Standard.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-14", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "(The similar lateral fricative 𝽧 is not supported.) Old-style IPA click letters, voiceless implosives, and the retired letters ⟨ ƞ ⟩ and ⟨ ɼ ⟩ have also been accepted for version 18 of the Unicode Standard. The Teuthonista letter ⟨ ꜧ ⟩ (U+A727) is also an old graphic variant of ⟨ ɮ ⟩. Its superscript is supported at ⟨ ꭜ ⟩ (U+AB5C). Para-IPA Among para-IPA letters, superscript variants of Sinological ⟨ ȡ ȴ ȵ ȶ ⟩, of the Bantuist labio-dental plosives ⟨ ȹ ⟩ and ⟨ ȸ ⟩, of the central semivowels ⟨ ɉ ⟩, ⟨ ɥ̶ ⟩, and ⟨ w̶ ⟩, of the extended old-style click letters ⟨ 𝼋 ⟩ and ⟨ ψ ⟩, and of the voiceless bilabial trill ⟨ ᴘ ⟩ have been accepted for version 18 of the Unicode Standard.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-15", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Para-IPA Among para-IPA letters, superscript variants of Sinological ⟨ ȡ ȴ ȵ ȶ ⟩, of the Bantuist labio-dental plosives ⟨ ȹ ⟩ and ⟨ ȸ ⟩, of the central semivowels ⟨ ɉ ⟩, ⟨ ɥ̶ ⟩, and ⟨ w̶ ⟩, of the extended old-style click letters ⟨ 𝼋 ⟩ and ⟨ ψ ⟩, and of the voiceless bilabial trill ⟨ ᴘ ⟩ have been accepted for version 18 of the Unicode Standard. Recently retired alternative letters such as ⟨ ɩ ɷ ⟩ are also supported; they are set off in parentheses and placed below the modern IPA letters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-16", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Recently retired alternative letters such as ⟨ ɩ ɷ ⟩ are also supported; they are set off in parentheses and placed below the modern IPA letters. Rhotic vowels The precomposed Unicode rhotic vowel letters ⟨ ɚ ɝ ⟩ are not directly supported. The retired and later briefly resurrected vowel letter ⟨ ʚ ⟩ (U+029A) is not supported as a superscript, only its reversed replacement ⟨ ɞ ⟩ is. Para-IPA Among para-IPA letters, Sinological superscript ⟨ ɿ ʅ ʮ ʯ ⟩ have been accepted for version 18 of the Unicode Standard, as have Sinological ⟨ ᴀ ᴇ ⟩ and the English dictionary and phonetics symbols ⟨ ᵿ ⟩ and ⟨ ω ⟩.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-17", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Para-IPA Among para-IPA letters, Sinological superscript ⟨ ɿ ʅ ʮ ʯ ⟩ have been accepted for version 18 of the Unicode Standard, as have Sinological ⟨ ᴀ ᴇ ⟩ and the English dictionary and phonetics symbols ⟨ ᵿ ⟩ and ⟨ ω ⟩. ᴺC (prenasalized consonant), ꟲN (prestopped nasal), Pꟳ (fricative release), D꟱ (sibilant release, added to Unicode in 2025), NᴾF (epenthetic plosive), CVNᵀ (tone-bearing syllable), Cᴸ (liquid or lateral release), Cᴿ (rhotic or resonant release), Vᴳ (off-glide/diphthong), Cⱽ (fleeting vowel). Superscript Ʞ for fleeting/epenthetic click is not included in the Unicode Standard. Other basic Latin superscript wildcards for tone and weak indeterminate sounds, as described in International Phonetic Alphabet § Capital letters , are mostly supported.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-18", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Other basic Latin superscript wildcards for tone and weak indeterminate sounds, as described in International Phonetic Alphabet § Capital letters , are mostly supported. The copyright © and registered trademark signs ® are also in this block; they are set as superscript in some fonts. The General Punctuation block contains the permille sign ‰ and the per-ten-thousand sign ‱ , and Basic Latin has the percent sign % . The Letterlike Symbols block contains a few symbols composed of subscript and superscript characters: ℀ ℁ ℅ ℆ № ℠ ™ ⅍ . The Enclosed Alphanumeric Supplement block contains three superscript abbreviations 🅪 🅫 🅬 : MC for marque de commerce ( trademark ), MD for marque déposée ( registered trademark ), both used in Canada; MR for marca registrada (registered trademark) in Spanish and Portuguese speaking countries.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-19", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Enclosed Alphanumeric Supplement block contains three superscript abbreviations 🅪 🅫 🅬 : MC for marque de commerce ( trademark ), MD for marque déposée ( registered trademark ), both used in Canada; MR for marca registrada (registered trademark) in Spanish and Portuguese speaking countries. The Unified Canadian Aboriginal Syllabics and its Extended blocks contain several letters composed with superscripted letters to indicate extended sound values: Main block ᐂ ᐫ ᐬ ᐭ ᐮ ᐰ ᑍ ᑧ ᑨ ᑩ ᑪ ᑬ ᒅ ᒆ ᒇ ᒈ ᒊ ᒤ ᓁ ᓔ ᓮ ᔌ ᔍ ᔎ ᔏ ᔧ ᕅ ᕔ ᕿ ᖀ ᖁ ᖂ ᖃ ᖄ ᖎ ᖏ ᖐ ᖑ ᖒ ᖓ ᖔ ᙯ ᙰ ᙱ ᙲ ᙳ ᙴ ᙵ ᙶ , Extended block ᢰ ᢱ ᢲ ᢳ ᢴ ᢵ ᢶ ᢷ ᢸ ᢹ ᢺ ᢻ ᢼ ᢽ ᢾ ᢿ ᣀ ᣁ ᣂ ᣃ ᣄ ᣅ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-20", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Unified Canadian Aboriginal Syllabics and its Extended blocks contain several letters composed with superscripted letters to indicate extended sound values: Main block ᐂ ᐫ ᐬ ᐭ ᐮ ᐰ ᑍ ᑧ ᑨ ᑩ ᑪ ᑬ ᒅ ᒆ ᒇ ᒈ ᒊ ᒤ ᓁ ᓔ ᓮ ᔌ ᔍ ᔎ ᔏ ᔧ ᕅ ᕔ ᕿ ᖀ ᖁ ᖂ ᖃ ᖄ ᖎ ᖏ ᖐ ᖑ ᖒ ᖓ ᖔ ᙯ ᙰ ᙱ ᙲ ᙳ ᙴ ᙵ ᙶ , Extended block ᢰ ᢱ ᢲ ᢳ ᢴ ᢵ ᢶ ᢷ ᢸ ᢹ ᢺ ᢻ ᢼ ᢽ ᢾ ᢿ ᣀ ᣁ ᣂ ᣃ ᣄ ᣅ . edit ] ^ For a general overview and technical information on glyph substitution (though not specifically for fractions), see GSUB — Glyph Substitution Table in the OpenType specification on the Microsoft Typography site .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-21", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "edit ] ^ For a general overview and technical information on glyph substitution (though not specifically for fractions), see GSUB — Glyph Substitution Table in the OpenType specification on the Microsoft Typography site . ^ Such as Andika , Arno Pro , Brill , Brioso Pro , Calibri , Candara , Carlito , Cantarell , FiraGO , EB Garamond , Gentium , Lato , Linux Libertine , Noto Sans , Noto Serif , Open Sans and Yrsa ^ Such as Chrome , Firefox and Falkon ^ Such as LibreOffice Writer ^ Such as Adobe InDesign and Scribus ^ ⟨ ◌̫ ⟩ and ⟨ ◌᫇ ⟩ are traditionally typeset as an omega.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-22", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "^ Such as Andika , Arno Pro , Brill , Brioso Pro , Calibri , Candara , Carlito , Cantarell , FiraGO , EB Garamond , Gentium , Lato , Linux Libertine , Noto Sans , Noto Serif , Open Sans and Yrsa ^ Such as Chrome , Firefox and Falkon ^ Such as LibreOffice Writer ^ Such as Adobe InDesign and Scribus ^ ⟨ ◌̫ ⟩ and ⟨ ◌᫇ ⟩ are traditionally typeset as an omega. ^ ⟨ ͺ ⟩ is set lower than a normal subscript. It is equivalent to underscript ⟨ ◌ͅ ⟩ on a space.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-23", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "^ ⟨ ͺ ⟩ is set lower than a normal subscript. It is equivalent to underscript ⟨ ◌ͅ ⟩ on a space. ^ Superscript ⟨ ç ⟩ is composed of superscript c and a combining cedilla , which should display properly in a good font. Superscript c was specifically requested for this purpose in Unicode proposal L2/03-180. ^ U+02E4 ˤ MODIFIER LETTER SMALL REVERSED GLOTTAL STOP is the superscript variant of U+0295 ʕ LATIN LETTER PHARYNGEAL VOICED FRICATIVE and is defined for IPA use. The similar character U+02C1 ˁ MODIFIER LETTER REVERSED GLOTTAL STOP is a reversed U+02C0 ˀ MODIFIER LETTER GLOTTAL STOP , perhaps a gelded reversed question mark.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-24", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The similar character U+02C1 ˁ MODIFIER LETTER REVERSED GLOTTAL STOP is a reversed U+02C0 ˀ MODIFIER LETTER GLOTTAL STOP , perhaps a gelded reversed question mark. Fonts are inconsistent in whether they look different and what the difference is. ^ In Microsoft fonts, superscript ⟨ ɫ ⟩ was erroneously designed as a superscript ⟨ ꬸ ⟩. ^ U+A71D ⟨ ꜝ ⟩ and A71E ⟨ ꜞ ⟩ were adopted as the Africanist equivalents of the IPA characters ⟨ ꜜ ⟩ downstep and ⟨ ꜛ ⟩ upstep . Their correspondence to the IPA click letter ⟨ ǃ ⟩ and the extIPA percussive consonant ⟨ ¡ ⟩ is thus accidental.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-25", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Their correspondence to the IPA click letter ⟨ ǃ ⟩ and the extIPA percussive consonant ⟨ ¡ ⟩ is thus accidental. The other percussive letters, ⟨ ʬ ⟩ and ⟨ ʭ ⟩, do not have superscript support in Unicode, though they can be hacked by stacking diacritics as here. ^ U+1D4C ᵌ MODIFIER LETTER SMALL TURNED OPEN E and U+1D9F ᶟ MODIFIER LETTER SMALL REVERSED OPEN E are mistakenly both defined as modifier U+025C ɜ LATIN SMALL LETTER REVERSED OPEN E in their Unicode properties, though the former is named as the modifier variant of U+1D08 ᴈ LATIN SMALL LETTER TURNED OPEN E .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-26", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "^ U+1D4C ᵌ MODIFIER LETTER SMALL TURNED OPEN E and U+1D9F ᶟ MODIFIER LETTER SMALL REVERSED OPEN E are mistakenly both defined as modifier U+025C ɜ LATIN SMALL LETTER REVERSED OPEN E in their Unicode properties, though the former is named as the modifier variant of U+1D08 ᴈ LATIN SMALL LETTER TURNED OPEN E . ^ This Unicode character is actually the Vietnamese diacritic dấu hỏi , but the same shape is used for laryngealization in phonetic notation, e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-0", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "To imitate a bold typeface on a typewriter , a character can be typed over itself (called double-striking ); symbols thus produced are called double-struck , and this name is sometimes adopted for blackboard bold symbols, for instance in Unicode grapheme names. In typography , a typeface with characters that are not solid is called inline , handtooled , or open face . To produce a bold effect on a typewriter, a character can be double-struck with or without a small offset. While this method makes a character bolder, and can effectively emphasize words or passages, in isolation a double-struck character is not always clearly different from its single-struck counterpart.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-1", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "While this method makes a character bolder, and can effectively emphasize words or passages, in isolation a double-struck character is not always clearly different from its single-struck counterpart. Blackboard bold originated from the attempt to write bold symbols on typewriters and blackboards that were legible but distinct, perhaps starting in the late 1950s in France, and then taking hold at the Princeton University mathematics department in the early 1960s. Mathematical authors began typing faux-bold letters by double-striking them with a significant offset or over-striking them with the letter I , creating new symbols such as IR , IN , CC , or ZZ ; at the blackboard, lecturers began writing bold symbols with certain doubled strokes.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-2", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "Mathematical authors began typing faux-bold letters by double-striking them with a significant offset or over-striking them with the letter I , creating new symbols such as IR , IN , CC , or ZZ ; at the blackboard, lecturers began writing bold symbols with certain doubled strokes. The notation caught on: blackboard bold spread from classroom to classroom and is now used around the world. A page from Loomis & Sternberg (1968), showing an early example of \"blackboard bold\" style R and C in a printed book The style made its way into print starting in the mid-1960s.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-3", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "In 1979, Wiley recommended its authors avoid \"double-backed shadow or outline letters, sometimes called blackboard bold\", because they could not always be printed; in 1982, Wiley refused to include blackboard bold characters in mathematical books because the type was difficult and expensive to obtain. Donald Knuth preferred boldface to blackboard bold and so did not include blackboard bold in the Computer Modern typeface that he created for the TeX mathematical typesetting system he first released in 1978. Not all mathematical authors were satisfied with such workarounds. The American Mathematical Society created a simple chalk-style blackboard bold typeface in 1985 to go with the AMS-TeX package created by Michael Spivak , accessed using the \\Bbb command (for \"blackboard bold\"); in 1990, the AMS released an update with a new inline-style blackboard bold font intended to better match the Times New Roman font.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-4", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "The American Mathematical Society created a simple chalk-style blackboard bold typeface in 1985 to go with the AMS-TeX package created by Michael Spivak , accessed using the \\Bbb command (for \"blackboard bold\"); in 1990, the AMS released an update with a new inline-style blackboard bold font intended to better match the Times New Roman font. Since then, a variety of other blackboard bold typefaces have been created, some following the style of traditional inline typefaces and others closer in form to letters drawn with chalk. Unicode included the most common blackboard bold letters among the \" Letterlike Symbols \" in version 1.0 (1991), inherited from the Xerox Character Code Standard .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-5", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "Unicode included the most common blackboard bold letters among the \" Letterlike Symbols \" in version 1.0 (1991), inherited from the Xerox Character Code Standard . Later versions of Unicode extended this set to all uppercase and lowercase Latin letters and a variety of other symbols, among the \" Mathematical Alphanumeric Symbols \". In professionally typeset books, publishers and authors have gradually adopted blackboard bold, and its use is now commonplace, but some still use ordinary bold symbols. Some authors use blackboard bold letters on the blackboard or in manuscripts, but prefer an ordinary bold typeface in print; for example, Jean-Pierre Serre has used blackboard bold in lectures, but has consistently used ordinary bold for the same symbols in his published works.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-6", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "Some authors use blackboard bold letters on the blackboard or in manuscripts, but prefer an ordinary bold typeface in print; for example, Jean-Pierre Serre has used blackboard bold in lectures, but has consistently used ordinary bold for the same symbols in his published works. The Chicago Manual of Style ' s recommendation has evolved over time: In 1993, for the 14th edition, it advised that \"blackboard bold should be confined to the classroom\" (13.14); In 2003, for the 15th edition, it stated that \"open-faced (blackboard) symbols are reserved for familiar systems of numbers\" (14.12). In Unicode , a few of the more common blackboard bold characters (ℂ, ℍ, ℕ, ℙ, ℚ, ℝ, and ℤ) are encoded in the Basic Multilingual Plane (BMP) in the Letterlike Symbols (2100–214F) area, named DOUBLE-STRUCK CAPITAL C etc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-7", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "In Unicode , a few of the more common blackboard bold characters (ℂ, ℍ, ℕ, ℙ, ℚ, ℝ, and ℤ) are encoded in the Basic Multilingual Plane (BMP) in the Letterlike Symbols (2100–214F) area, named DOUBLE-STRUCK CAPITAL C etc. The rest, however, are encoded outside the BMP, in Mathematical Alphanumeric Symbols (1D400–1D7FF), specifically from 1D538–1D550 (uppercase, excluding those encoded in the BMP), 1D552–1D56B (lowercase), and 1D7D8–1D7E1 (digits). Blackboard bold Arabic letters are encoded in Arabic Mathematical Alphabetic Symbols (1EE00–1EEFF), specifically 1EEA1–1EEBB. The third column shows the Unicode symbol itself (which will only display correctly on browsers that support Unicode and have access to a suitable typeface).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-8", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "The third column shows the Unicode symbol itself (which will only display correctly on browsers that support Unicode and have access to a suitable typeface). The fourth column describes some typical usage in mathematical texts. In addition, a blackboard-bold μ n (not found in Unicode or amsmath LaTeX) is sometimes used by number theorists and algebraic geometers to designate the group scheme of n -th roots of unity . Inline : A letter in which the inner portions of the main strokes have been carved away, leaving the edges more or less intact. The sign for bold type is a wavy line beneath the words or symbols in question; for security the word 'bold' may be added in the margin.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-9", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "The sign for bold type is a wavy line beneath the words or symbols in question; for security the word 'bold' may be added in the margin. ^ An example of double-struck type produced by an impact printer of the early 1980s can be found in: Waite, Mitchell; Arca, Julie (1982). This usenet post (as mirrored by The Math Forum ) seems to have been one of the for Webb 2018 ; see p. The later revised edition is available from Sternberg's website . For example, some users may have fairly strong preferences regarding such details as to whether the stem or the diagonal of the letter 'N' is double-struck.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-0", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "50 CE to present Descendants ℟ ℞ ® Ɍ ᚱ 𐍂 Ꭱ Sisters Р ר ر ܪ ࠓ 𐎗 𐡓 ረ Ռ ռ Ր ր ર र Other Associated graphs r(x) rh Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . R ( minuscule : r ) is the eighteenth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is ar (pronounced / ˈ ɑːr / ), plural ars . The letter ⟨r⟩ is the eighth most common letter in English and the fourth-most common consonant, after ⟨t⟩ , ⟨n⟩ , and ⟨s⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-1", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The letter ⟨r⟩ is the eighth most common letter in English and the fourth-most common consonant, after ⟨t⟩ , ⟨n⟩ , and ⟨s⟩ . This name is preserved in French and many other languages. In Middle English , the name of the letter changed from /ɛr/ to /ar/ , following a pattern exhibited in many other words such as farm (compare French ferme ) and star (compare German Stern ). In Hiberno-English , the letter is called /ɒr/ or /ɔːr/ , somewhat similar to oar , ore , orr . The letter ⟨R⟩ is sometimes referred to as the littera canīna ' canine letter ' , often rendered in English as the dog's letter .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-2", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The letter ⟨R⟩ is sometimes referred to as the littera canīna ' canine letter ' , often rendered in English as the dog's letter . This Latin term referred to the Latin ⟨R⟩ that was trilled to sound like a growling dog, a spoken style referred to as vōx canīna ' dog voice ' (e.g. The letter ⟨R⟩ is believed to derive ultimately from an image of a head, used in Semitic alphabets for the sound /r/ because the word for 'head' was rêš or similar in most Semitic languages . The descending diagonal stroke develops as a graphic variant in some Western Greek alphabets (writing rho as ⟨ ⟩), but it was not adopted in most Old Italic alphabets ; most Old Italic alphabets show variants of their rho between a ⟨P⟩ and a ⟨D⟩ shape, but without the Western Greek descending stroke.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-3", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The descending diagonal stroke develops as a graphic variant in some Western Greek alphabets (writing rho as ⟨ ⟩), but it was not adopted in most Old Italic alphabets ; most Old Italic alphabets show variants of their rho between a ⟨P⟩ and a ⟨D⟩ shape, but without the Western Greek descending stroke. Indeed, the oldest known forms of the Latin alphabet itself of the 7th to 6th centuries BC, in the Duenos and the Forum inscription , still write ⟨r⟩ using the ⟨P⟩ shape of the letter. The descending stroke of the Latin letter ⟨R⟩ has fully developed by the 3rd century BC, as seen in the Tomb of the Scipios sarcophagus inscriptions of that era.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-4", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The descending stroke of the Latin letter ⟨R⟩ has fully developed by the 3rd century BC, as seen in the Tomb of the Scipios sarcophagus inscriptions of that era. 50 AD , the letter ⟨P⟩ would be written with its loop fully closed, assuming the shape formerly taken by ⟨R⟩ . Along with Latin minuscule writing in general, it developed ultimately from Roman cursive via the uncial script of Late Antiquity into the Carolingian minuscule of the 9th century. In handwriting, it was common not to close the bottom of the loop but continue into the leg, saving an extra pen stroke.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-5", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "In handwriting, it was common not to close the bottom of the loop but continue into the leg, saving an extra pen stroke. The loop-leg stroke shortened into the simple arc used in the Carolingian minuscule and until today. A calligraphic minuscule ⟨r⟩ , known as r rotunda ⟨ꝛ⟩ , was used in the sequence ⟨or⟩ , bending the shape of the ⟨r⟩ to accommodate the bulge of the ⟨o⟩ as in ⟨oꝛ⟩ , as opposed to ⟨or⟩ . Later, the same variant was also used where ⟨r⟩ followed other lower case letters with a rounded loop towards the right, such as with ⟨b⟩ , ⟨h⟩ , ⟨p⟩ , as well as to write the geminate ⟨rr⟩ as ⟨ꝛꝛ⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-6", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "Later, the same variant was also used where ⟨r⟩ followed other lower case letters with a rounded loop towards the right, such as with ⟨b⟩ , ⟨h⟩ , ⟨p⟩ , as well as to write the geminate ⟨rr⟩ as ⟨ꝛꝛ⟩ . Use of r rotunda was mostly tied to blackletter typefaces, and the glyph fell out of use along with blackletter fonts in English language contexts mostly by the 18th century. Insular script used a minuscule which retained two downward strokes, but which did not close the loop, known as the Insular r ⟨ꞃ⟩ ; this variant survives in the Gaelic type popular in Ireland until the mid-20th century, but has become largely limited to a decorative function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-7", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "Insular script used a minuscule which retained two downward strokes, but which did not close the loop, known as the Insular r ⟨ꞃ⟩ ; this variant survives in the Gaelic type popular in Ireland until the mid-20th century, but has become largely limited to a decorative function. In non-rhotic accents, it is not pronounced in certain positions, but can affect the pronunciation of the vowel that precedes it. R is the ninth most frequently used letter in the English language. Other languages may use the letter ⟨r⟩ in their alphabets (or Latin transliteration schemes) to represent rhotic consonants different from the alveolar trill.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-8", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "Other languages may use the letter ⟨r⟩ in their alphabets (or Latin transliteration schemes) to represent rhotic consonants different from the alveolar trill. In Haitian Creole , it represents a sound so weak that it is often written interchangeably with ⟨w⟩ , e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-0", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "For consonants that are rhotic, see Rhotic consonant . An r-colored or rhotic vowel (also called a retroflex vowel , vocalic r , or a rhotacized vowel ) is a vowel that is modified in a way that results in a lowering in frequency of the third formant . R-colored vowels can be articulated in various ways: the tip or blade of the tongue may be turned up during at least part of the articulation of the vowel (a retroflex articulation) or the back of the tongue may be bunched. In addition, the vocal tract may often be constricted in the region of the epiglottis .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-1", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "R-colored vowels can be articulated in various ways: the tip or blade of the tongue may be turned up during at least part of the articulation of the vowel (a retroflex articulation) or the back of the tongue may be bunched. In addition, the vocal tract may often be constricted in the region of the epiglottis . R-colored vowels are exceedingly rare, occurring in less than one percent of all languages. In North American English, they are found in words such as doll ar , butt er , th ir d , col or , and n ur se .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-2", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "In North American English, they are found in words such as doll ar , butt er , th ir d , col or , and n ur se . They also occur in Canadian French , some varieties of Portuguese , some Jutlandic dialects of Danish , and in a few indigenous languages of the Americas and of Asia , including Serrano and Yurok in the United States, Luobohe Miao in China, Katë in Afghanistan, and Badaga in India. For example, the IPA symbol for schwa is ⟨ ə ⟩, while the IPA symbol for an r-colored schwa is ⟨ ɚ ⟩.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-3", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "For example, the IPA symbol for schwa is ⟨ ə ⟩, while the IPA symbol for an r-colored schwa is ⟨ ɚ ⟩. Similarly, the IPA symbol for the open-mid central unrounded vowel is ⟨ ɜ ⟩, while an r-colored open-mid central unrounded vowel is ⟨ ɝ ⟩. This diacritic is the hook of ⟨ ɚ ⟩ or ⟨ ɝ ⟩, symbols constructed by John Samuel Kenyon along with ⟨ ᶔ ⟩ by adding the retroflex hook (right hook) to ⟨ ə ⟩ and ⟨ ɜ ⟩. In 1976 the retroflex hook was dropped due to insufficient usage.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-4", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "This diacritic is the hook of ⟨ ɚ ⟩ or ⟨ ɝ ⟩, symbols constructed by John Samuel Kenyon along with ⟨ ᶔ ⟩ by adding the retroflex hook (right hook) to ⟨ ə ⟩ and ⟨ ɜ ⟩. In 1976 the retroflex hook was dropped due to insufficient usage. In 1989, at the Kiel Convention , the hook of ⟨ ɚ ⟩ and ⟨ ɝ ⟩ was adopted as a diacritic placed on the right side of the vowel symbol for r-colored vowels, e.g. Following the convention of alternating ⟨ ɜ ⟩ and ⟨ ə ⟩ for non-rhotic accents, in some English adaptations of IPA, ⟨ ɝ ⟩ and ⟨ ɚ ⟩ signify stressed and unstressed, respectively, rather than a difference in phonetic quality.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-5", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "Following the convention of alternating ⟨ ɜ ⟩ and ⟨ ə ⟩ for non-rhotic accents, in some English adaptations of IPA, ⟨ ɝ ⟩ and ⟨ ɚ ⟩ signify stressed and unstressed, respectively, rather than a difference in phonetic quality. The use of the superscript turned r ( əʴ ) is still commonly seen. R-colored vowels are found in most rhotic forms of English, including General American and Irish English . However, there have always been other singing styles in which r-colored vowels are given their full emphasis, including traditional Irish singing styles and those of many performers of country music .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-6", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "However, there have always been other singing styles in which r-colored vowels are given their full emphasis, including traditional Irish singing styles and those of many performers of country music . Certain post-grunge singers made heavy use of this technique to such an extent that many people derisively exaggerated this tendency when referencing their music. In certain particular cases, a vowel + /r/ is pronounced instead as two syllables: a non-rhotic vowel followed by a syllabic /r/. In many words, the -r suffix ( simplified Chinese : 儿 ; traditional Chinese : 兒 ) is added to indicate some meaning changes.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-7", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "In many words, the -r suffix ( simplified Chinese : 儿 ; traditional Chinese : 兒 ) is added to indicate some meaning changes. If the word ends in a velar nasal ( ng ), the final consonant is lost and the vowel becomes nasalized . Major cities that have this form of rhotacized ending include Beijing , Tianjin , Tangshan , Shenyang , Changchun , Jilin , Harbin , and Qiqihar . This erhua has since spread to other provincial capitals not home to Standard Mandarin , such as Shijiazhuang , Jinan , Xi'an , Chongqing , and Chengdu .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-8", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "This erhua has since spread to other provincial capitals not home to Standard Mandarin , such as Shijiazhuang , Jinan , Xi'an , Chongqing , and Chengdu . Chifeng , Hailar ), and in the Northeast , vocalic r occurs as a diminutive marker of nouns ( pinyin : ér ) and the perfective aspect particle ( 了 ; le ). For example, the name of the famous restaurant Go Believe ( 狗不理 ) in Tianjin is pronounced as 'Gourbli' ( Gǒu(r)b ù lǐ → Gǒurblǐ ). The name of the street Dazhalan ( 大栅栏 ) in Beijing is pronounced as 'Da-shi-lar' ( Dàshà n là n (r) → Dàshílàr ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-9", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "The name of the street Dazhalan ( 大栅栏 ) in Beijing is pronounced as 'Da-shi-lar' ( Dàshà n là n (r) → Dàshílàr ). The non-high vowels /a/ , /e/ and /o/ could become /ɚ/ in a word that has /ɚ/ . Katë , a Nuristani language , alongside neighboring languages such as Indo-Aryan Kalasha , has a rhotic vowel denoted as /ɘ˞/ . ^ (in Portuguese) Acoustic-phonetic characteristics of the Brazilian Portuguese's retroflex /r/: data from respondents in Pato Branco, Paraná Archived 2016-03-03 at the Wayback Machine . Pages 19–21 ^ (in Portuguese) Syllable coda /r/ in the \"capital\" of the Paulista hinterland: sociolinguistic analysis Archived 2013-09-26 at the Wayback Machine .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-10", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "Pages 19–21 ^ (in Portuguese) Syllable coda /r/ in the \"capital\" of the Paulista hinterland: sociolinguistic analysis Archived 2013-09-26 at the Wayback Machine .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-0", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "700 BCE to present Descendants Th (digraph) ™ ₮ ₸ Ŧ Ť Ţ Ʇ Sisters 𐍄 Т Ҭ Ћ Ҵ ת ت ܬ ة ࠕ 𐎚 𐎙 ተ ፐ Տ տ Ց ց त ट ત ટ ⶊ Other Associated graphs t(x) , th , tzsch Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . Without proper rendering support , you may see question marks, boxes, or other symbols instead of the intended characters. T ( minuscule : t ) is the twentieth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-1", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "T ( minuscule : t ) is the twentieth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is tee (pronounced / ˈ t iː / ), plural tees . It is derived from the Semitic Taw 𐤕 of the Phoenician and Paleo-Hebrew script ( Aramaic and Hebrew Taw ת/𐡕/ , Syriac Taw ܬ, and Arabic ت Tāʼ ) via the Greek letter τ ( tau ). In English, it is most commonly used to represent the voiceless alveolar plosive , a sound it also denotes in the International Phonetic Alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-2", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "In English, it is most commonly used to represent the voiceless alveolar plosive , a sound it also denotes in the International Phonetic Alphabet . It is the most commonly used consonant and the second-most commonly used letter in English-language texts. History Taw was the last letter of the Western Semitic and Hebrew alphabets . Use in writing systems English In English, ⟨t⟩ usually denotes the voiceless alveolar plosive ( International Phonetic Alphabet : / t / ), as in tart , tee , or ties , often with aspiration at the beginnings of words or before stressed vowels.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-3", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "Use in writing systems English In English, ⟨t⟩ usually denotes the voiceless alveolar plosive ( International Phonetic Alphabet : / t / ), as in tart , tee , or ties , often with aspiration at the beginnings of words or before stressed vowels. The letter ⟨t⟩ corresponds to the affricate /t͡ʃ/ in some words as a result of yod-coalescence (for example, in words ending in -\"ture\", such as future ). A common digraph is ⟨th⟩ , which usually represents a dental fricative , but occasionally represents /t/ (as in Thomas and thyme ). The digraph ⟨ti⟩ often corresponds to the sound /ʃ/ (a voiceless palato-alveolar sibilant ) word-medially when followed by a vowel, as in nation , ratio , negotiation , and Croatia .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-4", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "The digraph ⟨ti⟩ often corresponds to the sound /ʃ/ (a voiceless palato-alveolar sibilant ) word-medially when followed by a vowel, as in nation , ratio , negotiation , and Croatia . In a few words of modern French origin, the letter T is silent at the end of a word; these include croquet and debut . Other languages In the orthographies of other languages, ⟨t⟩ is often used for /t/ , the voiceless dental plosive /t̪/ , or similar sounds. Related characters Descendants and related characters in the Latin alphabet A curly T pictured in the coat of arms of the former Teisko municipality, which was consolidated to Tampere .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-5", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "Related characters Descendants and related characters in the Latin alphabet A curly T pictured in the coat of arms of the former Teisko municipality, which was consolidated to Tampere . 𝼪 : Small t with mid-height left hook was used by the British and Foreign Bible Society in the early 20th century for romanization of the Malayalam language. Other The letter T in German Sign Language Unicode treats representation of letters of the Latin alphabet written in insular script as a typeface choice that needs no separate coding. U+A786 Ꞇ LATIN CAPITAL LETTER INSULAR T and U+A787 ꞇ LATIN SMALL LETTER INSULAR T are provided for use by phonetics specialists.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-0", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "A ring torus with a selection of circles on its surface As the distance from the axis of revolution decreases, the ring torus becomes a horn torus, then a spindle torus, and finally degenerates into a double-covered sphere . A ring torus with aspect ratio 3, the ratio between the diameters of the larger (blue) circle and the smaller (red) circle. The radius denoted by capital, R, is the distance from the geometric center of the outer ring lying outside the volume, to the center of the inner ring. The radius denoted by lower case, r, is the distance from the inner ring's center to the surface of the torus.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-1", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The radius denoted by lower case, r, is the distance from the inner ring's center to the surface of the torus. : tori or toruses ) is a surface of revolution generated by revolving a circle in three-dimensional space one full revolution about an axis that is coplanar with the circle. A ring torus is sometimes colloquially referred to as a doughnut . If the axis of revolution does not touch the circle, the surface has a ring shape and is called a torus of revolution , also known as a ring torus . If the axis of revolution is tangent to the circle, the surface is a horn torus .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-2", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "If the axis of revolution does not touch the circle, the surface has a ring shape and is called a torus of revolution , also known as a ring torus . If the axis of revolution is tangent to the circle, the surface is a horn torus . If the axis of revolution passes twice through the circle, the surface is a spindle torus (or self-crossing torus or self-intersecting torus ). If the axis of revolution passes through the center of the circle, the surface is a degenerate torus, a double-covered sphere . If the revolved curve is not a circle, the surface is called a toroid , as in a square toroid.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-3", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "If the revolved curve is not a circle, the surface is called a toroid , as in a square toroid. A torus is different than a solid torus , which is formed by rotating a disk , rather than a circle, around an axis. A solid torus is a torus plus the volume inside the torus. In topology , a ring torus is homeomorphic to the Cartesian product of two circles : S × S , which is sometimes used as the definition. The ring torus is one way to embed this space into Euclidean space , but another way to do this is the Cartesian product of the embedding of S in the plane with itself.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-4", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The ring torus is one way to embed this space into Euclidean space , but another way to do this is the Cartesian product of the embedding of S in the plane with itself. In the field of topology , a torus is any topological space that is homeomorphic to a torus. The surface of a coffee cup and a doughnut are both topological tori with genus one. An example of a torus can be constructed by taking a rectangular strip of flexible material such as rubber, and joining the top edge to the bottom edge, and the left edge to the right edge, without any half-twists (compare Klein bottle ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-5", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "An example of a torus can be constructed by taking a rectangular strip of flexible material such as rubber, and joining the top edge to the bottom edge, and the left edge to the right edge, without any half-twists (compare Klein bottle ). The ratio R / r is called the aspect ratio of the torus. R r describes the self-intersecting spindle torus; its inner shell is a lemon and its outer shell is an apple . The losses in surface area and volume on the inner side of the tube exactly cancel out the gains on the outer side.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-6", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The losses in surface area and volume on the inner side of the tube exactly cancel out the gains on the outer side. As a torus has, effectively, two center points, the centerpoints of the angles are moved; φ measures the same angle as it does in the spherical system, but is known as the \"toroidal\" direction. These terms were first used in a discussion of the Earth's magnetic field, where \"poloidal\" was used to denote \"the direction toward the poles\". In modern use, toroidal and poloidal are more commonly used to discuss magnetic confinement fusion devices.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-7", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "These terms were first used in a discussion of the Earth's magnetic field, where \"poloidal\" was used to denote \"the direction toward the poles\". In modern use, toroidal and poloidal are more commonly used to discuss magnetic confinement fusion devices. The usual differential operators of vector calculus can be calculated using the same parametrization to obtain their ring toroidal forms. For example, the Laplace operator for the ring torus, with the same variable ranges as for the integrals above, is given by the expression below. One can check that the square root of the determinant of the metric tensor is equal to the determinant of the Jacobi matrix, i.e.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-8", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "One can check that the square root of the determinant of the metric tensor is equal to the determinant of the Jacobi matrix, i.e. This can be viewed as lying in C and is a subset of the 3-sphere S of radius √2 . This topological torus is also often called the Clifford torus . In fact, S is filled out by a family of nested tori in this manner (with two degenerate circles), a fact that is important in the study of S as a fiber bundle over S (the Hopf bundle ). The surface described above, given the relative topology from R , is homeomorphic to a topological torus as long as it does not intersect its own axis.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-9", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The surface described above, given the relative topology from R , is homeomorphic to a topological torus as long as it does not intersect its own axis. A particular homeomorphism is given by stereographically projecting the topological torus into R from the north pole of S . Turning a punctured torus inside-out The fundamental group of the torus is just the direct product of the fundamental group of the circle with itself: π 1 ( T 2 ) = π 1 ( S 1 ) × π 1 ( S 1 ) ≅ Z × Z .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-10", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Turning a punctured torus inside-out The fundamental group of the torus is just the direct product of the fundamental group of the circle with itself: π 1 ( T 2 ) = π 1 ( S 1 ) × π 1 ( S 1 ) ≅ Z × Z . An equivalent statement may be imagined as two shoelaces passing through each other, then unwinding, then rewinding. The cohomology groups with integer coefficients are isomorphic to the homology ones-- which can be seen either by direct computation, the universal coefficient theorem or even Poincaré duality .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-11", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The cohomology groups with integer coefficients are isomorphic to the homology ones-- which can be seen either by direct computation, the universal coefficient theorem or even Poincaré duality . If a torus is punctured and turned inside out then another torus results, with lines of latitude and longitude interchanged. This is equivalent to building a torus from a cylinder, by joining the circular ends together, in two ways: around the outside like joining two ends of a garden hose, or through the inside like rolling a sock (with the toe cut off). Additionally, if the cylinder was made by gluing two opposite sides of a rectangle together, choosing the other two sides instead will cause the same reversal of orientation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-12", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Additionally, if the cylinder was made by gluing two opposite sides of a rectangle together, choosing the other two sides instead will cause the same reversal of orientation. Every conformal structure on the 2-torus can be represented as such a two-sheeted cover of the 2-sphere. The points on the torus corresponding to the ramification points are the Weierstrass points . In fact, the conformal type of the torus is determined by the cross-ratio of the four points. (This is the more typical meaning of the term \" n -torus\", the other referring to n holes or of genus n .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-13", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(This is the more typical meaning of the term \" n -torus\", the other referring to n holes or of genus n . ) Just as the ordinary torus is topologically the product space of two circles, the n -dimensional torus is topologically equivalent to the product of n circles. The torus discussed above is the standard 2-torus, T . And similar to the 2-torus, the n -torus, T can be described as a quotient of R under integral shifts in any coordinate. That is, the n -torus is R modulo the action of the integer lattice Z (with the action being taken as vector addition).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-14", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "That is, the n -torus is R modulo the action of the integer lattice Z (with the action being taken as vector addition). Equivalently, the n -torus is obtained from the n -dimensional hypercube by gluing the opposite faces together. An n -torus in this sense is an example of an n- dimensional compact manifold . It is also an example of a compact abelian Lie group . This follows from the fact that the unit circle is a compact abelian Lie group (when identified with the unit complex numbers with multiplication). Group multiplication on the torus is then defined by coordinate-wise multiplication.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-15", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "This follows from the fact that the unit circle is a compact abelian Lie group (when identified with the unit complex numbers with multiplication). Group multiplication on the torus is then defined by coordinate-wise multiplication. This is due in part to the fact that in any compact Lie group G one can always find a maximal torus ; that is, a closed subgroup which is a torus of the largest possible dimension. Toroidal groups are examples of protori , which (like tori) are compact connected abelian groups, which are not required to be manifolds .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-16", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Toroidal groups are examples of protori , which (like tori) are compact connected abelian groups, which are not required to be manifolds . Automorphisms of T are easily constructed from automorphisms of the lattice Z , which are classified by invertible integral matrices of size n with an integral inverse; these are just the integral matrices with determinant ±1 . The fundamental group of an n -torus is a free abelian group of rank n . The k th homology group of an n -torus is a free abelian group of rank n choose k .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-17", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The k th homology group of an n -torus is a free abelian group of rank n choose k . It follows that the Euler characteristic of the n -torus is 0 for all n . The Tonnetz is an example of a torus in music theory. The Tonnetz is only truly a torus if enharmonic equivalence is assumed, so that the (F♯-A♯) segment of the right edge of the repeated parallelogram is identified with the (G♭-B♭) segment of the left edge. As the n -torus is the n -fold product of the circle, the n -torus is the configuration space of n ordered, not necessarily distinct points on the circle.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-18", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "As the n -torus is the n -fold product of the circle, the n -torus is the configuration space of n ordered, not necessarily distinct points on the circle. These orbifolds have found significant applications to music theory in the work of Dmitri Tymoczko and collaborators (Felipe Posada, Michael Kolinas, et al.), being used to model musical triads . Seen in stereographic projection , a 4D flat torus can be projected into 3-dimensions and rotated on a fixed axis. It is seen here stereographically projected into 3-space as a torus. A flat torus is a torus with the metric inherited from its representation as the quotient , R / L , where L is a discrete subgroup of R isomorphic to Z .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-19", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "A flat torus is a torus with the metric inherited from its representation as the quotient , R / L , where L is a discrete subgroup of R isomorphic to Z . Perhaps the simplest example of this is when L = Z : R / Z , which can also be described as the Cartesian plane under the identifications ( x , y ) ~ ( x + 1, y ) ~ ( x , y + 1) . This particular flat torus (and any uniformly scaled version of it) is known as the square flat torus.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-20", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "This particular flat torus (and any uniformly scaled version of it) is known as the square flat torus. This metric of the square flat torus can also be realised by specific embeddings of the familiar 2-torus into Euclidean 4-space or higher dimensions. It is flat in the same sense that the surface of a cylinder is flat. In 3 dimensions, one can bend a flat sheet of paper into a cylinder without stretching the paper, but this cylinder cannot be bent into a torus without stretching the paper (unless some regularity and differentiability conditions are given up, see below).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-21", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "In 3 dimensions, one can bend a flat sheet of paper into a cylinder without stretching the paper, but this cylinder cannot be bent into a torus without stretching the paper (unless some regularity and differentiability conditions are given up, see below). It is diffeomorphic to a regular torus but not isometric . It can not be analytically embedded ( smooth of class C , 2 ≤ k ≤ ∞ ) into Euclidean 3-space. In particular, for certain very specific choices of a square flat torus in the 3-sphere S , where η = π/4 above, the torus will partition the 3-sphere into two congruent solid tori subsets with the aforesaid flat torus surface as their common boundary .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-22", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "In particular, for certain very specific choices of a square flat torus in the 3-sphere S , where η = π/4 above, the torus will partition the 3-sphere into two congruent solid tori subsets with the aforesaid flat torus surface as their common boundary . It is known that there exists no C (twice continuously differentiable) embedding of a flat torus into 3-space. (The idea of the proof is to take a large sphere containing such a flat torus in its interior, and shrink the radius of the sphere until it just touches the torus for the first time.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-23", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(The idea of the proof is to take a large sphere containing such a flat torus in its interior, and shrink the radius of the sphere until it just touches the torus for the first time. But that would imply that part of the torus, since it has zero curvature everywhere, must lie strictly outside the sphere, which is a contradiction.) On the other hand, according to the Nash-Kuiper theorem , which was proven in the 1950s, an isometric C embedding exists. This is solely an existence proof and does not provide explicit equations for such an embedding.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-24", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "But that would imply that part of the torus, since it has zero curvature everywhere, must lie strictly outside the sphere, which is a contradiction.) On the other hand, according to the Nash-Kuiper theorem , which was proven in the 1950s, an isometric C embedding exists. This is solely an existence proof and does not provide explicit equations for such an embedding. It is a flat torus in the sense that, as a metric space, it is isometric to a flat square torus. It is similar in structure to a fractal as it is constructed by repeatedly corrugating an ordinary torus at smaller scales.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-25", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "It is similar in structure to a fractal as it is constructed by repeatedly corrugating an ordinary torus at smaller scales. The key to obtaining the smoothness of this corrugated torus is to have the amplitudes of successive corrugations decreasing faster than their \"wavelengths\". (These infinitely recursive corrugations are used only for embedding into three dimensions; they are not an intrinsic feature of the flat torus.) This is the first time that any such embedding was defined by explicit equations or depicted by computer graphics. The Uniformization theorem guarantees that every Riemann surface is conformally equivalent to one that has constant Gaussian curvature .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-26", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The Uniformization theorem guarantees that every Riemann surface is conformally equivalent to one that has constant Gaussian curvature . Then one defines the \" moduli space \" of the torus to contain one point for each conformal equivalence class, with the appropriate topology. It turns out that this moduli space M may be identified with a punctured sphere that is smooth except for two points that have less angle than 2π (radians) around them: One has total angle π and the other has total angle 2π/3. M may be turned into a compact space M* – topologically equivalent to a sphere – by adding one additional point that represents the limiting case as a rectangular torus approaches an aspect ratio of 0 in the limit.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-27", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "M may be turned into a compact space M* – topologically equivalent to a sphere – by adding one additional point that represents the limiting case as a rectangular torus approaches an aspect ratio of 0 in the limit. The result is that this compactified moduli space is a sphere with three points each having less than 2π total angle around them. (Such a point is termed a \"cusp\", and may be thought of as the vertex of a cone, also called a \"conepoint\".) This third conepoint will have zero total angle around it. Due to symmetry, M* may be constructed by glueing together two congruent geodesic triangles in the hyperbolic plane along their (identical) boundaries, where each triangle has angles of π/2 , π/3 , and 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-28", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Due to symmetry, M* may be constructed by glueing together two congruent geodesic triangles in the hyperbolic plane along their (identical) boundaries, where each triangle has angles of π/2 , π/3 , and 0 . (The three angles of a hyperbolic triangle T determine T up to congruence.) As a result, the Gauss–Bonnet theorem shows that the area of each triangle can be calculated as π − (π/2 + π/3 + 0) = π/6 , so it follows that the compactified moduli space M* has area equal to π/3 . The other two cusps occur at the points corresponding in M* to (a) the square torus (total angle π ) and (b) the hexagonal torus (total angle 2π/3 ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-29", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The other two cusps occur at the points corresponding in M* to (a) the square torus (total angle π ) and (b) the hexagonal torus (total angle 2π/3 ). These are the only conformal equivalence classes of flat tori that have any conformal automorphisms other than those generated by translations and negation. A genus g surface is the connected sum of g two-tori. (And so the torus itself is the surface of genus 1.) To form a connected sum of two surfaces, remove from each the interior of a disk and \"glue\" the surfaces together along the boundary circles.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-30", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(And so the torus itself is the surface of genus 1.) To form a connected sum of two surfaces, remove from each the interior of a disk and \"glue\" the surfaces together along the boundary circles. (That is, merge the two boundary circles so they become just one circle.) To form the connected sum of more than two surfaces, successively take the connected sum of two of them at a time until they are all connected. In this sense, a genus g surface resembles the surface of g doughnuts stuck together side by side, or a 2-sphere with g handles attached.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-31", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "In this sense, a genus g surface resembles the surface of g doughnuts stuck together side by side, or a 2-sphere with g handles attached. As examples, a genus zero surface (without boundary) is the two-sphere while a genus one surface (without boundary) is the ordinary torus. The surfaces of higher genus are sometimes called n -holed tori (or, rarely, n -fold tori). The terms double torus and triple torus are also occasionally used. The classification theorem for surfaces states that every compact connected surface is topologically equivalent to either the sphere or the connect sum of some number of tori, disks, and real projective planes .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-32", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The classification theorem for surfaces states that every compact connected surface is topologically equivalent to either the sphere or the connect sum of some number of tori, disks, and real projective planes . For any number of holes, the formula generalizes to V − E + F = 2 − 2 g , where g is the topological genus. Toroidal polyhedra have been used to show that the maximum number of colors to color a map on a torus is seven. The Szilassi polyhedron is one example of a toroidal polyhedron with this property. The Szilassi polyhedron's dual, the Császár polyhedron , is the only polyhedron other than the tetrahedron which has the property that every possible edge connecting two vertices is an edge of the polyhedron.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-33", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The Szilassi polyhedron's dual, the Császár polyhedron , is the only polyhedron other than the tetrahedron which has the property that every possible edge connecting two vertices is an edge of the polyhedron. The term \"toroidal polyhedron\" is also used for higher-genus polyhedra and for immersions of toroidal polyhedra, although some authors only include those with genus 1. Self-crossing toroidal polyhedra are determined by the topology of their abstract manifold. One subset of the self-crossing toroidal polyhedra are the crown polyhedra, which are the only toroidal polyhedra that are also noble . (Contrast with the four color theorem for the plane .) This construction shows the torus divided into seven regions, every one of which touches every other, meaning each must be assigned a unique color.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-34", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(Contrast with the four color theorem for the plane .) This construction shows the torus divided into seven regions, every one of which touches every other, meaning each must be assigned a unique color. It is a torus because the edges are considered wraparound for the purpose of finding matrices. Its name comes from the De Bruijn sequence , which can be considered a special case where n is 1 (one dimension).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-0", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "700 BCE to present Descendants Î J Ɉ İ ı Tittle ꟾ ꟷ ᛁ ᴉ Sisters І י ܝ ی ࠉ 𐎊 ዪ Ⴢ ⴢ ჲ ☞ ☚ Other Associated graphs i(x) , ij , i(x)(y) Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . I ( minuscule : i ) is the ninth letter and the third vowel letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is i (pronounced / ˈ aɪ / ), plural i's or is .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-1", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "I ( minuscule : i ) is the ninth letter and the third vowel letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is i (pronounced / ˈ aɪ / ), plural i's or is . Pronunciation of the name of the letter ⟨i⟩ in European languages History In the Phoenician alphabet , the letter may have originated in a hieroglyph for an arm that represented a voiced pharyngeal fricative ( /ʕ/ ) in Egyptian , but was reassigned to /j/ (as in English \" y es\") by Semites because their word for \"arm\" began with that sound.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-2", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Pronunciation of the name of the letter ⟨i⟩ in European languages History In the Phoenician alphabet , the letter may have originated in a hieroglyph for an arm that represented a voiced pharyngeal fricative ( /ʕ/ ) in Egyptian , but was reassigned to /j/ (as in English \" y es\") by Semites because their word for \"arm\" began with that sound. This letter could also be used to represent /i/ , the close front unrounded vowel , mainly in foreign words. The Greeks adopted a form of this Phoenician yodh as their letter iota ( ⟨Ι, ι⟩ ) to represent /i/ , the same as in the Old Italic alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-3", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "The Greeks adopted a form of this Phoenician yodh as their letter iota ( ⟨Ι, ι⟩ ) to represent /i/ , the same as in the Old Italic alphabet . In Latin (as in Modern Greek ), it was also used to represent /j/ and this use persists in the languages that descended from Latin. The modern letter ' j ' originated as a variation of 'i', and both were used interchangeably for both the vowel and the consonant, coming to be differentiated only in the 16th century. Typographic variants In some sans serif typefaces, the uppercase ⟨I⟩ may be difficult to distinguish from the lowercase letter L , 'l', the vertical bar character '|', or the digit one '1'.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-4", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Typographic variants In some sans serif typefaces, the uppercase ⟨I⟩ may be difficult to distinguish from the lowercase letter L , 'l', the vertical bar character '|', or the digit one '1'. In serifed typefaces, the capital form of the letter has both a baseline and a cap height serif, while the lowercase L generally has a hooked ascender and a baseline serif. The dot over the lowercase 'i' is sometimes called a tittle . The dot can be considered optional and is usually removed when applying other diacritics . In Turkish, dotted İ and dotless I are considered separate letters, representing a front and back vowel, respectively, and both have uppercase ('I', 'İ') and lowercase ('ı', 'i') forms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-5", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "In Turkish, dotted İ and dotless I are considered separate letters, representing a front and back vowel, respectively, and both have uppercase ('I', 'İ') and lowercase ('ı', 'i') forms. Usually these are considered equivalent, but they are distinguished in some extended Latin alphabet systems, such as the 1978 version of the African reference alphabet . In that system, the former is the uppercase counterpart of ɪ and the latter is the counterpart of 'i'. Use in writing systems English In Modern English spelling , ⟨i⟩ represents several different sounds, either the diphthong / aɪ / (\"long\" ⟨i⟩ ) as in kite , the short / ɪ / as in bill , or the ⟨ee⟩ sound / iː / in the last syllable of machine .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-6", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Use in writing systems English In Modern English spelling , ⟨i⟩ represents several different sounds, either the diphthong / aɪ / (\"long\" ⟨i⟩ ) as in kite , the short / ɪ / as in bill , or the ⟨ee⟩ sound / iː / in the last syllable of machine . In the Great Vowel Shift , Middle English /iː/ changed to Early Modern English /ei/ , which later changed to /əi/ and finally to the Modern English diphthong /aɪ/ in General American and Received Pronunciation . The letter ⟨i⟩ is the fifth most common letter in the English language .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-7", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "In the Great Vowel Shift , Middle English /iː/ changed to Early Modern English /ei/ , which later changed to /əi/ and finally to the Modern English diphthong /aɪ/ in General American and Received Pronunciation . The letter ⟨i⟩ is the fifth most common letter in the English language . This pattern arose for basically the same reason that lowercase ⟨i⟩ acquired a dot: so it wouldn't get lost in manuscripts before the age of printing : The capitalized \"I\" first showed up about 1250 in the northern and midland dialects of England, according to the Chambers Dictionary of Etymology .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-8", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "This pattern arose for basically the same reason that lowercase ⟨i⟩ acquired a dot: so it wouldn't get lost in manuscripts before the age of printing : The capitalized \"I\" first showed up about 1250 in the northern and midland dialects of England, according to the Chambers Dictionary of Etymology . Chambers however, that the capitalized form didn't become established in the south of England until the 1700s (although it appears sporadically before that time). Capitalizing the pronoun, Chambers explains, made it more distinct, thus \"avoiding misreading handwritten manuscripts.\" Other languages In many languages' orthographies , ⟨i⟩ is used to represent the sound /i/ or, more rarely, /ɪ/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-9", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Capitalizing the pronoun, Chambers explains, made it more distinct, thus \"avoiding misreading handwritten manuscripts.\" Other languages In many languages' orthographies , ⟨i⟩ is used to represent the sound /i/ or, more rarely, /ɪ/ . In mathematics, a lowercase \" i \" is used to represent the unit imaginary number , while an uppercase \" I \" serves to denote an identity matrix . In some countries, a sign bearing the letter i or i indicates an information point, sometimes specifically for a visitor center . Ies is the plural of the English name of the letter; the plural of the letter itself is rendered I's, I s, i's, or i s.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-10", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Ies is the plural of the English name of the letter; the plural of the letter itself is rendered I's, I s, i's, or i s. In the course of time, I , V and X became identical with three letters of the alphabet; originally, however, they bore no relation to these letters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-0", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "The imaginary unit i in the complex plane : Real numbers are conventionally drawn on the horizontal axis and imaginary numbers on the vertical axis. The imaginary unit , usually denoted by i , is a mathematical constant that is a solution to the quadratic equation x = −1 , which is not solved by any real number . Any real-number multiple of the imaginary unit is called an imaginary number . By combining the real numbers with the imaginary unit using addition and multiplication , a new number system known as the complex numbers is formed; it consists of all numbers of the form a + bi with real numbers a and b .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-1", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "By combining the real numbers with the imaginary unit using addition and multiplication , a new number system known as the complex numbers is formed; it consists of all numbers of the form a + bi with real numbers a and b . There are two complex square roots of −1 : the imaginary unit i and its additive inverse − i . More generally, every nonzero complex number has two distinct complex-valued square roots, which are additive inverses of each other, while zero has only zero as its ( double ) square root. In contexts in which use of the letter i is ambiguous or problematic, the letter j is sometimes used instead.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-2", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "In contexts in which use of the letter i is ambiguous or problematic, the letter j is sometimes used instead. For example, in electrical engineering the imaginary unit is normally denoted by j instead of i , because i is commonly used to denote electric current . The name imaginary is generally credited to René Descartes , and Isaac Newton used the term as early as 1670. The i notation was introduced by Leonhard Euler . Although the construction is called imaginary , and although the concept of an imaginary number may be intuitively more difficult to grasp than that of a real number, the construction is valid from a mathematical standpoint.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-3", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Although the construction is called imaginary , and although the concept of an imaginary number may be intuitively more difficult to grasp than that of a real number, the construction is valid from a mathematical standpoint. Real number operations can be extended to imaginary and complex numbers, by treating i as an unknown quantity while manipulating an expression (and using the definition to replace any occurrence of i with −1 ). As a complex number, i can be represented in rectangular form as 0 + 1 i , with a zero real component and a unit imaginary component.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-4", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "As a complex number, i can be represented in rectangular form as 0 + 1 i , with a zero real component and a unit imaginary component. (Adding any integer multiple of 2 π to this angle works as well.) In the complex plane , which is a special interpretation of a Cartesian plane , i is the point located one unit from the origin along the imaginary axis (which is perpendicular to the real axis ). Although the two solutions are distinct numbers, their properties are indistinguishable; there is no property that one has that the other does not.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-5", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Although the two solutions are distinct numbers, their properties are indistinguishable; there is no property that one has that the other does not. One of these two solutions is labelled + i (or simply i ) and the other is labelled − i , though it is inherently ambiguous which is which. Also, despite the signs written with them, neither + i nor − i is inherently positive or negative in the sense that real numbers are. A more formal expression of this indistinguishability of + i and − i is that, although the complex field is unique (as an extension of the real numbers) up to isomorphism , it is not unique up to a unique isomorphism.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-6", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "A more formal expression of this indistinguishability of + i and − i is that, although the complex field is unique (as an extension of the real numbers) up to isomorphism , it is not unique up to a unique isomorphism. The real unit 1 and imaginary unit i can be represented by any pair of matrices I and J satisfying I = I , IJ = JI = J , and J = − I . Then a complex number a + bi can be represented by the matrix aI + bJ , and all of the ordinary rules of complex arithmetic can be derived from the rules of matrix arithmetic.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-7", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Then a complex number a + bi can be represented by the matrix aI + bJ , and all of the ordinary rules of complex arithmetic can be derived from the rules of matrix arithmetic. Larger matrices could also be used; for example, 1 could be represented by the 4 × 4 identity matrix and i could be represented by any of the Dirac matrices for spatial dimensions. In this representation, the numbers 1 and i are at the same distance from 0 , with a right angle between them. Addition by a complex number corresponds to translation in the plane, while multiplication by a unit-magnitude complex number corresponds to rotation about the origin.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-8", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Addition by a complex number corresponds to translation in the plane, while multiplication by a unit-magnitude complex number corresponds to rotation about the origin. Every similarity transformation of the plane can be represented by a complex-linear function z ↦ a z + b . (A scalar is a quantity with no orientation, a vector is a quantity oriented like a line, and a bivector is a quantity oriented like a plane.) The square of any vector is a positive scalar, representing its length squared, while the square of any bivector is a negative scalar. The quotient of a vector with itself is the scalar 1 = u / u , and when multiplied by any vector leaves it unchanged (the identity transformation ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-9", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "The quotient of a vector with itself is the scalar 1 = u / u , and when multiplied by any vector leaves it unchanged (the identity transformation ). The quotient of any two perpendicular vectors of the same magnitude, J = u / v , which when multiplied rotates the divisor a quarter turn into the dividend, Jv = u , is a unit bivector which squares to −1 , and can thus be taken as a representative of the imaginary unit. Any sum of a scalar and bivector can be multiplied by a vector to scale and rotate it, and the algebra of such sums is isomorphic to the algebra of complex numbers.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-10", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Any sum of a scalar and bivector can be multiplied by a vector to scale and rotate it, and the algebra of such sums is isomorphic to the algebra of complex numbers. In this interpretation points, vectors, and sums of scalars and bivectors are all distinct types of geometric objects. More generally, in the geometric algebra of any higher-dimensional Euclidean space , a unit bivector of any arbitrary planar orientation squares to −1 , so can be taken to represent the imaginary unit i . Attempting to apply the calculation rules of square roots of positive real numbers to manipulate square roots of complex numbers can produce false results: − 1 = i ⋅ i = − 1 ⋅ − 1 = f a l l a c y ( − 1 ) ⋅ ( − 1 ) = 1 = 1 (incorrect).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-11", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Attempting to apply the calculation rules of square roots of positive real numbers to manipulate square roots of complex numbers can produce false results: − 1 = i ⋅ i = − 1 ⋅ − 1 = f a l l a c y ( − 1 ) ⋅ ( − 1 ) = 1 = 1 (incorrect). The imaginary unit can also be multiplied by any arbitrary real number to form an imaginary number . These numbers can be pictured on a number line , the imaginary axis , which as part of the complex plane is typically drawn with a vertical orientation, perpendicular to the real axis which is drawn horizontally.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-12", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "These numbers can be pictured on a number line , the imaginary axis , which as part of the complex plane is typically drawn with a vertical orientation, perpendicular to the real axis which is drawn horizontally. When multiplied by − i , any arbitrary complex number is rotated by a quarter turn clockwise. The set of roots equals the corresponding set of roots of unity rotated by the principal n -th root of i . These are the vertices of a regular polygon inscribed within the complex unit circle . Real values in the domain represent scaling in the codomain (multiplication by a real scalar) with 1 representing multiplication by e , while imaginary values in the domain represent rotation in the codomain (multiplication by a unit complex number) with i representing a rotation by 1 radian.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-13", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Real values in the domain represent scaling in the codomain (multiplication by a real scalar) with 1 representing multiplication by e , while imaginary values in the domain represent rotation in the codomain (multiplication by a unit complex number) with i representing a rotation by 1 radian. The complex exponential is thus a periodic function in the imaginary direction, with period 2 πi and image 1 at points 2 kπi for all integers k , a real multiple of the lattice of imaginary integers. The quotient coth z = cosh z / sinh z , with appropriate scaling, can be represented as an infinite partial fraction decomposition as the sum of reciprocal functions translated by imaginary integers: π coth ⁡ π z = lim n → ∞ ∑ k = − n n 1 z + k i .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-14", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "The quotient coth z = cosh z / sinh z , with appropriate scaling, can be represented as an infinite partial fraction decomposition as the sum of reciprocal functions translated by imaginary integers: π coth ⁡ π z = lim n → ∞ ∑ k = − n n 1 z + k i . Because the real and imaginary parts are always separate, we regroup the terms, x − y + 2 ixy = 0 + i . By equating coefficients , separating the real part and imaginary part, we have a system of two equations: x 2 − y 2 = 0 2 x y = 1.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-15", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "By equating coefficients , separating the real part and imaginary part, we have a system of two equations: x 2 − y 2 = 0 2 x y = 1. Substituting either of these results into the equation 2 xy = 1 in turn, we will get the corresponding result for y . ^ The interpretation of the imaginary unit as the ratio of two perpendicular vectors was proposed by Hermann Grassmann in the foreword to his Ausdehnungslehre of 1844; later William Clifford realized that this ratio could be interpreted as a bivector. \"Decimal expansion of the real part of i!\", Sequence A212877 ; and \"Decimal expansion of the negated imaginary part of i!\", Sequence A212878 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-16", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "\"Decimal expansion of the real part of i!\", Sequence A212877 ; and \"Decimal expansion of the negated imaginary part of i!\", Sequence A212878 . \"Decimal expansion of the absolute value of i!\", Sequence A212879 ; and \"Decimal expansion of the negated argument of i!\", Sequence A212880 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-0", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "700 BCE to present Descendants Ḟ ₣ ℉ ꟻ ꬵ 𝆑 Sisters U V W Y Ʊ Ϝ У Ў Ұ Υ ו , וּ , וֹ , ﻭ , ۋ , ܘ ࠅ 𐎆 𐌖 Վ վ Ո ո Ւ ւ և Transliterations U V W Y Other Associated graphs f(x) Associated numbers 6, 15 Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . F ( minuscule : f ) is the sixth letter of the Latin alphabet and many modern alphabets influenced by it, including the modern English alphabet and the alphabets of all other modern western European languages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-1", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "F ( minuscule : f ) is the sixth letter of the Latin alphabet and many modern alphabets influenced by it, including the modern English alphabet and the alphabets of all other modern western European languages. Its name in English is ef (pronounced / ˈ ɛ f / ), and the plural is efs . History The origin of ⟨F⟩ is the Semitic letter waw , which represented the sound /w/ . Latin ⟨F⟩, despite being pronounced differently, is ultimately descended from digamma and closely resembles it in form. After sound changes eliminated /w/ from most dialects of Greek (Doric Greek retained it), digamma was used only as a numeral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-2", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "After sound changes eliminated /w/ from most dialects of Greek (Doric Greek retained it), digamma was used only as a numeral. In the Etruscan alphabet , ⟨F⟩ probably represented /w/ , as in Greek, and the Etruscans formed the digraph ⟨FH⟩ to represent /f/ . When the Romans adopted the alphabet, they used ⟨V⟩ (from Greek upsilon ) not only for the vowel /u/ , but also for the corresponding semivowel /w/ , leaving ⟨F⟩ available for /f/ . Initially, ⟨FH⟩ was also used for this sound in Latin, but the ⟨H⟩ was soon dropped.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-3", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "When the Romans adopted the alphabet, they used ⟨V⟩ (from Greek upsilon ) not only for the vowel /u/ , but also for the corresponding semivowel /w/ , leaving ⟨F⟩ available for /f/ . Initially, ⟨FH⟩ was also used for this sound in Latin, but the ⟨H⟩ was soon dropped. And so out of the various vav variants in the Mediterranean world, the letter F entered the Roman alphabet attached to a sound which the Greeks did not have. The Roman alphabet forms the basis of the alphabet used today for English and many other languages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-4", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "And so out of the various vav variants in the Mediterranean world, the letter F entered the Roman alphabet attached to a sound which the Greeks did not have. The Roman alphabet forms the basis of the alphabet used today for English and many other languages. The lowercase ⟨f⟩ is not related to the visually similar long s , ⟨ſ⟩ (or medial s ). The use of the long s largely died out by the beginning of the 19th century , mostly to prevent confusion with ⟨f⟩ when using a short mid-bar. Use in writing systems English In the English writing system ⟨f⟩ is used to represent the sound / f / , the voiceless labiodental fricative .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-5", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "Use in writing systems English In the English writing system ⟨f⟩ is used to represent the sound / f / , the voiceless labiodental fricative . F is the eleventh least frequently used letter in the English language (after G , Y , P , B , V , K , J , X , Q , and Z ), with a frequency of about 2.23% in words. In French orthography , ⟨f⟩ is used to represent /f/ . In Spanish orthography , ⟨f⟩ is used to represent /f/ . In Esperanto orthography , ⟨f⟩ is used to represent /f/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-6", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "In Spanish orthography , ⟨f⟩ is used to represent /f/ . In Esperanto orthography , ⟨f⟩ is used to represent /f/ . In Slavic languages , ⟨f⟩ is used primarily in words of foreign (Hellenic, Romance, or Germanic) origin. Other systems The International Phonetic Alphabet uses ⟨ f ⟩ to represent the voiceless labiodental fricative . The italic letter f is conventionally used to denote an arbitrary function . In countries such as the United States , the letter \"F\" is defined as a failure in terms of academic evaluation . The letter F has become an Internet meme , where it is used to pay respects .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-7", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "In countries such as the United States , the letter \"F\" is defined as a failure in terms of academic evaluation . The letter F has become an Internet meme , where it is used to pay respects . This use is derived from the 2014 video game Call of Duty: Advanced Warfare , where in a quick-time event, protagonist Jack Mitchell must pay his respects to his friend Will Irons who fell in combat in a previous mission, represented by the player pressing F when playing the PC version. People on the Internet use the letter F sometimes in a genuine way to express respect, sadness, or condolences towards other Internet personalities, Internet memes, or other players on certain events.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-8", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "People on the Internet use the letter F sometimes in a genuine way to express respect, sadness, or condolences towards other Internet personalities, Internet memes, or other players on certain events. ꜰ : Small capital F was used in the Icelandic First Grammatical Treatise to mark gemination ꟳ : Modifier letter capital F – Used to mark tone for the Chatino orthography in Oaxaca, Mexico; Used as a generic transcription for a falling tone; used in para- IPA notation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-0", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The remaining smaller peaks are higher-frequency overtones of the fundamental pitches. In mathematics , the Fourier transform ( FT ) is an integral transform that takes a function as input and outputs another function that describes the extent to which various frequencies are present in the original function. The output of the transform is a complex valued function of frequency. The term Fourier transform refers to both the mathematical operation and to this complex-valued function. When a distinction needs to be made, the output of the operation is sometimes called the frequency domain representation of the original function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-1", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "When a distinction needs to be made, the output of the operation is sometimes called the frequency domain representation of the original function. The Fourier transform is analogous to decomposing the sound of a musical chord into the intensities of its constituent pitches . The component frequencies, extended for the whole frequency spectrum, are shown as peaks in the domain of the frequency. Functions that are localized in the time domain have Fourier transforms that are spread out across the frequency domain and vice versa, a phenomenon known as the uncertainty principle . The critical case for this principle is the Gaussian function , of substantial importance in probability theory and statistics as well as in the study of physical phenomena exhibiting normal distribution (e.g., diffusion ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-2", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The critical case for this principle is the Gaussian function , of substantial importance in probability theory and statistics as well as in the study of physical phenomena exhibiting normal distribution (e.g., diffusion ). The Fourier transform of a Gaussian function is another Gaussian function. Joseph Fourier introduced sine and cosine transforms (which correspond to the imaginary and real components of the modern Fourier transform) in his study of heat transfer , where Gaussian functions appear as solutions of the heat equation . The Fourier transform can be formally defined as an improper Riemann integral , making it an integral transform, although this definition is not suitable for many applications requiring a more sophisticated integration theory.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-3", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform can be formally defined as an improper Riemann integral , making it an integral transform, although this definition is not suitable for many applications requiring a more sophisticated integration theory. For example, many relatively simple applications use the Dirac delta function , which can be treated formally as if it were a function, but the justification requires a mathematically more sophisticated viewpoint. The Fourier transform can also be generalized to functions of several variables on Euclidean space , sending a function of 3-dimensional \"position space\" to a function of 3-dimensional momentum (or a function of space and time to a function of 4-momentum ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-4", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform can also be generalized to functions of several variables on Euclidean space , sending a function of 3-dimensional \"position space\" to a function of 3-dimensional momentum (or a function of space and time to a function of 4-momentum ). This idea makes the spatial Fourier transform very natural in the study of waves, as well as in quantum mechanics , where it is important to be able to represent wave solutions as functions of either position or momentum and sometimes both. In general, functions to which Fourier methods are applicable are complex-valued, and possibly vector-valued .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-5", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This idea makes the spatial Fourier transform very natural in the study of waves, as well as in quantum mechanics , where it is important to be able to represent wave solutions as functions of either position or momentum and sometimes both. In general, functions to which Fourier methods are applicable are complex-valued, and possibly vector-valued . The latter is routinely employed to handle periodic functions . The fast Fourier transform (FFT) is an algorithm for computing the DFT. However, the Fourier transform can also be defined for (generalized) functions for which the Lebesgue integral Eq.1 does not make sense.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-6", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "However, the Fourier transform can also be defined for (generalized) functions for which the Lebesgue integral Eq.1 does not make sense. as an improper integral for locally integrable functions) extends the Fourier transform to functions that are not necessarily integrable over the whole real line. More generally, the Fourier transform also applies to generalized functions like the Dirac delta (and all other tempered distributions ), in which case it is defined by duality rather than an integral. A common notation for designating transform pairs is: f ( x ) ⟷ F f ^ ( ξ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-7", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "A common notation for designating transform pairs is: f ( x ) ⟷ F f ^ ( ξ ) . However, there is no easy characterization of the image, and thus no easy characterization of the inverse transform. In such cases, the Fourier transform can be obtained explicitly by regularizing the integral, and then passing to a limit. In practice, the integral is often regarded as an improper integral instead of a proper Lebesgue integral, but sometimes for convergence one needs to use weak limit or principal value instead of the (pointwise) limits implicit in an improper integral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-8", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In practice, the integral is often regarded as an improper integral instead of a proper Lebesgue integral, but sometimes for convergence one needs to use weak limit or principal value instead of the (pointwise) limits implicit in an improper integral. Titchmarsh (1986) and Dym & McKean (1985) each gives three rigorous ways of extending the Fourier transform to square integrable functions using this procedure. That important work was corrected and expanded upon by others to provide the foundation for the various forms of the Fourier transform used since. It is noteworthy how easily the product was simplified using the polar form, and how easily the rectangular form was deduced by an application of Euler's formula.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-9", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "It is noteworthy how easily the product was simplified using the polar form, and how easily the rectangular form was deduced by an application of Euler's formula. It is possible to extend the definition to include periodic functions by viewing them as tempered distributions . This makes it possible to see a connection between the Fourier series and the Fourier transform for periodic functions that have a convergent Fourier series . In other words, the Fourier transform is a Dirac comb function whose teeth are multiplied by the Fourier series coefficients. Therefore, the Fourier transform goes from one space of functions to a different space of functions: functions that have a different domain of definition.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-10", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Therefore, the Fourier transform goes from one space of functions to a different space of functions: functions that have a different domain of definition. (See the article Linear algebra for a more formal explanation and for more details.) This point of view becomes essential in generalizations of the Fourier transform to general symmetry groups , including the case of Fourier series. That there is no one preferred way (often, one says \"no canonical way\") to compare the two versions of the real line that are involved in the Fourier transform—fixing the units on one line does not force the scale of the units on the other line—is the reason for the plethora of rival conventions on the definition of the Fourier transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-11", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "That there is no one preferred way (often, one says \"no canonical way\") to compare the two versions of the real line that are involved in the Fourier transform—fixing the units on one line does not force the scale of the units on the other line—is the reason for the plethora of rival conventions on the definition of the Fourier transform. In other conventions, the Fourier transform has i in the exponent instead of − i , and vice versa for the inversion formula. This convention is common in modern physics and is the default for Wolfram Alpha , and does not mean that the frequency has become negative, since there is no canonical definition of positivity for frequency of a complex wave.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-12", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This convention is common in modern physics and is the default for Wolfram Alpha , and does not mean that the frequency has become negative, since there is no canonical definition of positivity for frequency of a complex wave. Many of the identities involving the Fourier transform remain valid in those conventions, provided all terms that explicitly involve i have it replaced by − i . In electrical engineering the letter j is typically used for the imaginary unit instead of i because i is used for current. From the higher point of view of group characters , which is much more abstract, all these arbitrary choices disappear, as will be explained in the later section of this article, which treats the notion of the Fourier transform of a function on a locally compact abelian group .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-13", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "From the higher point of view of group characters , which is much more abstract, all these arbitrary choices disappear, as will be explained in the later section of this article, which treats the notion of the Fourier transform of a function on a locally compact abelian group . The sinc function , which is the Fourier transform of the rectangular function, is bounded and continuous, but not Lebesgue integrable. The Fourier transform may be defined in some cases for non-integrable functions, but the Fourier transforms of integrable functions have several strong properties. For example, the Fourier transform of the rectangular function , which is integrable, is the sinc function , which is not Lebesgue integrable , because its improper integrals behave analogously to the alternating harmonic series , in converging to a sum without being absolutely convergent .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-14", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "For example, the Fourier transform of the rectangular function , which is integrable, is the sinc function , which is not Lebesgue integrable , because its improper integrals behave analogously to the alternating harmonic series , in converging to a sum without being absolutely convergent . It is not generally possible to write the inverse transform as a Lebesgue integral . As a result, the Fourier transform is injective on L ( R ) . The terminology of these formulas is not quite standardised. Parseval's theorem was proved only for Fourier series, and was first proved by Lyapunov.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-15", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The terminology of these formulas is not quite standardised. Parseval's theorem was proved only for Fourier series, and was first proved by Lyapunov. But Parseval's formula makes sense for the Fourier transform as well, and so even though in the context of the Fourier transform it was proved by Plancherel, it is still often referred to as Parseval's formula, or Parseval's relation, or even Parseval's theorem. By applying the Fourier transform and using these formulas, some ordinary differential equations can be transformed into algebraic equations, which are much easier to solve. The corresponding solutions provide an important choice of an orthonormal basis for L ( R ) and are given by the \"physicist's\" Hermite functions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-16", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The corresponding solutions provide an important choice of an orthonormal basis for L ( R ) and are given by the \"physicist's\" Hermite functions . However, this choice of eigenfunctions is not unique. As a consequence of this, it is possible to decompose L ( R ) as a direct sum of four spaces H 0 , H 1 , H 2 , and H 3 where the Fourier transform acts on H k simply by multiplication by i . Among other properties, Hermite functions decrease exponentially fast in both frequency and time domains, and they are thus used to define a generalization of the Fourier transform, namely the fractional Fourier transform used in time–frequency analysis.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-17", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Among other properties, Hermite functions decrease exponentially fast in both frequency and time domains, and they are thus used to define a generalization of the Fourier transform, namely the fractional Fourier transform used in time–frequency analysis. In physics , this transform was introduced by Edward Condon . This change of basis becomes possible because the Fourier transform is a unitary transform when using the right conventions . Upon extending the Fourier transform to distributions the Dirac comb is also an eigenfunction of the Fourier transform. In particular the Fourier transform is invertible (under suitable conditions).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-18", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Upon extending the Fourier transform to distributions the Dirac comb is also an eigenfunction of the Fourier transform. In particular the Fourier transform is invertible (under suitable conditions). equality almost everywhere ?) and defining equality of operators – that is, defining the topology on the function space and operator space in question. These are not true for all functions, but are true under various conditions, which are the content of the various forms of the Fourier inversion theorem . This fourfold periodicity of the Fourier transform is similar to a rotation of the plane by 90°, particularly as the two-fold iteration yields a reversal, and in fact this analogy can be made precise.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-19", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This fourfold periodicity of the Fourier transform is similar to a rotation of the plane by 90°, particularly as the two-fold iteration yields a reversal, and in fact this analogy can be made precise. This can be further generalized to linear canonical transformations , which can be visualized as the action of the special linear group SL 2 ( R ) on the time–frequency plane, with the preserved symplectic form corresponding to the uncertainty principle , below. This approach is particularly studied in signal processing , under time–frequency analysis . The above procedure describes not only the group structure, but also a standard unitary representation of H 1 on a Hilbert space, which we denote by ρ : H 1 → B ( L ( R )) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-20", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The above procedure describes not only the group structure, but also a standard unitary representation of H 1 on a Hilbert space, which we denote by ρ : H 1 → B ( L ( R )) . Many of the standard properties of the Fourier transform are immediate consequences of this more general framework. For example, the square of the Fourier transform, W , is an intertwiner associated with J = − I , and so we have ( W f )( x ) = f (− x ) is the reflection of the original function f .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-21", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "For example, the square of the Fourier transform, W , is an intertwiner associated with J = − I , and so we have ( W f )( x ) = f (− x ) is the reflection of the original function f . Depending on the properties of f , this might not converge off the real axis at all, or it might converge to a complex analytic function for all values of ξ = σ + iτ , or something in between. (If f is not smooth, but only L , a corresponding version holds with the rapid-decrease condition replaced by the appropriate L condition.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-22", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "(If f is not smooth, but only L , a corresponding version holds with the rapid-decrease condition replaced by the appropriate L condition. ) The space of such functions of a complex variable is called the Paley–Wiener space. If f is supported on the half-line t ≥ 0 , then f is said to be \"causal\" because the impulse response function of a physically realisable filter must have this property, as no effect can precede its cause. Paley and Wiener showed that then, under suitable integrability hypotheses, f̂ extends to a holomorphic function on the complex lower half-plane τ that tends to zero as τ goes to −∞ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-23", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Paley and Wiener showed that then, under suitable integrability hypotheses, f̂ extends to a holomorphic function on the complex lower half-plane τ that tends to zero as τ goes to −∞ . A simple converse in this form is false; precise converses require additional growth or Hardy-space hypotheses. It may happen that a function f for which the Fourier integral does not converge on the real axis at all nevertheless has a complex Fourier transform defined in some region of the complex plane . Thus, extending the Fourier transform to the complex domain means it includes the Laplace transform as a special case in the case of causal functions—but with the change of variable s = i 2π ξ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-24", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Thus, extending the Fourier transform to the complex domain means it includes the Laplace transform as a special case in the case of causal functions—but with the change of variable s = i 2π ξ . From another, perhaps more classical viewpoint, the Laplace transform by its form involves an additional exponential regulating term that lets it converge outside of the imaginary line where the Fourier transform is defined. As such it can converge for functions and integrals with at most exponential growth in the regulated direction, whereas the original Fourier decomposition cannot, enabling analysis of systems with divergent or critical elements.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-25", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As such it can converge for functions and integrals with at most exponential growth in the regulated direction, whereas the original Fourier decomposition cannot, enabling analysis of systems with divergent or critical elements. Two particular examples from linear signal processing are the construction of allpass filter networks from critical comb and mitigating filters via exact pole-zero cancellation on the unit circle. Such designs are common in audio processing, where highly nonlinear phase response is sought for, as in reverb. Furthermore, when extended pulselike impulse responses are sought for signal processing work, the easiest way to produce them is to have one circuit that produces a divergent time response, and then to cancel its divergence through a delayed opposite and compensatory response.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-26", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Furthermore, when extended pulselike impulse responses are sought for signal processing work, the easiest way to produce them is to have one circuit that produces a divergent time response, and then to cancel its divergence through a delayed opposite and compensatory response. There, only the delay circuit in-between admits a classical Fourier description, which is critical. Both the circuits to the side are unstable, and do not admit a convergent Fourier decomposition. However, they do admit a Laplace domain description, with compatible half-planes of convergence in the complex plane (or in the discrete case, the Z-plane), wherein their effects cancel.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-27", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "However, they do admit a Laplace domain description, with compatible half-planes of convergence in the complex plane (or in the discrete case, the Z-plane), wherein their effects cancel. In modern mathematics the Laplace transform is conventionally subsumed under the aegis of Fourier methods. Both of them are subsumed by the far more general, and more abstract, idea of harmonic analysis . Therefore, the Fourier inversion formula can use integration along different lines, parallel to the real axis. The hypotheses can be weakened, as in standard Fourier inversion results, to f ( t ) e being L , provided that f be of bounded variation in a closed neighborhood of t (cf.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-28", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The hypotheses can be weakened, as in standard Fourier inversion results, to f ( t ) e being L , provided that f be of bounded variation in a closed neighborhood of t (cf. Dini test ), the value of f at t be taken to be the arithmetic mean of the left and right limits, and that the integrals be taken in the sense of Cauchy principal values. L versions of these inversion formulas are also available. As with the one-dimensional case, there are many conventions. When the function is integrable, the Fourier transform is still uniformly continuous and the Riemann–Lebesgue lemma holds.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-29", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As with the one-dimensional case, there are many conventions. When the function is integrable, the Fourier transform is still uniformly continuous and the Riemann–Lebesgue lemma holds. In particular, the scaling property of the Fourier transform may be seen as saying: if we squeeze a function in x , its Fourier transform stretches out in ξ . It is not possible to arbitrarily concentrate both a function and its Fourier transform. Suppose f ( x ) is an integrable and square-integrable function. In other words, where f is a (normalized) Gaussian function with variance σ /2 π , centered at zero, and its Fourier transform is a Gaussian function with variance σ /2 π .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-30", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In other words, where f is a (normalized) Gaussian function with variance σ /2 π , centered at zero, and its Fourier transform is a Gaussian function with variance σ /2 π . Gaussian functions are examples of Schwartz functions (see the discussion on tempered distributions below). The equality is attained for a Gaussian, as in the previous case. An absolutely integrable function f for which Fourier inversion holds can be expanded in terms of genuine frequencies (avoiding negative frequencies, which are sometimes considered hard to interpret physically ) λ by f ( t ) = ∫ 0 ∞ ( a ( λ ) cos ⁡ ( 2 π λ t ) + b ( λ ) sin ⁡ ( 2 π λ t ) ) d λ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-31", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "An absolutely integrable function f for which Fourier inversion holds can be expanded in terms of genuine frequencies (avoiding negative frequencies, which are sometimes considered hard to interpret physically ) λ by f ( t ) = ∫ 0 ∞ ( a ( λ ) cos ⁡ ( 2 π λ t ) + b ( λ ) sin ⁡ ( 2 π λ t ) ) d λ . This is referred to as Fourier's integral formula. The space L ( R ) is then a direct sum of the spaces H k and the Fourier transform maps each space H k to itself and it is possible to characterize the action of the Fourier transform on each space H k .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-32", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The space L ( R ) is then a direct sum of the spaces H k and the Fourier transform maps each space H k to itself and it is possible to characterize the action of the Fourier transform on each space H k . Moreover, there is a simple recursion relating the cases n + 2 and n allowing to compute, e.g., the three-dimensional Fourier transform of a radial function from the one-dimensional one. The Fourier transform of an integrable function is continuous and the restriction of this function to any set is defined.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-33", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform of an integrable function is continuous and the restriction of this function to any set is defined. But for a square-integrable function the Fourier transform could be a general class of square integrable functions. As such, the restriction of the Fourier transform of an L ( R ) function cannot be defined on sets of measure 0. It is still an active area of study to understand restriction problems in L for 1 p . It is possible in some cases to define the restriction of a Fourier transform to a set S , provided S has non-zero curvature.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-34", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "It is possible in some cases to define the restriction of a Fourier transform to a set S , provided S has non-zero curvature. The case when S is the unit sphere in R is of particular interest. In this case the Tomas– Stein restriction theorem states that the restriction of the Fourier transform to the unit sphere in R is a bounded operator on L provided 1 ≤ p ≤ ⁠ 2 n + 2 / n + 3 ⁠ . Consider an increasing collection of measurable sets E R indexed by R ∈ (0, ∞) : such as balls of radius R centered at the origin, or cubes of side 2 R .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-35", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Consider an increasing collection of measurable sets E R indexed by R ∈ (0, ∞) : such as balls of radius R centered at the origin, or cubes of side 2 R . For n = 1 and 1 p , if one takes E R = (− R , R ) , then f R converges to f in L as R tends to infinity, by the boundedness of the Hilbert transform . Naively one may hope the same holds true for n > 1 . In the case that E R is taken to be a cube with side length R , then convergence still holds.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-36", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In the case that E R is taken to be a cube with side length R , then convergence still holds. In order for this partial sum operator to converge, it is necessary that the multiplier for the unit ball be bounded in L ( R ) . For n ≥ 2 it is a celebrated theorem of Charles Fefferman that the multiplier for the unit ball is never bounded unless p = 2 . In fact, when p ≠ 2 , this shows that not only may f R fail to converge to f in L , but for some functions f ∈ L ( R ) , f R is not even an element of L .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-37", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In fact, when p ≠ 2 , this shows that not only may f R fail to converge to f in L , but for some functions f ∈ L ( R ) , f R is not even an element of L . For an operator to be unitary it is sufficient to show that it is bijective and preserves the inner product. The Fourier inversion theorem implies that the transform is bijective. In each of these spaces, the Fourier transform of a function in L ( R ) is in L ( R ) , where q = ⁠ p / p − 1 ⁠ is the Hölder conjugate of p (by the Hausdorff–Young inequality ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-38", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In each of these spaces, the Fourier transform of a function in L ( R ) is in L ( R ) , where q = ⁠ p / p − 1 ⁠ is the Hölder conjugate of p (by the Hausdorff–Young inequality ). However, except for p = 2 , the image is not easily characterized. In fact, it can be shown that there are functions in L with p > 2 so that the Fourier transform is not defined as a function. The tempered distributions include well-behaved functions of polynomial growth, distributions of compact support as well as all the integrable functions mentioned above.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-39", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The tempered distributions include well-behaved functions of polynomial growth, distributions of compact support as well as all the integrable functions mentioned above. Distributions can be differentiated and the above-mentioned compatibility of the Fourier transform with differentiation and convolution remains true for tempered distributions. If, in addition, the probability distribution has a probability density function , this definition is subject to the usual Fourier transform. That is, the notable difference with the Fourier transform of integrable functions is that the Fourier-Stieltjes transform need not vanish at infinity, i.e., the Riemann–Lebesgue lemma fails for measures. Bochner's theorem characterizes which functions may arise as the Fourier–Stieltjes transform of a positive measure on the circle.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-40", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Bochner's theorem characterizes which functions may arise as the Fourier–Stieltjes transform of a positive measure on the circle. One example of a finite Borel measure that is not a function is the Dirac measure . Its Fourier transform is a constant function (whose value depends on the form of the Fourier transform used). If G is a locally compact abelian group, it has a translation invariant measure μ , called Haar measure . one-dimensional, unitary representations are called its characters . Now, in the case of representations of finite groups, the character table of a group G consists of rows of vectors such that each row is the character of one irreducible representation of G , and these vectors form an orthonormal basis of the space of class (meaning conjugation-invariant) functions that map from G to C by Schur's lemma.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-41", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Now, in the case of representations of finite groups, the character table of a group G consists of rows of vectors such that each row is the character of one irreducible representation of G , and these vectors form an orthonormal basis of the space of class (meaning conjugation-invariant) functions that map from G to C by Schur's lemma. The group T is no longer finite but still compact, and it preserves the orthonormality of the character table. In this particular context, it is closely related to the Pontryagin duality map defined above. Given an abelian locally compact Hausdorff topological group G , as before we consider the space L ( G ) , defined using a Haar measure.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-42", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Given an abelian locally compact Hausdorff topological group G , as before we consider the space L ( G ) , defined using a Haar measure. With convolution as multiplication, L ( G ) is an abelian Banach algebra . (Any C * -norm on L ( G ) is bounded by the L norm, therefore their supremum exists.) Given any abelian C * -algebra A , the Gelfand transform gives an isomorphism between A and C 0 ( A ^) , where A ^ is the multiplicative linear functionals, i.e. Removing the assumption that the underlying group is abelian, irreducible unitary representations need not always be one-dimensional.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-43", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "(Any C * -norm on L ( G ) is bounded by the L norm, therefore their supremum exists.) Given any abelian C * -algebra A , the Gelfand transform gives an isomorphism between A and C 0 ( A ^) , where A ^ is the multiplicative linear functionals, i.e. Removing the assumption that the underlying group is abelian, irreducible unitary representations need not always be one-dimensional. This means the Fourier transform on a non-abelian group takes values as Hilbert space operators. The Fourier transform on compact groups is a major tool in representation theory and non-commutative harmonic analysis .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-44", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform on compact groups is a major tool in representation theory and non-commutative harmonic analysis . Let Σ denote the collection of all isomorphism classes of finite-dimensional irreducible unitary representations , along with a definite choice of representation U on the Hilbert space H σ of finite dimension d σ for each σ ∈ Σ . With the convention above, convolution corresponds to operator multiplication with the order reversed: μ ∗ ν ^ ( σ ) = ν ^ ( σ ) μ ^ ( σ ) . The generalization of the Fourier transform to the noncommutative situation has also in part contributed to the development of noncommutative geometry .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-45", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The generalization of the Fourier transform to the noncommutative situation has also in part contributed to the development of noncommutative geometry . In this context, a categorical generalization of the Fourier transform to noncommutative groups is Tannaka–Krein duality , which replaces the group of characters with the category of representations. However, this is no longer simply a transform of scalar-valued functions into scalar-valued functions. This limits the usefulness of the Fourier transform for analyzing signals that are localized in time, notably transients , or any signal of finite extent. As alternatives to the Fourier transform, in time–frequency analysis , one uses time–frequency transforms or time–frequency distributions to represent signals in a form that has some time information and some frequency information – by the uncertainty principle, there is a trade-off between these.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-46", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As alternatives to the Fourier transform, in time–frequency analysis , one uses time–frequency transforms or time–frequency distributions to represent signals in a form that has some time information and some frequency information – by the uncertainty principle, there is a trade-off between these. These can be generalizations of the Fourier transform, such as the short-time Fourier transform , fractional Fourier transform , synchrosqueezing Fourier transform, or other functions to represent signals, as in wavelet transforms and chirplet transforms , with the wavelet analog of the (continuous) Fourier transform being the continuous wavelet transform . The absolute value of the Fourier transform at +3 Hz is 0.5, which is relatively large.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-47", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "These can be generalizations of the Fourier transform, such as the short-time Fourier transform , fractional Fourier transform , synchrosqueezing Fourier transform, or other functions to represent signals, as in wavelet transforms and chirplet transforms , with the wavelet analog of the (continuous) Fourier transform being the continuous wavelet transform . The absolute value of the Fourier transform at +3 Hz is 0.5, which is relatively large. When added to the Fourier transform at -3 Hz (which is identical because we started with a real signal), we find that the amplitude of the 3 Hz frequency component is 1.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-48", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "When added to the Fourier transform at -3 Hz (which is identical because we started with a real signal), we find that the amplitude of the 3 Hz frequency component is 1. However, when you try to measure a frequency that is not present, both the real and imaginary component of the integral vary rapidly between positive and negative values. For instance, the red curve is looking for 5 Hz. The absolute value of its integral is nearly zero, indicating that almost no 5 Hz component was in the signal. In that case the solution to the original problem is recovered using the inverse Fourier transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-49", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The absolute value of its integral is nearly zero, indicating that almost no 5 Hz component was in the signal. In that case the solution to the original problem is recovered using the inverse Fourier transform. Linear operations performed in one domain (time or frequency) have corresponding operations in the other domain, which are sometimes easier to perform. The operation of differentiation in the time domain corresponds to multiplication by the frequency, so some differential equations are easier to analyze in the frequency domain. After performing the desired operations, transformation of the result can be made back to the time domain.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-50", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The operation of differentiation in the time domain corresponds to multiplication by the frequency, so some differential equations are easier to analyze in the frequency domain. After performing the desired operations, transformation of the result can be made back to the time domain. Harmonic analysis is the systematic study of the relationship between the frequency and time domains, including the kinds of functions or operations that are \"simpler\" in one or the other, and has deep connections to many areas of modern mathematics. Many of the equations of the mathematical physics of the nineteenth century can be treated this way.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-51", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Harmonic analysis is the systematic study of the relationship between the frequency and time domains, including the kinds of functions or operations that are \"simpler\" in one or the other, and has deep connections to many areas of modern mathematics. Many of the equations of the mathematical physics of the nineteenth century can be treated this way. For the heat equation, only one boundary condition can be required (usually the first one). But for the wave equation, there are still infinitely many solutions y that satisfy the first boundary condition. But when one imposes both conditions, there is only one possible solution.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-52", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "But for the wave equation, there are still infinitely many solutions y that satisfy the first boundary condition. But when one imposes both conditions, there is only one possible solution. It is easier to find the Fourier transform ŷ of the solution than to find the solution directly. This is because the Fourier transformation takes differentiation into multiplication by the Fourier-dual variable, and so a partial differential equation applied to the original function is transformed into multiplication by polynomial functions of the dual variables applied to the transformed function. After ŷ is determined, we can apply the inverse Fourier transformation to find y .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-53", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This is because the Fourier transformation takes differentiation into multiplication by the Fourier-dual variable, and so a partial differential equation applied to the original function is transformed into multiplication by polynomial functions of the dual variables applied to the transformed function. After ŷ is determined, we can apply the inverse Fourier transformation to find y . This integral may be interpreted as a continuous linear combination of solutions for the linear equation. In fact, this is the real inverse Fourier transform of a ± and b ± in the variable x . The third step is to examine how to find the specific unknown coefficient functions a ± and b ± that will lead to y satisfying the boundary conditions.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-54", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The third step is to examine how to find the specific unknown coefficient functions a ± and b ± that will lead to y satisfying the boundary conditions. We are interested in the values of these solutions at t = 0 . In summary, we chose a set of elementary solutions, parametrized by ξ , of which the general solution would be a (continuous) linear combination in the form of an integral over the parameter ξ . But this integral was in the form of a Fourier integral. The next step was to express the boundary conditions in terms of these integrals, and set them equal to the given functions f and g .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-55", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The next step was to express the boundary conditions in terms of these integrals, and set them equal to the given functions f and g . But these expressions also took the form of a Fourier integral because of the properties of the Fourier transform of a derivative. The last step was to exploit Fourier inversion by applying the Fourier transformation to both sides, thus obtaining expressions for the coefficient functions a ± and b ± in terms of the given boundary conditions f and g . From a higher point of view, Fourier's procedure can be reformulated more conceptually.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-56", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The last step was to exploit Fourier inversion by applying the Fourier transformation to both sides, thus obtaining expressions for the coefficient functions a ± and b ± in terms of the given boundary conditions f and g . From a higher point of view, Fourier's procedure can be reformulated more conceptually. Since there are two variables, we will use the Fourier transformation in both x and t rather than operate as Fourier did, who only transformed in the spatial variables. Note that ŷ must be considered in the sense of a distribution since y ( x , t ) is not going to be L : as a wave, it will persist through time and thus is not a transient phenomenon.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-57", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Note that ŷ must be considered in the sense of a distribution since y ( x , t ) is not going to be L : as a wave, it will persist through time and thus is not a transient phenomenon. But it will be bounded and so its Fourier transform can be defined as a distribution. The operational properties of the Fourier transformation that are relevant to this equation are that it takes differentiation in x to multiplication by i 2π ξ and differentiation with respect to t to multiplication by i 2π f where f is the frequency.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-58", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The operational properties of the Fourier transformation that are relevant to this equation are that it takes differentiation in x to multiplication by i 2π ξ and differentiation with respect to t to multiplication by i 2π f where f is the frequency. Right away, this explains why the choice of elementary solutions we made earlier worked so well: obviously ŷ = δ ( ξ ± f ) will be solutions. But from the higher point of view, one does not pick elementary solutions, but rather considers the space of all distributions that are supported on the (degenerate) conic ξ − f = 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-59", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "But from the higher point of view, one does not pick elementary solutions, but rather considers the space of all distributions that are supported on the (degenerate) conic ξ − f = 0 . From a calculational point of view, the drawback of course is that one must first calculate the Fourier transforms of the boundary conditions, then assemble the solution from these, and then calculate an inverse Fourier transform. Closed form formulas are rare, except when there is some geometric symmetry that can be exploited, and the numerical calculations are difficult because of the oscillatory nature of the integrals, which makes convergence slow and hard to estimate.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-60", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Closed form formulas are rare, except when there is some geometric symmetry that can be exploited, and the numerical calculations are difficult because of the oscillatory nature of the integrals, which makes convergence slow and hard to estimate. For practical calculations, other methods are often used. those equations that describe how a particular quantity evolves in time from a specified initial state) that can be associated with linear eigenvalue problems whose eigenvalues are integrals of the nonlinear equations. As it may be considered an extension of Fourier analysis to nonlinear problems, the solution method is called the nonlinear Fourier transform (or inverse scattering transform ) method.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-61", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As it may be considered an extension of Fourier analysis to nonlinear problems, the solution method is called the nonlinear Fourier transform (or inverse scattering transform ) method. In NMR an exponentially shaped free induction decay (FID) signal is acquired in the time domain and Fourier-transformed to a Lorentzian line-shape in the frequency domain. The Fourier transform is also used in magnetic resonance imaging (MRI) and mass spectrometry . To begin with, the basic conceptual structure of quantum mechanics postulates the existence of pairs of complementary variables , connected by the Heisenberg uncertainty principle .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-62", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "To begin with, the basic conceptual structure of quantum mechanics postulates the existence of pairs of complementary variables , connected by the Heisenberg uncertainty principle . For example, in one dimension, the spatial variable q of, say, a particle, can only be measured by the quantum mechanical \" position operator \" at the cost of losing information about the momentum p of the particle. Therefore, the physical state of the particle can either be described by a function, called \"the wave function\", of q or by a function of p but not by a function of both variables.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-63", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Therefore, the physical state of the particle can either be described by a function, called \"the wave function\", of q or by a function of p but not by a function of both variables. The variable p is called the conjugate variable to q . In classical mechanics, the physical state of a particle (existing in one dimension, for simplicity of exposition) would be given by assigning definite values to both p and q simultaneously. Thus, the set of all possible physical states is the two-dimensional real vector space with a p -axis and a q -axis called the phase space .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-64", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Thus, the set of all possible physical states is the two-dimensional real vector space with a p -axis and a q -axis called the phase space . In contrast, quantum mechanics chooses a polarisation of this space in the sense that it picks a subspace of one-half the dimension, for example, the q -axis alone, but instead of considering only points, takes the set of all complex-valued \"wave functions\" on this axis. Nevertheless, choosing the p -axis is an equally valid polarisation, yielding a different representation of the set of possible physical states of the particle.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-65", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Nevertheless, choosing the p -axis is an equally valid polarisation, yielding a different representation of the set of possible physical states of the particle. Infinitely many different polarisations are possible, and all are equally valid. Being able to transform states from one representation to another by the Fourier transform is not only convenient but also the underlying reason of the Heisenberg uncertainty principle . The other use of the Fourier transform in both quantum mechanics and quantum field theory is to solve the applicable wave equation. In non-relativistic quantum mechanics, the Schrödinger equation for a time-varying wave function in one-dimension, not subject to external forces, is − ∂ 2 ∂ x 2 ψ ( x , t ) = i h 2 π ∂ ∂ t ψ ( x , t ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-66", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In non-relativistic quantum mechanics, the Schrödinger equation for a time-varying wave function in one-dimension, not subject to external forces, is − ∂ 2 ∂ x 2 ψ ( x , t ) = i h 2 π ∂ ∂ t ψ ( x , t ) . Fourier methods can be used to solve this equation. Neither of these approaches is of much practical use in quantum mechanics. Boundary value problems and the time-evolution of the wave function is not of much practical interest: it is the stationary states that are most important. In relativistic quantum mechanics, the Schrödinger equation becomes a wave equation as was usual in classical physics, except that complex-valued waves are considered.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-67", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In relativistic quantum mechanics, the Schrödinger equation becomes a wave equation as was usual in classical physics, except that complex-valued waves are considered. A simple example, in the absence of interactions with other particles or fields, is the free one-dimensional Klein–Gordon–Schrödinger–Fock equation, this time in dimensionless units, ( ∂ 2 ∂ x 2 + 1 ) ψ ( x , t ) = ∂ 2 ∂ t 2 ψ ( x , t ) . This is of great use in quantum field theory: each separate Fourier component of a wave can be treated as a separate harmonic oscillator and then quantized, a procedure known as \"second quantization\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-68", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This is of great use in quantum field theory: each separate Fourier component of a wave can be treated as a separate harmonic oscillator and then quantized, a procedure known as \"second quantization\". Even if a real signal is indeed transient, it has been found in practice advisable to model a signal by a function (or, alternatively, a stochastic process) that is stationary in the sense that its characteristic properties are constant over all time. The Fourier transform of such a function does not exist in the usual sense, and it has been found more useful for the analysis of signals to instead take the Fourier transform of its autocorrelation function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-69", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform of such a function does not exist in the usual sense, and it has been found more useful for the analysis of signals to instead take the Fourier transform of its autocorrelation function. For most functions f that occur in practice, R is a bounded even function of the time-lag τ and for typical noisy signals it turns out to be uniformly continuous with a maximum at τ = 0 . The autocorrelation function, more properly called the autocovariance function unless it is normalized in some appropriate fashion, measures the strength of the correlation between the values of f separated by a time lag.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-70", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The autocorrelation function, more properly called the autocovariance function unless it is normalized in some appropriate fashion, measures the strength of the correlation between the values of f separated by a time lag. This is a way of searching for the correlation of f with its own past. It is useful even for other statistical tasks besides the analysis of signals. For example, if f ( t ) represents the temperature at time t , one expects a strong correlation with the temperature at a time lag of 24 hours. (Unless all periodic components are first filtered out from f , this integral will diverge, but it is easy to filter out such periodicities.) The power spectrum, as indicated by this density function P , measures the amount of variance contributed to the data by the frequency ξ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-71", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "(Unless all periodic components are first filtered out from f , this integral will diverge, but it is easy to filter out such periodicities.) The power spectrum, as indicated by this density function P , measures the amount of variance contributed to the data by the frequency ξ . In electrical signals, the variance is proportional to the average power (energy per unit time), and so the power spectrum describes how much the different frequencies contribute to the average power of the signal. This process is called the spectral analysis of time-series and is analogous to the usual analysis of variance of data that is not a time-series ( ANOVA ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-72", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This process is called the spectral analysis of time-series and is analogous to the usual analysis of variance of data that is not a time-series ( ANOVA ). Knowledge of which frequencies are \"important\" in this sense is crucial for the proper design of filters and for the proper evaluation of measuring apparatuses. It can also be useful for the scientific analysis of the phenomena responsible for producing the data. The power spectrum of a signal can also be approximately measured directly by measuring the average power that remains in a signal after all the frequencies outside a narrow band have been filtered out.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-73", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The power spectrum of a signal can also be approximately measured directly by measuring the average power that remains in a signal after all the frequencies outside a narrow band have been filtered out. Spectral analysis is carried out for visual signals as well. The power spectrum ignores all phase relations, which is good enough for many purposes, but for video signals other types of spectral analysis must also be employed, still using the Fourier transform as a tool. Each component is a complex sinusoid of the form e whose amplitude is A ( ξ ) and whose initial phase angle (at x = 0 ) is φ ( ξ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-74", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Each component is a complex sinusoid of the form e whose amplitude is A ( ξ ) and whose initial phase angle (at x = 0 ) is φ ( ξ ) . The Fourier transform may be thought of as a mapping on function spaces. This mapping is here denoted F and F ( f ) is used to denote the Fourier transform of the function f . This mapping is linear, which means that F can also be seen as a linear transformation on the function space and implies that the standard notation in linear algebra of applying a linear transformation to a vector (here the function f ) can be used to write F f instead of F ( f ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-75", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This mapping is linear, which means that F can also be seen as a linear transformation on the function space and implies that the standard notation in linear algebra of applying a linear transformation to a vector (here the function f ) can be used to write F f instead of F ( f ) . Since the result of applying the Fourier transform is again a function, we can be interested in the value of this function evaluated at the value ξ for its variable, and this is denoted either as F f ( ξ ) or as ( F f )( ξ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-76", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Since the result of applying the Fourier transform is again a function, we can be interested in the value of this function evaluated at the value ξ for its variable, and this is denoted either as F f ( ξ ) or as ( F f )( ξ ) . Notice that in the former case, it is implicitly understood that F is applied first to f and then the resulting function is evaluated at ξ , not the other way around. In mathematics and various applied sciences, it is often necessary to distinguish between a function f and the value of f when its variable equals x , denoted f ( x ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-77", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In mathematics and various applied sciences, it is often necessary to distinguish between a function f and the value of f when its variable equals x , denoted f ( x ) . This means that a notation like F ( f ( x )) formally can be interpreted as the Fourier transform of the values of f at x . Despite this flaw, the previous notation appears frequently, often when a particular function or a function of a particular variable is to be transformed. Notice, that the last example is only correct under the assumption that the transformed function is a function of x , not of x 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-78", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Notice, that the last example is only correct under the assumption that the transformed function is a function of x , not of x 0 . As discussed above, the characteristic function of a random variable is the same as the Fourier–Stieltjes transform of its distribution measure, but in this context it is typical to take a different convention for the constants. Efficient procedures, depending on the frequency resolution needed, are described at Discrete-time Fourier transform § Sampling the DTFT . The discrete Fourier transform (DFT), used there, is usually computed by a fast Fourier transform (FFT) algorithm.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-79", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Efficient procedures, depending on the frequency resolution needed, are described at Discrete-time Fourier transform § Sampling the DTFT . The discrete Fourier transform (DFT), used there, is usually computed by a fast Fourier transform (FFT) algorithm. Many computer algebra systems such as Matlab and Mathematica that are capable of symbolic integration are capable of computing Fourier transforms symbolically. The numerical integration approach works on a much broader class of functions than the analytic approach. The DTFT is a common subcase of this more general situation. Only the three most common conventions are included. It may be useful to notice that entry 105 gives a relationship between the Fourier transform of a function and the original function, which can be seen as relating the Fourier transform and its inverse.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-80", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "It may be useful to notice that entry 105 gives a relationship between the Fourier transform of a function and the original function, which can be seen as relating the Fourier transform and its inverse. ^ Depending on the application a Lebesgue integral , distributional , or other approach may be most appropriate. ^ Vretblad (2000) provides solid justification for these formal procedures without going too deeply into functional analysis or the theory of distributions . In quantum field theory , operator-valued Fourier transforms of operator-valued functions of spacetime are in frequent use, see for example Greiner & Reinhardt (1996) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-81", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In quantum field theory , operator-valued Fourier transforms of operator-valued functions of spacetime are in frequent use, see for example Greiner & Reinhardt (1996) . ^ A possible source of confusion is the frequency-shifting property ; i.e. ^ More generally, one can take a sequence of functions that are in the intersection of L and L and that converges to f in the L -norm, and define the Fourier transform of f as the L -limit of the Fourier transforms of these functions. ^ Up to an imaginary constant factor whose magnitude depends on what Fourier transform convention is used.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-82", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "^ More generally, one can take a sequence of functions that are in the intersection of L and L and that converges to f in the L -norm, and define the Fourier transform of f as the L -limit of the Fourier transforms of these functions. ^ Up to an imaginary constant factor whose magnitude depends on what Fourier transform convention is used. ^ For example, to compute the Fourier transform of cos(6π t ) e one might enter the command integrate cos(6*pi*t) exp(−pi*t^2) exp(-i*2*pi*f*t) from -inf to inf into Wolfram Alpha . The direct command fourier transform of cos(6*pi*t) exp(−pi*t^2) would also work for Wolfram Alpha, although the options for the convention (see § Other conventions ) must be changed away from the default option, which is actually equivalent to integrate cos(6*pi*t) exp(−pi*t^2) exp(i*omega*t) /sqrt(2*pi) from -inf to inf .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-83", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The direct command fourier transform of cos(6*pi*t) exp(−pi*t^2) would also work for Wolfram Alpha, although the options for the convention (see § Other conventions ) must be changed away from the default option, which is actually equivalent to integrate cos(6*pi*t) exp(−pi*t^2) exp(i*omega*t) /sqrt(2*pi) from -inf to inf . 1992 ^ Bailey & Swarztrauber 1994 ^ Lado 1971 ^ Simonen & Olkkonen 1985 ^ \"The Integration Property of the Fourier Transform\" . de Groot, Sybren R.; Mazur, Peter (1984), Non-Equilibrium Thermodynamics (2nd ed.), New York: Dover Duoandikoetxea, Javier (2001), Fourier Analysis , American Mathematical Society , Dym, H.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-84", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "We may think of a real sinusoid as being the sum of a positive-frequency and a negative-frequency complex sinusoid. Stein, Elias; Shakarchi, Rami (2003), Fourier Analysis: An introduction , Princeton University Press , Stein, Elias ; Weiss, Guido (1971), Introduction to Fourier Analysis on Euclidean Spaces , Princeton, N.J.: Princeton University Press , Strichartz, Robert S.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-0", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "In mathematics , a finite field or Galois field (so-named in honor of Évariste Galois ) is a field that has a finite number of elements . As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The order of a finite field is its number of elements, which is either a prime number or a prime power . All finite fields of a given order are isomorphic . Finite fields are fundamental in a number of areas of mathematics and computer science , including number theory , algebraic geometry , Galois theory , finite geometry , cryptography and coding theory .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-1", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Finite fields are fundamental in a number of areas of mathematics and computer science , including number theory , algebraic geometry , Galois theory , finite geometry , cryptography and coding theory . The number of elements of a finite field is called its order or, sometimes, its size . This group is cyclic , so all non-zero elements can be expressed as powers of a single element called a primitive element of the field. The multiplicative inverse of an element may be computed by using the extended Euclidean algorithm (see Modular multiplicative inverse § Extended Euclidean algorithm ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-2", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "The multiplicative inverse of an element may be computed by using the extended Euclidean algorithm (see Modular multiplicative inverse § Extended Euclidean algorithm ). Any finite field extension of a finite field is separable and simple. To use a piece of jargon, finite fields are perfect . This was a conjecture of Artin and Dickson , and was proved by Chevalley ; see Chevalley–Warning theorem . Moore : The order of a finite field is a prime power. The multiplicative inverse of a non-zero element may be computed with the extended Euclidean algorithm; see Extended Euclidean algorithm § Simple algebraic field extensions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-3", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "The multiplicative inverse of a non-zero element may be computed with the extended Euclidean algorithm; see Extended Euclidean algorithm § Simple algebraic field extensions . A possible choice for such a polynomial is given by Conway polynomials . In the next sections, we will show how the general construction method outlined above works for small finite fields. This may be deduced as follows from the results of the preceding section. As in any field, division by zero is undefined. The structure theorem of finite abelian groups implies that this multiplicative group is cyclic , that is, all non-zero elements are powers of a single element.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-4", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "The structure theorem of finite abelian groups implies that this multiplicative group is cyclic , that is, all non-zero elements are powers of a single element. This has been used in various cryptographic protocols , see Discrete logarithm for details. Zech's logarithms are useful for large computations, such as linear algebra over medium-sized fields, that is, fields that are sufficiently large for making natural algorithms inefficient, but not too large, as one has to pre-compute a table of the same size as the order of the field. It follows that they are roots of irreducible polynomials of degree 6 over GF(2) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-5", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Zech's logarithms are useful for large computations, such as linear algebra over medium-sized fields, that is, fields that are sufficiently large for making natural algorithms inefficient, but not too large, as one has to pre-compute a table of the same size as the order of the field. It follows that they are roots of irreducible polynomials of degree 6 over GF(2) . This implies that, over GF(2) , there are exactly 9 = ⁠ 54 / 6 ⁠ irreducible monic polynomials of degree 6 . This may be verified by factoring X − X over GF(2) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-6", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "This implies that, over GF(2) , there are exactly 9 = ⁠ 54 / 6 ⁠ irreducible monic polynomials of degree 6 . This may be verified by factoring X − X over GF(2) . The elements of GF(64) are primitive n th roots of unity for some n dividing 63 . Euler's totient function shows that there are 6 primitive 9 th roots of unity, 12 primitive 21 st roots of unity, and 36 primitive 63 rd roots of unity. As the two factors are reciprocal to each other, a root and its (multiplicative) inverse do not belong to the same orbit.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-7", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "As the two factors are reciprocal to each other, a root and its (multiplicative) inverse do not belong to the same orbit. In fact, this generator is a primitive element, and this polynomial is the irreducible polynomial that produces the easiest Euclidean division. It is called the Frobenius automorphism , after Ferdinand Georg Frobenius . Denoting by φ the composition of φ with itself k times, we have φ k : x ↦ x p k . There are no other GF( p ) -automorphisms of GF( q ) . The fact that the Frobenius map is surjective implies that every finite field is perfect .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-8", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "There are no other GF( p ) -automorphisms of GF( q ) . The fact that the Frobenius map is surjective implies that every finite field is perfect . As every polynomial ring over a field is a unique factorization domain , every monic polynomial over a finite field may be factored in a unique way (up to the order of the factors) into a product of irreducible monic polynomials. There are efficient algorithms for testing polynomial irreducibility and factoring polynomials over finite fields. They are a key step for factoring polynomials over the integers or the rational numbers .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-9", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "There are efficient algorithms for testing polynomial irreducibility and factoring polynomials over finite fields. They are a key step for factoring polynomials over the integers or the rational numbers . At least for this reason, every computer algebra system has functions for factoring polynomials over finite fields, or, at least, over finite prime fields. More precisely, this polynomial is the product of all monic polynomials of degree one over a field of order q . This implies that, if q = p then X − X is the product of all monic irreducible polynomials over GF( p ) , whose degree divides n .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-10", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "This implies that, if q = p then X − X is the product of all monic irreducible polynomials over GF( p ) , whose degree divides n . In fact, if P is an irreducible factor over GF( p ) of X − X , its degree divides n , as its splitting field is contained in GF( p ) . Conversely, if P is an irreducible monic polynomial over GF( p ) of degree d dividing n , it defines a field extension of degree d , which is contained in GF( p ) , and all roots of P belong to GF( p ) , and are roots of X − X ; thus P divides X − X .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-11", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Conversely, if P is an irreducible monic polynomial over GF( p ) of degree d dividing n , it defines a field extension of degree d , which is contained in GF( p ) , and all roots of P belong to GF( p ) , and are roots of X − X ; thus P divides X − X . As X − X does not have any multiple factor, it is thus the product of all the irreducible monic polynomials that divide it. This property is used to compute the product of the irreducible factors of each degree of polynomials over GF( p ) ; see Distinct degree factorization .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-12", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "This property is used to compute the product of the irreducible factors of each degree of polynomials over GF( p ) ; see Distinct degree factorization . This formula is an immediate consequence of the property of X − X above and the Möbius inversion formula . By the above formula, the number of irreducible (not necessarily monic) polynomials of degree n over GF( q ) is ( q − 1) N ( q , n ) . For every q and every n , the right hand side is positive, so there is at least one irreducible polynomial of degree n over GF( q ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-13", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For every q and every n , the right hand side is positive, so there is at least one irreducible polynomial of degree n over GF( q ) . It is unique up to isomorphism, as holds for an algebraic closure of any given field. Any algebraic extension is the union of its finite subextensions, so F ¯ p = ⋃ n ≥ 1 F p n . For example, in 2014, a secure internet connection to Wikipedia involved the elliptic curve Diffie–Hellman protocol ( ECDHE ) over a large finite field. In coding theory , many codes are constructed as subspaces of vector spaces over finite fields.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-14", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For example, in 2014, a secure internet connection to Wikipedia involved the elliptic curve Diffie–Hellman protocol ( ECDHE ) over a large finite field. In coding theory , many codes are constructed as subspaces of vector spaces over finite fields. Finite fields are used by many error correction codes , such as Reed–Solomon error correction code or BCH code . The finite field almost always has characteristic of 2 , since computer data is stored in binary. For example, a byte of data can be interpreted as an element of GF(2 ) . One exception is PDF417 bar code, which is GF(929) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-15", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For example, a byte of data can be interpreted as an element of GF(2 ) . One exception is PDF417 bar code, which is GF(929) . Some CPUs have special instructions that can be useful for finite fields of characteristic 2 , generally variations of carry-less product . Finite fields are widely used in number theory , as many problems over the integers may be solved by reducing them modulo one or several prime numbers . For example, the fastest known algorithms for polynomial factorization and linear algebra over the field of rational numbers proceed by reduction modulo one or several primes, and then reconstruction of the solution by using Chinese remainder theorem , Hensel lifting or the LLL algorithm .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-16", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For example, the fastest known algorithms for polynomial factorization and linear algebra over the field of rational numbers proceed by reduction modulo one or several primes, and then reconstruction of the solution by using Chinese remainder theorem , Hensel lifting or the LLL algorithm . Similarly many theoretical problems in number theory can be solved by considering their reductions modulo some or all prime numbers. Many recent developments of algebraic geometry were motivated by the need to enlarge the power of these modular methods. Wiles' proof of Fermat's Last Theorem is an example of a deep result involving many mathematical tools, including finite fields.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-17", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Wiles' proof of Fermat's Last Theorem is an example of a deep result involving many mathematical tools, including finite fields. The Weil conjectures concern the number of points on algebraic varieties over finite fields and the theory has many applications including exponential and character sum estimates. Finite fields have widespread application in combinatorics , two well known examples being the definition of Paley Graphs and the related construction for Hadamard Matrices . In arithmetic combinatorics finite fields and finite field models are used extensively, such as in Szemerédi's theorem on arithmetic progressions. The Artin–Zorn theorem states that all alternative division rings are finite fields.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-18", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "In arithmetic combinatorics finite fields and finite field models are used extensively, such as in Szemerédi's theorem on arithmetic progressions. The Artin–Zorn theorem states that all alternative division rings are finite fields. edit ] Elementary abelian group Field with one element Finite field arithmetic Finite ring Finite group Galois ring Hamming space Quasi-finite field edit ] ^ Dummit, David Steven; Foote, Richard M. (eds.), Mathematical Papers Read at the International Mathematics Congress Held in Connection with the World's Columbian Exposition , Macmillan & Co., pp. 208– 242 ^ This latter notation was introduced by E.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-19", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "(eds.), Mathematical Papers Read at the International Mathematics Congress Held in Connection with the World's Columbian Exposition , Macmillan & Co., pp. 208– 242 ^ This latter notation was introduced by E. ^ Xiang-dong Hou (2018), Lectures on Finite Fields , Graduate Studies in Mathematics, Providence, Rhode Island: American Mathematical Society , p. 3, archived (PDF) from the original on 2008-07-19 ^ Jacobson 2009 , §4.13 ^ On most browsers, this can be verified by looking at the security information available by clicking on the locker displayed near the URL.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-0", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "700 BCE – present Descendants ç ⒞ Ⓒ ⓒ 🄒 🄫 🄯 🄲 🅒 🅲 🇨 Ȼ ₵ ₡ ¢ ℃ ∁ Sisters Г G Գ ( 𐡂 ࠂ ג ܓ ج ) Other Associated numbers 100 This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . C in copyright symbol C ( minuscule : c ) is the third letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is cee (pronounced / ˈ s iː / ), plural cees .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-1", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "C in copyright symbol C ( minuscule : c ) is the third letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is cee (pronounced / ˈ s iː / ), plural cees . The sign is possibly adapted from an Egyptian hieroglyph for a staff sling , which may have been the meaning of the name gimel . Another possibility is that it depicted a camel, the Semitic name for which was gamal . Powell , a specialist in the history of writing, states \"It is hard to imagine how gimel = \"camel\" can be derived from the picture of a camel (it may show his hump, or his head and neck!)\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-2", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Powell , a specialist in the history of writing, states \"It is hard to imagine how gimel = \"camel\" can be derived from the picture of a camel (it may show his hump, or his head and neck!)\". In the Etruscan language , plosive consonants had no contrastive voicing , so the Greek ' Γ ' (Gamma) was adopted into the Etruscan alphabet to represent /k/ . Already in the Western Greek alphabet , Gamma first took a ' ' form in Early Etruscan, then ' ' in Classical Etruscan. In the earliest Latin inscriptions, the letters ' c k q ' were used to represent the sounds /k/ and /ɡ/ (which were not differentiated in writing).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-3", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In the earliest Latin inscriptions, the letters ' c k q ' were used to represent the sounds /k/ and /ɡ/ (which were not differentiated in writing). During the 3rd century BC, a modified character was introduced for /ɡ/ , and ' c ' itself was retained for /k/ . Hence, in the classical period and after, ' g ' was treated as the equivalent of Greek gamma, and ' c ' as the equivalent of kappa; this shows in the romanization of Greek words, as in 'ΚΑΔΜΟΣ', 'ΚΥΡΟΣ', and 'ΦΩΚΙΣ' came into Latin as ' cadmvs ', ' cyrvs ' and ' phocis ', respectively.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-4", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Hence, in the classical period and after, ' g ' was treated as the equivalent of Greek gamma, and ' c ' as the equivalent of kappa; this shows in the romanization of Greek words, as in 'ΚΑΔΜΟΣ', 'ΚΥΡΟΣ', and 'ΦΩΚΙΣ' came into Latin as ' cadmvs ', ' cyrvs ' and ' phocis ', respectively. Other alphabets have letters homoglyphic to 'c' but not analogous in use and derivation, like the Cyrillic letter Es (С, с) which derives from the lunate sigma . Later use When the Roman alphabet was introduced into Britain, ⟨c⟩ represented only /k/ , and this value of the letter has been retained in loanwords to all the insular Celtic languages : in Welsh , Irish , and Gaelic , ⟨c⟩ represents only /k/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-5", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Later use When the Roman alphabet was introduced into Britain, ⟨c⟩ represented only /k/ , and this value of the letter has been retained in loanwords to all the insular Celtic languages : in Welsh , Irish , and Gaelic , ⟨c⟩ represents only /k/ . The Old English Latin-based writing system was learned from the Celts , apparently of Ireland; hence, ⟨c⟩ in Old English also originally represented /k/ ; the Modern English words kin , break , broken , thick , and seek all come from Old English words written with ⟨c⟩ : cyn, brecan, brocen, þicc , and séoc .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-6", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The Old English Latin-based writing system was learned from the Celts , apparently of Ireland; hence, ⟨c⟩ in Old English also originally represented /k/ ; the Modern English words kin , break , broken , thick , and seek all come from Old English words written with ⟨c⟩ : cyn, brecan, brocen, þicc , and séoc . On the continent, meanwhile, a similar phonetic change before the same two vowels had also been going on in almost all of the Romance languages (for example, in Italian ). Yet for these new sounds, ⟨ c ⟩ was still used before the letters ⟨e⟩ and ⟨i⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-7", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Yet for these new sounds, ⟨ c ⟩ was still used before the letters ⟨e⟩ and ⟨i⟩ . Subsequently, the Latin phoneme /k / (spelled ⟨ qv ⟩ ) de-labialized to /k/ , meaning that the various Romance languages had /k/ before front vowels. In addition, Norman used the letter ⟨k⟩ so that the sound /k/ could be represented by either ⟨k⟩ or ⟨c⟩ , the latter of which could represent either /k/ or /ts/ depending on whether it preceded a front vowel letter or not. The convention of using both ⟨c⟩ and ⟨k⟩ was applied to the writing of English after the Norman Conquest , causing a considerable re-spelling of the Old English words.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-8", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The convention of using both ⟨c⟩ and ⟨k⟩ was applied to the writing of English after the Norman Conquest , causing a considerable re-spelling of the Old English words. Thus, while Old English candel, clif, corn, crop , and cú , remained unchanged, cent, cǣᵹ (cēᵹ), cyng, brece , and sēoce , were now (without any change of sound) spelled Kent, keȝ, kyng, breke , and seoke ; even cniht ( ' knight ' ) was subsequently changed to kniht , and þic ( ' thick ' ) was changed to thik or thikk .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-9", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Thus, while Old English candel, clif, corn, crop , and cú , remained unchanged, cent, cǣᵹ (cēᵹ), cyng, brece , and sēoce , were now (without any change of sound) spelled Kent, keȝ, kyng, breke , and seoke ; even cniht ( ' knight ' ) was subsequently changed to kniht , and þic ( ' thick ' ) was changed to thik or thikk . The Old English ⟨cw⟩ was also at length displaced by the French ⟨qu⟩ so that the Old English cwēn ( ' queen ' ) and cwic ( ' quick ' ) became Middle English quen and quik , respectively.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-10", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The Old English ⟨cw⟩ was also at length displaced by the French ⟨qu⟩ so that the Old English cwēn ( ' queen ' ) and cwic ( ' quick ' ) became Middle English quen and quik , respectively. In French, it was represented by the digraph ⟨ch⟩ , as in champ (from Latin camp-um ), and this spelling was introduced into English: the Hatton Gospels , written c. i-iii, child, chyld, riche , and mychel , for the cild, rice , and mycel of the Old English version whence they were copied. In these cases, the Old English ⟨c⟩ gave way to ⟨k⟩ , ⟨qu⟩ and ⟨ch⟩ ; on the other hand, ⟨c⟩ in its new value of /ts/ appeared largely in French words like processiun, emperice , and grace and was also substituted for ⟨ts⟩ in a few Old English words, as miltse, bletsien , in early Middle English milce, blecien .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-11", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In these cases, the Old English ⟨c⟩ gave way to ⟨k⟩ , ⟨qu⟩ and ⟨ch⟩ ; on the other hand, ⟨c⟩ in its new value of /ts/ appeared largely in French words like processiun, emperice , and grace and was also substituted for ⟨ts⟩ in a few Old English words, as miltse, bletsien , in early Middle English milce, blecien . By the end of the thirteenth century, both in France and England, this sound /ts/ was de-affricated to /s/ ; and from that time, ⟨c⟩ has represented /s/ before front vowels either for etymological reasons, as in lance , cent , or to avoid the ambiguity due to the \"etymological\" use of ⟨s⟩ for /z/ , as in ace , mice , once , pence , defence .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-12", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "By the end of the thirteenth century, both in France and England, this sound /ts/ was de-affricated to /s/ ; and from that time, ⟨c⟩ has represented /s/ before front vowels either for etymological reasons, as in lance , cent , or to avoid the ambiguity due to the \"etymological\" use of ⟨s⟩ for /z/ , as in ace , mice , once , pence , defence . Thus, to show etymology, English spelling has advise , devise (instead of *advize , *devize ), while advice , device , dice , ice , mice , twice , etc., do not reflect etymology; example has extended this to hence , pence , defence , etc., where there is no etymological reason for using ⟨c⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-13", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Thus, to show etymology, English spelling has advise , devise (instead of *advize , *devize ), while advice , device , dice , ice , mice , twice , etc., do not reflect etymology; example has extended this to hence , pence , defence , etc., where there is no etymological reason for using ⟨c⟩ . Hence, today, the Romance languages and English have a common feature inherited from Vulgar Latin spelling conventions where ⟨c⟩ takes on either a \"hard\" or \"soft\" value depending on the following letter. Use in writing systems Hard and soft C English In English orthography , ⟨c⟩ generally represents the \"soft\" value of / s / before the letters ⟨e⟩ (including the Latin-derived digraphs ⟨ae⟩ and ⟨oe⟩ , or the corresponding ligatures ⟨æ⟩ and ⟨œ⟩ ), ⟨i⟩ , and ⟨y⟩ , and a \"hard\" value of / k / before any other letters or at the end of a word.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-14", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Use in writing systems Hard and soft C English In English orthography , ⟨c⟩ generally represents the \"soft\" value of / s / before the letters ⟨e⟩ (including the Latin-derived digraphs ⟨ae⟩ and ⟨oe⟩ , or the corresponding ligatures ⟨æ⟩ and ⟨œ⟩ ), ⟨i⟩ , and ⟨y⟩ , and a \"hard\" value of / k / before any other letters or at the end of a word. However, there are a number of exceptions in English: \" soccer \", \" celt \" and \" sceptic \" are words that have / k / where / s / would be expected.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-15", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "However, there are a number of exceptions in English: \" soccer \", \" celt \" and \" sceptic \" are words that have / k / where / s / would be expected. The \"soft\" ⟨c⟩ may represent the / ʃ / sound in the digraph ⟨ci⟩ when this precedes a vowel, as in the words 'delicious' and 'appreciate', and also in the word \"ocean\" and its derivatives. The digraph ⟨ ch ⟩ most commonly represents / tʃ / , but can also represent / k / (mainly in words of Greek origin) or / ʃ / (mainly in words of French origin).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-16", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The digraph ⟨ ch ⟩ most commonly represents / tʃ / , but can also represent / k / (mainly in words of Greek origin) or / ʃ / (mainly in words of French origin). For some dialects of English, it may also represent / x / in words like loch , while other speakers pronounce the final sound as / k / . C is the twelfth most frequently used letter in the English language (after E , T , A , O , I , N , S , H , R , D , and L ), with a frequency of about 2.8% in words.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-17", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "C is the twelfth most frequently used letter in the English language (after E , T , A , O , I , N , S , H , R , D , and L ), with a frequency of about 2.8% in words. Other languages In the Romance languages French , Spanish , Italian , Romanian , Catalan , and Portuguese , ⟨c⟩ generally has a \"hard\" value of /k/ and a \"soft\" value whose pronunciation varies by language. In French, Portuguese, Catalan, and Spanish from Latin America and some places in Spain, the soft ⟨c⟩ value is /s/ as it is in English.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-18", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In French, Portuguese, Catalan, and Spanish from Latin America and some places in Spain, the soft ⟨c⟩ value is /s/ as it is in English. In the Spanish spoken in most of Spain, the soft ⟨c⟩ is a voiceless dental fricative /θ/ . Germanic languages usually use ⟨c⟩ for Romance loans or digraphs, such as ⟨ch⟩ and ⟨ck⟩ , but the rules vary across languages. Of all the Germanic languages, only English uses the initial ⟨c⟩ in native Germanic words like come . Other than English, Dutch uses ⟨c⟩ the most, for most Romance loans and the digraph ⟨ch⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-19", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Of all the Germanic languages, only English uses the initial ⟨c⟩ in native Germanic words like come . Other than English, Dutch uses ⟨c⟩ the most, for most Romance loans and the digraph ⟨ch⟩ . German uses ⟨c⟩ in the digraphs ⟨ch⟩ and ⟨ck⟩ , and the trigraph ⟨sch⟩ , but by itself only in unassimilated loanwords and proper names. Swedish has the same rules for soft and hard ⟨c⟩ as Danish, and also uses ⟨c⟩ in the digraph ⟨ck⟩ and the very common word och , \"and\". Norwegian , Afrikaans , and Icelandic are the most restrictive, replacing all cases of ⟨c⟩ with ⟨k⟩ or ⟨s⟩ , and reserving ⟨c⟩ for unassimilated loanwords and names.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-20", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Norwegian , Afrikaans , and Icelandic are the most restrictive, replacing all cases of ⟨c⟩ with ⟨k⟩ or ⟨s⟩ , and reserving ⟨c⟩ for unassimilated loanwords and names. In Hanyu Pinyin , the standard romanization of Mandarin Chinese , the letter represents an aspirated version of this sound, /t͡s / . Yup'ik , Indonesian , Malay , and a number of African languages such as Hausa , Fula , and Manding share the soft Italian value of /t͡ʃ/ . In Azeri , Crimean Tatar , Kurmanji Kurdish , and Turkish , ⟨c⟩ stands for the voiced counterpart of this sound, the voiced postalveolar affricate /d͡ʒ/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-21", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In Azeri , Crimean Tatar , Kurmanji Kurdish , and Turkish , ⟨c⟩ stands for the voiced counterpart of this sound, the voiced postalveolar affricate /d͡ʒ/ . In some other African languages, such as Berber languages , ⟨c⟩ is used for /ʃ/ . In Fijian , ⟨c⟩ stands for a voiced dental fricative /ð/ , while in Somali it has the value of / ʕ / . The letter ⟨c⟩ is also used as a transliteration of Cyrillic ⟨ц⟩ in the Latin forms of Serbian , Macedonian , and sometimes Ukrainian , along with the digraph ⟨ts⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-22", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The letter ⟨c⟩ is also used as a transliteration of Cyrillic ⟨ц⟩ in the Latin forms of Serbian , Macedonian , and sometimes Ukrainian , along with the digraph ⟨ts⟩ . Other systems As a phonetic symbol, lowercase ⟨ c ⟩ is the International Phonetic Alphabet (IPA) and X-SAMPA symbol for the voiceless palatal plosive , and capital ⟨C⟩ is the X-SAMPA symbol for the voiceless palatal fricative . Digraphs There are several common digraphs with ⟨c⟩ , the most common being ⟨ ch ⟩ , which in some languages (such as German ) is far more common than ⟨c⟩ alone.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-23", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Digraphs There are several common digraphs with ⟨c⟩ , the most common being ⟨ ch ⟩ , which in some languages (such as German ) is far more common than ⟨c⟩ alone. As in English, ⟨ck⟩ , with the value /k/ , is often used after short vowels in other Germanic languages such as German and Swedish (other Germanic languages, such as Dutch and Norwegian , use ⟨kk⟩ instead). The digraph ⟨cz⟩ is found in Polish and ⟨cs⟩ in Hungarian, representing /t͡ʂ/ and /t͡ʃ/ respectively. The digraph ⟨sc⟩ represents /ʃ/ in Old English, Italian, and a few languages related to Italian (where this only happens before front vowels , while otherwise it represents /sk/ ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-24", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The digraph ⟨sc⟩ represents /ʃ/ in Old English, Italian, and a few languages related to Italian (where this only happens before front vowels , while otherwise it represents /sk/ ). ⟨ꟲ⟩ : Modifier letter capital ⟨c⟩ – Used to mark tone for the Chatino orthography in Oaxaca, Mexico ; used as a generic transcription for a falling tone; also used in para- IPA notation. ⟨ ᶜ ⟩ : Modifier letter small c ⟨ ᶝ ⟩ : Modifier letter small ⟨c⟩ with curl ⟨ᴄ⟩ : Small capital ⟨c⟩ is used in the Uralic Phonetic Alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-25", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "⟨ ᶜ ⟩ : Modifier letter small c ⟨ ᶝ ⟩ : Modifier letter small ⟨c⟩ with curl ⟨ᴄ⟩ : Small capital ⟨c⟩ is used in the Uralic Phonetic Alphabet . ⟨Ꞔ⟩ ⟨ꞔ⟩ : ⟨C⟩ with palatal hook, used for writing Mandarin Chinese using the early draft version of pinyin romanization during the mid-1950s. Other representations Computing The Latin letters ⟨C⟩ and ⟨c⟩ have Unicode encodings U+0043 C LATIN CAPITAL LETTER C and U+0063 c LATIN SMALL LETTER C . These are the same code points as those used in ASCII and ISO 8859 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-26", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Other representations Computing The Latin letters ⟨C⟩ and ⟨c⟩ have Unicode encodings U+0043 C LATIN CAPITAL LETTER C and U+0063 c LATIN SMALL LETTER C . These are the same code points as those used in ASCII and ISO 8859 . There are also precomposed character encodings for ⟨C⟩ and ⟨c⟩ with diacritics, for most of those listed above ; the remainder are produced using combining diacritics . Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, voiceless palatal sounds in linguistics, and halfwidth and fullwidth forms for legacy CJK font compatibility.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-27", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "450-1100)-language text Articles containing Middle English (1100-1500)-language text Articles containing French-language text Articles containing Latin-language text Articles containing Anglo-Norman-language text Articles containing Greek-language text Commons link from Wikidata Search Search C 169 languages Add topic", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum-0", "source": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum", "title": "Cardinality of the continuum", "text": "The inequality was later stated more simply in his diagonal argument in 1891. Cantor defined cardinality in terms of bijective functions : two sets have the same cardinality if, and only if, there exists a bijective function between them. Between any two real numbers a b , no matter how close they are to each other, there are always infinitely many other real numbers, and Cantor showed that they are as many as those contained in the whole set of real numbers. This hypothesis is independent of the widely used Zermelo–Fraenkel set theory with axiom of choice (ZFC); that is, ZFC can neither prove that it is true nor that it is false.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum-1", "source": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum", "title": "Cardinality of the continuum", "text": "This hypothesis is independent of the widely used Zermelo–Fraenkel set theory with axiom of choice (ZFC); that is, ZFC can neither prove that it is true nor that it is false. He famously showed that the set of real numbers is uncountably infinite . This can be shown by providing one-to-one mappings in both directions between subsets of a countably infinite set and real numbers, and applying the Cantor–Bernstein–Schroeder theorem according to which two sets with one-to-one mappings in both directions have the same cardinality. In one direction, reals can be equated with Dedekind cuts , sets of rational numbers, or with their binary expansions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum-2", "source": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum", "title": "Cardinality of the continuum", "text": "In one direction, reals can be equated with Dedekind cuts , sets of rational numbers, or with their binary expansions . That is, both the hypothesis and its negation are consistent with these axioms. The same is true for most other alephs, although in some cases, equality can be ruled out by König's theorem on the grounds of cofinality (e.g. This article incorporates material from cardinality of the continuum on PlanetMath , which is licensed under the .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-0", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "700 BCE to present Descendants ɮ Ꝇ ꝇ ℒ ℓ £ Ł ᛚ ꬸ Sisters Л Љ Ӆ Ԯ ל ل ܠ ⵍ ࠋ 𐡋 ለ ℓ Other Associated graphs l(x) , lj , ll , ly Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . L ( minuscule : l ) is the twelfth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other Western European languages and others worldwide. Its name in English is el (pronounced / ˈ ɛ l / EL ), plural els .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-1", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "L ( minuscule : l ) is the twelfth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other Western European languages and others worldwide. Its name in English is el (pronounced / ˈ ɛ l / EL ), plural els . History Lamedh may have come from a pictogram of an ox goad or cattle prod . In most sans-serif typefaces, the lowercase letter ell ⟨l⟩ , written as the glyph l , may be difficult to distinguish from the uppercase letter \"eye\" ⟨ I ⟩ (written as the glyph I ); in some serif typefaces, the glyph l may be confused with the glyph 1 , the digit one .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-2", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "In most sans-serif typefaces, the lowercase letter ell ⟨l⟩ , written as the glyph l , may be difficult to distinguish from the uppercase letter \"eye\" ⟨ I ⟩ (written as the glyph I ); in some serif typefaces, the glyph l may be confused with the glyph 1 , the digit one . To avoid such confusion, some newer computer fonts (such as Trebuchet MS ) have a finial , a curve to the right at the bottom of the lowercase letter ell . Other style variants are provided in script typefaces and display typefaces .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-3", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "To avoid such confusion, some newer computer fonts (such as Trebuchet MS ) have a finial , a curve to the right at the bottom of the lowercase letter ell . Other style variants are provided in script typefaces and display typefaces . All these variants of the letter are encoded in Unicode as U+004C L LATIN CAPITAL LETTER L or U+006C l LATIN SMALL LETTER L , allowing presentation to be chosen according to each context. For specialist mathematical and scientific use, there are a number of dedicated codepoints in the Mathematical Alphanumeric Symbols block .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-4", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "For specialist mathematical and scientific use, there are a number of dedicated codepoints in the Mathematical Alphanumeric Symbols block . In the Romain du Roi , where the ascenders of lowercase letters have symmetrical serifs at the top, l has an extra serif to the left at the mean line to distinguish it from capital I . Another means of reducing such confusion is to use symbol ℓ , which is a cursive , handwriting-style lowercase form of the letter \"ell\". In Japan and Korea, for example, this is the symbol for the liter .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-5", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Another means of reducing such confusion is to use symbol ℓ , which is a cursive , handwriting-style lowercase form of the letter \"ell\". In Japan and Korea, for example, this is the symbol for the liter . (The International Committee for Weights and Measures recommends using L or l for the liter, without specifying a typeface.) In Unicode , the cursive form is encoded as U+2113 ℓ SCRIPT SMALL L from the \" letter-like symbols \" block. In mathematical formulas, an italic form ( ℓ ) of the script ℓ is the norm. Use in writing systems English In English orthography , ⟨l⟩ usually represents the phoneme / l / , which can have several sound values, depending on the speaker's accent, and whether it occurs before or after a vowel.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-6", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Use in writing systems English In English orthography , ⟨l⟩ usually represents the phoneme / l / , which can have several sound values, depending on the speaker's accent, and whether it occurs before or after a vowel. This velarization does not occur in many European languages that use ⟨l⟩ ; it is also a factor making the pronunciation of ⟨l⟩ difficult for users of languages that lack ⟨l⟩ or have different values for it, such as Japanese or some southern dialects of Chinese . A medical condition or speech impediment restricting the pronunciation of ⟨l⟩ is known as lambdacism .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-7", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "This velarization does not occur in many European languages that use ⟨l⟩ ; it is also a factor making the pronunciation of ⟨l⟩ difficult for users of languages that lack ⟨l⟩ or have different values for it, such as Japanese or some southern dialects of Chinese . A medical condition or speech impediment restricting the pronunciation of ⟨l⟩ is known as lambdacism . In English orthography, ⟨l⟩ is often silent in such words as walk or could (though its presence can modify the preceding vowel letter's value), and it is usually silent in such words as palm and psalm ; however, there is some regional variation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-8", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "In English orthography, ⟨l⟩ is often silent in such words as walk or could (though its presence can modify the preceding vowel letter's value), and it is usually silent in such words as palm and psalm ; however, there is some regional variation. L is the eleventh most frequently used letter in the English language. Other systems The International Phonetic Alphabet uses ⟨ l ⟩ to represent the voiced alveolar lateral approximant and a small cap ⟨ ʟ ⟩ to represent the voiced velar lateral approximant . It was often used, especially in handwriting, as the currency sign for the Italian lira .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-9", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Other systems The International Phonetic Alphabet uses ⟨ l ⟩ to represent the voiced alveolar lateral approximant and a small cap ⟨ ʟ ⟩ to represent the voiced velar lateral approximant . It was often used, especially in handwriting, as the currency sign for the Italian lira . In running text, its lower-case form (usually italicised ), l , was more often seen. In the International system of units , the liter (or litre) is abbreviated using a lower-case l or ℓ , or an upper-case L . The latter form is used to avoid the risk of confusion between the letter l (el) and the numeral 1 (one) (For ℓ, see above .) In watchmaking, the ligne (a traditional French measure of length still used in the industry) is abbreviated using an upper-case L.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-10", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "The latter form is used to avoid the risk of confusion between the letter l (el) and the numeral 1 (one) (For ℓ, see above .) In watchmaking, the ligne (a traditional French measure of length still used in the industry) is abbreviated using an upper-case L. In chemistry, L is used as a symbol (as is N A ) for the Avogadro constant . Without proper rendering support , you may see question marks, boxes, or other symbols . In Unicode, these are U+A780 Ꞁ LATIN CAPITAL LETTER TURNED L and U+A781 ꞁ LATIN SMALL LETTER TURNED L .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-11", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "In Unicode, these are U+A780 Ꞁ LATIN CAPITAL LETTER TURNED L and U+A781 ꞁ LATIN SMALL LETTER TURNED L . 𝼦 : Small letter l with mid-height left hook was used by the British and Foreign Bible Society in the early 20th century for romanization of the Malayalam language. These are the same code points as those used in ASCII and ISO 8859 . There are also precomposed character encodings for ⟨L⟩ and ⟨l⟩ with diacritics, for most of those listed above ; the remainder are produced using combining diacritics . Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, and halfwidth and fullwidth forms for legacy CJK font compatibility.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-12", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, and halfwidth and fullwidth forms for legacy CJK font compatibility. Other For example, see the Diary of Samuel Pepys for 31 December 1661: \" I suppose myself to be worth about 500 l. The alternative symbol, capital L, was adopted by the 16th CGPM (1979, Resolution 6; CR, 101 and Metrologia, 1980, 16, 56-57) in order to avoid the risk of confusion between the letter l (el) and the numeral 1 (one). ^ Everson, Michael; Baker, Peter; Emiliano, António; Grammel, Florian; Haugen, Odd Einar; Luft, Diana; Pedro, Susana; Schumacher, Gerd; Stötzner, Andreas (January 30, 2006).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-13", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "^ Everson, Michael; Baker, Peter; Emiliano, António; Grammel, Florian; Haugen, Odd Einar; Luft, Diana; Pedro, Susana; Schumacher, Gerd; Stötzner, Andreas (January 30, 2006). 230 ^ Everson, Michael; Baker, Peter; Emiliano, António; Grammel, Florian; Haugen, Odd Einar; Luft, Diana; Pedro, Susana; Schumacher, Gerd; Stötzner, Andreas (January 30, 2006).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-0", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The functions are often denoted using a lowercase symbol for the time-domain function and the corresponding uppercase symbol for the frequency-domain function, e.g. The transform is useful for converting differentiation and integration in the time domain into the algebraic operations multiplication and division in the Laplace domain (analogous to how logarithms are useful for simplifying multiplication and division into addition and subtraction). This gives the transform many applications in science and engineering , mostly as a tool for solving linear differential equations and dynamical systems by replacing ordinary differential equations and integral equations with algebraic polynomial equations , and by replacing convolution with multiplication .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-1", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "This gives the transform many applications in science and engineering , mostly as a tool for solving linear differential equations and dynamical systems by replacing ordinary differential equations and integral equations with algebraic polynomial equations , and by replacing convolution with multiplication . Once solved, the inverse Laplace transform can be used to transform it to the original domain. This is often aided by referencing tables such as that given below . The Laplace transform is related to many other transforms. It is essentially the same as the Mellin transform and is closely related to the Fourier transform .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-2", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "It is essentially the same as the Mellin transform and is closely related to the Fourier transform . Unlike for the Fourier transform, the Laplace transform of a function is often an analytic function , meaning that it can be expressed as a power series that converges locally, the coefficients of which represent the moments of the original function. Moreover, the techniques of complex analysis , especially contour integrals , can be used for simplifying calculations. Laplace wrote extensively about the use of generating functions (1814), and the integral form of the Laplace transform evolved naturally as a result.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-3", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Laplace wrote extensively about the use of generating functions (1814), and the integral form of the Laplace transform evolved naturally as a result. Laplace's use of generating functions was similar to what is now known as the z-transform , and he gave little attention to the continuous variable case which was discussed by Niels Henrik Abel . These types of integrals seem first to have attracted Laplace's attention in 1782, where he was following in the spirit of Euler in using the integrals themselves as solutions of equations. However, in 1785, Laplace took the critical step forward when, rather than simply looking for a solution in the form of an integral, he started to apply the transforms in the sense that was later to become popular.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-4", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "However, in 1785, Laplace took the critical step forward when, rather than simply looking for a solution in the form of an integral, he started to apply the transforms in the sense that was later to become popular. He then went on to apply the Laplace transform in the same way and started to derive some of its properties, beginning to appreciate its potential power. Laplace also recognised that Joseph Fourier 's method of Fourier series for solving the diffusion equation could only apply to a limited region of space, because those solutions were periodic .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-5", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Laplace also recognised that Joseph Fourier 's method of Fourier series for solving the diffusion equation could only apply to a limited region of space, because those solutions were periodic . In 1821, Cauchy developed an operational calculus for the Laplace transform that could be used to study linear differential equations in much the same way the transform is now used in basic engineering. This method was popularized, and perhaps rediscovered, by Oliver Heaviside around the turn of the century. Bernhard Riemann used the Laplace transform in his 1859 paper On the number of primes less than a given magnitude , in which he also developed the inversion theorem.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-6", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Bernhard Riemann used the Laplace transform in his 1859 paper On the number of primes less than a given magnitude , in which he also developed the inversion theorem. Riemann used the Laplace transform to develop the functional equation of the Riemann zeta function , and his method is still used to relate the modular transformation law of the Jacobi theta function , which is readily proved via Poisson summation , to the functional equation. Hjalmar Mellin was among the first to study the Laplace transform rigorously in the Karl Weierstrass school of analysis, and apply it to the study of differential equations and special functions , at the turn of the 20th century.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-7", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Hjalmar Mellin was among the first to study the Laplace transform rigorously in the Karl Weierstrass school of analysis, and apply it to the study of differential equations and special functions , at the turn of the 20th century. At around the same time, Heaviside was busy with his operational calculus. In 1929, Vannevar Bush and Norbert Wiener published Operational Circuit Analysis as a text for engineering analysis of electrical circuits, applying both Fourier transforms and operational calculus, and in which they included one of the first predecessors of the modern table of Laplace transforms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-8", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In 1929, Vannevar Bush and Norbert Wiener published Operational Circuit Analysis as a text for engineering analysis of electrical circuits, applying both Fourier transforms and operational calculus, and in which they included one of the first predecessors of the modern table of Laplace transforms. In 1934, Raymond Paley and Norbert Wiener published the important work Fourier transforms in the complex domain , about what is now called the Laplace transform (see below). Also during the 30s, the Laplace transform was instrumental in Godfrey Harold Hardy and John Edensor Littlewood 's study of tauberian theorems , and this application was later expounded on by Widder (1941) , who developed other aspects of the theory such as a new method for inversion.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-9", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Also during the 30s, the Laplace transform was instrumental in Godfrey Harold Hardy and John Edensor Littlewood 's study of tauberian theorems , and this application was later expounded on by Widder (1941) , who developed other aspects of the theory such as a new method for inversion. The current widespread use of the transform (mainly in engineering) came about during and soon after World War II , replacing the earlier Heaviside operational calculus . However, for many applications it is necessary to regard it as a conditionally convergent improper integral at ∞ . Still more generally, the integral can be understood in a weak sense , and this is dealt with below.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-10", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Still more generally, the integral can be understood in a weak sense , and this is dealt with below. In operational calculus , the Laplace transform of a measure is often treated as though the measure came from a probability density function f . Although with the Lebesgue integral, it is not necessary to take such a limit, it does appear more naturally in connection with the Laplace–Stieltjes transform . The Laplace transform can be alternatively defined as the bilateral Laplace transform , or two-sided Laplace transform , by extending the limits of integration to be the entire real axis.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-11", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The Laplace transform can be alternatively defined as the bilateral Laplace transform , or two-sided Laplace transform , by extending the limits of integration to be the entire real axis. If that is done, the common unilateral transform becomes a special case of the bilateral transform, where the definition of the function being transformed includes being multiplied by the Heaviside step function . This means that, on the range of the transform, there is an inverse transform. In fact, besides integrable functions, the Laplace transform is a one-to-one mapping from one function space into another in many other function spaces as well, although there is usually no easy characterization of the range.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-12", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In fact, besides integrable functions, the Laplace transform is a one-to-one mapping from one function space into another in many other function spaces as well, although there is usually no easy characterization of the range. Typical function spaces in which this is true include the spaces of bounded continuous functions, the space L (0, ∞) , or more generally tempered distributions on (0, ∞) . The Laplace transform is also defined and injective for suitable spaces of tempered distributions. In these cases, the image of the Laplace transform lives in a space of analytic functions in the region of convergence .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-13", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In these cases, the image of the Laplace transform lives in a space of analytic functions in the region of convergence . In most applications, the contour can be closed, allowing the use of the residue theorem . An alternative formula for the inverse Laplace transform is given by Post's inversion formula . The limit here is interpreted in the weak-* topology . In practice, it is typically more convenient to decompose a Laplace transform into known transforms of functions obtained from a table and construct the inverse by inspection. By convention , this is referred to as the Laplace transform of the random variable X itself.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-14", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In practice, it is typically more convenient to decompose a Laplace transform into known transforms of functions obtained from a table and construct the inverse by inspection. By convention , this is referred to as the Laplace transform of the random variable X itself. The Laplace transform has applications throughout probability theory, including first passage times of stochastic processes such as Markov chains , and renewal theory . The resulting space of abstract operators is exactly equivalent to Laplace space, but in this construction the forward and reverse transforms never need to be explicitly defined (avoiding the related difficulties with proving convergence).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-15", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The resulting space of abstract operators is exactly equivalent to Laplace space, but in this construction the forward and reverse transforms never need to be explicitly defined (avoiding the related difficulties with proving convergence). The Laplace transform is usually understood as conditionally convergent , meaning that it converges in the former but not in the latter sense. The set of values for which F ( s ) converges absolutely is either of the form Re( s ) > a or Re( s ) ≥ a , where a is an extended real constant with −∞ ≤ a ≤ ∞ (a consequence of the dominated convergence theorem ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-16", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The set of values for which F ( s ) converges absolutely is either of the form Re( s ) > a or Re( s ) ≥ a , where a is an extended real constant with −∞ ≤ a ≤ ∞ (a consequence of the dominated convergence theorem ). The constant a is known as the abscissa of absolute convergence, and depends on the growth behavior of f ( t ) . Analogously, the two-sided transform converges absolutely in a strip of the form a s ) b , and possibly including the lines Re( s ) = a or Re( s ) = b .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-17", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Analogously, the two-sided transform converges absolutely in a strip of the form a s ) b , and possibly including the lines Re( s ) = a or Re( s ) = b . The subset of values of s for which the Laplace transform converges absolutely is called the region of absolute convergence, or the domain of absolute convergence. In the two-sided case, it is sometimes called the strip of absolute convergence. The Laplace transform is analytic in the region of absolute convergence: this is a consequence of Fubini's theorem and Morera's theorem .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-18", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The Laplace transform is analytic in the region of absolute convergence: this is a consequence of Fubini's theorem and Morera's theorem . Similarly, the set of values for which F ( s ) converges (conditionally or absolutely) is known as the region of conditional convergence, or simply the region of convergence (ROC). If the Laplace transform converges (conditionally) at s = s 0 , then it automatically converges for all s with Re( s ) > Re( s 0 ) . Therefore, the region of convergence is a half-plane of the form Re( s ) > a , possibly including some points of the boundary line Re( s ) = a .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-19", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Therefore, the region of convergence is a half-plane of the form Re( s ) > a , possibly including some points of the boundary line Re( s ) = a . There are several Paley–Wiener theorems concerning the relationship between the decay properties of f , and the properties of the Laplace transform within the region of convergence. In engineering applications, a function corresponding to a linear time-invariant (LTI) system is stable if every bounded input produces a bounded output. This is equivalent to the absolute convergence of the Laplace transform of the impulse response function in the region Re( s ) ≥ 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-20", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "This is equivalent to the absolute convergence of the Laplace transform of the impulse response function in the region Re( s ) ≥ 0 . As a result, LTI systems are stable, provided that the poles of the Laplace transform of the impulse response function have negative real part. This ROC is used in knowing about the causality and stability of a system. Thus, the Laplace variable s is also known as an operator variable in the Laplace domain: either the derivative operator or (for s ) the integration operator . The final value theorem is useful because it gives the long-term behaviour without having to perform partial fraction decompositions (or other difficult algebra).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-21", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The final value theorem is useful because it gives the long-term behaviour without having to perform partial fraction decompositions (or other difficult algebra). If the first n moments of f converge absolutely, then by repeated differentiation under the integral , ( − 1 ) n ( L f ) ( n ) ( 0 ) = μ n . This method can be used to compute integrals that would otherwise be difficult to compute using elementary methods of real calculus. In general, the Laplace–Stieltjes transform is the Laplace transform of the Stieltjes measure associated to g .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-22", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "This method can be used to compute integrals that would otherwise be difficult to compute using elementary methods of real calculus. In general, the Laplace–Stieltjes transform is the Laplace transform of the Stieltjes measure associated to g . So in practice, the only distinction between the two transforms is that the Laplace transform is thought of as operating on the density function of the measure, whereas the Laplace–Stieltjes transform is thought of as operating on its cumulative distribution function . Indeed, the Fourier transform is a special case (under certain conditions) of the bilateral Laplace transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-23", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "So in practice, the only distinction between the two transforms is that the Laplace transform is thought of as operating on the density function of the measure, whereas the Laplace–Stieltjes transform is thought of as operating on its cumulative distribution function . Indeed, the Fourier transform is a special case (under certain conditions) of the bilateral Laplace transform. The Laplace transform is usually restricted to transformation of functions of t with t ≥ 0 . A consequence of this restriction is that the Laplace transform of a function is a holomorphic function of the variable s .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-24", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "A consequence of this restriction is that the Laplace transform of a function is a holomorphic function of the variable s . Unlike the Fourier transform, the Laplace transform of a distribution is generally a well-behaved function. Techniques of complex variables can also be used to directly study Laplace transforms. This relationship between the Laplace and Fourier transforms is often used to determine the frequency spectrum of a signal or dynamical system. The above relation is valid as stated if and only if the region of convergence (ROC) of F ( s ) contains the imaginary axis, σ = 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-25", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The above relation is valid as stated if and only if the region of convergence (ROC) of F ( s ) contains the imaginary axis, σ = 0 . As s = iω 0 is a pole of F ( s ) , substituting s = iω in F ( s ) does not yield the Fourier transform of f ( t ) u ( t ) , which contains terms proportional to the Dirac delta functions δ ( ω ± ω 0 ) . For instance, this holds for the above example provided that the limit is understood as a weak limit of measures (see vague topology ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-26", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "For instance, this holds for the above example provided that the limit is understood as a weak limit of measures (see vague topology ). General conditions relating the limit of the Laplace transform of a function on the boundary to the Fourier transform take the form of Paley–Wiener theorems . Comparing the last two equations, we find the relationship between the unilateral Z-transform and the Laplace transform of the sampled signal, X q ( s ) = X ( z ) | z = e s T . The generalized Borel transform allows a different weighting function to be used, rather than the exponential function, to transform functions not of exponential type.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-27", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The generalized Borel transform allows a different weighting function to be used, rather than the exponential function, to transform functions not of exponential type. However, a different point of view and different characteristic problems are associated with each of these four major integral transforms. Because the Laplace transform is a linear operator , The Laplace transform of a sum is the sum of Laplace transforms of each term. The unilateral Laplace transform takes as input a function whose time domain is the non-negative reals, which is why all of the time domain functions in the table below are multiples of the Heaviside step function , u ( t ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-28", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The unilateral Laplace transform takes as input a function whose time domain is the non-negative reals, which is why all of the time domain functions in the table below are multiples of the Heaviside step function , u ( t ) . The entries of the table that involve a time delay τ are required to be causal (meaning that τ > 0 ). A causal system is a system where the impulse response h ( t ) is zero for all time t prior to t = 0 . In general, the region of convergence for causal systems is not the same as that of anticausal systems .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-29", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In general, the region of convergence for causal systems is not the same as that of anticausal systems . Circuit elements can be transformed into impedances , very similar to phasor impedances. Here is a summary of equivalents: s -domain equivalent circuits Note that the resistor is exactly the same in the time domain and the s -domain. The are put in if there are initial conditions on the circuit elements. For example, if a capacitor has an initial voltage across it, or if the inductor has an initial current through it, the inserted in the s -domain account for that.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-30", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "For example, if a capacitor has an initial voltage across it, or if the inductor has an initial current through it, the inserted in the s -domain account for that. The equivalents for current and voltage are derived from the transformations in the table above. Performing this calculation in Laplace space turns the convolution into a multiplication; the latter being easier to solve because of its algebraic form. The Laplace transform is invertible on a large class of functions. Given a mathematical or functional description of an input or output to a system , the Laplace transform provides an alternative functional description that often simplifies the process of analyzing the behavior of the system, or in synthesizing a new system based on a set of specifications.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-31", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Given a mathematical or functional description of an input or output to a system , the Laplace transform provides an alternative functional description that often simplifies the process of analyzing the behavior of the system, or in synthesizing a new system based on a set of specifications. The Laplace transform can also be used to solve differential equations and is used extensively in mechanical engineering and electrical engineering . The Laplace transform reduces a linear differential equation to an algebraic equation, which can then be solved by the formal rules of algebra. The original differential equation can then be solved by applying the inverse Laplace transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-32", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The Laplace transform reduces a linear differential equation to an algebraic equation, which can then be solved by the formal rules of algebra. The original differential equation can then be solved by applying the inverse Laplace transform. English electrical engineer Oliver Heaviside first proposed a similar scheme, although without using the Laplace transform; and the resulting operational calculus is credited as the Heaviside calculus. This is often possible as a consequence of the final value theorem . Even when the interchange cannot be justified the calculation can be suggestive. Convolution The same result can be achieved using the convolution property as if the system is a series of filters with transfer functions 1/( s + α ) and 1/( s + β ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-33", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Convolution The same result can be achieved using the convolution property as if the system is a series of filters with transfer functions 1/( s + α ) and 1/( s + β ) . spherical shape and constant temperature, calculations based on carrying out an inverse Laplace transformation on the spectrum of the object can produce the only possible model of the distribution of matter in it (density as a function of distance from the center) consistent with the spectrum. When independent information on the structure of an object is available, the inverse Laplace transform method has been found to be in good agreement.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-34", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "When independent information on the structure of an object is available, the inverse Laplace transform method has been found to be in good agreement. They are thus of importance in asymptotic formulae of probability and statistics , where often the spectral side has asymptotics that are simpler to infer. Two Tauberian theorems of note are the Hardy–Littlewood Tauberian theorem and Wiener's Tauberian theorem . This statement can be applied in particular to the logarithmic derivative of Riemann zeta function , and thus provides an extremely short way to prove the prime number theorem . Laplace Transform is somewhat more general in scope than the Fourier Transform, and is widely used by engineers for describing continuous circuits and systems, including automatic control systems.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-35", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Laplace Transform is somewhat more general in scope than the Fourier Transform, and is widely used by engineers for describing continuous circuits and systems, including automatic control systems. ^ The cumulative distribution function is the integral of the probability density function. ^ Mikusiński, Jan (14 July 2014), Operational Calculus , Elsevier, ^ Widder 1941 , Chapter II, §1 ^ Widder 1941 , Chapter VI, §2 ^ Beffa, Federico (2024), \"Laplace Transform of Distributions\" , Weakly Nonlinear Systems , Cham: Springer Nature Switzerland, pp. 385 ^ Archived at Ghostarchive and the Wayback Machine : Mattuck, Arthur (7 November 2008), \"Where the Laplace Transform comes from\" , YouTube ^ Widder 1941 , p.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-36", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": ", \"Laplace Transform\" , MathWorld Good explanations of the initial and final value theorems Archived 2009-01-08 at the Wayback Machine Laplace Transforms at MathPages Computational Knowledge Engine allows to easily calculate Laplace Transforms and its inverse Transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-0", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Numerals in Unicode - Wikipedia Jump to content Search Search Donate Create account Log in Donate Create account Log in Numerals in Unicode 3 languages Deutsch Italiano 中文 Edit links From Wikipedia, the free encyclopedia Graphemes for various number systems A numeral (often called number in Unicode ) is a character that denotes a number. The decimal number digits 0–9 are used widely in various writing systems throughout the world, however the graphemes representing the decimal digits differ widely. Therefore Unicode includes 22 different sets of graphemes for the decimal digits, and also various decimal points, thousands separators, negative signs, etc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-1", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Therefore Unicode includes 22 different sets of graphemes for the decimal digits, and also various decimal points, thousands separators, negative signs, etc. Unicode also includes several non-decimal numerals such as Aegean numerals , Roman numerals , counting rod numerals , Mayan numerals , Cuneiform numerals and ancient Greek numerals . There is also a large number of typographical variations of the Western Arabic numerals provided for specialized mathematical use and for compatibility with earlier character sets, such as ² or ②, and composite characters such as ½. Then there are decimal-radix numbers, commonly used in Western style decimals (plain 0–9), there are numbers that are not part of a decimal system such as Roman numbers, and decimal numbers in typographic context, such as encircled numbers.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-2", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Then there are decimal-radix numbers, commonly used in Western style decimals (plain 0–9), there are numbers that are not part of a decimal system such as Roman numbers, and decimal numbers in typographic context, such as encircled numbers. Unicode includes the Western Arabic numerals in the Basic Latin (or ASCII derived) block. The digits are repeated in several other scripts: Eastern Arabic , Balinese, Bengali, Devanagari, Ethiopic, Gujarati, Gurmukhi, Telugu, Khmer, Lao, Limbu, Malayalam, Mongolian, Myanmar, New Tai Lue, Nko, Oriya, Telugu, Thai, Tibetan, Osmanya. Unicode includes a numeric value property for each digit to assist in collation and other text processing operations.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-3", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Unicode includes a numeric value property for each digit to assist in collation and other text processing operations. However, there is no mapping between the various related digits. Although Arabic is written from right to left, while English is written left to right, in both languages numbers are written with the most significant digit on the left and the least significant on the right. This was intended to instruct font rendering to make the surrounding digits smaller and raise them on the left and lower them on the right, but this is rarely implemented. (A workaround is to use the super/subscript characters described below, but only Arabic numerals are available.) Unicode also includes a handful of vulgar fractions as compatibility characters, but discourages their use.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-4", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "(A workaround is to use the super/subscript characters described below, but only Arabic numerals are available.) Unicode also includes a handful of vulgar fractions as compatibility characters, but discourages their use. Decimal fractions are represented in text as a sequence of decimal digit numerals with a decimal separator separating the whole-number portion from the fractional portion. However, cultures vary in the glyph or grapheme used for a decimal separator. The Arabic writing system includes a dedicated character for a decimal separator that looks much like a comma, U+066B ٫ ARABIC DECIMAL SEPARATOR , which when combined with the Arabic digits to express one-quarter appears as: \"٠٫٢٥\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-5", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "The Arabic writing system includes a dedicated character for a decimal separator that looks much like a comma, U+066B ٫ ARABIC DECIMAL SEPARATOR , which when combined with the Arabic digits to express one-quarter appears as: \"٠٫٢٥\". Other mathematical constants can be represented using characters that have multiple semantic uses. For example, although Unicode includes a character for natural exponent ℯ (U+212F) its UCS canonical name derives from its glyph: U+212F ℯ SCRIPT SMALL E ; and the mathematical constant π , 3.141592.., is represented by U+03C0 π GREEK SMALL LETTER PI . Rich text parenthesized, circled and other variants are also included in the blocks Enclosed CJK Letters and Months ; Enclosed Alphanumerics ; Enclosed Alphanumeric Supplement ; Superscripts and Subscripts ; Number Forms ; and Dingbats .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-6", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Rich text parenthesized, circled and other variants are also included in the blocks Enclosed CJK Letters and Months ; Enclosed Alphanumerics ; Enclosed Alphanumeric Supplement ; Superscripts and Subscripts ; Number Forms ; and Dingbats . Rod numerals are closely related to the counting rods and the abacus , which is why the numeric symbols for 1, 2, 3, 6, 7 and 8 in the huāmǎ system are represented in a similar way as on the abacus. Nowadays, the huāmǎ system is only used for displaying prices in Chinese markets or on traditional handwritten invoices.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-7", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Nowadays, the huāmǎ system is only used for displaying prices in Chinese markets or on traditional handwritten invoices. In Unicode 3.0 these characters are incorrectly called Hangzhou style numerals. In the Unicode 4.0, an erratum was added which stated: The Suzhou numerals (Chinese su1zhou1ma3zi ) are special numeric forms used by traders to display the prices of goods. All Hangzhou\" in the Unicode standard have been corrected to \"Suzhou\" except for the character names themselves, which cannot be changed once assigned, according to the Unicode Stability Policy. Attic numerals were used by ancient Greeks , possibly from the 7th century BC .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-8", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "All Hangzhou\" in the Unicode standard have been corrected to \"Suzhou\" except for the character names themselves, which cannot be changed once assigned, according to the Unicode Stability Policy. Attic numerals were used by ancient Greeks , possibly from the 7th century BC . They were also known as Herodianic numerals because they were first described in a 2nd-century manuscript by Herodian . They are also known as acrophonic numerals because all of the symbols used derive from the first letters of the words that the symbols represent: 'one', 'five', 'ten', 'hundred', 'thousand' and 'ten thousand'.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-9", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "They are also known as acrophonic numerals because all of the symbols used derive from the first letters of the words that the symbols represent: 'one', 'five', 'ten', 'hundred', 'thousand' and 'ten thousand'. The system used in classical antiquity was slightly modified in the Middle Ages to produce the system we use today. It is based on certain letters which are given values as numerals. Unicode has a number of characters specifically designated as Roman numerals, as part of the Number Forms range from U+2160 to U+2188. This range includes both upper- and lowercase numerals, as well as pre-combined characters for numbers up to 12 (XII).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-10", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "This range includes both upper- and lowercase numerals, as well as pre-combined characters for numbers up to 12 (XII). One reason for the existence of pre-combined numbers is to facilitate the setting of multiple-letter numbers (such as VIII) on a single horizontal line in Asian vertical text. The small reversed c, ↄ, is not intended to be used in Roman numerals, but as lower case Claudian letter Ↄ. If using blackletter or script typefaces, Roman numerals are set in Roman type . Such typefaces may contain Roman numerals matching the style of the typeface in the Unicode range U+2160–217F; if they don't exist, a matching Antiqua typeface is used for Roman numerals.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-11", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Such typefaces may contain Roman numerals matching the style of the typeface in the Unicode range U+2160–217F; if they don't exist, a matching Antiqua typeface is used for Roman numerals. There are nine \"horizontal\" digits (U+1D360 to U+1D368) and nine \"vertical\" digits (U+1D369 to U+1D371), the horizontal digits are used for odd powers of ten and the vertical digits for even powers of ten. Zero should be represented by U+3007 (〇, ideographic number zero) and the negative sign should be represented by U+20E5 (combining reverse solidus overlay). As these were recently added to the character set and are not in the BMP, font support may still be limited.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-12", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "As these were recently added to the character set and are not in the BMP, font support may still be limited. edit ] Number Forms (Unicode block) edit ] ^ It is unknown which constant this is supposed to be. ^ Unicode Charts: Ancient Greek Numbers ^ Unicode Number Forms ^ The Unicode Standard, Version 6.0 – Electronic edition (PDF) , Unicode, Inc., 2011, p. Perry: Proposal to Add Additional Ancient Roman Characters to UCS ^ For the first two rows ^ Unicode Ancient Symbols ^ The Unicode Standard, Version 5.0 – Electronic edition (PDF) , Unicode, Inc., 2006, pp.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-13", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Perry: Proposal to Add Additional Ancient Roman Characters to UCS ^ For the first two rows ^ Unicode Ancient Symbols ^ The Unicode Standard, Version 5.0 – Electronic edition (PDF) , Unicode, Inc., 2006, pp.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-0", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "A ( minuscule : a ) is the first letter and the first vowel letter of the Latin alphabet , used in the modern English alphabet , and others worldwide. Its name in English is a (pronounced as in say ), plural aes . It is similar in shape to the Ancient Greek letter alpha , from which it derives. The latter form is commonly used in handwriting and fonts based on it, especially fonts intended to be read by children, and is also found in italic type . Name In English, the name of the letter is the long A sound, pronounced / ˈ eɪ / .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-1", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Name In English, the name of the letter is the long A sound, pronounced / ˈ eɪ / . In turn, the ancestor of aleph may have been a pictogram of an ox head in proto-Sinaitic script influenced by Egyptian hieroglyphs , styled as a triangular head with two horns extended. When the ancient Greeks adopted the alphabet, they had no use for a letter representing a glottal stop —so they adapted the sign to represent the vowel / a / , calling the letter by the similar name alpha . In the earliest Greek inscriptions dating to the 8th century BC following the Greek Dark Ages , the letter rests upon its side.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-2", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In the earliest Greek inscriptions dating to the 8th century BC following the Greek Dark Ages , the letter rests upon its side. However, in the later Greek alphabet it generally resembles the modern capital form—though many local varieties can be distinguished by the shortening of one leg, or by the angle at which the cross line is set. When the Romans adopted the Etruscan alphabet to write Latin , the resulting form used in the Latin script would come to be used to write many other languages, including English. During Roman times, there were many variant forms of the letter A.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-3", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "When the Romans adopted the Etruscan alphabet to write Latin , the resulting form used in the Latin script would come to be used to write many other languages, including English. During Roman times, there were many variant forms of the letter A. First was the monumental or lapidary style, which was used when inscribing on stone or other more permanent media. There was also a cursive style used for everyday or utilitarian writing, which was done on more perishable surfaces. Due to the perishable nature of these surfaces, there are not as many examples of this style as there are of the monumental, but there are still many surviving examples of different types of cursive, such as majuscule cursive, minuscule cursive, and semi-cursive minuscule.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-4", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Due to the perishable nature of these surfaces, there are not as many examples of this style as there are of the monumental, but there are still many surviving examples of different types of cursive, such as majuscule cursive, minuscule cursive, and semi-cursive minuscule. Variants also existed that were intermediate between the monumental and cursive styles. Among these were the semi-cursive minuscule of Italy, the Merovingian script in France, the Visigothic script in Spain, and the Insular or Anglo-Irish semi-uncial or Anglo-Saxon majuscule of Great Britain. This form was derived through a combining of prior forms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-5", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Among these were the semi-cursive minuscule of Italy, the Merovingian script in France, the Visigothic script in Spain, and the Insular or Anglo-Irish semi-uncial or Anglo-Saxon majuscule of Great Britain. This form was derived through a combining of prior forms. Road sign in Ireland showing the \"Latin alpha\" form of ⟨a⟩ in lower and upper case forms 15th-century Italy saw the formation of the two main variants that are known today. These variants, the Italic and Roman forms, were derived from the Caroline Script version. The Italic form ⟨ɑ⟩ , also called script a , is often used in handwriting ; it consists of a circle with a vertical stroke on its right.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-6", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "The Italic form ⟨ɑ⟩ , also called script a , is often used in handwriting ; it consists of a circle with a vertical stroke on its right. In the hands of medieval Irish and English writers, this form gradually developed from a 5th-century form resembling the Greek letter tau ⟨τ⟩ . The Roman form ⟨a⟩ is found in most printed material, and consists of a small loop with an arc over it. In Greek handwriting, it was common to join the left leg and horizontal stroke into a single loop, as demonstrated by the uncial version shown.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-7", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In Greek handwriting, it was common to join the left leg and horizontal stroke into a single loop, as demonstrated by the uncial version shown. In some of these, the serif that began the right leg stroke developed into an arc, resulting in the printed form, while in others it was dropped, resulting in the modern handwritten form. Italic type is commonly used to mark emphasis or more generally to distinguish one part of a text from the rest set in Roman type. There are some other cases aside from italic type where script a ⟨ɑ⟩ , also called Latin alpha , is used in contrast with Latin ⟨a⟩ , such as in the International Phonetic Alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-8", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "There are some other cases aside from italic type where script a ⟨ɑ⟩ , also called Latin alpha , is used in contrast with Latin ⟨a⟩ , such as in the International Phonetic Alphabet . Use in writing systems In English , ⟨a⟩ is the indefinite article (with the alternative form an when followed by a vowel). Pronunciation English Further information: Pronunciation of English ⟨a⟩ In English language education, the word apple is consistently associated with the letter A. However, ⟨a⟩ occurs in many common digraphs , all with their own sound or sounds, particularly ⟨ai⟩ , ⟨au⟩ , ⟨aw⟩ , ⟨ay⟩ , ⟨ea⟩ and ⟨oa⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-9", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "However, ⟨a⟩ occurs in many common digraphs , all with their own sound or sounds, particularly ⟨ai⟩ , ⟨au⟩ , ⟨aw⟩ , ⟨ay⟩ , ⟨ea⟩ and ⟨oa⟩ . ⟨a⟩ is the third-most-commonly used letter in English after ⟨e⟩ and ⟨t⟩ , as well as in French; it is the second most common in Spanish, and the most common in Portuguese. ⟨a⟩ represents approximately 8.2% of letters as used in English texts; the figure is around 7.6% in French 11.5% in Spanish, and 14.6% in Portuguese. Other languages In most languages that use the Latin alphabet, ⟨a⟩ denotes an open unrounded vowel, such as / a / , / ä / , or / ɑ / .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-10", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Other languages In most languages that use the Latin alphabet, ⟨a⟩ denotes an open unrounded vowel, such as / a / , / ä / , or / ɑ / . An exception is Saanich , in which ⟨a⟩ —and the glyph ⟨ Á ⟩ —stands for a close-mid front unrounded vowel /e/ . Other systems In the International Phonetic Alphabet , ⟨ a ⟩ is used for the open front unrounded vowel , ⟨ ä ⟩ is used for the open central unrounded vowel , and ⟨ ɑ ⟩ is used for the open back unrounded vowel .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-11", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Other systems In the International Phonetic Alphabet , ⟨ a ⟩ is used for the open front unrounded vowel , ⟨ ä ⟩ is used for the open central unrounded vowel , and ⟨ ɑ ⟩ is used for the open back unrounded vowel . In X-SAMPA , ⟨a⟩ is used for the open front unrounded vowel and ⟨A⟩ is used for the open back unrounded vowel . In algebra , the letter a along with various other letters of the alphabet is often used to denote a variable , with various conventional meanings in different areas of mathematics.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-12", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In algebra , the letter a along with various other letters of the alphabet is often used to denote a variable , with various conventional meanings in different areas of mathematics. In 1637, René Descartes \"invented the convention of representing unknowns in equations by x, y, and z, and knowns by a, b, and c\", and this convention is still often followed, especially in elementary algebra. In geometry , capital Latin letters are used to denote objects including line segments , lines , and rays A capital A is also typically used as one of the letters to represent an angle in a triangle , the lowercase a representing the side opposite angle A.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-13", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "In geometry , capital Latin letters are used to denote objects including line segments , lines , and rays A capital A is also typically used as one of the letters to represent an angle in a triangle , the lowercase a representing the side opposite angle A. A is often used to denote something or someone of a better or more prestigious quality or status: A−, A or A+, the best grade that can be assigned by teachers for students' schoolwork; \"A grade\" for clean restaurants; A-list celebrities, A1 at Lloyd's for shipping, etc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-14", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "A is often used to denote something or someone of a better or more prestigious quality or status: A−, A or A+, the best grade that can be assigned by teachers for students' schoolwork; \"A grade\" for clean restaurants; A-list celebrities, A1 at Lloyd's for shipping, etc. Such associations can have a motivating effect, as exposure to the letter A has been found to improve performance, when compared with other letters. A is used to denote size, as in a narrow size shoe, or a small cup size in a brassiere . These are the same code points as those used in ASCII and ISO 8859 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-15", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "A is used to denote size, as in a narrow size shoe, or a small cup size in a brassiere . These are the same code points as those used in ASCII and ISO 8859 . There are also precomposed character encodings for ⟨A⟩ and ⟨a⟩ with diacritics, for most of those listed above ; the remainder are produced using combining diacritics . Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, Latin alpha in linguistics, and halfwidth and fullwidth forms for legacy CJK font compatibility.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-16", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, Latin alpha in linguistics, and halfwidth and fullwidth forms for legacy CJK font compatibility. The Cyrillic and Greek homoglyphs of the Latin ⟨A⟩ have separate encodings U+0410 А CYRILLIC CAPITAL LETTER A and U+0391 Α GREEK CAPITAL LETTER ALPHA . Other Aes is the plural of the name of the letter. The plural of the letter itself is rendered A s, A's, a s, or a's. ^ Constable, Peter (19 April 2004), L2/04-132 Proposal to Add Additional Phonetic Characters to the UCS (PDF) , archived (PDF) from the original on 11 October 2017 , .unicode.org ^ Everson, Michael ; et al.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/A-17", "source": "https://en.wikipedia.org/wiki/A", "title": "A", "text": "^ Constable, Peter (19 April 2004), L2/04-132 Proposal to Add Additional Phonetic Characters to the UCS (PDF) , archived (PDF) from the original on 11 October 2017 , .unicode.org ^ Everson, Michael ; et al. ( Audio help · More spoken articles ) History of the Alphabet Archived 10 April 2021 at the Wayback Machine Texts on Wikisource: \" A \" in A Dictionary of the English Language by Samuel Johnson \"A\" .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-0", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Historically these letters were \"elevated terminals\", that is to say the last few letters of the full word denoting the ordinal form of the number displayed as a superscript . Probably originating with medieval monastic practice, the character(s) used vary in different languages. In English orthography , this corresponds to the suffixes ‑st , ‑nd , ‑rd , ‑th in written ordinals (represented either on the line 1st , 2nd , 3rd , 4th or as superscript 1 , 2 , 3 , 4 ). Also commonly encountered in Romance languages are the superscript or superior (and often underlined) masculine ordinal indicator , º , and feminine ordinal indicator , ª .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-1", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Also commonly encountered in Romance languages are the superscript or superior (and often underlined) masculine ordinal indicator , º , and feminine ordinal indicator , ª . In formal typography, the ordinal indicators ª and º are distinguishable from other characters. The practice of underlined (or doubly underlined) superscripted abbreviations was common in 19th-century writing (not limited to ordinal indicators in particular, and extant in the numero sign № ), and was found in handwritten English until at least the late 19th century (e.g. The indicator may be given an underline but this is not ubiquitous.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-2", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The practice of underlined (or doubly underlined) superscripted abbreviations was common in 19th-century writing (not limited to ordinal indicators in particular, and extant in the numero sign № ), and was found in handwritten English until at least the late 19th century (e.g. The indicator may be given an underline but this is not ubiquitous. In digital typography , this depends on the font: Cambria and Calibri , for example, have underlined ordinal indicators, while most other fonts do not. Examples of the usage of ordinal indicators in Italian are: 1º, primo ; 1ª, prima \"first\" 2º, secondo ; 2ª, seconda \"second\" 3º, terzo ; 3ª, terza \"third\" Galician also forms its ordinal numbers this way, while Asturian follows a similar system where ᵘ is used for the masculine gender, ª for the feminine gender and º for the neuter gender.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-3", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Examples of the usage of ordinal indicators in Italian are: 1º, primo ; 1ª, prima \"first\" 2º, secondo ; 2ª, seconda \"second\" 3º, terzo ; 3ª, terza \"third\" Galician also forms its ordinal numbers this way, while Asturian follows a similar system where ᵘ is used for the masculine gender, ª for the feminine gender and º for the neuter gender. In Spanish, using the two final letters of the word as it is spelled is not allowed, except in the cases of primer (an apocope of primero ) before singular masculine nouns, which is not abbreviated as 1.º but as 1.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-4", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In Spanish, using the two final letters of the word as it is spelled is not allowed, except in the cases of primer (an apocope of primero ) before singular masculine nouns, which is not abbreviated as 1.º but as 1. ; of tercer (an apocope of tercero ) before singular masculine nouns, which is not abbreviated as 3.º but as 3. Since none of these words are shortened before feminine nouns, their correct forms for those cases are primera and tercera . The terminal letters used depend on the gender of the item to be ordered and the case in which the ordinal adjective is stated, for example primus dies ('the first day', nominative case , masculine), but primo die ('on the first day', ablative case masculine), shown as I or i .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-5", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The terminal letters used depend on the gender of the item to be ordered and the case in which the ordinal adjective is stated, for example primus dies ('the first day', nominative case , masculine), but primo die ('on the first day', ablative case masculine), shown as I or i . As monumental inscriptions often refer to days on which events happened (e.g., \"he died on the tenth of June\"), the ablative case is generally used: X ( decimo ) with the month stated in the genitive case . The masculine ordinal indicator º may be confused with the degree sign ° (U+00B0), which looks very similar and which is provided on the Italian and Latin American keyboard layouts .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-6", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The masculine ordinal indicator º may be confused with the degree sign ° (U+00B0), which looks very similar and which is provided on the Italian and Latin American keyboard layouts . It was common in the early days of computers to use the same character for both. The degree sign is a uniform circle and is never underlined. The masculine ordinal indicator is the shape of a lower-case letter o , and thus may be oval or elliptical , and may have a varying line thickness. It is not mandatory in Portugal nor in Brazil , but it is preferred in some fonts to avoid confusion with the degree sign.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-7", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "It is not mandatory in Portugal nor in Brazil , but it is preferred in some fonts to avoid confusion with the degree sign. The top of the ordinal indicators (i.e., the top of the elevated letter a and letter o ) must be aligned with the cap height of the font. The line thickness of the ordinal indicators is always proportional to the line thickness of the other characters of the font. ISO 8859-1 was incorporated as the first 256 code points of Unicode in 1991. The Unicode characters are thus: U+00AA ª FEMININE ORDINAL INDICATOR ( ª ) U+00BA º MASCULINE ORDINAL INDICATOR ( º ) There are superscript versions of the letters ⟨a⟩ and ⟨o⟩ in Unicode ; these are different characters and should not be used as ordinal indicators.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-8", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The Unicode characters are thus: U+00AA ª FEMININE ORDINAL INDICATOR ( ª ) U+00BA º MASCULINE ORDINAL INDICATOR ( º ) There are superscript versions of the letters ⟨a⟩ and ⟨o⟩ in Unicode ; these are different characters and should not be used as ordinal indicators. On other keyboard layouts, these characters are accessible only through a set of keystrokes (see Unicode input ). In Basque , Serbo-Croatian , Czech , Danish , Estonian , Faroese , Finnish , German , Hungarian , Icelandic , Latvian , Norwegian , Slovak , Slovene , Turkish , among other languages, a period or full stop is written after the numeral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-9", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In Basque , Serbo-Croatian , Czech , Danish , Estonian , Faroese , Finnish , German , Hungarian , Icelandic , Latvian , Norwegian , Slovak , Slovene , Turkish , among other languages, a period or full stop is written after the numeral. In Polish , the period can be omitted if there is no ambiguity whether a given numeral is ordinal or cardinal. The only exceptions are variables in mathematics ( k+1-szy – (k+1)st ). Writing out the endings for various cases , as sometimes happens in Czech and Slovak, is considered incorrect and uneducated.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-10", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Writing out the endings for various cases , as sometimes happens in Czech and Slovak, is considered incorrect and uneducated. Should a full stop follow this dot, it is omitted. The Serbian standard of Serbo-Croatian (unlike the Croatian and Bosnian standards) uses the dot in role of the ordinal indicator only past Arabic numerals, while Roman numerals are used without a dot. There is a problem with autocorrection, mobile editors, etc., which often force a capital initial letter in the word following the ordinal numbers. 1st , pronounced fir st ) -nd is used with numbers ending in 2 (e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-11", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "There is a problem with autocorrection, mobile editors, etc., which often force a capital initial letter in the word following the ordinal numbers. 1st , pronounced fir st ) -nd is used with numbers ending in 2 (e.g. 92nd , pronounced ninety-seco nd ) -rd is used with numbers ending in 3 (e.g. 33rd , pronounced thirty-thi rd ) As an exception to the above rules, numbers ending with 11 , 12 , and 13 use -th (e.g. One archaic variant uses a singular -d for numbers ending in 2 or 3 (e.g. 92d or 33d ) In 19th-century handwriting, these terminals were often elevated, that is to say written as superscripts (e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-12", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "92d or 33d ) In 19th-century handwriting, these terminals were often elevated, that is to say written as superscripts (e.g. With the gradual introduction of the typewriter in the late 19th century, it became common to write them on the baseline in typewritten texts, and this usage even became recommended in certain 20th-century style guides. Thus, the 17th edition of The Chicago Manual of Style states: \"The letters in ordinal numbers should not appear as superscripts (e.g., 122nd not 122 )\", as do the Bluebook and style guides by the Council of Science Editors , Microsoft , and Yahoo .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-13", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Thus, the 17th edition of The Chicago Manual of Style states: \"The letters in ordinal numbers should not appear as superscripts (e.g., 122nd not 122 )\", as do the Bluebook and style guides by the Council of Science Editors , Microsoft , and Yahoo . Style guide author Jack Lynch ( Rutgers ) recommends turning off automatic superscripting of ordinals in Microsoft Word , because \"no professionally printed books use superscripts\". It uses for higher numbers (for instance 2 – deuxième ). French also uses the indicators and for the alternative second ordinal number (masculine 2 – second ; feminine 2 – seconde ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-14", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "French also uses the indicators and for the alternative second ordinal number (masculine 2 – second ; feminine 2 – seconde ). Although regarded as incorrect by typographic standards, longer forms are in wide usage: for feminine 1 ( 1 – première )), for numbers starting at 2 (for instance 2 – deuxième ), and for the alternative second ordinal number ( 2 – second ; 2 – seconde ) These indicators use superscript formatting whenever it is available. Most numbers follow the pattern exemplified by vint '20' ( 20è m sg , 20a f sg , 20ns m pl , 20es f pl ), but the first few ordinals are irregular, affecting the abbreviations of the masculine forms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-15", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Most numbers follow the pattern exemplified by vint '20' ( 20è m sg , 20a f sg , 20ns m pl , 20es f pl ), but the first few ordinals are irregular, affecting the abbreviations of the masculine forms. Optionally ‑ste and ‑de may be used, but this is more complex: 1ste ( eerste ), 2de ( tweede ), 4de ( vierde ), 20ste ( twintigste ), etc. However, if the head noun is omitted, the ordinal indicator takes the form of a morphological suffix, which is attached to the numeral with a colon .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-16", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "However, if the head noun is omitted, the ordinal indicator takes the form of a morphological suffix, which is attached to the numeral with a colon . In the nominative case , the suffix is ‑nen for 1 and 2, and ‑s for larger numerals: Minä olin 2:nen , ja veljeni oli 3:s 'I came 2nd , and my brother came 3rd '. This is derived from the endings of the spelled-out ordinal numbers: ensimmäinen , toinen , kolmas , neljäs , viides , kuudes , seitsemäs , etc.. Even native speakers sometimes find it difficult to exactly identify the ordinal suffix, as its borders with the word stem and the case ending may appear blurred.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-17", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Even native speakers sometimes find it difficult to exactly identify the ordinal suffix, as its borders with the word stem and the case ending may appear blurred. In such cases, it may be preferable to write the ordinal word entirely with letters and particularly 2:nen is rare even in the nominative case, as it is not significantly shorter than the full word toinen . When the ordinal is written out, the suffix adheres to the spelling restrictions imposed by the broad/slender difference in consonants and is written -iú after slender consonants; but when written as numbers, only the suffix itself ( -ú ) is written.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-18", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "When the ordinal is written out, the suffix adheres to the spelling restrictions imposed by the broad/slender difference in consonants and is written -iú after slender consonants; but when written as numbers, only the suffix itself ( -ú ) is written. In the case of 4 ( ceathair ), the final syllable is syncopated before the suffix, and in the case of 9 ( naoi ), 20 ( fiche ), and 1000 ( míle ), the final vowel is assimilated into the suffix. Most multiples of ten end in a vowel in their cardinal form and form their ordinal form by adding the suffix to their genitive singular form, which ends in -d ; this is not reflected in writing.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-19", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Most multiples of ten end in a vowel in their cardinal form and form their ordinal form by adding the suffix to their genitive singular form, which ends in -d ; this is not reflected in writing. Exceptions are 20 ( fiche ) and 40 ( daichead ), both of which form their ordinals by adding the suffix directly to the cardinal ( fichiú and daicheadú ). As in French, the vigesimal system is widely used, particularly in people's ages. The numbers 1 ( aon ) and 2 ( dó ) both have two separate ordinals: one regularly formed by adding -ú ( aonú , dóú ), and one suppletive form ( céad , dara ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-20", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The numbers 1 ( aon ) and 2 ( dó ) both have two separate ordinals: one regularly formed by adding -ú ( aonú , dóú ), and one suppletive form ( céad , dara ). The regular forms are restricted in their usage to actual numeric contexts, when counting. The latter are also used in counting, especially céad , but are used in broader, more abstract senses of \"first\" and \"second\" (or \"other\"). In their broader senses, céad and dara are not written as 1ú and 2ú , though 1ú and 2ú may in a numeric context be read aloud as céad and dara (e.g., an 21ú lá may be read as an t-aonú lá is fiche or as an chéad lá is fiche ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-21", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In their broader senses, céad and dara are not written as 1ú and 2ú , though 1ú and 2ú may in a numeric context be read aloud as céad and dara (e.g., an 21ú lá may be read as an t-aonú lá is fiche or as an chéad lá is fiche ). The rule is to take the minimal number of letters that include at least one consonant phoneme. The reason is that -a and -e respectively end the ordinal number words. The ordinals for 1 and 2 may however be given an -e form ( förste and andre instead of första and andra ) when used about a male person (masculine natural gender), and if so they are written 1:e and 2:e .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-22", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "The ordinals for 1 and 2 may however be given an -e form ( förste and andre instead of första and andra ) when used about a male person (masculine natural gender), and if so they are written 1:e and 2:e . Furthermore, suffixes can be left out if the number obviously is an ordinal number, example: 3 utg. Using a full stop as an ordinal indicator is considered archaic , but still occurs in military contexts; for example: 5. Numbers in Filipino are preceded by the ordinal prefix ika- or pang- (the latter subject to sandhi ; for example, ika-7 or pam-7 \"seventh\").", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-23", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "Numbers in Filipino are preceded by the ordinal prefix ika- or pang- (the latter subject to sandhi ; for example, ika-7 or pam-7 \"seventh\"). In Chinese and Japanese , an ordinal number is formed when a numeral is preceded by the character 第 (pronounced dì in Mandarin Chinese , dai in Japanese): for example, 第一 \"first\", 第二 \"second\". This is a typical character, not a special ordinal indicator, and unlike in European languages, it is also not an abbreviation. In Korean , an ordinal number is prefixed by 제 je or suffixed by 번째 beonjjae : for example, 제1 \"first\", 2번째 \"second\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-24", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In Korean , an ordinal number is prefixed by 제 je or suffixed by 번째 beonjjae : for example, 제1 \"first\", 2번째 \"second\". for impuesto ('tax'), V.º B.º for visto bueno ('approved'), D.ª for doña (an honorific ), and M.ª for María (a Spanish name frequently used in compounds like José M.ª ). When a lone o or a is the raised letter, the masculine or feminine ordinal indicator may be used for this purpose, which may or may not be considered correct. In both Spanish and Portuguese, abbreviations formed this way have a period between the last regular letter and the first raised letter.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-25", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "In both Spanish and Portuguese, abbreviations formed this way have a period between the last regular letter and the first raised letter. Traditionally, the raised letters are underlined, but this is optional and less frequent today. In English : Abbreviations such as \"answ \" for \"answered\" and \"Jo \" for \"Joseph\" were commonly used in English-language handwritten letters and records prior to the 20th century. abbreviation from the Romance-language word numero , which itself derives from the Latin word numero , the ablative case of the word numerus \"number\". This is sometimes written as N , with the superscript o optionally underlined, or sometimes with the ordinal indicator.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-26", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "This is sometimes written as N , with the superscript o optionally underlined, or sometimes with the ordinal indicator. The underline helps avoid confusion between the masculine ordinal and the degree character. This is important at low resolution, such as the screen, when both characters are very similar in size and shape. Peirce also regularly used the nineteenth-century calligraphic convention of double underlining superscript portions of abbreviations such as M or 1 . 629 : \"In all MSS in this period, Peirce inscribed \"st,\" \"nd,\" \"rd,\" and \"th\" in the superscript position: for convenience's sake, they are on the line in typewritten pieces.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Ordinal_indicator-27", "source": "https://en.wikipedia.org/wiki/Ordinal_indicator", "title": "Ordinal indicator", "text": "629 : \"In all MSS in this period, Peirce inscribed \"st,\" \"nd,\" \"rd,\" and \"th\" in the superscript position: for convenience's sake, they are on the line in typewritten pieces. In published pieces the ordinals are superscripted to conform to Peirce's style; \"2 \" and \"3 \" are emended to \"2nd\" and \"3rd\". When Peirce typed abbreviated ordinals on the line, these mechanical exceptions attributable to his typewriter have been changed to superscript ordinals.\" ^ Butterick, Matthew (4 October 2012).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-0", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Without proper rendering support , you may see question marks, boxes, or other symbols . It is designed such that the beginnings and ends of the individual strokes that make up each letter will be clearly visible, and often emphasized; in this way it is often contrasted with the curves of the Antiqua (common) typefaces where the letters are designed to flow and strokes connect together in a continuous fashion. The word \"Fraktur\" derives from Latin frāctūra (\"a break\"), built from frāctus , passive participle of frangere (\"to break\"), which is also the root for the English word \"fracture\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-1", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "The word \"Fraktur\" derives from Latin frāctūra (\"a break\"), built from frāctus , passive participle of frangere (\"to break\"), which is also the root for the English word \"fracture\". In non-professional contexts, the term \"Fraktur\" is sometimes misused to refer to all blackletter typefaces – while Fraktur typefaces do fall under that category, not all blackletter typefaces exhibit the Fraktur characteristics described above. Fraktur is often characterized as \"the German typeface\", as it remained popular in Germany and much of Eastern Europe far longer than elsewhere. Beginning in the 19th century, the use of Fraktur versus Antiqua (seen as modern) was the subject of controversy in Germany.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-2", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Beginning in the 19th century, the use of Fraktur versus Antiqua (seen as modern) was the subject of controversy in Germany. Some Fraktur typefaces also include a variant form of the letter r known as the r rotunda , and many include a variety of ligatures which are left over from cursive handwriting and have rules for their use. Most older Fraktur typefaces make no distinction between the majuscules ⟨I⟩ and ⟨J⟩ (where the common shape is more suggestive of a ⟨J⟩ ), even though the minuscules ⟨i⟩ and ⟨j⟩ are differentiated. One difference between the Fraktur and other blackletter scripts is that in the lower case ⟨o⟩ , the left part of the bow is broken, but the right part is not.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-3", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "One difference between the Fraktur and other blackletter scripts is that in the lower case ⟨o⟩ , the left part of the bow is broken, but the right part is not. In Danish texts composed in Fraktur, the letter ⟨ ø ⟩ was already preferred to the German and Swedish ⟨ ö ⟩ in the 16th century. In the Latvian variant of Fraktur, used mainly until the 1920s, there are additional characters used to denote Latvian letters with diacritical marks . Stroked variants of ⟨s⟩ are also used in pre-1950 Sorbian orthography. Fraktur quickly overtook the earlier Schwabacher and Textualis typefaces in popularity, and a wide variety of Fraktur fonts were carved and became common in the German-speaking world and areas under German influence (Scandinavia, Estonia, Latvia, Central Europe ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-4", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Fraktur quickly overtook the earlier Schwabacher and Textualis typefaces in popularity, and a wide variety of Fraktur fonts were carved and became common in the German-speaking world and areas under German influence (Scandinavia, Estonia, Latvia, Central Europe ). In the 18th century, the German Theuerdank Fraktur was further developed by the Leipzig typographer Johann Gottlob Immanuel Breitkopf to create the typeset Breitkopf Fraktur . In reality only German-speakers, Estonia, and Latvia still used Fraktur as the majority script at this time. Denmark had shifted to Antiqua during the mid 19th century, and in Norway the majority of printed texts used Antiqua around 1900.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-5", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Denmark had shifted to Antiqua during the mid 19th century, and in Norway the majority of printed texts used Antiqua around 1900. Notably, the map itself uses Antiqua for its legend, even though it is in German, indicating that Fraktur was no longer universally used even among German-speakers. Typesetting in Fraktur was still very common in the early 20th century in all German-speaking countries and areas, as well as in Norway , Estonia , and Latvia , and was still used to a very small extent in Sweden , Finland and Denmark , even though other countries typeset in Antiqua .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-6", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Typesetting in Fraktur was still very common in the early 20th century in all German-speaking countries and areas, as well as in Norway , Estonia , and Latvia , and was still used to a very small extent in Sweden , Finland and Denmark , even though other countries typeset in Antiqua . Some books at that time used related blackletter fonts such as Schwabacher ; however, the predominant typeface was the Normalfraktur, which came in slight variations. From the late 18th century to the late 19th century, Fraktur was progressively replaced by Antiqua as a symbol of the classicist age and emerging cosmopolitanism in most of the countries in Europe that had previously used Fraktur.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-7", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "From the late 18th century to the late 19th century, Fraktur was progressively replaced by Antiqua as a symbol of the classicist age and emerging cosmopolitanism in most of the countries in Europe that had previously used Fraktur. This move was hotly debated in Germany, a controversy known as the Antiqua–Fraktur dispute . The Fraktur typefaces remained in use in Nazi Germany , when they were initially represented as true German script; official Nazi documents and letterheads employed the font, and the cover of Hitler 's Mein Kampf used a hand-drawn version of it. These fonts were designed in the early 20th century, mainly the 1930s, as grotesque versions of blackletter typefaces.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-8", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "These fonts were designed in the early 20th century, mainly the 1930s, as grotesque versions of blackletter typefaces. The Nazis heavily used these fonts themselves, although the shift remained controversial; in fact, the press was at times scolded for its frequent use of \"Roman characters\" under \"Jewish influence\" and German émigrés were urged to use only \"German script\". Martin Bormann issued a circular (the \" normal type decree \") to all public offices which declared Fraktur (and its corollary, the Sütterlin -based handwriting) to be Judenlettern (Jewish letters) and prohibited their further use. German historian Albert Kapr has speculated that the regime viewed Fraktur as inhibiting communication in the occupied territories during World War II .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-9", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "German historian Albert Kapr has speculated that the regime viewed Fraktur as inhibiting communication in the occupied territories during World War II . After Nazi Germany fell in 1945, Fraktur was unbanned, but remain limited use as of today. It means \"Victor chases twelve boxers across the Sylt dike\" and contains all 26 letters of the alphabet plus the umlauted glyphs used in German, making it an example of a pangram . Thus, the additional ligatures that are required for Fraktur typefaces will not be encoded in Unicode: support for these ligatures is a font engineering issue left up to font developers.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-10", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "Thus, the additional ligatures that are required for Fraktur typefaces will not be encoded in Unicode: support for these ligatures is a font engineering issue left up to font developers. There are, however, two sets of Fraktur symbols in the Unicode blocks of Mathematical Alphanumeric Symbols , Letterlike Symbols , and Latin Extended-E . The long s , ß , and the umlauted vowels are not encoded, as the characters are meant to be used in mathematics and phonetics, so they are not suitable for typesetting German-language texts. ^ ISO basic Latin alphabet is derived from the English alphabet hence its 26 letters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fraktur-11", "source": "https://en.wikipedia.org/wiki/Fraktur", "title": "Fraktur", "text": "The long s , ß , and the umlauted vowels are not encoded, as the characters are meant to be used in mathematics and phonetics, so they are not suitable for typesetting German-language texts. ^ ISO basic Latin alphabet is derived from the English alphabet hence its 26 letters. (in Danish) and Biblia: Det er Den gantske Hellige Scrifft paa Danske igien offuerseet oc prentet effter vor allernaadigste herris oc Kongis K.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-0", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Unicode subscripts and superscripts - Wikipedia Jump to content Search Search Donate Create account Log in Donate Create account Log in Unicode subscripts and superscripts 2 languages Français Українська Edit links From Wikipedia, the free encyclopedia Unicode denominator & numerator glyphs This article contains special characters . Without proper rendering support , you may see question marks, boxes, or other symbols . These characters allow any polynomial , chemical and certain other equations to be represented in plain text without using any form of markup like HTML or TeX . The intended use when these characters were added to Unicode was to produce true superscripts and subscripts so that chemical and algebraic formulas could be written without markup.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-1", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The intended use when these characters were added to Unicode was to produce true superscripts and subscripts so that chemical and algebraic formulas could be written without markup. Thus H₂O (using a subscript 2 character) is supposed to be identical to H 2 O (with subscript markup). In reality, many fonts that include these characters ignore the Unicode definition, and instead design the digits for mathematical numerator and denominator glyphs, which are aligned with the cap line and the baseline , respectively. When used with the solidus or the Fraction Slash, they produce an almost typographically correct diagonal fraction, such as ³/₄ for the ¾ glyph.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-2", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "When used with the solidus or the Fraction Slash, they produce an almost typographically correct diagonal fraction, such as ³/₄ for the ¾ glyph. Unicode intended that diagonal fractions be rendered by a different mechanism: the fraction slash U+2044 is visually similar to the solidus, but when used with the ordinary digits (not the superscripts and subscripts), it instructs the layout system that a fraction such as ¾ is to be rendered using automatic glyph substitution. User-end support was quite poor for a number of years, but fonts, browsers, word processors, desktop publishing software and others increasingly support the intended Unicode behavior.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-3", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "User-end support was quite poor for a number of years, but fonts, browsers, word processors, desktop publishing software and others increasingly support the intended Unicode behavior. The remainder were placed along with basic arithmetical symbols, and later some Latin subscripts, in a dedicated block at U+ 2070 to U+209F. Each superscript or subscript character is preceded by a baseline x to show the height of subscripting/superscripting. As of November 2024, three of these (209D, 209E, and 209F) were provisionally assigned to new subscript characters, namely Latin lowercase w , y , and z . The Spacing Modifier Letters block has superscripted letters and symbols used for phonetic transcription: ʰ ʱ ʲ ʳ ʴ ʵ ʶ ʷ ʸ ˀ ˁ ˠ ˡ ˢ ˣ ˤ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-4", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Spacing Modifier Letters block has superscripted letters and symbols used for phonetic transcription: ʰ ʱ ʲ ʳ ʴ ʵ ʶ ʷ ʸ ˀ ˁ ˠ ˡ ˢ ˣ ˤ . The Phonetic Extensions block has several superscripted letters and symbols: Latin/IPA ᴬ ᴭ ᴮ ᴯ ᴰ ᴱ ᴲ ᴳ ᴴ ᴵ ᴶ ᴷ ᴸ ᴹ ᴺ ᴻ ᴼ ᴽ ᴾ ᴿ ᵀ ᵁ ᵂ ᵃ ᵄ ᵅ ᵆ ᵇ ᵈ ᵉ ᵊ ᵋ ᵌ ᵍ ᵏ ᵐ ᵑ ᵒ ᵓ ᵖ ᵗ ᵘ ᵚ ᵛ , Greek ᵝ ᵞ ᵟ ᵠ ᵡ , Cyrillic ᵸ , other ᵎ ᵔ ᵕ ᵙ ᵜ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-5", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Phonetic Extensions block has several superscripted letters and symbols: Latin/IPA ᴬ ᴭ ᴮ ᴯ ᴰ ᴱ ᴲ ᴳ ᴴ ᴵ ᴶ ᴷ ᴸ ᴹ ᴺ ᴻ ᴼ ᴽ ᴾ ᴿ ᵀ ᵁ ᵂ ᵃ ᵄ ᵅ ᵆ ᵇ ᵈ ᵉ ᵊ ᵋ ᵌ ᵍ ᵏ ᵐ ᵑ ᵒ ᵓ ᵖ ᵗ ᵘ ᵚ ᵛ , Greek ᵝ ᵞ ᵟ ᵠ ᵡ , Cyrillic ᵸ , other ᵎ ᵔ ᵕ ᵙ ᵜ . These are intended to indicate secondary articulation . The Phonetic Extensions Supplement block has several more: Latin/IPA ᶛ ᶜ ᶝ ᶞ ᶟ ᶠ ᶡ ᶢ ᶣ ᶤ ᶥ ᶦ ᶧ ᶨ ᶩ ᶪ ᶫ ᶬ ᶭ ᶮ ᶯ ᶰ ᶱ ᶲ ᶳ ᶴ ᶵ ᶶ ᶷ ᶸ ᶹ ᶺ ᶻ ᶼ ᶽ ᶾ , Greek ᶿ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-6", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Phonetic Extensions Supplement block has several more: Latin/IPA ᶛ ᶜ ᶝ ᶞ ᶟ ᶠ ᶡ ᶢ ᶣ ᶤ ᶥ ᶦ ᶧ ᶨ ᶩ ᶪ ᶫ ᶬ ᶭ ᶮ ᶯ ᶰ ᶱ ᶲ ᶳ ᶴ ᶵ ᶶ ᶷ ᶸ ᶹ ᶺ ᶻ ᶼ ᶽ ᶾ , Greek ᶿ . The Cyrillic Extended-D block contains many Cyrillic superscripts: 𞀰 𞀱 𞀲 𞀳 𞀷 𞀵 𞀶 𞀷 𞀸 𞀹 𞀺 𞀻 𞀼 𞀽 𞀾 𞀿 𞁀 𞁁 𞁂 𞁃 𞁄 𞁅 𞁆 𞁇 𞁈 𞁉 𞁊 𞁋 𞁌 𞁍 𞁎 𞁏 𞁐 𞁫 𞁬 𞁭 . The Kanbun block has superscripted annotation characters used in Japanese copies of Classical Chinese texts: ㆒ ㆓ ㆔ ㆕ ㆖ ㆗ ㆘ ㆙ ㆚ ㆛ ㆜ ㆝ ㆞ ㆟ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-7", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Kanbun block has superscripted annotation characters used in Japanese copies of Classical Chinese texts: ㆒ ㆓ ㆔ ㆕ ㆖ ㆗ ㆘ ㆙ ㆚ ㆛ ㆜ ㆝ ㆞ ㆟ . These letters are written directly above other letters appearing in medieval Germanic manuscripts, and so these glyphs do not include spacing, for example uͤ. The Phonetic Extensions block has several subscripted letters and symbols: Latin/IPA ᵢ ᵣ ᵤ ᵥ and Greek ᵦ ᵧ ᵨ ᵩ ᵪ . The Cyrillic Extended-D block also contains many Cyrillic subscripts: 𞁑 𞁒 𞁓 𞁔 𞁕 𞁖 𞁗 𞁘 𞁙 𞁚 𞁛 𞁜 𞁝 𞁞 𞁟 𞁠 𞁡 𞁢 𞁣 𞁤 𞁥 𞁦 𞁧 𞁨 𞁩 𞁪 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-8", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Cyrillic Extended-D block also contains many Cyrillic subscripts: 𞁑 𞁒 𞁓 𞁔 𞁕 𞁖 𞁗 𞁘 𞁙 𞁚 𞁛 𞁜 𞁝 𞁞 𞁟 𞁠 𞁡 𞁢 𞁣 𞁤 𞁥 𞁦 𞁧 𞁨 𞁩 𞁪 . Here they are arranged in alphabetical order for comparison (or for copy and paste convenience). Since these characters appear in different Unicode ranges, they may not appear to be the same size or position due to font substitution by the browser. Shaded cells mark petite capitals that are not very distinct from minuscules in Roman typeface, but they may be distinct in italic typeface, as is used in some phonetic notation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-9", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Shaded cells mark petite capitals that are not very distinct from minuscules in Roman typeface, but they may be distinct in italic typeface, as is used in some phonetic notation. Parentheses are shown in the basic superscript block above, and the exclamation mark ⟨ ꜝ ⟩ is shown in the IPA table below. In a supporting font, a question mark may be created with a superscript gelded question mark and a combining dot below: ⟨ ˀ̣ ⟩. * Superscript versions of petite capital A, D, E and P, of ƀ, and subscript versions of w, y and z are scheduled to be released with version 18 of the Unicode Standard.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-10", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "* Superscript versions of petite capital A, D, E and P, of ƀ, and subscript versions of w, y and z are scheduled to be released with version 18 of the Unicode Standard. Some of these superscript capitals are small caps in the source documents in the Unicode proposals. Superscript Ä, Ö, Ü (in parentheses) are composed of the base letter and a combining tréma . Except for the iota subscript , which has use in Greek text, the modifier Greek letters are intended as phonetic characters in Latin-script text. Shaded cells are indistinguishable from Latin letters, and so would not be expected to have distinctive use in Latin text or to be supported by Unicode.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-11", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Shaded cells are indistinguishable from Latin letters, and so would not be expected to have distinctive use in Latin text or to be supported by Unicode. ^ In some fonts, script-a ᵅ and ᶹ have the form of superscript Greek alpha and upsilon, in others they are not a close match. * Superscript versions of Greek psi and omega are scheduled for version 18 of the Unicode Standard. Cyrillic modifier characters are intended for use in Cyrillic text. are handled with diacritics, ⟨𞀵̈ 𞁌̈ 𞀸̆ 𞁁̆⟩ etc. Many of the Cyrillic characters were added to the Cyrillic Extended-D block, which was added to the free Gentium and Andika fonts with version 6.2 in February 2023.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-12", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Many of the Cyrillic characters were added to the Cyrillic Extended-D block, which was added to the free Gentium and Andika fonts with version 6.2 in February 2023. They are supported by the free Gentium and Andika fonts. Additional superscript characters for historical and para-IPA letters are scheduled to be released with version 18 of the Unicode Standard in 2026. The entire Latin Extended-F block is dedicated to superscript IPA. Characters for sounds with secondary articulation are set off in parentheses and placed below the letter for the primary articulation. Ejectives The spacing diacritic for ejective consonants, U+2BC, works with superscript letters despite not being superscript itself: ⟨ ᵖʼ ᵗʼ ᶜʼ ᵏˣʼ ⟩.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-13", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Ejectives The spacing diacritic for ejective consonants, U+2BC, works with superscript letters despite not being superscript itself: ⟨ ᵖʼ ᵗʼ ᶜʼ ᵏˣʼ ⟩. If a distinction needs to be made, the combining apostrophe U+315 may be used: ⟨ ᵖ̕ ᵗ̕ ᶜ̕ ᵏˣ̕ ⟩. IPA once had an idiosyncratic curl on some of the palatalized letters: these are the fricative letters ⟨ ʆ ʓ ⟩ and the homologous affricates. (The similar lateral fricative 𝽧 is not supported.) Old-style IPA click letters, voiceless implosives, and the retired letters ⟨ ƞ ⟩ and ⟨ ɼ ⟩ have also been accepted for version 18 of the Unicode Standard.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-14", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "(The similar lateral fricative 𝽧 is not supported.) Old-style IPA click letters, voiceless implosives, and the retired letters ⟨ ƞ ⟩ and ⟨ ɼ ⟩ have also been accepted for version 18 of the Unicode Standard. The Teuthonista letter ⟨ ꜧ ⟩ (U+A727) is also an old graphic variant of ⟨ ɮ ⟩. Its superscript is supported at ⟨ ꭜ ⟩ (U+AB5C). Para-IPA Among para-IPA letters, superscript variants of Sinological ⟨ ȡ ȴ ȵ ȶ ⟩, of the Bantuist labio-dental plosives ⟨ ȹ ⟩ and ⟨ ȸ ⟩, of the central semivowels ⟨ ɉ ⟩, ⟨ ɥ̶ ⟩, and ⟨ w̶ ⟩, of the extended old-style click letters ⟨ 𝼋 ⟩ and ⟨ ψ ⟩, and of the voiceless bilabial trill ⟨ ᴘ ⟩ have been accepted for version 18 of the Unicode Standard.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-15", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Para-IPA Among para-IPA letters, superscript variants of Sinological ⟨ ȡ ȴ ȵ ȶ ⟩, of the Bantuist labio-dental plosives ⟨ ȹ ⟩ and ⟨ ȸ ⟩, of the central semivowels ⟨ ɉ ⟩, ⟨ ɥ̶ ⟩, and ⟨ w̶ ⟩, of the extended old-style click letters ⟨ 𝼋 ⟩ and ⟨ ψ ⟩, and of the voiceless bilabial trill ⟨ ᴘ ⟩ have been accepted for version 18 of the Unicode Standard. Recently retired alternative letters such as ⟨ ɩ ɷ ⟩ are also supported; they are set off in parentheses and placed below the modern IPA letters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-16", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Recently retired alternative letters such as ⟨ ɩ ɷ ⟩ are also supported; they are set off in parentheses and placed below the modern IPA letters. Rhotic vowels The precomposed Unicode rhotic vowel letters ⟨ ɚ ɝ ⟩ are not directly supported. The retired and later briefly resurrected vowel letter ⟨ ʚ ⟩ (U+029A) is not supported as a superscript, only its reversed replacement ⟨ ɞ ⟩ is. Para-IPA Among para-IPA letters, Sinological superscript ⟨ ɿ ʅ ʮ ʯ ⟩ have been accepted for version 18 of the Unicode Standard, as have Sinological ⟨ ᴀ ᴇ ⟩ and the English dictionary and phonetics symbols ⟨ ᵿ ⟩ and ⟨ ω ⟩.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-17", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Para-IPA Among para-IPA letters, Sinological superscript ⟨ ɿ ʅ ʮ ʯ ⟩ have been accepted for version 18 of the Unicode Standard, as have Sinological ⟨ ᴀ ᴇ ⟩ and the English dictionary and phonetics symbols ⟨ ᵿ ⟩ and ⟨ ω ⟩. ᴺC (prenasalized consonant), ꟲN (prestopped nasal), Pꟳ (fricative release), D꟱ (sibilant release, added to Unicode in 2025), NᴾF (epenthetic plosive), CVNᵀ (tone-bearing syllable), Cᴸ (liquid or lateral release), Cᴿ (rhotic or resonant release), Vᴳ (off-glide/diphthong), Cⱽ (fleeting vowel). Superscript Ʞ for fleeting/epenthetic click is not included in the Unicode Standard. Other basic Latin superscript wildcards for tone and weak indeterminate sounds, as described in International Phonetic Alphabet § Capital letters , are mostly supported.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-18", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Other basic Latin superscript wildcards for tone and weak indeterminate sounds, as described in International Phonetic Alphabet § Capital letters , are mostly supported. The copyright © and registered trademark signs ® are also in this block; they are set as superscript in some fonts. The General Punctuation block contains the permille sign ‰ and the per-ten-thousand sign ‱ , and Basic Latin has the percent sign % . The Letterlike Symbols block contains a few symbols composed of subscript and superscript characters: ℀ ℁ ℅ ℆ № ℠ ™ ⅍ . The Enclosed Alphanumeric Supplement block contains three superscript abbreviations 🅪 🅫 🅬 : MC for marque de commerce ( trademark ), MD for marque déposée ( registered trademark ), both used in Canada; MR for marca registrada (registered trademark) in Spanish and Portuguese speaking countries.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-19", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Enclosed Alphanumeric Supplement block contains three superscript abbreviations 🅪 🅫 🅬 : MC for marque de commerce ( trademark ), MD for marque déposée ( registered trademark ), both used in Canada; MR for marca registrada (registered trademark) in Spanish and Portuguese speaking countries. The Unified Canadian Aboriginal Syllabics and its Extended blocks contain several letters composed with superscripted letters to indicate extended sound values: Main block ᐂ ᐫ ᐬ ᐭ ᐮ ᐰ ᑍ ᑧ ᑨ ᑩ ᑪ ᑬ ᒅ ᒆ ᒇ ᒈ ᒊ ᒤ ᓁ ᓔ ᓮ ᔌ ᔍ ᔎ ᔏ ᔧ ᕅ ᕔ ᕿ ᖀ ᖁ ᖂ ᖃ ᖄ ᖎ ᖏ ᖐ ᖑ ᖒ ᖓ ᖔ ᙯ ᙰ ᙱ ᙲ ᙳ ᙴ ᙵ ᙶ , Extended block ᢰ ᢱ ᢲ ᢳ ᢴ ᢵ ᢶ ᢷ ᢸ ᢹ ᢺ ᢻ ᢼ ᢽ ᢾ ᢿ ᣀ ᣁ ᣂ ᣃ ᣄ ᣅ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-20", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The Unified Canadian Aboriginal Syllabics and its Extended blocks contain several letters composed with superscripted letters to indicate extended sound values: Main block ᐂ ᐫ ᐬ ᐭ ᐮ ᐰ ᑍ ᑧ ᑨ ᑩ ᑪ ᑬ ᒅ ᒆ ᒇ ᒈ ᒊ ᒤ ᓁ ᓔ ᓮ ᔌ ᔍ ᔎ ᔏ ᔧ ᕅ ᕔ ᕿ ᖀ ᖁ ᖂ ᖃ ᖄ ᖎ ᖏ ᖐ ᖑ ᖒ ᖓ ᖔ ᙯ ᙰ ᙱ ᙲ ᙳ ᙴ ᙵ ᙶ , Extended block ᢰ ᢱ ᢲ ᢳ ᢴ ᢵ ᢶ ᢷ ᢸ ᢹ ᢺ ᢻ ᢼ ᢽ ᢾ ᢿ ᣀ ᣁ ᣂ ᣃ ᣄ ᣅ . edit ] ^ For a general overview and technical information on glyph substitution (though not specifically for fractions), see GSUB — Glyph Substitution Table in the OpenType specification on the Microsoft Typography site .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-21", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "edit ] ^ For a general overview and technical information on glyph substitution (though not specifically for fractions), see GSUB — Glyph Substitution Table in the OpenType specification on the Microsoft Typography site . ^ Such as Andika , Arno Pro , Brill , Brioso Pro , Calibri , Candara , Carlito , Cantarell , FiraGO , EB Garamond , Gentium , Lato , Linux Libertine , Noto Sans , Noto Serif , Open Sans and Yrsa ^ Such as Chrome , Firefox and Falkon ^ Such as LibreOffice Writer ^ Such as Adobe InDesign and Scribus ^ ⟨ ◌̫ ⟩ and ⟨ ◌᫇ ⟩ are traditionally typeset as an omega.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-22", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "^ Such as Andika , Arno Pro , Brill , Brioso Pro , Calibri , Candara , Carlito , Cantarell , FiraGO , EB Garamond , Gentium , Lato , Linux Libertine , Noto Sans , Noto Serif , Open Sans and Yrsa ^ Such as Chrome , Firefox and Falkon ^ Such as LibreOffice Writer ^ Such as Adobe InDesign and Scribus ^ ⟨ ◌̫ ⟩ and ⟨ ◌᫇ ⟩ are traditionally typeset as an omega. ^ ⟨ ͺ ⟩ is set lower than a normal subscript. It is equivalent to underscript ⟨ ◌ͅ ⟩ on a space.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-23", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "^ ⟨ ͺ ⟩ is set lower than a normal subscript. It is equivalent to underscript ⟨ ◌ͅ ⟩ on a space. ^ Superscript ⟨ ç ⟩ is composed of superscript c and a combining cedilla , which should display properly in a good font. Superscript c was specifically requested for this purpose in Unicode proposal L2/03-180. ^ U+02E4 ˤ MODIFIER LETTER SMALL REVERSED GLOTTAL STOP is the superscript variant of U+0295 ʕ LATIN LETTER PHARYNGEAL VOICED FRICATIVE and is defined for IPA use. The similar character U+02C1 ˁ MODIFIER LETTER REVERSED GLOTTAL STOP is a reversed U+02C0 ˀ MODIFIER LETTER GLOTTAL STOP , perhaps a gelded reversed question mark.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-24", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "The similar character U+02C1 ˁ MODIFIER LETTER REVERSED GLOTTAL STOP is a reversed U+02C0 ˀ MODIFIER LETTER GLOTTAL STOP , perhaps a gelded reversed question mark. Fonts are inconsistent in whether they look different and what the difference is. ^ In Microsoft fonts, superscript ⟨ ɫ ⟩ was erroneously designed as a superscript ⟨ ꬸ ⟩. ^ U+A71D ⟨ ꜝ ⟩ and A71E ⟨ ꜞ ⟩ were adopted as the Africanist equivalents of the IPA characters ⟨ ꜜ ⟩ downstep and ⟨ ꜛ ⟩ upstep . Their correspondence to the IPA click letter ⟨ ǃ ⟩ and the extIPA percussive consonant ⟨ ¡ ⟩ is thus accidental.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-25", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "Their correspondence to the IPA click letter ⟨ ǃ ⟩ and the extIPA percussive consonant ⟨ ¡ ⟩ is thus accidental. The other percussive letters, ⟨ ʬ ⟩ and ⟨ ʭ ⟩, do not have superscript support in Unicode, though they can be hacked by stacking diacritics as here. ^ U+1D4C ᵌ MODIFIER LETTER SMALL TURNED OPEN E and U+1D9F ᶟ MODIFIER LETTER SMALL REVERSED OPEN E are mistakenly both defined as modifier U+025C ɜ LATIN SMALL LETTER REVERSED OPEN E in their Unicode properties, though the former is named as the modifier variant of U+1D08 ᴈ LATIN SMALL LETTER TURNED OPEN E .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts-26", "source": "https://en.wikipedia.org/wiki/Unicode_subscripts_and_superscripts", "title": "Unicode subscripts and superscripts", "text": "^ U+1D4C ᵌ MODIFIER LETTER SMALL TURNED OPEN E and U+1D9F ᶟ MODIFIER LETTER SMALL REVERSED OPEN E are mistakenly both defined as modifier U+025C ɜ LATIN SMALL LETTER REVERSED OPEN E in their Unicode properties, though the former is named as the modifier variant of U+1D08 ᴈ LATIN SMALL LETTER TURNED OPEN E . ^ This Unicode character is actually the Vietnamese diacritic dấu hỏi , but the same shape is used for laryngealization in phonetic notation, e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-0", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "50 CE to present Descendants ℟ ℞ ® Ɍ ᚱ 𐍂 Ꭱ Sisters Р ר ر ܪ ࠓ 𐎗 𐡓 ረ Ռ ռ Ր ր ર र Other Associated graphs r(x) rh Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . R ( minuscule : r ) is the eighteenth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is ar (pronounced / ˈ ɑːr / ), plural ars . The letter ⟨r⟩ is the eighth most common letter in English and the fourth-most common consonant, after ⟨t⟩ , ⟨n⟩ , and ⟨s⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-1", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The letter ⟨r⟩ is the eighth most common letter in English and the fourth-most common consonant, after ⟨t⟩ , ⟨n⟩ , and ⟨s⟩ . This name is preserved in French and many other languages. In Middle English , the name of the letter changed from /ɛr/ to /ar/ , following a pattern exhibited in many other words such as farm (compare French ferme ) and star (compare German Stern ). In Hiberno-English , the letter is called /ɒr/ or /ɔːr/ , somewhat similar to oar , ore , orr . The letter ⟨R⟩ is sometimes referred to as the littera canīna ' canine letter ' , often rendered in English as the dog's letter .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-2", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The letter ⟨R⟩ is sometimes referred to as the littera canīna ' canine letter ' , often rendered in English as the dog's letter . This Latin term referred to the Latin ⟨R⟩ that was trilled to sound like a growling dog, a spoken style referred to as vōx canīna ' dog voice ' (e.g. The letter ⟨R⟩ is believed to derive ultimately from an image of a head, used in Semitic alphabets for the sound /r/ because the word for 'head' was rêš or similar in most Semitic languages . The descending diagonal stroke develops as a graphic variant in some Western Greek alphabets (writing rho as ⟨ ⟩), but it was not adopted in most Old Italic alphabets ; most Old Italic alphabets show variants of their rho between a ⟨P⟩ and a ⟨D⟩ shape, but without the Western Greek descending stroke.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-3", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The descending diagonal stroke develops as a graphic variant in some Western Greek alphabets (writing rho as ⟨ ⟩), but it was not adopted in most Old Italic alphabets ; most Old Italic alphabets show variants of their rho between a ⟨P⟩ and a ⟨D⟩ shape, but without the Western Greek descending stroke. Indeed, the oldest known forms of the Latin alphabet itself of the 7th to 6th centuries BC, in the Duenos and the Forum inscription , still write ⟨r⟩ using the ⟨P⟩ shape of the letter. The descending stroke of the Latin letter ⟨R⟩ has fully developed by the 3rd century BC, as seen in the Tomb of the Scipios sarcophagus inscriptions of that era.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-4", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "The descending stroke of the Latin letter ⟨R⟩ has fully developed by the 3rd century BC, as seen in the Tomb of the Scipios sarcophagus inscriptions of that era. 50 AD , the letter ⟨P⟩ would be written with its loop fully closed, assuming the shape formerly taken by ⟨R⟩ . Along with Latin minuscule writing in general, it developed ultimately from Roman cursive via the uncial script of Late Antiquity into the Carolingian minuscule of the 9th century. In handwriting, it was common not to close the bottom of the loop but continue into the leg, saving an extra pen stroke.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-5", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "In handwriting, it was common not to close the bottom of the loop but continue into the leg, saving an extra pen stroke. The loop-leg stroke shortened into the simple arc used in the Carolingian minuscule and until today. A calligraphic minuscule ⟨r⟩ , known as r rotunda ⟨ꝛ⟩ , was used in the sequence ⟨or⟩ , bending the shape of the ⟨r⟩ to accommodate the bulge of the ⟨o⟩ as in ⟨oꝛ⟩ , as opposed to ⟨or⟩ . Later, the same variant was also used where ⟨r⟩ followed other lower case letters with a rounded loop towards the right, such as with ⟨b⟩ , ⟨h⟩ , ⟨p⟩ , as well as to write the geminate ⟨rr⟩ as ⟨ꝛꝛ⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-6", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "Later, the same variant was also used where ⟨r⟩ followed other lower case letters with a rounded loop towards the right, such as with ⟨b⟩ , ⟨h⟩ , ⟨p⟩ , as well as to write the geminate ⟨rr⟩ as ⟨ꝛꝛ⟩ . Use of r rotunda was mostly tied to blackletter typefaces, and the glyph fell out of use along with blackletter fonts in English language contexts mostly by the 18th century. Insular script used a minuscule which retained two downward strokes, but which did not close the loop, known as the Insular r ⟨ꞃ⟩ ; this variant survives in the Gaelic type popular in Ireland until the mid-20th century, but has become largely limited to a decorative function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-7", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "Insular script used a minuscule which retained two downward strokes, but which did not close the loop, known as the Insular r ⟨ꞃ⟩ ; this variant survives in the Gaelic type popular in Ireland until the mid-20th century, but has become largely limited to a decorative function. In non-rhotic accents, it is not pronounced in certain positions, but can affect the pronunciation of the vowel that precedes it. R is the ninth most frequently used letter in the English language. Other languages may use the letter ⟨r⟩ in their alphabets (or Latin transliteration schemes) to represent rhotic consonants different from the alveolar trill.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-8", "source": "https://en.wikipedia.org/wiki/R", "title": "R", "text": "Other languages may use the letter ⟨r⟩ in their alphabets (or Latin transliteration schemes) to represent rhotic consonants different from the alveolar trill. In Haitian Creole , it represents a sound so weak that it is often written interchangeably with ⟨w⟩ , e.g.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-0", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "For consonants that are rhotic, see Rhotic consonant . An r-colored or rhotic vowel (also called a retroflex vowel , vocalic r , or a rhotacized vowel ) is a vowel that is modified in a way that results in a lowering in frequency of the third formant . R-colored vowels can be articulated in various ways: the tip or blade of the tongue may be turned up during at least part of the articulation of the vowel (a retroflex articulation) or the back of the tongue may be bunched. In addition, the vocal tract may often be constricted in the region of the epiglottis .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-1", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "R-colored vowels can be articulated in various ways: the tip or blade of the tongue may be turned up during at least part of the articulation of the vowel (a retroflex articulation) or the back of the tongue may be bunched. In addition, the vocal tract may often be constricted in the region of the epiglottis . R-colored vowels are exceedingly rare, occurring in less than one percent of all languages. In North American English, they are found in words such as doll ar , butt er , th ir d , col or , and n ur se .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-2", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "In North American English, they are found in words such as doll ar , butt er , th ir d , col or , and n ur se . They also occur in Canadian French , some varieties of Portuguese , some Jutlandic dialects of Danish , and in a few indigenous languages of the Americas and of Asia , including Serrano and Yurok in the United States, Luobohe Miao in China, Katë in Afghanistan, and Badaga in India. For example, the IPA symbol for schwa is ⟨ ə ⟩, while the IPA symbol for an r-colored schwa is ⟨ ɚ ⟩.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-3", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "For example, the IPA symbol for schwa is ⟨ ə ⟩, while the IPA symbol for an r-colored schwa is ⟨ ɚ ⟩. Similarly, the IPA symbol for the open-mid central unrounded vowel is ⟨ ɜ ⟩, while an r-colored open-mid central unrounded vowel is ⟨ ɝ ⟩. This diacritic is the hook of ⟨ ɚ ⟩ or ⟨ ɝ ⟩, symbols constructed by John Samuel Kenyon along with ⟨ ᶔ ⟩ by adding the retroflex hook (right hook) to ⟨ ə ⟩ and ⟨ ɜ ⟩. In 1976 the retroflex hook was dropped due to insufficient usage.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-4", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "This diacritic is the hook of ⟨ ɚ ⟩ or ⟨ ɝ ⟩, symbols constructed by John Samuel Kenyon along with ⟨ ᶔ ⟩ by adding the retroflex hook (right hook) to ⟨ ə ⟩ and ⟨ ɜ ⟩. In 1976 the retroflex hook was dropped due to insufficient usage. In 1989, at the Kiel Convention , the hook of ⟨ ɚ ⟩ and ⟨ ɝ ⟩ was adopted as a diacritic placed on the right side of the vowel symbol for r-colored vowels, e.g. Following the convention of alternating ⟨ ɜ ⟩ and ⟨ ə ⟩ for non-rhotic accents, in some English adaptations of IPA, ⟨ ɝ ⟩ and ⟨ ɚ ⟩ signify stressed and unstressed, respectively, rather than a difference in phonetic quality.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-5", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "Following the convention of alternating ⟨ ɜ ⟩ and ⟨ ə ⟩ for non-rhotic accents, in some English adaptations of IPA, ⟨ ɝ ⟩ and ⟨ ɚ ⟩ signify stressed and unstressed, respectively, rather than a difference in phonetic quality. The use of the superscript turned r ( əʴ ) is still commonly seen. R-colored vowels are found in most rhotic forms of English, including General American and Irish English . However, there have always been other singing styles in which r-colored vowels are given their full emphasis, including traditional Irish singing styles and those of many performers of country music .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-6", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "However, there have always been other singing styles in which r-colored vowels are given their full emphasis, including traditional Irish singing styles and those of many performers of country music . Certain post-grunge singers made heavy use of this technique to such an extent that many people derisively exaggerated this tendency when referencing their music. In certain particular cases, a vowel + /r/ is pronounced instead as two syllables: a non-rhotic vowel followed by a syllabic /r/. In many words, the -r suffix ( simplified Chinese : 儿 ; traditional Chinese : 兒 ) is added to indicate some meaning changes.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-7", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "In many words, the -r suffix ( simplified Chinese : 儿 ; traditional Chinese : 兒 ) is added to indicate some meaning changes. If the word ends in a velar nasal ( ng ), the final consonant is lost and the vowel becomes nasalized . Major cities that have this form of rhotacized ending include Beijing , Tianjin , Tangshan , Shenyang , Changchun , Jilin , Harbin , and Qiqihar . This erhua has since spread to other provincial capitals not home to Standard Mandarin , such as Shijiazhuang , Jinan , Xi'an , Chongqing , and Chengdu .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-8", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "This erhua has since spread to other provincial capitals not home to Standard Mandarin , such as Shijiazhuang , Jinan , Xi'an , Chongqing , and Chengdu . Chifeng , Hailar ), and in the Northeast , vocalic r occurs as a diminutive marker of nouns ( pinyin : ér ) and the perfective aspect particle ( 了 ; le ). For example, the name of the famous restaurant Go Believe ( 狗不理 ) in Tianjin is pronounced as 'Gourbli' ( Gǒu(r)b ù lǐ → Gǒurblǐ ). The name of the street Dazhalan ( 大栅栏 ) in Beijing is pronounced as 'Da-shi-lar' ( Dàshà n là n (r) → Dàshílàr ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-9", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "The name of the street Dazhalan ( 大栅栏 ) in Beijing is pronounced as 'Da-shi-lar' ( Dàshà n là n (r) → Dàshílàr ). The non-high vowels /a/ , /e/ and /o/ could become /ɚ/ in a word that has /ɚ/ . Katë , a Nuristani language , alongside neighboring languages such as Indo-Aryan Kalasha , has a rhotic vowel denoted as /ɘ˞/ . ^ (in Portuguese) Acoustic-phonetic characteristics of the Brazilian Portuguese's retroflex /r/: data from respondents in Pato Branco, Paraná Archived 2016-03-03 at the Wayback Machine . Pages 19–21 ^ (in Portuguese) Syllable coda /r/ in the \"capital\" of the Paulista hinterland: sociolinguistic analysis Archived 2013-09-26 at the Wayback Machine .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/R-colored_vowel-10", "source": "https://en.wikipedia.org/wiki/R-colored_vowel", "title": "R-colored vowel", "text": "Pages 19–21 ^ (in Portuguese) Syllable coda /r/ in the \"capital\" of the Paulista hinterland: sociolinguistic analysis Archived 2013-09-26 at the Wayback Machine .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-0", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "700 BCE to present Descendants Th (digraph) ™ ₮ ₸ Ŧ Ť Ţ Ʇ Sisters 𐍄 Т Ҭ Ћ Ҵ ת ت ܬ ة ࠕ 𐎚 𐎙 ተ ፐ Տ տ Ց ց त ट ત ટ ⶊ Other Associated graphs t(x) , th , tzsch Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . Without proper rendering support , you may see question marks, boxes, or other symbols instead of the intended characters. T ( minuscule : t ) is the twentieth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-1", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "T ( minuscule : t ) is the twentieth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is tee (pronounced / ˈ t iː / ), plural tees . It is derived from the Semitic Taw 𐤕 of the Phoenician and Paleo-Hebrew script ( Aramaic and Hebrew Taw ת/𐡕/ , Syriac Taw ܬ, and Arabic ت Tāʼ ) via the Greek letter τ ( tau ). In English, it is most commonly used to represent the voiceless alveolar plosive , a sound it also denotes in the International Phonetic Alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-2", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "In English, it is most commonly used to represent the voiceless alveolar plosive , a sound it also denotes in the International Phonetic Alphabet . It is the most commonly used consonant and the second-most commonly used letter in English-language texts. History Taw was the last letter of the Western Semitic and Hebrew alphabets . Use in writing systems English In English, ⟨t⟩ usually denotes the voiceless alveolar plosive ( International Phonetic Alphabet : / t / ), as in tart , tee , or ties , often with aspiration at the beginnings of words or before stressed vowels.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-3", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "Use in writing systems English In English, ⟨t⟩ usually denotes the voiceless alveolar plosive ( International Phonetic Alphabet : / t / ), as in tart , tee , or ties , often with aspiration at the beginnings of words or before stressed vowels. The letter ⟨t⟩ corresponds to the affricate /t͡ʃ/ in some words as a result of yod-coalescence (for example, in words ending in -\"ture\", such as future ). A common digraph is ⟨th⟩ , which usually represents a dental fricative , but occasionally represents /t/ (as in Thomas and thyme ). The digraph ⟨ti⟩ often corresponds to the sound /ʃ/ (a voiceless palato-alveolar sibilant ) word-medially when followed by a vowel, as in nation , ratio , negotiation , and Croatia .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-4", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "The digraph ⟨ti⟩ often corresponds to the sound /ʃ/ (a voiceless palato-alveolar sibilant ) word-medially when followed by a vowel, as in nation , ratio , negotiation , and Croatia . In a few words of modern French origin, the letter T is silent at the end of a word; these include croquet and debut . Other languages In the orthographies of other languages, ⟨t⟩ is often used for /t/ , the voiceless dental plosive /t̪/ , or similar sounds. Related characters Descendants and related characters in the Latin alphabet A curly T pictured in the coat of arms of the former Teisko municipality, which was consolidated to Tampere .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/T-5", "source": "https://en.wikipedia.org/wiki/T", "title": "T", "text": "Related characters Descendants and related characters in the Latin alphabet A curly T pictured in the coat of arms of the former Teisko municipality, which was consolidated to Tampere . 𝼪 : Small t with mid-height left hook was used by the British and Foreign Bible Society in the early 20th century for romanization of the Malayalam language. Other The letter T in German Sign Language Unicode treats representation of letters of the Latin alphabet written in insular script as a typeface choice that needs no separate coding. U+A786 Ꞇ LATIN CAPITAL LETTER INSULAR T and U+A787 ꞇ LATIN SMALL LETTER INSULAR T are provided for use by phonetics specialists.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-0", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "A ring torus with a selection of circles on its surface As the distance from the axis of revolution decreases, the ring torus becomes a horn torus, then a spindle torus, and finally degenerates into a double-covered sphere . A ring torus with aspect ratio 3, the ratio between the diameters of the larger (blue) circle and the smaller (red) circle. The radius denoted by capital, R, is the distance from the geometric center of the outer ring lying outside the volume, to the center of the inner ring. The radius denoted by lower case, r, is the distance from the inner ring's center to the surface of the torus.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-1", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The radius denoted by lower case, r, is the distance from the inner ring's center to the surface of the torus. : tori or toruses ) is a surface of revolution generated by revolving a circle in three-dimensional space one full revolution about an axis that is coplanar with the circle. A ring torus is sometimes colloquially referred to as a doughnut . If the axis of revolution does not touch the circle, the surface has a ring shape and is called a torus of revolution , also known as a ring torus . If the axis of revolution is tangent to the circle, the surface is a horn torus .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-2", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "If the axis of revolution does not touch the circle, the surface has a ring shape and is called a torus of revolution , also known as a ring torus . If the axis of revolution is tangent to the circle, the surface is a horn torus . If the axis of revolution passes twice through the circle, the surface is a spindle torus (or self-crossing torus or self-intersecting torus ). If the axis of revolution passes through the center of the circle, the surface is a degenerate torus, a double-covered sphere . If the revolved curve is not a circle, the surface is called a toroid , as in a square toroid.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-3", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "If the revolved curve is not a circle, the surface is called a toroid , as in a square toroid. A torus is different than a solid torus , which is formed by rotating a disk , rather than a circle, around an axis. A solid torus is a torus plus the volume inside the torus. In topology , a ring torus is homeomorphic to the Cartesian product of two circles : S × S , which is sometimes used as the definition. The ring torus is one way to embed this space into Euclidean space , but another way to do this is the Cartesian product of the embedding of S in the plane with itself.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-4", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The ring torus is one way to embed this space into Euclidean space , but another way to do this is the Cartesian product of the embedding of S in the plane with itself. In the field of topology , a torus is any topological space that is homeomorphic to a torus. The surface of a coffee cup and a doughnut are both topological tori with genus one. An example of a torus can be constructed by taking a rectangular strip of flexible material such as rubber, and joining the top edge to the bottom edge, and the left edge to the right edge, without any half-twists (compare Klein bottle ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-5", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "An example of a torus can be constructed by taking a rectangular strip of flexible material such as rubber, and joining the top edge to the bottom edge, and the left edge to the right edge, without any half-twists (compare Klein bottle ). The ratio R / r is called the aspect ratio of the torus. R r describes the self-intersecting spindle torus; its inner shell is a lemon and its outer shell is an apple . The losses in surface area and volume on the inner side of the tube exactly cancel out the gains on the outer side.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-6", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The losses in surface area and volume on the inner side of the tube exactly cancel out the gains on the outer side. As a torus has, effectively, two center points, the centerpoints of the angles are moved; φ measures the same angle as it does in the spherical system, but is known as the \"toroidal\" direction. These terms were first used in a discussion of the Earth's magnetic field, where \"poloidal\" was used to denote \"the direction toward the poles\". In modern use, toroidal and poloidal are more commonly used to discuss magnetic confinement fusion devices.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-7", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "These terms were first used in a discussion of the Earth's magnetic field, where \"poloidal\" was used to denote \"the direction toward the poles\". In modern use, toroidal and poloidal are more commonly used to discuss magnetic confinement fusion devices. The usual differential operators of vector calculus can be calculated using the same parametrization to obtain their ring toroidal forms. For example, the Laplace operator for the ring torus, with the same variable ranges as for the integrals above, is given by the expression below. One can check that the square root of the determinant of the metric tensor is equal to the determinant of the Jacobi matrix, i.e.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-8", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "One can check that the square root of the determinant of the metric tensor is equal to the determinant of the Jacobi matrix, i.e. This can be viewed as lying in C and is a subset of the 3-sphere S of radius √2 . This topological torus is also often called the Clifford torus . In fact, S is filled out by a family of nested tori in this manner (with two degenerate circles), a fact that is important in the study of S as a fiber bundle over S (the Hopf bundle ). The surface described above, given the relative topology from R , is homeomorphic to a topological torus as long as it does not intersect its own axis.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-9", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The surface described above, given the relative topology from R , is homeomorphic to a topological torus as long as it does not intersect its own axis. A particular homeomorphism is given by stereographically projecting the topological torus into R from the north pole of S . Turning a punctured torus inside-out The fundamental group of the torus is just the direct product of the fundamental group of the circle with itself: π 1 ( T 2 ) = π 1 ( S 1 ) × π 1 ( S 1 ) ≅ Z × Z .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-10", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Turning a punctured torus inside-out The fundamental group of the torus is just the direct product of the fundamental group of the circle with itself: π 1 ( T 2 ) = π 1 ( S 1 ) × π 1 ( S 1 ) ≅ Z × Z . An equivalent statement may be imagined as two shoelaces passing through each other, then unwinding, then rewinding. The cohomology groups with integer coefficients are isomorphic to the homology ones-- which can be seen either by direct computation, the universal coefficient theorem or even Poincaré duality .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-11", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The cohomology groups with integer coefficients are isomorphic to the homology ones-- which can be seen either by direct computation, the universal coefficient theorem or even Poincaré duality . If a torus is punctured and turned inside out then another torus results, with lines of latitude and longitude interchanged. This is equivalent to building a torus from a cylinder, by joining the circular ends together, in two ways: around the outside like joining two ends of a garden hose, or through the inside like rolling a sock (with the toe cut off). Additionally, if the cylinder was made by gluing two opposite sides of a rectangle together, choosing the other two sides instead will cause the same reversal of orientation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-12", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Additionally, if the cylinder was made by gluing two opposite sides of a rectangle together, choosing the other two sides instead will cause the same reversal of orientation. Every conformal structure on the 2-torus can be represented as such a two-sheeted cover of the 2-sphere. The points on the torus corresponding to the ramification points are the Weierstrass points . In fact, the conformal type of the torus is determined by the cross-ratio of the four points. (This is the more typical meaning of the term \" n -torus\", the other referring to n holes or of genus n .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-13", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(This is the more typical meaning of the term \" n -torus\", the other referring to n holes or of genus n . ) Just as the ordinary torus is topologically the product space of two circles, the n -dimensional torus is topologically equivalent to the product of n circles. The torus discussed above is the standard 2-torus, T . And similar to the 2-torus, the n -torus, T can be described as a quotient of R under integral shifts in any coordinate. That is, the n -torus is R modulo the action of the integer lattice Z (with the action being taken as vector addition).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-14", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "That is, the n -torus is R modulo the action of the integer lattice Z (with the action being taken as vector addition). Equivalently, the n -torus is obtained from the n -dimensional hypercube by gluing the opposite faces together. An n -torus in this sense is an example of an n- dimensional compact manifold . It is also an example of a compact abelian Lie group . This follows from the fact that the unit circle is a compact abelian Lie group (when identified with the unit complex numbers with multiplication). Group multiplication on the torus is then defined by coordinate-wise multiplication.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-15", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "This follows from the fact that the unit circle is a compact abelian Lie group (when identified with the unit complex numbers with multiplication). Group multiplication on the torus is then defined by coordinate-wise multiplication. This is due in part to the fact that in any compact Lie group G one can always find a maximal torus ; that is, a closed subgroup which is a torus of the largest possible dimension. Toroidal groups are examples of protori , which (like tori) are compact connected abelian groups, which are not required to be manifolds .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-16", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Toroidal groups are examples of protori , which (like tori) are compact connected abelian groups, which are not required to be manifolds . Automorphisms of T are easily constructed from automorphisms of the lattice Z , which are classified by invertible integral matrices of size n with an integral inverse; these are just the integral matrices with determinant ±1 . The fundamental group of an n -torus is a free abelian group of rank n . The k th homology group of an n -torus is a free abelian group of rank n choose k .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-17", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The k th homology group of an n -torus is a free abelian group of rank n choose k . It follows that the Euler characteristic of the n -torus is 0 for all n . The Tonnetz is an example of a torus in music theory. The Tonnetz is only truly a torus if enharmonic equivalence is assumed, so that the (F♯-A♯) segment of the right edge of the repeated parallelogram is identified with the (G♭-B♭) segment of the left edge. As the n -torus is the n -fold product of the circle, the n -torus is the configuration space of n ordered, not necessarily distinct points on the circle.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-18", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "As the n -torus is the n -fold product of the circle, the n -torus is the configuration space of n ordered, not necessarily distinct points on the circle. These orbifolds have found significant applications to music theory in the work of Dmitri Tymoczko and collaborators (Felipe Posada, Michael Kolinas, et al.), being used to model musical triads . Seen in stereographic projection , a 4D flat torus can be projected into 3-dimensions and rotated on a fixed axis. It is seen here stereographically projected into 3-space as a torus. A flat torus is a torus with the metric inherited from its representation as the quotient , R / L , where L is a discrete subgroup of R isomorphic to Z .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-19", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "A flat torus is a torus with the metric inherited from its representation as the quotient , R / L , where L is a discrete subgroup of R isomorphic to Z . Perhaps the simplest example of this is when L = Z : R / Z , which can also be described as the Cartesian plane under the identifications ( x , y ) ~ ( x + 1, y ) ~ ( x , y + 1) . This particular flat torus (and any uniformly scaled version of it) is known as the square flat torus.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-20", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "This particular flat torus (and any uniformly scaled version of it) is known as the square flat torus. This metric of the square flat torus can also be realised by specific embeddings of the familiar 2-torus into Euclidean 4-space or higher dimensions. It is flat in the same sense that the surface of a cylinder is flat. In 3 dimensions, one can bend a flat sheet of paper into a cylinder without stretching the paper, but this cylinder cannot be bent into a torus without stretching the paper (unless some regularity and differentiability conditions are given up, see below).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-21", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "In 3 dimensions, one can bend a flat sheet of paper into a cylinder without stretching the paper, but this cylinder cannot be bent into a torus without stretching the paper (unless some regularity and differentiability conditions are given up, see below). It is diffeomorphic to a regular torus but not isometric . It can not be analytically embedded ( smooth of class C , 2 ≤ k ≤ ∞ ) into Euclidean 3-space. In particular, for certain very specific choices of a square flat torus in the 3-sphere S , where η = π/4 above, the torus will partition the 3-sphere into two congruent solid tori subsets with the aforesaid flat torus surface as their common boundary .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-22", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "In particular, for certain very specific choices of a square flat torus in the 3-sphere S , where η = π/4 above, the torus will partition the 3-sphere into two congruent solid tori subsets with the aforesaid flat torus surface as their common boundary . It is known that there exists no C (twice continuously differentiable) embedding of a flat torus into 3-space. (The idea of the proof is to take a large sphere containing such a flat torus in its interior, and shrink the radius of the sphere until it just touches the torus for the first time.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-23", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(The idea of the proof is to take a large sphere containing such a flat torus in its interior, and shrink the radius of the sphere until it just touches the torus for the first time. But that would imply that part of the torus, since it has zero curvature everywhere, must lie strictly outside the sphere, which is a contradiction.) On the other hand, according to the Nash-Kuiper theorem , which was proven in the 1950s, an isometric C embedding exists. This is solely an existence proof and does not provide explicit equations for such an embedding.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-24", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "But that would imply that part of the torus, since it has zero curvature everywhere, must lie strictly outside the sphere, which is a contradiction.) On the other hand, according to the Nash-Kuiper theorem , which was proven in the 1950s, an isometric C embedding exists. This is solely an existence proof and does not provide explicit equations for such an embedding. It is a flat torus in the sense that, as a metric space, it is isometric to a flat square torus. It is similar in structure to a fractal as it is constructed by repeatedly corrugating an ordinary torus at smaller scales.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-25", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "It is similar in structure to a fractal as it is constructed by repeatedly corrugating an ordinary torus at smaller scales. The key to obtaining the smoothness of this corrugated torus is to have the amplitudes of successive corrugations decreasing faster than their \"wavelengths\". (These infinitely recursive corrugations are used only for embedding into three dimensions; they are not an intrinsic feature of the flat torus.) This is the first time that any such embedding was defined by explicit equations or depicted by computer graphics. The Uniformization theorem guarantees that every Riemann surface is conformally equivalent to one that has constant Gaussian curvature .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-26", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The Uniformization theorem guarantees that every Riemann surface is conformally equivalent to one that has constant Gaussian curvature . Then one defines the \" moduli space \" of the torus to contain one point for each conformal equivalence class, with the appropriate topology. It turns out that this moduli space M may be identified with a punctured sphere that is smooth except for two points that have less angle than 2π (radians) around them: One has total angle π and the other has total angle 2π/3. M may be turned into a compact space M* – topologically equivalent to a sphere – by adding one additional point that represents the limiting case as a rectangular torus approaches an aspect ratio of 0 in the limit.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-27", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "M may be turned into a compact space M* – topologically equivalent to a sphere – by adding one additional point that represents the limiting case as a rectangular torus approaches an aspect ratio of 0 in the limit. The result is that this compactified moduli space is a sphere with three points each having less than 2π total angle around them. (Such a point is termed a \"cusp\", and may be thought of as the vertex of a cone, also called a \"conepoint\".) This third conepoint will have zero total angle around it. Due to symmetry, M* may be constructed by glueing together two congruent geodesic triangles in the hyperbolic plane along their (identical) boundaries, where each triangle has angles of π/2 , π/3 , and 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-28", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "Due to symmetry, M* may be constructed by glueing together two congruent geodesic triangles in the hyperbolic plane along their (identical) boundaries, where each triangle has angles of π/2 , π/3 , and 0 . (The three angles of a hyperbolic triangle T determine T up to congruence.) As a result, the Gauss–Bonnet theorem shows that the area of each triangle can be calculated as π − (π/2 + π/3 + 0) = π/6 , so it follows that the compactified moduli space M* has area equal to π/3 . The other two cusps occur at the points corresponding in M* to (a) the square torus (total angle π ) and (b) the hexagonal torus (total angle 2π/3 ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-29", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The other two cusps occur at the points corresponding in M* to (a) the square torus (total angle π ) and (b) the hexagonal torus (total angle 2π/3 ). These are the only conformal equivalence classes of flat tori that have any conformal automorphisms other than those generated by translations and negation. A genus g surface is the connected sum of g two-tori. (And so the torus itself is the surface of genus 1.) To form a connected sum of two surfaces, remove from each the interior of a disk and \"glue\" the surfaces together along the boundary circles.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-30", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(And so the torus itself is the surface of genus 1.) To form a connected sum of two surfaces, remove from each the interior of a disk and \"glue\" the surfaces together along the boundary circles. (That is, merge the two boundary circles so they become just one circle.) To form the connected sum of more than two surfaces, successively take the connected sum of two of them at a time until they are all connected. In this sense, a genus g surface resembles the surface of g doughnuts stuck together side by side, or a 2-sphere with g handles attached.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-31", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "In this sense, a genus g surface resembles the surface of g doughnuts stuck together side by side, or a 2-sphere with g handles attached. As examples, a genus zero surface (without boundary) is the two-sphere while a genus one surface (without boundary) is the ordinary torus. The surfaces of higher genus are sometimes called n -holed tori (or, rarely, n -fold tori). The terms double torus and triple torus are also occasionally used. The classification theorem for surfaces states that every compact connected surface is topologically equivalent to either the sphere or the connect sum of some number of tori, disks, and real projective planes .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-32", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The classification theorem for surfaces states that every compact connected surface is topologically equivalent to either the sphere or the connect sum of some number of tori, disks, and real projective planes . For any number of holes, the formula generalizes to V − E + F = 2 − 2 g , where g is the topological genus. Toroidal polyhedra have been used to show that the maximum number of colors to color a map on a torus is seven. The Szilassi polyhedron is one example of a toroidal polyhedron with this property. The Szilassi polyhedron's dual, the Császár polyhedron , is the only polyhedron other than the tetrahedron which has the property that every possible edge connecting two vertices is an edge of the polyhedron.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-33", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "The Szilassi polyhedron's dual, the Császár polyhedron , is the only polyhedron other than the tetrahedron which has the property that every possible edge connecting two vertices is an edge of the polyhedron. The term \"toroidal polyhedron\" is also used for higher-genus polyhedra and for immersions of toroidal polyhedra, although some authors only include those with genus 1. Self-crossing toroidal polyhedra are determined by the topology of their abstract manifold. One subset of the self-crossing toroidal polyhedra are the crown polyhedra, which are the only toroidal polyhedra that are also noble . (Contrast with the four color theorem for the plane .) This construction shows the torus divided into seven regions, every one of which touches every other, meaning each must be assigned a unique color.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Torus-34", "source": "https://en.wikipedia.org/wiki/Torus", "title": "Torus", "text": "(Contrast with the four color theorem for the plane .) This construction shows the torus divided into seven regions, every one of which touches every other, meaning each must be assigned a unique color. It is a torus because the edges are considered wraparound for the purpose of finding matrices. Its name comes from the De Bruijn sequence , which can be considered a special case where n is 1 (one dimension).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-0", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "700 BCE to present Descendants Î J Ɉ İ ı Tittle ꟾ ꟷ ᛁ ᴉ Sisters І י ܝ ی ࠉ 𐎊 ዪ Ⴢ ⴢ ჲ ☞ ☚ Other Associated graphs i(x) , ij , i(x)(y) Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . I ( minuscule : i ) is the ninth letter and the third vowel letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is i (pronounced / ˈ aɪ / ), plural i's or is .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-1", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "I ( minuscule : i ) is the ninth letter and the third vowel letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is i (pronounced / ˈ aɪ / ), plural i's or is . Pronunciation of the name of the letter ⟨i⟩ in European languages History In the Phoenician alphabet , the letter may have originated in a hieroglyph for an arm that represented a voiced pharyngeal fricative ( /ʕ/ ) in Egyptian , but was reassigned to /j/ (as in English \" y es\") by Semites because their word for \"arm\" began with that sound.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-2", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Pronunciation of the name of the letter ⟨i⟩ in European languages History In the Phoenician alphabet , the letter may have originated in a hieroglyph for an arm that represented a voiced pharyngeal fricative ( /ʕ/ ) in Egyptian , but was reassigned to /j/ (as in English \" y es\") by Semites because their word for \"arm\" began with that sound. This letter could also be used to represent /i/ , the close front unrounded vowel , mainly in foreign words. The Greeks adopted a form of this Phoenician yodh as their letter iota ( ⟨Ι, ι⟩ ) to represent /i/ , the same as in the Old Italic alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-3", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "The Greeks adopted a form of this Phoenician yodh as their letter iota ( ⟨Ι, ι⟩ ) to represent /i/ , the same as in the Old Italic alphabet . In Latin (as in Modern Greek ), it was also used to represent /j/ and this use persists in the languages that descended from Latin. The modern letter ' j ' originated as a variation of 'i', and both were used interchangeably for both the vowel and the consonant, coming to be differentiated only in the 16th century. Typographic variants In some sans serif typefaces, the uppercase ⟨I⟩ may be difficult to distinguish from the lowercase letter L , 'l', the vertical bar character '|', or the digit one '1'.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-4", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Typographic variants In some sans serif typefaces, the uppercase ⟨I⟩ may be difficult to distinguish from the lowercase letter L , 'l', the vertical bar character '|', or the digit one '1'. In serifed typefaces, the capital form of the letter has both a baseline and a cap height serif, while the lowercase L generally has a hooked ascender and a baseline serif. The dot over the lowercase 'i' is sometimes called a tittle . The dot can be considered optional and is usually removed when applying other diacritics . In Turkish, dotted İ and dotless I are considered separate letters, representing a front and back vowel, respectively, and both have uppercase ('I', 'İ') and lowercase ('ı', 'i') forms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-5", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "In Turkish, dotted İ and dotless I are considered separate letters, representing a front and back vowel, respectively, and both have uppercase ('I', 'İ') and lowercase ('ı', 'i') forms. Usually these are considered equivalent, but they are distinguished in some extended Latin alphabet systems, such as the 1978 version of the African reference alphabet . In that system, the former is the uppercase counterpart of ɪ and the latter is the counterpart of 'i'. Use in writing systems English In Modern English spelling , ⟨i⟩ represents several different sounds, either the diphthong / aɪ / (\"long\" ⟨i⟩ ) as in kite , the short / ɪ / as in bill , or the ⟨ee⟩ sound / iː / in the last syllable of machine .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-6", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Use in writing systems English In Modern English spelling , ⟨i⟩ represents several different sounds, either the diphthong / aɪ / (\"long\" ⟨i⟩ ) as in kite , the short / ɪ / as in bill , or the ⟨ee⟩ sound / iː / in the last syllable of machine . In the Great Vowel Shift , Middle English /iː/ changed to Early Modern English /ei/ , which later changed to /əi/ and finally to the Modern English diphthong /aɪ/ in General American and Received Pronunciation . The letter ⟨i⟩ is the fifth most common letter in the English language .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-7", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "In the Great Vowel Shift , Middle English /iː/ changed to Early Modern English /ei/ , which later changed to /əi/ and finally to the Modern English diphthong /aɪ/ in General American and Received Pronunciation . The letter ⟨i⟩ is the fifth most common letter in the English language . This pattern arose for basically the same reason that lowercase ⟨i⟩ acquired a dot: so it wouldn't get lost in manuscripts before the age of printing : The capitalized \"I\" first showed up about 1250 in the northern and midland dialects of England, according to the Chambers Dictionary of Etymology .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-8", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "This pattern arose for basically the same reason that lowercase ⟨i⟩ acquired a dot: so it wouldn't get lost in manuscripts before the age of printing : The capitalized \"I\" first showed up about 1250 in the northern and midland dialects of England, according to the Chambers Dictionary of Etymology . Chambers however, that the capitalized form didn't become established in the south of England until the 1700s (although it appears sporadically before that time). Capitalizing the pronoun, Chambers explains, made it more distinct, thus \"avoiding misreading handwritten manuscripts.\" Other languages In many languages' orthographies , ⟨i⟩ is used to represent the sound /i/ or, more rarely, /ɪ/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-9", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Capitalizing the pronoun, Chambers explains, made it more distinct, thus \"avoiding misreading handwritten manuscripts.\" Other languages In many languages' orthographies , ⟨i⟩ is used to represent the sound /i/ or, more rarely, /ɪ/ . In mathematics, a lowercase \" i \" is used to represent the unit imaginary number , while an uppercase \" I \" serves to denote an identity matrix . In some countries, a sign bearing the letter i or i indicates an information point, sometimes specifically for a visitor center . Ies is the plural of the English name of the letter; the plural of the letter itself is rendered I's, I s, i's, or i s.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/I-10", "source": "https://en.wikipedia.org/wiki/I", "title": "I", "text": "Ies is the plural of the English name of the letter; the plural of the letter itself is rendered I's, I s, i's, or i s. In the course of time, I , V and X became identical with three letters of the alphabet; originally, however, they bore no relation to these letters.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-0", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "The imaginary unit i in the complex plane : Real numbers are conventionally drawn on the horizontal axis and imaginary numbers on the vertical axis. The imaginary unit , usually denoted by i , is a mathematical constant that is a solution to the quadratic equation x = −1 , which is not solved by any real number . Any real-number multiple of the imaginary unit is called an imaginary number . By combining the real numbers with the imaginary unit using addition and multiplication , a new number system known as the complex numbers is formed; it consists of all numbers of the form a + bi with real numbers a and b .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-1", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "By combining the real numbers with the imaginary unit using addition and multiplication , a new number system known as the complex numbers is formed; it consists of all numbers of the form a + bi with real numbers a and b . There are two complex square roots of −1 : the imaginary unit i and its additive inverse − i . More generally, every nonzero complex number has two distinct complex-valued square roots, which are additive inverses of each other, while zero has only zero as its ( double ) square root. In contexts in which use of the letter i is ambiguous or problematic, the letter j is sometimes used instead.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-2", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "In contexts in which use of the letter i is ambiguous or problematic, the letter j is sometimes used instead. For example, in electrical engineering the imaginary unit is normally denoted by j instead of i , because i is commonly used to denote electric current . The name imaginary is generally credited to René Descartes , and Isaac Newton used the term as early as 1670. The i notation was introduced by Leonhard Euler . Although the construction is called imaginary , and although the concept of an imaginary number may be intuitively more difficult to grasp than that of a real number, the construction is valid from a mathematical standpoint.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-3", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Although the construction is called imaginary , and although the concept of an imaginary number may be intuitively more difficult to grasp than that of a real number, the construction is valid from a mathematical standpoint. Real number operations can be extended to imaginary and complex numbers, by treating i as an unknown quantity while manipulating an expression (and using the definition to replace any occurrence of i with −1 ). As a complex number, i can be represented in rectangular form as 0 + 1 i , with a zero real component and a unit imaginary component.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-4", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "As a complex number, i can be represented in rectangular form as 0 + 1 i , with a zero real component and a unit imaginary component. (Adding any integer multiple of 2 π to this angle works as well.) In the complex plane , which is a special interpretation of a Cartesian plane , i is the point located one unit from the origin along the imaginary axis (which is perpendicular to the real axis ). Although the two solutions are distinct numbers, their properties are indistinguishable; there is no property that one has that the other does not.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-5", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Although the two solutions are distinct numbers, their properties are indistinguishable; there is no property that one has that the other does not. One of these two solutions is labelled + i (or simply i ) and the other is labelled − i , though it is inherently ambiguous which is which. Also, despite the signs written with them, neither + i nor − i is inherently positive or negative in the sense that real numbers are. A more formal expression of this indistinguishability of + i and − i is that, although the complex field is unique (as an extension of the real numbers) up to isomorphism , it is not unique up to a unique isomorphism.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-6", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "A more formal expression of this indistinguishability of + i and − i is that, although the complex field is unique (as an extension of the real numbers) up to isomorphism , it is not unique up to a unique isomorphism. The real unit 1 and imaginary unit i can be represented by any pair of matrices I and J satisfying I = I , IJ = JI = J , and J = − I . Then a complex number a + bi can be represented by the matrix aI + bJ , and all of the ordinary rules of complex arithmetic can be derived from the rules of matrix arithmetic.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-7", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Then a complex number a + bi can be represented by the matrix aI + bJ , and all of the ordinary rules of complex arithmetic can be derived from the rules of matrix arithmetic. Larger matrices could also be used; for example, 1 could be represented by the 4 × 4 identity matrix and i could be represented by any of the Dirac matrices for spatial dimensions. In this representation, the numbers 1 and i are at the same distance from 0 , with a right angle between them. Addition by a complex number corresponds to translation in the plane, while multiplication by a unit-magnitude complex number corresponds to rotation about the origin.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-8", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Addition by a complex number corresponds to translation in the plane, while multiplication by a unit-magnitude complex number corresponds to rotation about the origin. Every similarity transformation of the plane can be represented by a complex-linear function z ↦ a z + b . (A scalar is a quantity with no orientation, a vector is a quantity oriented like a line, and a bivector is a quantity oriented like a plane.) The square of any vector is a positive scalar, representing its length squared, while the square of any bivector is a negative scalar. The quotient of a vector with itself is the scalar 1 = u / u , and when multiplied by any vector leaves it unchanged (the identity transformation ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-9", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "The quotient of a vector with itself is the scalar 1 = u / u , and when multiplied by any vector leaves it unchanged (the identity transformation ). The quotient of any two perpendicular vectors of the same magnitude, J = u / v , which when multiplied rotates the divisor a quarter turn into the dividend, Jv = u , is a unit bivector which squares to −1 , and can thus be taken as a representative of the imaginary unit. Any sum of a scalar and bivector can be multiplied by a vector to scale and rotate it, and the algebra of such sums is isomorphic to the algebra of complex numbers.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-10", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Any sum of a scalar and bivector can be multiplied by a vector to scale and rotate it, and the algebra of such sums is isomorphic to the algebra of complex numbers. In this interpretation points, vectors, and sums of scalars and bivectors are all distinct types of geometric objects. More generally, in the geometric algebra of any higher-dimensional Euclidean space , a unit bivector of any arbitrary planar orientation squares to −1 , so can be taken to represent the imaginary unit i . Attempting to apply the calculation rules of square roots of positive real numbers to manipulate square roots of complex numbers can produce false results: − 1 = i ⋅ i = − 1 ⋅ − 1 = f a l l a c y ( − 1 ) ⋅ ( − 1 ) = 1 = 1 (incorrect).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-11", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Attempting to apply the calculation rules of square roots of positive real numbers to manipulate square roots of complex numbers can produce false results: − 1 = i ⋅ i = − 1 ⋅ − 1 = f a l l a c y ( − 1 ) ⋅ ( − 1 ) = 1 = 1 (incorrect). The imaginary unit can also be multiplied by any arbitrary real number to form an imaginary number . These numbers can be pictured on a number line , the imaginary axis , which as part of the complex plane is typically drawn with a vertical orientation, perpendicular to the real axis which is drawn horizontally.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-12", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "These numbers can be pictured on a number line , the imaginary axis , which as part of the complex plane is typically drawn with a vertical orientation, perpendicular to the real axis which is drawn horizontally. When multiplied by − i , any arbitrary complex number is rotated by a quarter turn clockwise. The set of roots equals the corresponding set of roots of unity rotated by the principal n -th root of i . These are the vertices of a regular polygon inscribed within the complex unit circle . Real values in the domain represent scaling in the codomain (multiplication by a real scalar) with 1 representing multiplication by e , while imaginary values in the domain represent rotation in the codomain (multiplication by a unit complex number) with i representing a rotation by 1 radian.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-13", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "Real values in the domain represent scaling in the codomain (multiplication by a real scalar) with 1 representing multiplication by e , while imaginary values in the domain represent rotation in the codomain (multiplication by a unit complex number) with i representing a rotation by 1 radian. The complex exponential is thus a periodic function in the imaginary direction, with period 2 πi and image 1 at points 2 kπi for all integers k , a real multiple of the lattice of imaginary integers. The quotient coth z = cosh z / sinh z , with appropriate scaling, can be represented as an infinite partial fraction decomposition as the sum of reciprocal functions translated by imaginary integers: π coth ⁡ π z = lim n → ∞ ∑ k = − n n 1 z + k i .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-14", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "The quotient coth z = cosh z / sinh z , with appropriate scaling, can be represented as an infinite partial fraction decomposition as the sum of reciprocal functions translated by imaginary integers: π coth ⁡ π z = lim n → ∞ ∑ k = − n n 1 z + k i . Because the real and imaginary parts are always separate, we regroup the terms, x − y + 2 ixy = 0 + i . By equating coefficients , separating the real part and imaginary part, we have a system of two equations: x 2 − y 2 = 0 2 x y = 1.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-15", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "By equating coefficients , separating the real part and imaginary part, we have a system of two equations: x 2 − y 2 = 0 2 x y = 1. Substituting either of these results into the equation 2 xy = 1 in turn, we will get the corresponding result for y . ^ The interpretation of the imaginary unit as the ratio of two perpendicular vectors was proposed by Hermann Grassmann in the foreword to his Ausdehnungslehre of 1844; later William Clifford realized that this ratio could be interpreted as a bivector. \"Decimal expansion of the real part of i!\", Sequence A212877 ; and \"Decimal expansion of the negated imaginary part of i!\", Sequence A212878 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Imaginary_unit-16", "source": "https://en.wikipedia.org/wiki/Imaginary_unit", "title": "Imaginary unit", "text": "\"Decimal expansion of the real part of i!\", Sequence A212877 ; and \"Decimal expansion of the negated imaginary part of i!\", Sequence A212878 . \"Decimal expansion of the absolute value of i!\", Sequence A212879 ; and \"Decimal expansion of the negated argument of i!\", Sequence A212880 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-0", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "700 BCE to present Descendants Ḟ ₣ ℉ ꟻ ꬵ 𝆑 Sisters U V W Y Ʊ Ϝ У Ў Ұ Υ ו , וּ , וֹ , ﻭ , ۋ , ܘ ࠅ 𐎆 𐌖 Վ վ Ո ո Ւ ւ և Transliterations U V W Y Other Associated graphs f(x) Associated numbers 6, 15 Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . F ( minuscule : f ) is the sixth letter of the Latin alphabet and many modern alphabets influenced by it, including the modern English alphabet and the alphabets of all other modern western European languages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-1", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "F ( minuscule : f ) is the sixth letter of the Latin alphabet and many modern alphabets influenced by it, including the modern English alphabet and the alphabets of all other modern western European languages. Its name in English is ef (pronounced / ˈ ɛ f / ), and the plural is efs . History The origin of ⟨F⟩ is the Semitic letter waw , which represented the sound /w/ . Latin ⟨F⟩, despite being pronounced differently, is ultimately descended from digamma and closely resembles it in form. After sound changes eliminated /w/ from most dialects of Greek (Doric Greek retained it), digamma was used only as a numeral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-2", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "After sound changes eliminated /w/ from most dialects of Greek (Doric Greek retained it), digamma was used only as a numeral. In the Etruscan alphabet , ⟨F⟩ probably represented /w/ , as in Greek, and the Etruscans formed the digraph ⟨FH⟩ to represent /f/ . When the Romans adopted the alphabet, they used ⟨V⟩ (from Greek upsilon ) not only for the vowel /u/ , but also for the corresponding semivowel /w/ , leaving ⟨F⟩ available for /f/ . Initially, ⟨FH⟩ was also used for this sound in Latin, but the ⟨H⟩ was soon dropped.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-3", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "When the Romans adopted the alphabet, they used ⟨V⟩ (from Greek upsilon ) not only for the vowel /u/ , but also for the corresponding semivowel /w/ , leaving ⟨F⟩ available for /f/ . Initially, ⟨FH⟩ was also used for this sound in Latin, but the ⟨H⟩ was soon dropped. And so out of the various vav variants in the Mediterranean world, the letter F entered the Roman alphabet attached to a sound which the Greeks did not have. The Roman alphabet forms the basis of the alphabet used today for English and many other languages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-4", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "And so out of the various vav variants in the Mediterranean world, the letter F entered the Roman alphabet attached to a sound which the Greeks did not have. The Roman alphabet forms the basis of the alphabet used today for English and many other languages. The lowercase ⟨f⟩ is not related to the visually similar long s , ⟨ſ⟩ (or medial s ). The use of the long s largely died out by the beginning of the 19th century , mostly to prevent confusion with ⟨f⟩ when using a short mid-bar. Use in writing systems English In the English writing system ⟨f⟩ is used to represent the sound / f / , the voiceless labiodental fricative .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-5", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "Use in writing systems English In the English writing system ⟨f⟩ is used to represent the sound / f / , the voiceless labiodental fricative . F is the eleventh least frequently used letter in the English language (after G , Y , P , B , V , K , J , X , Q , and Z ), with a frequency of about 2.23% in words. In French orthography , ⟨f⟩ is used to represent /f/ . In Spanish orthography , ⟨f⟩ is used to represent /f/ . In Esperanto orthography , ⟨f⟩ is used to represent /f/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-6", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "In Spanish orthography , ⟨f⟩ is used to represent /f/ . In Esperanto orthography , ⟨f⟩ is used to represent /f/ . In Slavic languages , ⟨f⟩ is used primarily in words of foreign (Hellenic, Romance, or Germanic) origin. Other systems The International Phonetic Alphabet uses ⟨ f ⟩ to represent the voiceless labiodental fricative . The italic letter f is conventionally used to denote an arbitrary function . In countries such as the United States , the letter \"F\" is defined as a failure in terms of academic evaluation . The letter F has become an Internet meme , where it is used to pay respects .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-7", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "In countries such as the United States , the letter \"F\" is defined as a failure in terms of academic evaluation . The letter F has become an Internet meme , where it is used to pay respects . This use is derived from the 2014 video game Call of Duty: Advanced Warfare , where in a quick-time event, protagonist Jack Mitchell must pay his respects to his friend Will Irons who fell in combat in a previous mission, represented by the player pressing F when playing the PC version. People on the Internet use the letter F sometimes in a genuine way to express respect, sadness, or condolences towards other Internet personalities, Internet memes, or other players on certain events.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/F-8", "source": "https://en.wikipedia.org/wiki/F", "title": "F", "text": "People on the Internet use the letter F sometimes in a genuine way to express respect, sadness, or condolences towards other Internet personalities, Internet memes, or other players on certain events. ꜰ : Small capital F was used in the Icelandic First Grammatical Treatise to mark gemination ꟳ : Modifier letter capital F – Used to mark tone for the Chatino orthography in Oaxaca, Mexico; Used as a generic transcription for a falling tone; used in para- IPA notation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-0", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The remaining smaller peaks are higher-frequency overtones of the fundamental pitches. In mathematics , the Fourier transform ( FT ) is an integral transform that takes a function as input and outputs another function that describes the extent to which various frequencies are present in the original function. The output of the transform is a complex valued function of frequency. The term Fourier transform refers to both the mathematical operation and to this complex-valued function. When a distinction needs to be made, the output of the operation is sometimes called the frequency domain representation of the original function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-1", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "When a distinction needs to be made, the output of the operation is sometimes called the frequency domain representation of the original function. The Fourier transform is analogous to decomposing the sound of a musical chord into the intensities of its constituent pitches . The component frequencies, extended for the whole frequency spectrum, are shown as peaks in the domain of the frequency. Functions that are localized in the time domain have Fourier transforms that are spread out across the frequency domain and vice versa, a phenomenon known as the uncertainty principle . The critical case for this principle is the Gaussian function , of substantial importance in probability theory and statistics as well as in the study of physical phenomena exhibiting normal distribution (e.g., diffusion ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-2", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The critical case for this principle is the Gaussian function , of substantial importance in probability theory and statistics as well as in the study of physical phenomena exhibiting normal distribution (e.g., diffusion ). The Fourier transform of a Gaussian function is another Gaussian function. Joseph Fourier introduced sine and cosine transforms (which correspond to the imaginary and real components of the modern Fourier transform) in his study of heat transfer , where Gaussian functions appear as solutions of the heat equation . The Fourier transform can be formally defined as an improper Riemann integral , making it an integral transform, although this definition is not suitable for many applications requiring a more sophisticated integration theory.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-3", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform can be formally defined as an improper Riemann integral , making it an integral transform, although this definition is not suitable for many applications requiring a more sophisticated integration theory. For example, many relatively simple applications use the Dirac delta function , which can be treated formally as if it were a function, but the justification requires a mathematically more sophisticated viewpoint. The Fourier transform can also be generalized to functions of several variables on Euclidean space , sending a function of 3-dimensional \"position space\" to a function of 3-dimensional momentum (or a function of space and time to a function of 4-momentum ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-4", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform can also be generalized to functions of several variables on Euclidean space , sending a function of 3-dimensional \"position space\" to a function of 3-dimensional momentum (or a function of space and time to a function of 4-momentum ). This idea makes the spatial Fourier transform very natural in the study of waves, as well as in quantum mechanics , where it is important to be able to represent wave solutions as functions of either position or momentum and sometimes both. In general, functions to which Fourier methods are applicable are complex-valued, and possibly vector-valued .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-5", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This idea makes the spatial Fourier transform very natural in the study of waves, as well as in quantum mechanics , where it is important to be able to represent wave solutions as functions of either position or momentum and sometimes both. In general, functions to which Fourier methods are applicable are complex-valued, and possibly vector-valued . The latter is routinely employed to handle periodic functions . The fast Fourier transform (FFT) is an algorithm for computing the DFT. However, the Fourier transform can also be defined for (generalized) functions for which the Lebesgue integral Eq.1 does not make sense.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-6", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "However, the Fourier transform can also be defined for (generalized) functions for which the Lebesgue integral Eq.1 does not make sense. as an improper integral for locally integrable functions) extends the Fourier transform to functions that are not necessarily integrable over the whole real line. More generally, the Fourier transform also applies to generalized functions like the Dirac delta (and all other tempered distributions ), in which case it is defined by duality rather than an integral. A common notation for designating transform pairs is: f ( x ) ⟷ F f ^ ( ξ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-7", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "A common notation for designating transform pairs is: f ( x ) ⟷ F f ^ ( ξ ) . However, there is no easy characterization of the image, and thus no easy characterization of the inverse transform. In such cases, the Fourier transform can be obtained explicitly by regularizing the integral, and then passing to a limit. In practice, the integral is often regarded as an improper integral instead of a proper Lebesgue integral, but sometimes for convergence one needs to use weak limit or principal value instead of the (pointwise) limits implicit in an improper integral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-8", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In practice, the integral is often regarded as an improper integral instead of a proper Lebesgue integral, but sometimes for convergence one needs to use weak limit or principal value instead of the (pointwise) limits implicit in an improper integral. Titchmarsh (1986) and Dym & McKean (1985) each gives three rigorous ways of extending the Fourier transform to square integrable functions using this procedure. That important work was corrected and expanded upon by others to provide the foundation for the various forms of the Fourier transform used since. It is noteworthy how easily the product was simplified using the polar form, and how easily the rectangular form was deduced by an application of Euler's formula.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-9", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "It is noteworthy how easily the product was simplified using the polar form, and how easily the rectangular form was deduced by an application of Euler's formula. It is possible to extend the definition to include periodic functions by viewing them as tempered distributions . This makes it possible to see a connection between the Fourier series and the Fourier transform for periodic functions that have a convergent Fourier series . In other words, the Fourier transform is a Dirac comb function whose teeth are multiplied by the Fourier series coefficients. Therefore, the Fourier transform goes from one space of functions to a different space of functions: functions that have a different domain of definition.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-10", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Therefore, the Fourier transform goes from one space of functions to a different space of functions: functions that have a different domain of definition. (See the article Linear algebra for a more formal explanation and for more details.) This point of view becomes essential in generalizations of the Fourier transform to general symmetry groups , including the case of Fourier series. That there is no one preferred way (often, one says \"no canonical way\") to compare the two versions of the real line that are involved in the Fourier transform—fixing the units on one line does not force the scale of the units on the other line—is the reason for the plethora of rival conventions on the definition of the Fourier transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-11", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "That there is no one preferred way (often, one says \"no canonical way\") to compare the two versions of the real line that are involved in the Fourier transform—fixing the units on one line does not force the scale of the units on the other line—is the reason for the plethora of rival conventions on the definition of the Fourier transform. In other conventions, the Fourier transform has i in the exponent instead of − i , and vice versa for the inversion formula. This convention is common in modern physics and is the default for Wolfram Alpha , and does not mean that the frequency has become negative, since there is no canonical definition of positivity for frequency of a complex wave.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-12", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This convention is common in modern physics and is the default for Wolfram Alpha , and does not mean that the frequency has become negative, since there is no canonical definition of positivity for frequency of a complex wave. Many of the identities involving the Fourier transform remain valid in those conventions, provided all terms that explicitly involve i have it replaced by − i . In electrical engineering the letter j is typically used for the imaginary unit instead of i because i is used for current. From the higher point of view of group characters , which is much more abstract, all these arbitrary choices disappear, as will be explained in the later section of this article, which treats the notion of the Fourier transform of a function on a locally compact abelian group .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-13", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "From the higher point of view of group characters , which is much more abstract, all these arbitrary choices disappear, as will be explained in the later section of this article, which treats the notion of the Fourier transform of a function on a locally compact abelian group . The sinc function , which is the Fourier transform of the rectangular function, is bounded and continuous, but not Lebesgue integrable. The Fourier transform may be defined in some cases for non-integrable functions, but the Fourier transforms of integrable functions have several strong properties. For example, the Fourier transform of the rectangular function , which is integrable, is the sinc function , which is not Lebesgue integrable , because its improper integrals behave analogously to the alternating harmonic series , in converging to a sum without being absolutely convergent .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-14", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "For example, the Fourier transform of the rectangular function , which is integrable, is the sinc function , which is not Lebesgue integrable , because its improper integrals behave analogously to the alternating harmonic series , in converging to a sum without being absolutely convergent . It is not generally possible to write the inverse transform as a Lebesgue integral . As a result, the Fourier transform is injective on L ( R ) . The terminology of these formulas is not quite standardised. Parseval's theorem was proved only for Fourier series, and was first proved by Lyapunov.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-15", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The terminology of these formulas is not quite standardised. Parseval's theorem was proved only for Fourier series, and was first proved by Lyapunov. But Parseval's formula makes sense for the Fourier transform as well, and so even though in the context of the Fourier transform it was proved by Plancherel, it is still often referred to as Parseval's formula, or Parseval's relation, or even Parseval's theorem. By applying the Fourier transform and using these formulas, some ordinary differential equations can be transformed into algebraic equations, which are much easier to solve. The corresponding solutions provide an important choice of an orthonormal basis for L ( R ) and are given by the \"physicist's\" Hermite functions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-16", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The corresponding solutions provide an important choice of an orthonormal basis for L ( R ) and are given by the \"physicist's\" Hermite functions . However, this choice of eigenfunctions is not unique. As a consequence of this, it is possible to decompose L ( R ) as a direct sum of four spaces H 0 , H 1 , H 2 , and H 3 where the Fourier transform acts on H k simply by multiplication by i . Among other properties, Hermite functions decrease exponentially fast in both frequency and time domains, and they are thus used to define a generalization of the Fourier transform, namely the fractional Fourier transform used in time–frequency analysis.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-17", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Among other properties, Hermite functions decrease exponentially fast in both frequency and time domains, and they are thus used to define a generalization of the Fourier transform, namely the fractional Fourier transform used in time–frequency analysis. In physics , this transform was introduced by Edward Condon . This change of basis becomes possible because the Fourier transform is a unitary transform when using the right conventions . Upon extending the Fourier transform to distributions the Dirac comb is also an eigenfunction of the Fourier transform. In particular the Fourier transform is invertible (under suitable conditions).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-18", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Upon extending the Fourier transform to distributions the Dirac comb is also an eigenfunction of the Fourier transform. In particular the Fourier transform is invertible (under suitable conditions). equality almost everywhere ?) and defining equality of operators – that is, defining the topology on the function space and operator space in question. These are not true for all functions, but are true under various conditions, which are the content of the various forms of the Fourier inversion theorem . This fourfold periodicity of the Fourier transform is similar to a rotation of the plane by 90°, particularly as the two-fold iteration yields a reversal, and in fact this analogy can be made precise.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-19", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This fourfold periodicity of the Fourier transform is similar to a rotation of the plane by 90°, particularly as the two-fold iteration yields a reversal, and in fact this analogy can be made precise. This can be further generalized to linear canonical transformations , which can be visualized as the action of the special linear group SL 2 ( R ) on the time–frequency plane, with the preserved symplectic form corresponding to the uncertainty principle , below. This approach is particularly studied in signal processing , under time–frequency analysis . The above procedure describes not only the group structure, but also a standard unitary representation of H 1 on a Hilbert space, which we denote by ρ : H 1 → B ( L ( R )) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-20", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The above procedure describes not only the group structure, but also a standard unitary representation of H 1 on a Hilbert space, which we denote by ρ : H 1 → B ( L ( R )) . Many of the standard properties of the Fourier transform are immediate consequences of this more general framework. For example, the square of the Fourier transform, W , is an intertwiner associated with J = − I , and so we have ( W f )( x ) = f (− x ) is the reflection of the original function f .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-21", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "For example, the square of the Fourier transform, W , is an intertwiner associated with J = − I , and so we have ( W f )( x ) = f (− x ) is the reflection of the original function f . Depending on the properties of f , this might not converge off the real axis at all, or it might converge to a complex analytic function for all values of ξ = σ + iτ , or something in between. (If f is not smooth, but only L , a corresponding version holds with the rapid-decrease condition replaced by the appropriate L condition.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-22", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "(If f is not smooth, but only L , a corresponding version holds with the rapid-decrease condition replaced by the appropriate L condition. ) The space of such functions of a complex variable is called the Paley–Wiener space. If f is supported on the half-line t ≥ 0 , then f is said to be \"causal\" because the impulse response function of a physically realisable filter must have this property, as no effect can precede its cause. Paley and Wiener showed that then, under suitable integrability hypotheses, f̂ extends to a holomorphic function on the complex lower half-plane τ that tends to zero as τ goes to −∞ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-23", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Paley and Wiener showed that then, under suitable integrability hypotheses, f̂ extends to a holomorphic function on the complex lower half-plane τ that tends to zero as τ goes to −∞ . A simple converse in this form is false; precise converses require additional growth or Hardy-space hypotheses. It may happen that a function f for which the Fourier integral does not converge on the real axis at all nevertheless has a complex Fourier transform defined in some region of the complex plane . Thus, extending the Fourier transform to the complex domain means it includes the Laplace transform as a special case in the case of causal functions—but with the change of variable s = i 2π ξ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-24", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Thus, extending the Fourier transform to the complex domain means it includes the Laplace transform as a special case in the case of causal functions—but with the change of variable s = i 2π ξ . From another, perhaps more classical viewpoint, the Laplace transform by its form involves an additional exponential regulating term that lets it converge outside of the imaginary line where the Fourier transform is defined. As such it can converge for functions and integrals with at most exponential growth in the regulated direction, whereas the original Fourier decomposition cannot, enabling analysis of systems with divergent or critical elements.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-25", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As such it can converge for functions and integrals with at most exponential growth in the regulated direction, whereas the original Fourier decomposition cannot, enabling analysis of systems with divergent or critical elements. Two particular examples from linear signal processing are the construction of allpass filter networks from critical comb and mitigating filters via exact pole-zero cancellation on the unit circle. Such designs are common in audio processing, where highly nonlinear phase response is sought for, as in reverb. Furthermore, when extended pulselike impulse responses are sought for signal processing work, the easiest way to produce them is to have one circuit that produces a divergent time response, and then to cancel its divergence through a delayed opposite and compensatory response.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-26", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Furthermore, when extended pulselike impulse responses are sought for signal processing work, the easiest way to produce them is to have one circuit that produces a divergent time response, and then to cancel its divergence through a delayed opposite and compensatory response. There, only the delay circuit in-between admits a classical Fourier description, which is critical. Both the circuits to the side are unstable, and do not admit a convergent Fourier decomposition. However, they do admit a Laplace domain description, with compatible half-planes of convergence in the complex plane (or in the discrete case, the Z-plane), wherein their effects cancel.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-27", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "However, they do admit a Laplace domain description, with compatible half-planes of convergence in the complex plane (or in the discrete case, the Z-plane), wherein their effects cancel. In modern mathematics the Laplace transform is conventionally subsumed under the aegis of Fourier methods. Both of them are subsumed by the far more general, and more abstract, idea of harmonic analysis . Therefore, the Fourier inversion formula can use integration along different lines, parallel to the real axis. The hypotheses can be weakened, as in standard Fourier inversion results, to f ( t ) e being L , provided that f be of bounded variation in a closed neighborhood of t (cf.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-28", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The hypotheses can be weakened, as in standard Fourier inversion results, to f ( t ) e being L , provided that f be of bounded variation in a closed neighborhood of t (cf. Dini test ), the value of f at t be taken to be the arithmetic mean of the left and right limits, and that the integrals be taken in the sense of Cauchy principal values. L versions of these inversion formulas are also available. As with the one-dimensional case, there are many conventions. When the function is integrable, the Fourier transform is still uniformly continuous and the Riemann–Lebesgue lemma holds.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-29", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As with the one-dimensional case, there are many conventions. When the function is integrable, the Fourier transform is still uniformly continuous and the Riemann–Lebesgue lemma holds. In particular, the scaling property of the Fourier transform may be seen as saying: if we squeeze a function in x , its Fourier transform stretches out in ξ . It is not possible to arbitrarily concentrate both a function and its Fourier transform. Suppose f ( x ) is an integrable and square-integrable function. In other words, where f is a (normalized) Gaussian function with variance σ /2 π , centered at zero, and its Fourier transform is a Gaussian function with variance σ /2 π .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-30", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In other words, where f is a (normalized) Gaussian function with variance σ /2 π , centered at zero, and its Fourier transform is a Gaussian function with variance σ /2 π . Gaussian functions are examples of Schwartz functions (see the discussion on tempered distributions below). The equality is attained for a Gaussian, as in the previous case. An absolutely integrable function f for which Fourier inversion holds can be expanded in terms of genuine frequencies (avoiding negative frequencies, which are sometimes considered hard to interpret physically ) λ by f ( t ) = ∫ 0 ∞ ( a ( λ ) cos ⁡ ( 2 π λ t ) + b ( λ ) sin ⁡ ( 2 π λ t ) ) d λ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-31", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "An absolutely integrable function f for which Fourier inversion holds can be expanded in terms of genuine frequencies (avoiding negative frequencies, which are sometimes considered hard to interpret physically ) λ by f ( t ) = ∫ 0 ∞ ( a ( λ ) cos ⁡ ( 2 π λ t ) + b ( λ ) sin ⁡ ( 2 π λ t ) ) d λ . This is referred to as Fourier's integral formula. The space L ( R ) is then a direct sum of the spaces H k and the Fourier transform maps each space H k to itself and it is possible to characterize the action of the Fourier transform on each space H k .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-32", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The space L ( R ) is then a direct sum of the spaces H k and the Fourier transform maps each space H k to itself and it is possible to characterize the action of the Fourier transform on each space H k . Moreover, there is a simple recursion relating the cases n + 2 and n allowing to compute, e.g., the three-dimensional Fourier transform of a radial function from the one-dimensional one. The Fourier transform of an integrable function is continuous and the restriction of this function to any set is defined.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-33", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform of an integrable function is continuous and the restriction of this function to any set is defined. But for a square-integrable function the Fourier transform could be a general class of square integrable functions. As such, the restriction of the Fourier transform of an L ( R ) function cannot be defined on sets of measure 0. It is still an active area of study to understand restriction problems in L for 1 p . It is possible in some cases to define the restriction of a Fourier transform to a set S , provided S has non-zero curvature.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-34", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "It is possible in some cases to define the restriction of a Fourier transform to a set S , provided S has non-zero curvature. The case when S is the unit sphere in R is of particular interest. In this case the Tomas– Stein restriction theorem states that the restriction of the Fourier transform to the unit sphere in R is a bounded operator on L provided 1 ≤ p ≤ ⁠ 2 n + 2 / n + 3 ⁠ . Consider an increasing collection of measurable sets E R indexed by R ∈ (0, ∞) : such as balls of radius R centered at the origin, or cubes of side 2 R .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-35", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Consider an increasing collection of measurable sets E R indexed by R ∈ (0, ∞) : such as balls of radius R centered at the origin, or cubes of side 2 R . For n = 1 and 1 p , if one takes E R = (− R , R ) , then f R converges to f in L as R tends to infinity, by the boundedness of the Hilbert transform . Naively one may hope the same holds true for n > 1 . In the case that E R is taken to be a cube with side length R , then convergence still holds.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-36", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In the case that E R is taken to be a cube with side length R , then convergence still holds. In order for this partial sum operator to converge, it is necessary that the multiplier for the unit ball be bounded in L ( R ) . For n ≥ 2 it is a celebrated theorem of Charles Fefferman that the multiplier for the unit ball is never bounded unless p = 2 . In fact, when p ≠ 2 , this shows that not only may f R fail to converge to f in L , but for some functions f ∈ L ( R ) , f R is not even an element of L .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-37", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In fact, when p ≠ 2 , this shows that not only may f R fail to converge to f in L , but for some functions f ∈ L ( R ) , f R is not even an element of L . For an operator to be unitary it is sufficient to show that it is bijective and preserves the inner product. The Fourier inversion theorem implies that the transform is bijective. In each of these spaces, the Fourier transform of a function in L ( R ) is in L ( R ) , where q = ⁠ p / p − 1 ⁠ is the Hölder conjugate of p (by the Hausdorff–Young inequality ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-38", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In each of these spaces, the Fourier transform of a function in L ( R ) is in L ( R ) , where q = ⁠ p / p − 1 ⁠ is the Hölder conjugate of p (by the Hausdorff–Young inequality ). However, except for p = 2 , the image is not easily characterized. In fact, it can be shown that there are functions in L with p > 2 so that the Fourier transform is not defined as a function. The tempered distributions include well-behaved functions of polynomial growth, distributions of compact support as well as all the integrable functions mentioned above.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-39", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The tempered distributions include well-behaved functions of polynomial growth, distributions of compact support as well as all the integrable functions mentioned above. Distributions can be differentiated and the above-mentioned compatibility of the Fourier transform with differentiation and convolution remains true for tempered distributions. If, in addition, the probability distribution has a probability density function , this definition is subject to the usual Fourier transform. That is, the notable difference with the Fourier transform of integrable functions is that the Fourier-Stieltjes transform need not vanish at infinity, i.e., the Riemann–Lebesgue lemma fails for measures. Bochner's theorem characterizes which functions may arise as the Fourier–Stieltjes transform of a positive measure on the circle.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-40", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Bochner's theorem characterizes which functions may arise as the Fourier–Stieltjes transform of a positive measure on the circle. One example of a finite Borel measure that is not a function is the Dirac measure . Its Fourier transform is a constant function (whose value depends on the form of the Fourier transform used). If G is a locally compact abelian group, it has a translation invariant measure μ , called Haar measure . one-dimensional, unitary representations are called its characters . Now, in the case of representations of finite groups, the character table of a group G consists of rows of vectors such that each row is the character of one irreducible representation of G , and these vectors form an orthonormal basis of the space of class (meaning conjugation-invariant) functions that map from G to C by Schur's lemma.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-41", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Now, in the case of representations of finite groups, the character table of a group G consists of rows of vectors such that each row is the character of one irreducible representation of G , and these vectors form an orthonormal basis of the space of class (meaning conjugation-invariant) functions that map from G to C by Schur's lemma. The group T is no longer finite but still compact, and it preserves the orthonormality of the character table. In this particular context, it is closely related to the Pontryagin duality map defined above. Given an abelian locally compact Hausdorff topological group G , as before we consider the space L ( G ) , defined using a Haar measure.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-42", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Given an abelian locally compact Hausdorff topological group G , as before we consider the space L ( G ) , defined using a Haar measure. With convolution as multiplication, L ( G ) is an abelian Banach algebra . (Any C * -norm on L ( G ) is bounded by the L norm, therefore their supremum exists.) Given any abelian C * -algebra A , the Gelfand transform gives an isomorphism between A and C 0 ( A ^) , where A ^ is the multiplicative linear functionals, i.e. Removing the assumption that the underlying group is abelian, irreducible unitary representations need not always be one-dimensional.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-43", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "(Any C * -norm on L ( G ) is bounded by the L norm, therefore their supremum exists.) Given any abelian C * -algebra A , the Gelfand transform gives an isomorphism between A and C 0 ( A ^) , where A ^ is the multiplicative linear functionals, i.e. Removing the assumption that the underlying group is abelian, irreducible unitary representations need not always be one-dimensional. This means the Fourier transform on a non-abelian group takes values as Hilbert space operators. The Fourier transform on compact groups is a major tool in representation theory and non-commutative harmonic analysis .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-44", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform on compact groups is a major tool in representation theory and non-commutative harmonic analysis . Let Σ denote the collection of all isomorphism classes of finite-dimensional irreducible unitary representations , along with a definite choice of representation U on the Hilbert space H σ of finite dimension d σ for each σ ∈ Σ . With the convention above, convolution corresponds to operator multiplication with the order reversed: μ ∗ ν ^ ( σ ) = ν ^ ( σ ) μ ^ ( σ ) . The generalization of the Fourier transform to the noncommutative situation has also in part contributed to the development of noncommutative geometry .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-45", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The generalization of the Fourier transform to the noncommutative situation has also in part contributed to the development of noncommutative geometry . In this context, a categorical generalization of the Fourier transform to noncommutative groups is Tannaka–Krein duality , which replaces the group of characters with the category of representations. However, this is no longer simply a transform of scalar-valued functions into scalar-valued functions. This limits the usefulness of the Fourier transform for analyzing signals that are localized in time, notably transients , or any signal of finite extent. As alternatives to the Fourier transform, in time–frequency analysis , one uses time–frequency transforms or time–frequency distributions to represent signals in a form that has some time information and some frequency information – by the uncertainty principle, there is a trade-off between these.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-46", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As alternatives to the Fourier transform, in time–frequency analysis , one uses time–frequency transforms or time–frequency distributions to represent signals in a form that has some time information and some frequency information – by the uncertainty principle, there is a trade-off between these. These can be generalizations of the Fourier transform, such as the short-time Fourier transform , fractional Fourier transform , synchrosqueezing Fourier transform, or other functions to represent signals, as in wavelet transforms and chirplet transforms , with the wavelet analog of the (continuous) Fourier transform being the continuous wavelet transform . The absolute value of the Fourier transform at +3 Hz is 0.5, which is relatively large.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-47", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "These can be generalizations of the Fourier transform, such as the short-time Fourier transform , fractional Fourier transform , synchrosqueezing Fourier transform, or other functions to represent signals, as in wavelet transforms and chirplet transforms , with the wavelet analog of the (continuous) Fourier transform being the continuous wavelet transform . The absolute value of the Fourier transform at +3 Hz is 0.5, which is relatively large. When added to the Fourier transform at -3 Hz (which is identical because we started with a real signal), we find that the amplitude of the 3 Hz frequency component is 1.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-48", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "When added to the Fourier transform at -3 Hz (which is identical because we started with a real signal), we find that the amplitude of the 3 Hz frequency component is 1. However, when you try to measure a frequency that is not present, both the real and imaginary component of the integral vary rapidly between positive and negative values. For instance, the red curve is looking for 5 Hz. The absolute value of its integral is nearly zero, indicating that almost no 5 Hz component was in the signal. In that case the solution to the original problem is recovered using the inverse Fourier transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-49", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The absolute value of its integral is nearly zero, indicating that almost no 5 Hz component was in the signal. In that case the solution to the original problem is recovered using the inverse Fourier transform. Linear operations performed in one domain (time or frequency) have corresponding operations in the other domain, which are sometimes easier to perform. The operation of differentiation in the time domain corresponds to multiplication by the frequency, so some differential equations are easier to analyze in the frequency domain. After performing the desired operations, transformation of the result can be made back to the time domain.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-50", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The operation of differentiation in the time domain corresponds to multiplication by the frequency, so some differential equations are easier to analyze in the frequency domain. After performing the desired operations, transformation of the result can be made back to the time domain. Harmonic analysis is the systematic study of the relationship between the frequency and time domains, including the kinds of functions or operations that are \"simpler\" in one or the other, and has deep connections to many areas of modern mathematics. Many of the equations of the mathematical physics of the nineteenth century can be treated this way.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-51", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Harmonic analysis is the systematic study of the relationship between the frequency and time domains, including the kinds of functions or operations that are \"simpler\" in one or the other, and has deep connections to many areas of modern mathematics. Many of the equations of the mathematical physics of the nineteenth century can be treated this way. For the heat equation, only one boundary condition can be required (usually the first one). But for the wave equation, there are still infinitely many solutions y that satisfy the first boundary condition. But when one imposes both conditions, there is only one possible solution.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-52", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "But for the wave equation, there are still infinitely many solutions y that satisfy the first boundary condition. But when one imposes both conditions, there is only one possible solution. It is easier to find the Fourier transform ŷ of the solution than to find the solution directly. This is because the Fourier transformation takes differentiation into multiplication by the Fourier-dual variable, and so a partial differential equation applied to the original function is transformed into multiplication by polynomial functions of the dual variables applied to the transformed function. After ŷ is determined, we can apply the inverse Fourier transformation to find y .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-53", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This is because the Fourier transformation takes differentiation into multiplication by the Fourier-dual variable, and so a partial differential equation applied to the original function is transformed into multiplication by polynomial functions of the dual variables applied to the transformed function. After ŷ is determined, we can apply the inverse Fourier transformation to find y . This integral may be interpreted as a continuous linear combination of solutions for the linear equation. In fact, this is the real inverse Fourier transform of a ± and b ± in the variable x . The third step is to examine how to find the specific unknown coefficient functions a ± and b ± that will lead to y satisfying the boundary conditions.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-54", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The third step is to examine how to find the specific unknown coefficient functions a ± and b ± that will lead to y satisfying the boundary conditions. We are interested in the values of these solutions at t = 0 . In summary, we chose a set of elementary solutions, parametrized by ξ , of which the general solution would be a (continuous) linear combination in the form of an integral over the parameter ξ . But this integral was in the form of a Fourier integral. The next step was to express the boundary conditions in terms of these integrals, and set them equal to the given functions f and g .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-55", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The next step was to express the boundary conditions in terms of these integrals, and set them equal to the given functions f and g . But these expressions also took the form of a Fourier integral because of the properties of the Fourier transform of a derivative. The last step was to exploit Fourier inversion by applying the Fourier transformation to both sides, thus obtaining expressions for the coefficient functions a ± and b ± in terms of the given boundary conditions f and g . From a higher point of view, Fourier's procedure can be reformulated more conceptually.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-56", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The last step was to exploit Fourier inversion by applying the Fourier transformation to both sides, thus obtaining expressions for the coefficient functions a ± and b ± in terms of the given boundary conditions f and g . From a higher point of view, Fourier's procedure can be reformulated more conceptually. Since there are two variables, we will use the Fourier transformation in both x and t rather than operate as Fourier did, who only transformed in the spatial variables. Note that ŷ must be considered in the sense of a distribution since y ( x , t ) is not going to be L : as a wave, it will persist through time and thus is not a transient phenomenon.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-57", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Note that ŷ must be considered in the sense of a distribution since y ( x , t ) is not going to be L : as a wave, it will persist through time and thus is not a transient phenomenon. But it will be bounded and so its Fourier transform can be defined as a distribution. The operational properties of the Fourier transformation that are relevant to this equation are that it takes differentiation in x to multiplication by i 2π ξ and differentiation with respect to t to multiplication by i 2π f where f is the frequency.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-58", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The operational properties of the Fourier transformation that are relevant to this equation are that it takes differentiation in x to multiplication by i 2π ξ and differentiation with respect to t to multiplication by i 2π f where f is the frequency. Right away, this explains why the choice of elementary solutions we made earlier worked so well: obviously ŷ = δ ( ξ ± f ) will be solutions. But from the higher point of view, one does not pick elementary solutions, but rather considers the space of all distributions that are supported on the (degenerate) conic ξ − f = 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-59", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "But from the higher point of view, one does not pick elementary solutions, but rather considers the space of all distributions that are supported on the (degenerate) conic ξ − f = 0 . From a calculational point of view, the drawback of course is that one must first calculate the Fourier transforms of the boundary conditions, then assemble the solution from these, and then calculate an inverse Fourier transform. Closed form formulas are rare, except when there is some geometric symmetry that can be exploited, and the numerical calculations are difficult because of the oscillatory nature of the integrals, which makes convergence slow and hard to estimate.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-60", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Closed form formulas are rare, except when there is some geometric symmetry that can be exploited, and the numerical calculations are difficult because of the oscillatory nature of the integrals, which makes convergence slow and hard to estimate. For practical calculations, other methods are often used. those equations that describe how a particular quantity evolves in time from a specified initial state) that can be associated with linear eigenvalue problems whose eigenvalues are integrals of the nonlinear equations. As it may be considered an extension of Fourier analysis to nonlinear problems, the solution method is called the nonlinear Fourier transform (or inverse scattering transform ) method.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-61", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "As it may be considered an extension of Fourier analysis to nonlinear problems, the solution method is called the nonlinear Fourier transform (or inverse scattering transform ) method. In NMR an exponentially shaped free induction decay (FID) signal is acquired in the time domain and Fourier-transformed to a Lorentzian line-shape in the frequency domain. The Fourier transform is also used in magnetic resonance imaging (MRI) and mass spectrometry . To begin with, the basic conceptual structure of quantum mechanics postulates the existence of pairs of complementary variables , connected by the Heisenberg uncertainty principle .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-62", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "To begin with, the basic conceptual structure of quantum mechanics postulates the existence of pairs of complementary variables , connected by the Heisenberg uncertainty principle . For example, in one dimension, the spatial variable q of, say, a particle, can only be measured by the quantum mechanical \" position operator \" at the cost of losing information about the momentum p of the particle. Therefore, the physical state of the particle can either be described by a function, called \"the wave function\", of q or by a function of p but not by a function of both variables.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-63", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Therefore, the physical state of the particle can either be described by a function, called \"the wave function\", of q or by a function of p but not by a function of both variables. The variable p is called the conjugate variable to q . In classical mechanics, the physical state of a particle (existing in one dimension, for simplicity of exposition) would be given by assigning definite values to both p and q simultaneously. Thus, the set of all possible physical states is the two-dimensional real vector space with a p -axis and a q -axis called the phase space .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-64", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Thus, the set of all possible physical states is the two-dimensional real vector space with a p -axis and a q -axis called the phase space . In contrast, quantum mechanics chooses a polarisation of this space in the sense that it picks a subspace of one-half the dimension, for example, the q -axis alone, but instead of considering only points, takes the set of all complex-valued \"wave functions\" on this axis. Nevertheless, choosing the p -axis is an equally valid polarisation, yielding a different representation of the set of possible physical states of the particle.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-65", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Nevertheless, choosing the p -axis is an equally valid polarisation, yielding a different representation of the set of possible physical states of the particle. Infinitely many different polarisations are possible, and all are equally valid. Being able to transform states from one representation to another by the Fourier transform is not only convenient but also the underlying reason of the Heisenberg uncertainty principle . The other use of the Fourier transform in both quantum mechanics and quantum field theory is to solve the applicable wave equation. In non-relativistic quantum mechanics, the Schrödinger equation for a time-varying wave function in one-dimension, not subject to external forces, is − ∂ 2 ∂ x 2 ψ ( x , t ) = i h 2 π ∂ ∂ t ψ ( x , t ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-66", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In non-relativistic quantum mechanics, the Schrödinger equation for a time-varying wave function in one-dimension, not subject to external forces, is − ∂ 2 ∂ x 2 ψ ( x , t ) = i h 2 π ∂ ∂ t ψ ( x , t ) . Fourier methods can be used to solve this equation. Neither of these approaches is of much practical use in quantum mechanics. Boundary value problems and the time-evolution of the wave function is not of much practical interest: it is the stationary states that are most important. In relativistic quantum mechanics, the Schrödinger equation becomes a wave equation as was usual in classical physics, except that complex-valued waves are considered.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-67", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In relativistic quantum mechanics, the Schrödinger equation becomes a wave equation as was usual in classical physics, except that complex-valued waves are considered. A simple example, in the absence of interactions with other particles or fields, is the free one-dimensional Klein–Gordon–Schrödinger–Fock equation, this time in dimensionless units, ( ∂ 2 ∂ x 2 + 1 ) ψ ( x , t ) = ∂ 2 ∂ t 2 ψ ( x , t ) . This is of great use in quantum field theory: each separate Fourier component of a wave can be treated as a separate harmonic oscillator and then quantized, a procedure known as \"second quantization\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-68", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This is of great use in quantum field theory: each separate Fourier component of a wave can be treated as a separate harmonic oscillator and then quantized, a procedure known as \"second quantization\". Even if a real signal is indeed transient, it has been found in practice advisable to model a signal by a function (or, alternatively, a stochastic process) that is stationary in the sense that its characteristic properties are constant over all time. The Fourier transform of such a function does not exist in the usual sense, and it has been found more useful for the analysis of signals to instead take the Fourier transform of its autocorrelation function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-69", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The Fourier transform of such a function does not exist in the usual sense, and it has been found more useful for the analysis of signals to instead take the Fourier transform of its autocorrelation function. For most functions f that occur in practice, R is a bounded even function of the time-lag τ and for typical noisy signals it turns out to be uniformly continuous with a maximum at τ = 0 . The autocorrelation function, more properly called the autocovariance function unless it is normalized in some appropriate fashion, measures the strength of the correlation between the values of f separated by a time lag.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-70", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The autocorrelation function, more properly called the autocovariance function unless it is normalized in some appropriate fashion, measures the strength of the correlation between the values of f separated by a time lag. This is a way of searching for the correlation of f with its own past. It is useful even for other statistical tasks besides the analysis of signals. For example, if f ( t ) represents the temperature at time t , one expects a strong correlation with the temperature at a time lag of 24 hours. (Unless all periodic components are first filtered out from f , this integral will diverge, but it is easy to filter out such periodicities.) The power spectrum, as indicated by this density function P , measures the amount of variance contributed to the data by the frequency ξ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-71", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "(Unless all periodic components are first filtered out from f , this integral will diverge, but it is easy to filter out such periodicities.) The power spectrum, as indicated by this density function P , measures the amount of variance contributed to the data by the frequency ξ . In electrical signals, the variance is proportional to the average power (energy per unit time), and so the power spectrum describes how much the different frequencies contribute to the average power of the signal. This process is called the spectral analysis of time-series and is analogous to the usual analysis of variance of data that is not a time-series ( ANOVA ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-72", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This process is called the spectral analysis of time-series and is analogous to the usual analysis of variance of data that is not a time-series ( ANOVA ). Knowledge of which frequencies are \"important\" in this sense is crucial for the proper design of filters and for the proper evaluation of measuring apparatuses. It can also be useful for the scientific analysis of the phenomena responsible for producing the data. The power spectrum of a signal can also be approximately measured directly by measuring the average power that remains in a signal after all the frequencies outside a narrow band have been filtered out.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-73", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The power spectrum of a signal can also be approximately measured directly by measuring the average power that remains in a signal after all the frequencies outside a narrow band have been filtered out. Spectral analysis is carried out for visual signals as well. The power spectrum ignores all phase relations, which is good enough for many purposes, but for video signals other types of spectral analysis must also be employed, still using the Fourier transform as a tool. Each component is a complex sinusoid of the form e whose amplitude is A ( ξ ) and whose initial phase angle (at x = 0 ) is φ ( ξ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-74", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Each component is a complex sinusoid of the form e whose amplitude is A ( ξ ) and whose initial phase angle (at x = 0 ) is φ ( ξ ) . The Fourier transform may be thought of as a mapping on function spaces. This mapping is here denoted F and F ( f ) is used to denote the Fourier transform of the function f . This mapping is linear, which means that F can also be seen as a linear transformation on the function space and implies that the standard notation in linear algebra of applying a linear transformation to a vector (here the function f ) can be used to write F f instead of F ( f ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-75", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "This mapping is linear, which means that F can also be seen as a linear transformation on the function space and implies that the standard notation in linear algebra of applying a linear transformation to a vector (here the function f ) can be used to write F f instead of F ( f ) . Since the result of applying the Fourier transform is again a function, we can be interested in the value of this function evaluated at the value ξ for its variable, and this is denoted either as F f ( ξ ) or as ( F f )( ξ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-76", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Since the result of applying the Fourier transform is again a function, we can be interested in the value of this function evaluated at the value ξ for its variable, and this is denoted either as F f ( ξ ) or as ( F f )( ξ ) . Notice that in the former case, it is implicitly understood that F is applied first to f and then the resulting function is evaluated at ξ , not the other way around. In mathematics and various applied sciences, it is often necessary to distinguish between a function f and the value of f when its variable equals x , denoted f ( x ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-77", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In mathematics and various applied sciences, it is often necessary to distinguish between a function f and the value of f when its variable equals x , denoted f ( x ) . This means that a notation like F ( f ( x )) formally can be interpreted as the Fourier transform of the values of f at x . Despite this flaw, the previous notation appears frequently, often when a particular function or a function of a particular variable is to be transformed. Notice, that the last example is only correct under the assumption that the transformed function is a function of x , not of x 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-78", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Notice, that the last example is only correct under the assumption that the transformed function is a function of x , not of x 0 . As discussed above, the characteristic function of a random variable is the same as the Fourier–Stieltjes transform of its distribution measure, but in this context it is typical to take a different convention for the constants. Efficient procedures, depending on the frequency resolution needed, are described at Discrete-time Fourier transform § Sampling the DTFT . The discrete Fourier transform (DFT), used there, is usually computed by a fast Fourier transform (FFT) algorithm.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-79", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "Efficient procedures, depending on the frequency resolution needed, are described at Discrete-time Fourier transform § Sampling the DTFT . The discrete Fourier transform (DFT), used there, is usually computed by a fast Fourier transform (FFT) algorithm. Many computer algebra systems such as Matlab and Mathematica that are capable of symbolic integration are capable of computing Fourier transforms symbolically. The numerical integration approach works on a much broader class of functions than the analytic approach. The DTFT is a common subcase of this more general situation. Only the three most common conventions are included. It may be useful to notice that entry 105 gives a relationship between the Fourier transform of a function and the original function, which can be seen as relating the Fourier transform and its inverse.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-80", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "It may be useful to notice that entry 105 gives a relationship between the Fourier transform of a function and the original function, which can be seen as relating the Fourier transform and its inverse. ^ Depending on the application a Lebesgue integral , distributional , or other approach may be most appropriate. ^ Vretblad (2000) provides solid justification for these formal procedures without going too deeply into functional analysis or the theory of distributions . In quantum field theory , operator-valued Fourier transforms of operator-valued functions of spacetime are in frequent use, see for example Greiner & Reinhardt (1996) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-81", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "In quantum field theory , operator-valued Fourier transforms of operator-valued functions of spacetime are in frequent use, see for example Greiner & Reinhardt (1996) . ^ A possible source of confusion is the frequency-shifting property ; i.e. ^ More generally, one can take a sequence of functions that are in the intersection of L and L and that converges to f in the L -norm, and define the Fourier transform of f as the L -limit of the Fourier transforms of these functions. ^ Up to an imaginary constant factor whose magnitude depends on what Fourier transform convention is used.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-82", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "^ More generally, one can take a sequence of functions that are in the intersection of L and L and that converges to f in the L -norm, and define the Fourier transform of f as the L -limit of the Fourier transforms of these functions. ^ Up to an imaginary constant factor whose magnitude depends on what Fourier transform convention is used. ^ For example, to compute the Fourier transform of cos(6π t ) e one might enter the command integrate cos(6*pi*t) exp(−pi*t^2) exp(-i*2*pi*f*t) from -inf to inf into Wolfram Alpha . The direct command fourier transform of cos(6*pi*t) exp(−pi*t^2) would also work for Wolfram Alpha, although the options for the convention (see § Other conventions ) must be changed away from the default option, which is actually equivalent to integrate cos(6*pi*t) exp(−pi*t^2) exp(i*omega*t) /sqrt(2*pi) from -inf to inf .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-83", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "The direct command fourier transform of cos(6*pi*t) exp(−pi*t^2) would also work for Wolfram Alpha, although the options for the convention (see § Other conventions ) must be changed away from the default option, which is actually equivalent to integrate cos(6*pi*t) exp(−pi*t^2) exp(i*omega*t) /sqrt(2*pi) from -inf to inf . 1992 ^ Bailey & Swarztrauber 1994 ^ Lado 1971 ^ Simonen & Olkkonen 1985 ^ \"The Integration Property of the Fourier Transform\" . de Groot, Sybren R.; Mazur, Peter (1984), Non-Equilibrium Thermodynamics (2nd ed.), New York: Dover Duoandikoetxea, Javier (2001), Fourier Analysis , American Mathematical Society , Dym, H.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Fourier_transform-84", "source": "https://en.wikipedia.org/wiki/Fourier_transform", "title": "Fourier transform", "text": "We may think of a real sinusoid as being the sum of a positive-frequency and a negative-frequency complex sinusoid. Stein, Elias; Shakarchi, Rami (2003), Fourier Analysis: An introduction , Princeton University Press , Stein, Elias ; Weiss, Guido (1971), Introduction to Fourier Analysis on Euclidean Spaces , Princeton, N.J.: Princeton University Press , Strichartz, Robert S.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-0", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "In mathematics , a finite field or Galois field (so-named in honor of Évariste Galois ) is a field that has a finite number of elements . As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The order of a finite field is its number of elements, which is either a prime number or a prime power . All finite fields of a given order are isomorphic . Finite fields are fundamental in a number of areas of mathematics and computer science , including number theory , algebraic geometry , Galois theory , finite geometry , cryptography and coding theory .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-1", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Finite fields are fundamental in a number of areas of mathematics and computer science , including number theory , algebraic geometry , Galois theory , finite geometry , cryptography and coding theory . The number of elements of a finite field is called its order or, sometimes, its size . This group is cyclic , so all non-zero elements can be expressed as powers of a single element called a primitive element of the field. The multiplicative inverse of an element may be computed by using the extended Euclidean algorithm (see Modular multiplicative inverse § Extended Euclidean algorithm ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-2", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "The multiplicative inverse of an element may be computed by using the extended Euclidean algorithm (see Modular multiplicative inverse § Extended Euclidean algorithm ). Any finite field extension of a finite field is separable and simple. To use a piece of jargon, finite fields are perfect . This was a conjecture of Artin and Dickson , and was proved by Chevalley ; see Chevalley–Warning theorem . Moore : The order of a finite field is a prime power. The multiplicative inverse of a non-zero element may be computed with the extended Euclidean algorithm; see Extended Euclidean algorithm § Simple algebraic field extensions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-3", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "The multiplicative inverse of a non-zero element may be computed with the extended Euclidean algorithm; see Extended Euclidean algorithm § Simple algebraic field extensions . A possible choice for such a polynomial is given by Conway polynomials . In the next sections, we will show how the general construction method outlined above works for small finite fields. This may be deduced as follows from the results of the preceding section. As in any field, division by zero is undefined. The structure theorem of finite abelian groups implies that this multiplicative group is cyclic , that is, all non-zero elements are powers of a single element.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-4", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "The structure theorem of finite abelian groups implies that this multiplicative group is cyclic , that is, all non-zero elements are powers of a single element. This has been used in various cryptographic protocols , see Discrete logarithm for details. Zech's logarithms are useful for large computations, such as linear algebra over medium-sized fields, that is, fields that are sufficiently large for making natural algorithms inefficient, but not too large, as one has to pre-compute a table of the same size as the order of the field. It follows that they are roots of irreducible polynomials of degree 6 over GF(2) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-5", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Zech's logarithms are useful for large computations, such as linear algebra over medium-sized fields, that is, fields that are sufficiently large for making natural algorithms inefficient, but not too large, as one has to pre-compute a table of the same size as the order of the field. It follows that they are roots of irreducible polynomials of degree 6 over GF(2) . This implies that, over GF(2) , there are exactly 9 = ⁠ 54 / 6 ⁠ irreducible monic polynomials of degree 6 . This may be verified by factoring X − X over GF(2) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-6", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "This implies that, over GF(2) , there are exactly 9 = ⁠ 54 / 6 ⁠ irreducible monic polynomials of degree 6 . This may be verified by factoring X − X over GF(2) . The elements of GF(64) are primitive n th roots of unity for some n dividing 63 . Euler's totient function shows that there are 6 primitive 9 th roots of unity, 12 primitive 21 st roots of unity, and 36 primitive 63 rd roots of unity. As the two factors are reciprocal to each other, a root and its (multiplicative) inverse do not belong to the same orbit.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-7", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "As the two factors are reciprocal to each other, a root and its (multiplicative) inverse do not belong to the same orbit. In fact, this generator is a primitive element, and this polynomial is the irreducible polynomial that produces the easiest Euclidean division. It is called the Frobenius automorphism , after Ferdinand Georg Frobenius . Denoting by φ the composition of φ with itself k times, we have φ k : x ↦ x p k . There are no other GF( p ) -automorphisms of GF( q ) . The fact that the Frobenius map is surjective implies that every finite field is perfect .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-8", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "There are no other GF( p ) -automorphisms of GF( q ) . The fact that the Frobenius map is surjective implies that every finite field is perfect . As every polynomial ring over a field is a unique factorization domain , every monic polynomial over a finite field may be factored in a unique way (up to the order of the factors) into a product of irreducible monic polynomials. There are efficient algorithms for testing polynomial irreducibility and factoring polynomials over finite fields. They are a key step for factoring polynomials over the integers or the rational numbers .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-9", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "There are efficient algorithms for testing polynomial irreducibility and factoring polynomials over finite fields. They are a key step for factoring polynomials over the integers or the rational numbers . At least for this reason, every computer algebra system has functions for factoring polynomials over finite fields, or, at least, over finite prime fields. More precisely, this polynomial is the product of all monic polynomials of degree one over a field of order q . This implies that, if q = p then X − X is the product of all monic irreducible polynomials over GF( p ) , whose degree divides n .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-10", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "This implies that, if q = p then X − X is the product of all monic irreducible polynomials over GF( p ) , whose degree divides n . In fact, if P is an irreducible factor over GF( p ) of X − X , its degree divides n , as its splitting field is contained in GF( p ) . Conversely, if P is an irreducible monic polynomial over GF( p ) of degree d dividing n , it defines a field extension of degree d , which is contained in GF( p ) , and all roots of P belong to GF( p ) , and are roots of X − X ; thus P divides X − X .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-11", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Conversely, if P is an irreducible monic polynomial over GF( p ) of degree d dividing n , it defines a field extension of degree d , which is contained in GF( p ) , and all roots of P belong to GF( p ) , and are roots of X − X ; thus P divides X − X . As X − X does not have any multiple factor, it is thus the product of all the irreducible monic polynomials that divide it. This property is used to compute the product of the irreducible factors of each degree of polynomials over GF( p ) ; see Distinct degree factorization .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-12", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "This property is used to compute the product of the irreducible factors of each degree of polynomials over GF( p ) ; see Distinct degree factorization . This formula is an immediate consequence of the property of X − X above and the Möbius inversion formula . By the above formula, the number of irreducible (not necessarily monic) polynomials of degree n over GF( q ) is ( q − 1) N ( q , n ) . For every q and every n , the right hand side is positive, so there is at least one irreducible polynomial of degree n over GF( q ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-13", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For every q and every n , the right hand side is positive, so there is at least one irreducible polynomial of degree n over GF( q ) . It is unique up to isomorphism, as holds for an algebraic closure of any given field. Any algebraic extension is the union of its finite subextensions, so F ¯ p = ⋃ n ≥ 1 F p n . For example, in 2014, a secure internet connection to Wikipedia involved the elliptic curve Diffie–Hellman protocol ( ECDHE ) over a large finite field. In coding theory , many codes are constructed as subspaces of vector spaces over finite fields.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-14", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For example, in 2014, a secure internet connection to Wikipedia involved the elliptic curve Diffie–Hellman protocol ( ECDHE ) over a large finite field. In coding theory , many codes are constructed as subspaces of vector spaces over finite fields. Finite fields are used by many error correction codes , such as Reed–Solomon error correction code or BCH code . The finite field almost always has characteristic of 2 , since computer data is stored in binary. For example, a byte of data can be interpreted as an element of GF(2 ) . One exception is PDF417 bar code, which is GF(929) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-15", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For example, a byte of data can be interpreted as an element of GF(2 ) . One exception is PDF417 bar code, which is GF(929) . Some CPUs have special instructions that can be useful for finite fields of characteristic 2 , generally variations of carry-less product . Finite fields are widely used in number theory , as many problems over the integers may be solved by reducing them modulo one or several prime numbers . For example, the fastest known algorithms for polynomial factorization and linear algebra over the field of rational numbers proceed by reduction modulo one or several primes, and then reconstruction of the solution by using Chinese remainder theorem , Hensel lifting or the LLL algorithm .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-16", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "For example, the fastest known algorithms for polynomial factorization and linear algebra over the field of rational numbers proceed by reduction modulo one or several primes, and then reconstruction of the solution by using Chinese remainder theorem , Hensel lifting or the LLL algorithm . Similarly many theoretical problems in number theory can be solved by considering their reductions modulo some or all prime numbers. Many recent developments of algebraic geometry were motivated by the need to enlarge the power of these modular methods. Wiles' proof of Fermat's Last Theorem is an example of a deep result involving many mathematical tools, including finite fields.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-17", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "Wiles' proof of Fermat's Last Theorem is an example of a deep result involving many mathematical tools, including finite fields. The Weil conjectures concern the number of points on algebraic varieties over finite fields and the theory has many applications including exponential and character sum estimates. Finite fields have widespread application in combinatorics , two well known examples being the definition of Paley Graphs and the related construction for Hadamard Matrices . In arithmetic combinatorics finite fields and finite field models are used extensively, such as in Szemerédi's theorem on arithmetic progressions. The Artin–Zorn theorem states that all alternative division rings are finite fields.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-18", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "In arithmetic combinatorics finite fields and finite field models are used extensively, such as in Szemerédi's theorem on arithmetic progressions. The Artin–Zorn theorem states that all alternative division rings are finite fields. edit ] Elementary abelian group Field with one element Finite field arithmetic Finite ring Finite group Galois ring Hamming space Quasi-finite field edit ] ^ Dummit, David Steven; Foote, Richard M. (eds.), Mathematical Papers Read at the International Mathematics Congress Held in Connection with the World's Columbian Exposition , Macmillan & Co., pp. 208– 242 ^ This latter notation was introduced by E.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Finite_field-19", "source": "https://en.wikipedia.org/wiki/Finite_field", "title": "Finite field", "text": "(eds.), Mathematical Papers Read at the International Mathematics Congress Held in Connection with the World's Columbian Exposition , Macmillan & Co., pp. 208– 242 ^ This latter notation was introduced by E. ^ Xiang-dong Hou (2018), Lectures on Finite Fields , Graduate Studies in Mathematics, Providence, Rhode Island: American Mathematical Society , p. 3, archived (PDF) from the original on 2008-07-19 ^ Jacobson 2009 , §4.13 ^ On most browsers, this can be verified by looking at the security information available by clicking on the locker displayed near the URL.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-0", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "700 BCE – present Descendants ç ⒞ Ⓒ ⓒ 🄒 🄫 🄯 🄲 🅒 🅲 🇨 Ȼ ₵ ₡ ¢ ℃ ∁ Sisters Г G Գ ( 𐡂 ࠂ ג ܓ ج ) Other Associated numbers 100 This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . C in copyright symbol C ( minuscule : c ) is the third letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is cee (pronounced / ˈ s iː / ), plural cees .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-1", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "C in copyright symbol C ( minuscule : c ) is the third letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is cee (pronounced / ˈ s iː / ), plural cees . The sign is possibly adapted from an Egyptian hieroglyph for a staff sling , which may have been the meaning of the name gimel . Another possibility is that it depicted a camel, the Semitic name for which was gamal . Powell , a specialist in the history of writing, states \"It is hard to imagine how gimel = \"camel\" can be derived from the picture of a camel (it may show his hump, or his head and neck!)\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-2", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Powell , a specialist in the history of writing, states \"It is hard to imagine how gimel = \"camel\" can be derived from the picture of a camel (it may show his hump, or his head and neck!)\". In the Etruscan language , plosive consonants had no contrastive voicing , so the Greek ' Γ ' (Gamma) was adopted into the Etruscan alphabet to represent /k/ . Already in the Western Greek alphabet , Gamma first took a ' ' form in Early Etruscan, then ' ' in Classical Etruscan. In the earliest Latin inscriptions, the letters ' c k q ' were used to represent the sounds /k/ and /ɡ/ (which were not differentiated in writing).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-3", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In the earliest Latin inscriptions, the letters ' c k q ' were used to represent the sounds /k/ and /ɡ/ (which were not differentiated in writing). During the 3rd century BC, a modified character was introduced for /ɡ/ , and ' c ' itself was retained for /k/ . Hence, in the classical period and after, ' g ' was treated as the equivalent of Greek gamma, and ' c ' as the equivalent of kappa; this shows in the romanization of Greek words, as in 'ΚΑΔΜΟΣ', 'ΚΥΡΟΣ', and 'ΦΩΚΙΣ' came into Latin as ' cadmvs ', ' cyrvs ' and ' phocis ', respectively.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-4", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Hence, in the classical period and after, ' g ' was treated as the equivalent of Greek gamma, and ' c ' as the equivalent of kappa; this shows in the romanization of Greek words, as in 'ΚΑΔΜΟΣ', 'ΚΥΡΟΣ', and 'ΦΩΚΙΣ' came into Latin as ' cadmvs ', ' cyrvs ' and ' phocis ', respectively. Other alphabets have letters homoglyphic to 'c' but not analogous in use and derivation, like the Cyrillic letter Es (С, с) which derives from the lunate sigma . Later use When the Roman alphabet was introduced into Britain, ⟨c⟩ represented only /k/ , and this value of the letter has been retained in loanwords to all the insular Celtic languages : in Welsh , Irish , and Gaelic , ⟨c⟩ represents only /k/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-5", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Later use When the Roman alphabet was introduced into Britain, ⟨c⟩ represented only /k/ , and this value of the letter has been retained in loanwords to all the insular Celtic languages : in Welsh , Irish , and Gaelic , ⟨c⟩ represents only /k/ . The Old English Latin-based writing system was learned from the Celts , apparently of Ireland; hence, ⟨c⟩ in Old English also originally represented /k/ ; the Modern English words kin , break , broken , thick , and seek all come from Old English words written with ⟨c⟩ : cyn, brecan, brocen, þicc , and séoc .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-6", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The Old English Latin-based writing system was learned from the Celts , apparently of Ireland; hence, ⟨c⟩ in Old English also originally represented /k/ ; the Modern English words kin , break , broken , thick , and seek all come from Old English words written with ⟨c⟩ : cyn, brecan, brocen, þicc , and séoc . On the continent, meanwhile, a similar phonetic change before the same two vowels had also been going on in almost all of the Romance languages (for example, in Italian ). Yet for these new sounds, ⟨ c ⟩ was still used before the letters ⟨e⟩ and ⟨i⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-7", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Yet for these new sounds, ⟨ c ⟩ was still used before the letters ⟨e⟩ and ⟨i⟩ . Subsequently, the Latin phoneme /k / (spelled ⟨ qv ⟩ ) de-labialized to /k/ , meaning that the various Romance languages had /k/ before front vowels. In addition, Norman used the letter ⟨k⟩ so that the sound /k/ could be represented by either ⟨k⟩ or ⟨c⟩ , the latter of which could represent either /k/ or /ts/ depending on whether it preceded a front vowel letter or not. The convention of using both ⟨c⟩ and ⟨k⟩ was applied to the writing of English after the Norman Conquest , causing a considerable re-spelling of the Old English words.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-8", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The convention of using both ⟨c⟩ and ⟨k⟩ was applied to the writing of English after the Norman Conquest , causing a considerable re-spelling of the Old English words. Thus, while Old English candel, clif, corn, crop , and cú , remained unchanged, cent, cǣᵹ (cēᵹ), cyng, brece , and sēoce , were now (without any change of sound) spelled Kent, keȝ, kyng, breke , and seoke ; even cniht ( ' knight ' ) was subsequently changed to kniht , and þic ( ' thick ' ) was changed to thik or thikk .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-9", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Thus, while Old English candel, clif, corn, crop , and cú , remained unchanged, cent, cǣᵹ (cēᵹ), cyng, brece , and sēoce , were now (without any change of sound) spelled Kent, keȝ, kyng, breke , and seoke ; even cniht ( ' knight ' ) was subsequently changed to kniht , and þic ( ' thick ' ) was changed to thik or thikk . The Old English ⟨cw⟩ was also at length displaced by the French ⟨qu⟩ so that the Old English cwēn ( ' queen ' ) and cwic ( ' quick ' ) became Middle English quen and quik , respectively.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-10", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The Old English ⟨cw⟩ was also at length displaced by the French ⟨qu⟩ so that the Old English cwēn ( ' queen ' ) and cwic ( ' quick ' ) became Middle English quen and quik , respectively. In French, it was represented by the digraph ⟨ch⟩ , as in champ (from Latin camp-um ), and this spelling was introduced into English: the Hatton Gospels , written c. i-iii, child, chyld, riche , and mychel , for the cild, rice , and mycel of the Old English version whence they were copied. In these cases, the Old English ⟨c⟩ gave way to ⟨k⟩ , ⟨qu⟩ and ⟨ch⟩ ; on the other hand, ⟨c⟩ in its new value of /ts/ appeared largely in French words like processiun, emperice , and grace and was also substituted for ⟨ts⟩ in a few Old English words, as miltse, bletsien , in early Middle English milce, blecien .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-11", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In these cases, the Old English ⟨c⟩ gave way to ⟨k⟩ , ⟨qu⟩ and ⟨ch⟩ ; on the other hand, ⟨c⟩ in its new value of /ts/ appeared largely in French words like processiun, emperice , and grace and was also substituted for ⟨ts⟩ in a few Old English words, as miltse, bletsien , in early Middle English milce, blecien . By the end of the thirteenth century, both in France and England, this sound /ts/ was de-affricated to /s/ ; and from that time, ⟨c⟩ has represented /s/ before front vowels either for etymological reasons, as in lance , cent , or to avoid the ambiguity due to the \"etymological\" use of ⟨s⟩ for /z/ , as in ace , mice , once , pence , defence .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-12", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "By the end of the thirteenth century, both in France and England, this sound /ts/ was de-affricated to /s/ ; and from that time, ⟨c⟩ has represented /s/ before front vowels either for etymological reasons, as in lance , cent , or to avoid the ambiguity due to the \"etymological\" use of ⟨s⟩ for /z/ , as in ace , mice , once , pence , defence . Thus, to show etymology, English spelling has advise , devise (instead of *advize , *devize ), while advice , device , dice , ice , mice , twice , etc., do not reflect etymology; example has extended this to hence , pence , defence , etc., where there is no etymological reason for using ⟨c⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-13", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Thus, to show etymology, English spelling has advise , devise (instead of *advize , *devize ), while advice , device , dice , ice , mice , twice , etc., do not reflect etymology; example has extended this to hence , pence , defence , etc., where there is no etymological reason for using ⟨c⟩ . Hence, today, the Romance languages and English have a common feature inherited from Vulgar Latin spelling conventions where ⟨c⟩ takes on either a \"hard\" or \"soft\" value depending on the following letter. Use in writing systems Hard and soft C English In English orthography , ⟨c⟩ generally represents the \"soft\" value of / s / before the letters ⟨e⟩ (including the Latin-derived digraphs ⟨ae⟩ and ⟨oe⟩ , or the corresponding ligatures ⟨æ⟩ and ⟨œ⟩ ), ⟨i⟩ , and ⟨y⟩ , and a \"hard\" value of / k / before any other letters or at the end of a word.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-14", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Use in writing systems Hard and soft C English In English orthography , ⟨c⟩ generally represents the \"soft\" value of / s / before the letters ⟨e⟩ (including the Latin-derived digraphs ⟨ae⟩ and ⟨oe⟩ , or the corresponding ligatures ⟨æ⟩ and ⟨œ⟩ ), ⟨i⟩ , and ⟨y⟩ , and a \"hard\" value of / k / before any other letters or at the end of a word. However, there are a number of exceptions in English: \" soccer \", \" celt \" and \" sceptic \" are words that have / k / where / s / would be expected.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-15", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "However, there are a number of exceptions in English: \" soccer \", \" celt \" and \" sceptic \" are words that have / k / where / s / would be expected. The \"soft\" ⟨c⟩ may represent the / ʃ / sound in the digraph ⟨ci⟩ when this precedes a vowel, as in the words 'delicious' and 'appreciate', and also in the word \"ocean\" and its derivatives. The digraph ⟨ ch ⟩ most commonly represents / tʃ / , but can also represent / k / (mainly in words of Greek origin) or / ʃ / (mainly in words of French origin).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-16", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The digraph ⟨ ch ⟩ most commonly represents / tʃ / , but can also represent / k / (mainly in words of Greek origin) or / ʃ / (mainly in words of French origin). For some dialects of English, it may also represent / x / in words like loch , while other speakers pronounce the final sound as / k / . C is the twelfth most frequently used letter in the English language (after E , T , A , O , I , N , S , H , R , D , and L ), with a frequency of about 2.8% in words.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-17", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "C is the twelfth most frequently used letter in the English language (after E , T , A , O , I , N , S , H , R , D , and L ), with a frequency of about 2.8% in words. Other languages In the Romance languages French , Spanish , Italian , Romanian , Catalan , and Portuguese , ⟨c⟩ generally has a \"hard\" value of /k/ and a \"soft\" value whose pronunciation varies by language. In French, Portuguese, Catalan, and Spanish from Latin America and some places in Spain, the soft ⟨c⟩ value is /s/ as it is in English.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-18", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In French, Portuguese, Catalan, and Spanish from Latin America and some places in Spain, the soft ⟨c⟩ value is /s/ as it is in English. In the Spanish spoken in most of Spain, the soft ⟨c⟩ is a voiceless dental fricative /θ/ . Germanic languages usually use ⟨c⟩ for Romance loans or digraphs, such as ⟨ch⟩ and ⟨ck⟩ , but the rules vary across languages. Of all the Germanic languages, only English uses the initial ⟨c⟩ in native Germanic words like come . Other than English, Dutch uses ⟨c⟩ the most, for most Romance loans and the digraph ⟨ch⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-19", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Of all the Germanic languages, only English uses the initial ⟨c⟩ in native Germanic words like come . Other than English, Dutch uses ⟨c⟩ the most, for most Romance loans and the digraph ⟨ch⟩ . German uses ⟨c⟩ in the digraphs ⟨ch⟩ and ⟨ck⟩ , and the trigraph ⟨sch⟩ , but by itself only in unassimilated loanwords and proper names. Swedish has the same rules for soft and hard ⟨c⟩ as Danish, and also uses ⟨c⟩ in the digraph ⟨ck⟩ and the very common word och , \"and\". Norwegian , Afrikaans , and Icelandic are the most restrictive, replacing all cases of ⟨c⟩ with ⟨k⟩ or ⟨s⟩ , and reserving ⟨c⟩ for unassimilated loanwords and names.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-20", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Norwegian , Afrikaans , and Icelandic are the most restrictive, replacing all cases of ⟨c⟩ with ⟨k⟩ or ⟨s⟩ , and reserving ⟨c⟩ for unassimilated loanwords and names. In Hanyu Pinyin , the standard romanization of Mandarin Chinese , the letter represents an aspirated version of this sound, /t͡s / . Yup'ik , Indonesian , Malay , and a number of African languages such as Hausa , Fula , and Manding share the soft Italian value of /t͡ʃ/ . In Azeri , Crimean Tatar , Kurmanji Kurdish , and Turkish , ⟨c⟩ stands for the voiced counterpart of this sound, the voiced postalveolar affricate /d͡ʒ/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-21", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "In Azeri , Crimean Tatar , Kurmanji Kurdish , and Turkish , ⟨c⟩ stands for the voiced counterpart of this sound, the voiced postalveolar affricate /d͡ʒ/ . In some other African languages, such as Berber languages , ⟨c⟩ is used for /ʃ/ . In Fijian , ⟨c⟩ stands for a voiced dental fricative /ð/ , while in Somali it has the value of / ʕ / . The letter ⟨c⟩ is also used as a transliteration of Cyrillic ⟨ц⟩ in the Latin forms of Serbian , Macedonian , and sometimes Ukrainian , along with the digraph ⟨ts⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-22", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The letter ⟨c⟩ is also used as a transliteration of Cyrillic ⟨ц⟩ in the Latin forms of Serbian , Macedonian , and sometimes Ukrainian , along with the digraph ⟨ts⟩ . Other systems As a phonetic symbol, lowercase ⟨ c ⟩ is the International Phonetic Alphabet (IPA) and X-SAMPA symbol for the voiceless palatal plosive , and capital ⟨C⟩ is the X-SAMPA symbol for the voiceless palatal fricative . Digraphs There are several common digraphs with ⟨c⟩ , the most common being ⟨ ch ⟩ , which in some languages (such as German ) is far more common than ⟨c⟩ alone.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-23", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Digraphs There are several common digraphs with ⟨c⟩ , the most common being ⟨ ch ⟩ , which in some languages (such as German ) is far more common than ⟨c⟩ alone. As in English, ⟨ck⟩ , with the value /k/ , is often used after short vowels in other Germanic languages such as German and Swedish (other Germanic languages, such as Dutch and Norwegian , use ⟨kk⟩ instead). The digraph ⟨cz⟩ is found in Polish and ⟨cs⟩ in Hungarian, representing /t͡ʂ/ and /t͡ʃ/ respectively. The digraph ⟨sc⟩ represents /ʃ/ in Old English, Italian, and a few languages related to Italian (where this only happens before front vowels , while otherwise it represents /sk/ ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-24", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "The digraph ⟨sc⟩ represents /ʃ/ in Old English, Italian, and a few languages related to Italian (where this only happens before front vowels , while otherwise it represents /sk/ ). ⟨ꟲ⟩ : Modifier letter capital ⟨c⟩ – Used to mark tone for the Chatino orthography in Oaxaca, Mexico ; used as a generic transcription for a falling tone; also used in para- IPA notation. ⟨ ᶜ ⟩ : Modifier letter small c ⟨ ᶝ ⟩ : Modifier letter small ⟨c⟩ with curl ⟨ᴄ⟩ : Small capital ⟨c⟩ is used in the Uralic Phonetic Alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-25", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "⟨ ᶜ ⟩ : Modifier letter small c ⟨ ᶝ ⟩ : Modifier letter small ⟨c⟩ with curl ⟨ᴄ⟩ : Small capital ⟨c⟩ is used in the Uralic Phonetic Alphabet . ⟨Ꞔ⟩ ⟨ꞔ⟩ : ⟨C⟩ with palatal hook, used for writing Mandarin Chinese using the early draft version of pinyin romanization during the mid-1950s. Other representations Computing The Latin letters ⟨C⟩ and ⟨c⟩ have Unicode encodings U+0043 C LATIN CAPITAL LETTER C and U+0063 c LATIN SMALL LETTER C . These are the same code points as those used in ASCII and ISO 8859 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-26", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "Other representations Computing The Latin letters ⟨C⟩ and ⟨c⟩ have Unicode encodings U+0043 C LATIN CAPITAL LETTER C and U+0063 c LATIN SMALL LETTER C . These are the same code points as those used in ASCII and ISO 8859 . There are also precomposed character encodings for ⟨C⟩ and ⟨c⟩ with diacritics, for most of those listed above ; the remainder are produced using combining diacritics . Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, voiceless palatal sounds in linguistics, and halfwidth and fullwidth forms for legacy CJK font compatibility.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/C-27", "source": "https://en.wikipedia.org/wiki/C", "title": "C", "text": "450-1100)-language text Articles containing Middle English (1100-1500)-language text Articles containing French-language text Articles containing Latin-language text Articles containing Anglo-Norman-language text Articles containing Greek-language text Commons link from Wikidata Search Search C 169 languages Add topic", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum-0", "source": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum", "title": "Cardinality of the continuum", "text": "The inequality was later stated more simply in his diagonal argument in 1891. Cantor defined cardinality in terms of bijective functions : two sets have the same cardinality if, and only if, there exists a bijective function between them. Between any two real numbers a b , no matter how close they are to each other, there are always infinitely many other real numbers, and Cantor showed that they are as many as those contained in the whole set of real numbers. This hypothesis is independent of the widely used Zermelo–Fraenkel set theory with axiom of choice (ZFC); that is, ZFC can neither prove that it is true nor that it is false.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum-1", "source": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum", "title": "Cardinality of the continuum", "text": "This hypothesis is independent of the widely used Zermelo–Fraenkel set theory with axiom of choice (ZFC); that is, ZFC can neither prove that it is true nor that it is false. He famously showed that the set of real numbers is uncountably infinite . This can be shown by providing one-to-one mappings in both directions between subsets of a countably infinite set and real numbers, and applying the Cantor–Bernstein–Schroeder theorem according to which two sets with one-to-one mappings in both directions have the same cardinality. In one direction, reals can be equated with Dedekind cuts , sets of rational numbers, or with their binary expansions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum-2", "source": "https://en.wikipedia.org/wiki/Cardinality_of_the_continuum", "title": "Cardinality of the continuum", "text": "In one direction, reals can be equated with Dedekind cuts , sets of rational numbers, or with their binary expansions . That is, both the hypothesis and its negation are consistent with these axioms. The same is true for most other alephs, although in some cases, equality can be ruled out by König's theorem on the grounds of cofinality (e.g. This article incorporates material from cardinality of the continuum on PlanetMath , which is licensed under the .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-0", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "700 BCE to present Descendants ɮ Ꝇ ꝇ ℒ ℓ £ Ł ᛚ ꬸ Sisters Л Љ Ӆ Ԯ ל ل ܠ ⵍ ࠋ 𐡋 ለ ℓ Other Associated graphs l(x) , lj , ll , ly Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . L ( minuscule : l ) is the twelfth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other Western European languages and others worldwide. Its name in English is el (pronounced / ˈ ɛ l / EL ), plural els .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-1", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "L ( minuscule : l ) is the twelfth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other Western European languages and others worldwide. Its name in English is el (pronounced / ˈ ɛ l / EL ), plural els . History Lamedh may have come from a pictogram of an ox goad or cattle prod . In most sans-serif typefaces, the lowercase letter ell ⟨l⟩ , written as the glyph l , may be difficult to distinguish from the uppercase letter \"eye\" ⟨ I ⟩ (written as the glyph I ); in some serif typefaces, the glyph l may be confused with the glyph 1 , the digit one .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-2", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "In most sans-serif typefaces, the lowercase letter ell ⟨l⟩ , written as the glyph l , may be difficult to distinguish from the uppercase letter \"eye\" ⟨ I ⟩ (written as the glyph I ); in some serif typefaces, the glyph l may be confused with the glyph 1 , the digit one . To avoid such confusion, some newer computer fonts (such as Trebuchet MS ) have a finial , a curve to the right at the bottom of the lowercase letter ell . Other style variants are provided in script typefaces and display typefaces .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-3", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "To avoid such confusion, some newer computer fonts (such as Trebuchet MS ) have a finial , a curve to the right at the bottom of the lowercase letter ell . Other style variants are provided in script typefaces and display typefaces . All these variants of the letter are encoded in Unicode as U+004C L LATIN CAPITAL LETTER L or U+006C l LATIN SMALL LETTER L , allowing presentation to be chosen according to each context. For specialist mathematical and scientific use, there are a number of dedicated codepoints in the Mathematical Alphanumeric Symbols block .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-4", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "For specialist mathematical and scientific use, there are a number of dedicated codepoints in the Mathematical Alphanumeric Symbols block . In the Romain du Roi , where the ascenders of lowercase letters have symmetrical serifs at the top, l has an extra serif to the left at the mean line to distinguish it from capital I . Another means of reducing such confusion is to use symbol ℓ , which is a cursive , handwriting-style lowercase form of the letter \"ell\". In Japan and Korea, for example, this is the symbol for the liter .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-5", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Another means of reducing such confusion is to use symbol ℓ , which is a cursive , handwriting-style lowercase form of the letter \"ell\". In Japan and Korea, for example, this is the symbol for the liter . (The International Committee for Weights and Measures recommends using L or l for the liter, without specifying a typeface.) In Unicode , the cursive form is encoded as U+2113 ℓ SCRIPT SMALL L from the \" letter-like symbols \" block. In mathematical formulas, an italic form ( ℓ ) of the script ℓ is the norm. Use in writing systems English In English orthography , ⟨l⟩ usually represents the phoneme / l / , which can have several sound values, depending on the speaker's accent, and whether it occurs before or after a vowel.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-6", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Use in writing systems English In English orthography , ⟨l⟩ usually represents the phoneme / l / , which can have several sound values, depending on the speaker's accent, and whether it occurs before or after a vowel. This velarization does not occur in many European languages that use ⟨l⟩ ; it is also a factor making the pronunciation of ⟨l⟩ difficult for users of languages that lack ⟨l⟩ or have different values for it, such as Japanese or some southern dialects of Chinese . A medical condition or speech impediment restricting the pronunciation of ⟨l⟩ is known as lambdacism .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-7", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "This velarization does not occur in many European languages that use ⟨l⟩ ; it is also a factor making the pronunciation of ⟨l⟩ difficult for users of languages that lack ⟨l⟩ or have different values for it, such as Japanese or some southern dialects of Chinese . A medical condition or speech impediment restricting the pronunciation of ⟨l⟩ is known as lambdacism . In English orthography, ⟨l⟩ is often silent in such words as walk or could (though its presence can modify the preceding vowel letter's value), and it is usually silent in such words as palm and psalm ; however, there is some regional variation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-8", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "In English orthography, ⟨l⟩ is often silent in such words as walk or could (though its presence can modify the preceding vowel letter's value), and it is usually silent in such words as palm and psalm ; however, there is some regional variation. L is the eleventh most frequently used letter in the English language. Other systems The International Phonetic Alphabet uses ⟨ l ⟩ to represent the voiced alveolar lateral approximant and a small cap ⟨ ʟ ⟩ to represent the voiced velar lateral approximant . It was often used, especially in handwriting, as the currency sign for the Italian lira .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-9", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Other systems The International Phonetic Alphabet uses ⟨ l ⟩ to represent the voiced alveolar lateral approximant and a small cap ⟨ ʟ ⟩ to represent the voiced velar lateral approximant . It was often used, especially in handwriting, as the currency sign for the Italian lira . In running text, its lower-case form (usually italicised ), l , was more often seen. In the International system of units , the liter (or litre) is abbreviated using a lower-case l or ℓ , or an upper-case L . The latter form is used to avoid the risk of confusion between the letter l (el) and the numeral 1 (one) (For ℓ, see above .) In watchmaking, the ligne (a traditional French measure of length still used in the industry) is abbreviated using an upper-case L.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-10", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "The latter form is used to avoid the risk of confusion between the letter l (el) and the numeral 1 (one) (For ℓ, see above .) In watchmaking, the ligne (a traditional French measure of length still used in the industry) is abbreviated using an upper-case L. In chemistry, L is used as a symbol (as is N A ) for the Avogadro constant . Without proper rendering support , you may see question marks, boxes, or other symbols . In Unicode, these are U+A780 Ꞁ LATIN CAPITAL LETTER TURNED L and U+A781 ꞁ LATIN SMALL LETTER TURNED L .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-11", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "In Unicode, these are U+A780 Ꞁ LATIN CAPITAL LETTER TURNED L and U+A781 ꞁ LATIN SMALL LETTER TURNED L . 𝼦 : Small letter l with mid-height left hook was used by the British and Foreign Bible Society in the early 20th century for romanization of the Malayalam language. These are the same code points as those used in ASCII and ISO 8859 . There are also precomposed character encodings for ⟨L⟩ and ⟨l⟩ with diacritics, for most of those listed above ; the remainder are produced using combining diacritics . Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, and halfwidth and fullwidth forms for legacy CJK font compatibility.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-12", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "Variant forms of the letter have unique code points for specialist use: the alphanumeric symbols set in mathematics and science, and halfwidth and fullwidth forms for legacy CJK font compatibility. Other For example, see the Diary of Samuel Pepys for 31 December 1661: \" I suppose myself to be worth about 500 l. The alternative symbol, capital L, was adopted by the 16th CGPM (1979, Resolution 6; CR, 101 and Metrologia, 1980, 16, 56-57) in order to avoid the risk of confusion between the letter l (el) and the numeral 1 (one). ^ Everson, Michael; Baker, Peter; Emiliano, António; Grammel, Florian; Haugen, Odd Einar; Luft, Diana; Pedro, Susana; Schumacher, Gerd; Stötzner, Andreas (January 30, 2006).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/L-13", "source": "https://en.wikipedia.org/wiki/L", "title": "L", "text": "^ Everson, Michael; Baker, Peter; Emiliano, António; Grammel, Florian; Haugen, Odd Einar; Luft, Diana; Pedro, Susana; Schumacher, Gerd; Stötzner, Andreas (January 30, 2006). 230 ^ Everson, Michael; Baker, Peter; Emiliano, António; Grammel, Florian; Haugen, Odd Einar; Luft, Diana; Pedro, Susana; Schumacher, Gerd; Stötzner, Andreas (January 30, 2006).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-0", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The functions are often denoted using a lowercase symbol for the time-domain function and the corresponding uppercase symbol for the frequency-domain function, e.g. The transform is useful for converting differentiation and integration in the time domain into the algebraic operations multiplication and division in the Laplace domain (analogous to how logarithms are useful for simplifying multiplication and division into addition and subtraction). This gives the transform many applications in science and engineering , mostly as a tool for solving linear differential equations and dynamical systems by replacing ordinary differential equations and integral equations with algebraic polynomial equations , and by replacing convolution with multiplication .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-1", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "This gives the transform many applications in science and engineering , mostly as a tool for solving linear differential equations and dynamical systems by replacing ordinary differential equations and integral equations with algebraic polynomial equations , and by replacing convolution with multiplication . Once solved, the inverse Laplace transform can be used to transform it to the original domain. This is often aided by referencing tables such as that given below . The Laplace transform is related to many other transforms. It is essentially the same as the Mellin transform and is closely related to the Fourier transform .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-2", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "It is essentially the same as the Mellin transform and is closely related to the Fourier transform . Unlike for the Fourier transform, the Laplace transform of a function is often an analytic function , meaning that it can be expressed as a power series that converges locally, the coefficients of which represent the moments of the original function. Moreover, the techniques of complex analysis , especially contour integrals , can be used for simplifying calculations. Laplace wrote extensively about the use of generating functions (1814), and the integral form of the Laplace transform evolved naturally as a result.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-3", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Laplace wrote extensively about the use of generating functions (1814), and the integral form of the Laplace transform evolved naturally as a result. Laplace's use of generating functions was similar to what is now known as the z-transform , and he gave little attention to the continuous variable case which was discussed by Niels Henrik Abel . These types of integrals seem first to have attracted Laplace's attention in 1782, where he was following in the spirit of Euler in using the integrals themselves as solutions of equations. However, in 1785, Laplace took the critical step forward when, rather than simply looking for a solution in the form of an integral, he started to apply the transforms in the sense that was later to become popular.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-4", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "However, in 1785, Laplace took the critical step forward when, rather than simply looking for a solution in the form of an integral, he started to apply the transforms in the sense that was later to become popular. He then went on to apply the Laplace transform in the same way and started to derive some of its properties, beginning to appreciate its potential power. Laplace also recognised that Joseph Fourier 's method of Fourier series for solving the diffusion equation could only apply to a limited region of space, because those solutions were periodic .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-5", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Laplace also recognised that Joseph Fourier 's method of Fourier series for solving the diffusion equation could only apply to a limited region of space, because those solutions were periodic . In 1821, Cauchy developed an operational calculus for the Laplace transform that could be used to study linear differential equations in much the same way the transform is now used in basic engineering. This method was popularized, and perhaps rediscovered, by Oliver Heaviside around the turn of the century. Bernhard Riemann used the Laplace transform in his 1859 paper On the number of primes less than a given magnitude , in which he also developed the inversion theorem.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-6", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Bernhard Riemann used the Laplace transform in his 1859 paper On the number of primes less than a given magnitude , in which he also developed the inversion theorem. Riemann used the Laplace transform to develop the functional equation of the Riemann zeta function , and his method is still used to relate the modular transformation law of the Jacobi theta function , which is readily proved via Poisson summation , to the functional equation. Hjalmar Mellin was among the first to study the Laplace transform rigorously in the Karl Weierstrass school of analysis, and apply it to the study of differential equations and special functions , at the turn of the 20th century.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-7", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Hjalmar Mellin was among the first to study the Laplace transform rigorously in the Karl Weierstrass school of analysis, and apply it to the study of differential equations and special functions , at the turn of the 20th century. At around the same time, Heaviside was busy with his operational calculus. In 1929, Vannevar Bush and Norbert Wiener published Operational Circuit Analysis as a text for engineering analysis of electrical circuits, applying both Fourier transforms and operational calculus, and in which they included one of the first predecessors of the modern table of Laplace transforms.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-8", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In 1929, Vannevar Bush and Norbert Wiener published Operational Circuit Analysis as a text for engineering analysis of electrical circuits, applying both Fourier transforms and operational calculus, and in which they included one of the first predecessors of the modern table of Laplace transforms. In 1934, Raymond Paley and Norbert Wiener published the important work Fourier transforms in the complex domain , about what is now called the Laplace transform (see below). Also during the 30s, the Laplace transform was instrumental in Godfrey Harold Hardy and John Edensor Littlewood 's study of tauberian theorems , and this application was later expounded on by Widder (1941) , who developed other aspects of the theory such as a new method for inversion.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-9", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Also during the 30s, the Laplace transform was instrumental in Godfrey Harold Hardy and John Edensor Littlewood 's study of tauberian theorems , and this application was later expounded on by Widder (1941) , who developed other aspects of the theory such as a new method for inversion. The current widespread use of the transform (mainly in engineering) came about during and soon after World War II , replacing the earlier Heaviside operational calculus . However, for many applications it is necessary to regard it as a conditionally convergent improper integral at ∞ . Still more generally, the integral can be understood in a weak sense , and this is dealt with below.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-10", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Still more generally, the integral can be understood in a weak sense , and this is dealt with below. In operational calculus , the Laplace transform of a measure is often treated as though the measure came from a probability density function f . Although with the Lebesgue integral, it is not necessary to take such a limit, it does appear more naturally in connection with the Laplace–Stieltjes transform . The Laplace transform can be alternatively defined as the bilateral Laplace transform , or two-sided Laplace transform , by extending the limits of integration to be the entire real axis.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-11", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The Laplace transform can be alternatively defined as the bilateral Laplace transform , or two-sided Laplace transform , by extending the limits of integration to be the entire real axis. If that is done, the common unilateral transform becomes a special case of the bilateral transform, where the definition of the function being transformed includes being multiplied by the Heaviside step function . This means that, on the range of the transform, there is an inverse transform. In fact, besides integrable functions, the Laplace transform is a one-to-one mapping from one function space into another in many other function spaces as well, although there is usually no easy characterization of the range.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-12", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In fact, besides integrable functions, the Laplace transform is a one-to-one mapping from one function space into another in many other function spaces as well, although there is usually no easy characterization of the range. Typical function spaces in which this is true include the spaces of bounded continuous functions, the space L (0, ∞) , or more generally tempered distributions on (0, ∞) . The Laplace transform is also defined and injective for suitable spaces of tempered distributions. In these cases, the image of the Laplace transform lives in a space of analytic functions in the region of convergence .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-13", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In these cases, the image of the Laplace transform lives in a space of analytic functions in the region of convergence . In most applications, the contour can be closed, allowing the use of the residue theorem . An alternative formula for the inverse Laplace transform is given by Post's inversion formula . The limit here is interpreted in the weak-* topology . In practice, it is typically more convenient to decompose a Laplace transform into known transforms of functions obtained from a table and construct the inverse by inspection. By convention , this is referred to as the Laplace transform of the random variable X itself.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-14", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In practice, it is typically more convenient to decompose a Laplace transform into known transforms of functions obtained from a table and construct the inverse by inspection. By convention , this is referred to as the Laplace transform of the random variable X itself. The Laplace transform has applications throughout probability theory, including first passage times of stochastic processes such as Markov chains , and renewal theory . The resulting space of abstract operators is exactly equivalent to Laplace space, but in this construction the forward and reverse transforms never need to be explicitly defined (avoiding the related difficulties with proving convergence).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-15", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The resulting space of abstract operators is exactly equivalent to Laplace space, but in this construction the forward and reverse transforms never need to be explicitly defined (avoiding the related difficulties with proving convergence). The Laplace transform is usually understood as conditionally convergent , meaning that it converges in the former but not in the latter sense. The set of values for which F ( s ) converges absolutely is either of the form Re( s ) > a or Re( s ) ≥ a , where a is an extended real constant with −∞ ≤ a ≤ ∞ (a consequence of the dominated convergence theorem ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-16", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The set of values for which F ( s ) converges absolutely is either of the form Re( s ) > a or Re( s ) ≥ a , where a is an extended real constant with −∞ ≤ a ≤ ∞ (a consequence of the dominated convergence theorem ). The constant a is known as the abscissa of absolute convergence, and depends on the growth behavior of f ( t ) . Analogously, the two-sided transform converges absolutely in a strip of the form a s ) b , and possibly including the lines Re( s ) = a or Re( s ) = b .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-17", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Analogously, the two-sided transform converges absolutely in a strip of the form a s ) b , and possibly including the lines Re( s ) = a or Re( s ) = b . The subset of values of s for which the Laplace transform converges absolutely is called the region of absolute convergence, or the domain of absolute convergence. In the two-sided case, it is sometimes called the strip of absolute convergence. The Laplace transform is analytic in the region of absolute convergence: this is a consequence of Fubini's theorem and Morera's theorem .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-18", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The Laplace transform is analytic in the region of absolute convergence: this is a consequence of Fubini's theorem and Morera's theorem . Similarly, the set of values for which F ( s ) converges (conditionally or absolutely) is known as the region of conditional convergence, or simply the region of convergence (ROC). If the Laplace transform converges (conditionally) at s = s 0 , then it automatically converges for all s with Re( s ) > Re( s 0 ) . Therefore, the region of convergence is a half-plane of the form Re( s ) > a , possibly including some points of the boundary line Re( s ) = a .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-19", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Therefore, the region of convergence is a half-plane of the form Re( s ) > a , possibly including some points of the boundary line Re( s ) = a . There are several Paley–Wiener theorems concerning the relationship between the decay properties of f , and the properties of the Laplace transform within the region of convergence. In engineering applications, a function corresponding to a linear time-invariant (LTI) system is stable if every bounded input produces a bounded output. This is equivalent to the absolute convergence of the Laplace transform of the impulse response function in the region Re( s ) ≥ 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-20", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "This is equivalent to the absolute convergence of the Laplace transform of the impulse response function in the region Re( s ) ≥ 0 . As a result, LTI systems are stable, provided that the poles of the Laplace transform of the impulse response function have negative real part. This ROC is used in knowing about the causality and stability of a system. Thus, the Laplace variable s is also known as an operator variable in the Laplace domain: either the derivative operator or (for s ) the integration operator . The final value theorem is useful because it gives the long-term behaviour without having to perform partial fraction decompositions (or other difficult algebra).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-21", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The final value theorem is useful because it gives the long-term behaviour without having to perform partial fraction decompositions (or other difficult algebra). If the first n moments of f converge absolutely, then by repeated differentiation under the integral , ( − 1 ) n ( L f ) ( n ) ( 0 ) = μ n . This method can be used to compute integrals that would otherwise be difficult to compute using elementary methods of real calculus. In general, the Laplace–Stieltjes transform is the Laplace transform of the Stieltjes measure associated to g .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-22", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "This method can be used to compute integrals that would otherwise be difficult to compute using elementary methods of real calculus. In general, the Laplace–Stieltjes transform is the Laplace transform of the Stieltjes measure associated to g . So in practice, the only distinction between the two transforms is that the Laplace transform is thought of as operating on the density function of the measure, whereas the Laplace–Stieltjes transform is thought of as operating on its cumulative distribution function . Indeed, the Fourier transform is a special case (under certain conditions) of the bilateral Laplace transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-23", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "So in practice, the only distinction between the two transforms is that the Laplace transform is thought of as operating on the density function of the measure, whereas the Laplace–Stieltjes transform is thought of as operating on its cumulative distribution function . Indeed, the Fourier transform is a special case (under certain conditions) of the bilateral Laplace transform. The Laplace transform is usually restricted to transformation of functions of t with t ≥ 0 . A consequence of this restriction is that the Laplace transform of a function is a holomorphic function of the variable s .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-24", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "A consequence of this restriction is that the Laplace transform of a function is a holomorphic function of the variable s . Unlike the Fourier transform, the Laplace transform of a distribution is generally a well-behaved function. Techniques of complex variables can also be used to directly study Laplace transforms. This relationship between the Laplace and Fourier transforms is often used to determine the frequency spectrum of a signal or dynamical system. The above relation is valid as stated if and only if the region of convergence (ROC) of F ( s ) contains the imaginary axis, σ = 0 .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-25", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The above relation is valid as stated if and only if the region of convergence (ROC) of F ( s ) contains the imaginary axis, σ = 0 . As s = iω 0 is a pole of F ( s ) , substituting s = iω in F ( s ) does not yield the Fourier transform of f ( t ) u ( t ) , which contains terms proportional to the Dirac delta functions δ ( ω ± ω 0 ) . For instance, this holds for the above example provided that the limit is understood as a weak limit of measures (see vague topology ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-26", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "For instance, this holds for the above example provided that the limit is understood as a weak limit of measures (see vague topology ). General conditions relating the limit of the Laplace transform of a function on the boundary to the Fourier transform take the form of Paley–Wiener theorems . Comparing the last two equations, we find the relationship between the unilateral Z-transform and the Laplace transform of the sampled signal, X q ( s ) = X ( z ) | z = e s T . The generalized Borel transform allows a different weighting function to be used, rather than the exponential function, to transform functions not of exponential type.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-27", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The generalized Borel transform allows a different weighting function to be used, rather than the exponential function, to transform functions not of exponential type. However, a different point of view and different characteristic problems are associated with each of these four major integral transforms. Because the Laplace transform is a linear operator , The Laplace transform of a sum is the sum of Laplace transforms of each term. The unilateral Laplace transform takes as input a function whose time domain is the non-negative reals, which is why all of the time domain functions in the table below are multiples of the Heaviside step function , u ( t ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-28", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The unilateral Laplace transform takes as input a function whose time domain is the non-negative reals, which is why all of the time domain functions in the table below are multiples of the Heaviside step function , u ( t ) . The entries of the table that involve a time delay τ are required to be causal (meaning that τ > 0 ). A causal system is a system where the impulse response h ( t ) is zero for all time t prior to t = 0 . In general, the region of convergence for causal systems is not the same as that of anticausal systems .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-29", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "In general, the region of convergence for causal systems is not the same as that of anticausal systems . Circuit elements can be transformed into impedances , very similar to phasor impedances. Here is a summary of equivalents: s -domain equivalent circuits Note that the resistor is exactly the same in the time domain and the s -domain. The are put in if there are initial conditions on the circuit elements. For example, if a capacitor has an initial voltage across it, or if the inductor has an initial current through it, the inserted in the s -domain account for that.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-30", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "For example, if a capacitor has an initial voltage across it, or if the inductor has an initial current through it, the inserted in the s -domain account for that. The equivalents for current and voltage are derived from the transformations in the table above. Performing this calculation in Laplace space turns the convolution into a multiplication; the latter being easier to solve because of its algebraic form. The Laplace transform is invertible on a large class of functions. Given a mathematical or functional description of an input or output to a system , the Laplace transform provides an alternative functional description that often simplifies the process of analyzing the behavior of the system, or in synthesizing a new system based on a set of specifications.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-31", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Given a mathematical or functional description of an input or output to a system , the Laplace transform provides an alternative functional description that often simplifies the process of analyzing the behavior of the system, or in synthesizing a new system based on a set of specifications. The Laplace transform can also be used to solve differential equations and is used extensively in mechanical engineering and electrical engineering . The Laplace transform reduces a linear differential equation to an algebraic equation, which can then be solved by the formal rules of algebra. The original differential equation can then be solved by applying the inverse Laplace transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-32", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "The Laplace transform reduces a linear differential equation to an algebraic equation, which can then be solved by the formal rules of algebra. The original differential equation can then be solved by applying the inverse Laplace transform. English electrical engineer Oliver Heaviside first proposed a similar scheme, although without using the Laplace transform; and the resulting operational calculus is credited as the Heaviside calculus. This is often possible as a consequence of the final value theorem . Even when the interchange cannot be justified the calculation can be suggestive. Convolution The same result can be achieved using the convolution property as if the system is a series of filters with transfer functions 1/( s + α ) and 1/( s + β ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-33", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Convolution The same result can be achieved using the convolution property as if the system is a series of filters with transfer functions 1/( s + α ) and 1/( s + β ) . spherical shape and constant temperature, calculations based on carrying out an inverse Laplace transformation on the spectrum of the object can produce the only possible model of the distribution of matter in it (density as a function of distance from the center) consistent with the spectrum. When independent information on the structure of an object is available, the inverse Laplace transform method has been found to be in good agreement.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-34", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "When independent information on the structure of an object is available, the inverse Laplace transform method has been found to be in good agreement. They are thus of importance in asymptotic formulae of probability and statistics , where often the spectral side has asymptotics that are simpler to infer. Two Tauberian theorems of note are the Hardy–Littlewood Tauberian theorem and Wiener's Tauberian theorem . This statement can be applied in particular to the logarithmic derivative of Riemann zeta function , and thus provides an extremely short way to prove the prime number theorem . Laplace Transform is somewhat more general in scope than the Fourier Transform, and is widely used by engineers for describing continuous circuits and systems, including automatic control systems.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-35", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": "Laplace Transform is somewhat more general in scope than the Fourier Transform, and is widely used by engineers for describing continuous circuits and systems, including automatic control systems. ^ The cumulative distribution function is the integral of the probability density function. ^ Mikusiński, Jan (14 July 2014), Operational Calculus , Elsevier, ^ Widder 1941 , Chapter II, §1 ^ Widder 1941 , Chapter VI, §2 ^ Beffa, Federico (2024), \"Laplace Transform of Distributions\" , Weakly Nonlinear Systems , Cham: Springer Nature Switzerland, pp. 385 ^ Archived at Ghostarchive and the Wayback Machine : Mattuck, Arthur (7 November 2008), \"Where the Laplace Transform comes from\" , YouTube ^ Widder 1941 , p.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Laplace_transform-36", "source": "https://en.wikipedia.org/wiki/Laplace_transform", "title": "Laplace transform", "text": ", \"Laplace Transform\" , MathWorld Good explanations of the initial and final value theorems Archived 2009-01-08 at the Wayback Machine Laplace Transforms at MathPages Computational Knowledge Engine allows to easily calculate Laplace Transforms and its inverse Transform.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-0", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Numerals in Unicode - Wikipedia Jump to content Search Search Donate Create account Log in Donate Create account Log in Numerals in Unicode 3 languages Deutsch Italiano 中文 Edit links From Wikipedia, the free encyclopedia Graphemes for various number systems A numeral (often called number in Unicode ) is a character that denotes a number. The decimal number digits 0–9 are used widely in various writing systems throughout the world, however the graphemes representing the decimal digits differ widely. Therefore Unicode includes 22 different sets of graphemes for the decimal digits, and also various decimal points, thousands separators, negative signs, etc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-1", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Therefore Unicode includes 22 different sets of graphemes for the decimal digits, and also various decimal points, thousands separators, negative signs, etc. Unicode also includes several non-decimal numerals such as Aegean numerals , Roman numerals , counting rod numerals , Mayan numerals , Cuneiform numerals and ancient Greek numerals . There is also a large number of typographical variations of the Western Arabic numerals provided for specialized mathematical use and for compatibility with earlier character sets, such as ² or ②, and composite characters such as ½. Then there are decimal-radix numbers, commonly used in Western style decimals (plain 0–9), there are numbers that are not part of a decimal system such as Roman numbers, and decimal numbers in typographic context, such as encircled numbers.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-2", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Then there are decimal-radix numbers, commonly used in Western style decimals (plain 0–9), there are numbers that are not part of a decimal system such as Roman numbers, and decimal numbers in typographic context, such as encircled numbers. Unicode includes the Western Arabic numerals in the Basic Latin (or ASCII derived) block. The digits are repeated in several other scripts: Eastern Arabic , Balinese, Bengali, Devanagari, Ethiopic, Gujarati, Gurmukhi, Telugu, Khmer, Lao, Limbu, Malayalam, Mongolian, Myanmar, New Tai Lue, Nko, Oriya, Telugu, Thai, Tibetan, Osmanya. Unicode includes a numeric value property for each digit to assist in collation and other text processing operations.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-3", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Unicode includes a numeric value property for each digit to assist in collation and other text processing operations. However, there is no mapping between the various related digits. Although Arabic is written from right to left, while English is written left to right, in both languages numbers are written with the most significant digit on the left and the least significant on the right. This was intended to instruct font rendering to make the surrounding digits smaller and raise them on the left and lower them on the right, but this is rarely implemented. (A workaround is to use the super/subscript characters described below, but only Arabic numerals are available.) Unicode also includes a handful of vulgar fractions as compatibility characters, but discourages their use.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-4", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "(A workaround is to use the super/subscript characters described below, but only Arabic numerals are available.) Unicode also includes a handful of vulgar fractions as compatibility characters, but discourages their use. Decimal fractions are represented in text as a sequence of decimal digit numerals with a decimal separator separating the whole-number portion from the fractional portion. However, cultures vary in the glyph or grapheme used for a decimal separator. The Arabic writing system includes a dedicated character for a decimal separator that looks much like a comma, U+066B ٫ ARABIC DECIMAL SEPARATOR , which when combined with the Arabic digits to express one-quarter appears as: \"٠٫٢٥\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-5", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "The Arabic writing system includes a dedicated character for a decimal separator that looks much like a comma, U+066B ٫ ARABIC DECIMAL SEPARATOR , which when combined with the Arabic digits to express one-quarter appears as: \"٠٫٢٥\". Other mathematical constants can be represented using characters that have multiple semantic uses. For example, although Unicode includes a character for natural exponent ℯ (U+212F) its UCS canonical name derives from its glyph: U+212F ℯ SCRIPT SMALL E ; and the mathematical constant π , 3.141592.., is represented by U+03C0 π GREEK SMALL LETTER PI . Rich text parenthesized, circled and other variants are also included in the blocks Enclosed CJK Letters and Months ; Enclosed Alphanumerics ; Enclosed Alphanumeric Supplement ; Superscripts and Subscripts ; Number Forms ; and Dingbats .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-6", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Rich text parenthesized, circled and other variants are also included in the blocks Enclosed CJK Letters and Months ; Enclosed Alphanumerics ; Enclosed Alphanumeric Supplement ; Superscripts and Subscripts ; Number Forms ; and Dingbats . Rod numerals are closely related to the counting rods and the abacus , which is why the numeric symbols for 1, 2, 3, 6, 7 and 8 in the huāmǎ system are represented in a similar way as on the abacus. Nowadays, the huāmǎ system is only used for displaying prices in Chinese markets or on traditional handwritten invoices.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-7", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Nowadays, the huāmǎ system is only used for displaying prices in Chinese markets or on traditional handwritten invoices. In Unicode 3.0 these characters are incorrectly called Hangzhou style numerals. In the Unicode 4.0, an erratum was added which stated: The Suzhou numerals (Chinese su1zhou1ma3zi ) are special numeric forms used by traders to display the prices of goods. All Hangzhou\" in the Unicode standard have been corrected to \"Suzhou\" except for the character names themselves, which cannot be changed once assigned, according to the Unicode Stability Policy. Attic numerals were used by ancient Greeks , possibly from the 7th century BC .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-8", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "All Hangzhou\" in the Unicode standard have been corrected to \"Suzhou\" except for the character names themselves, which cannot be changed once assigned, according to the Unicode Stability Policy. Attic numerals were used by ancient Greeks , possibly from the 7th century BC . They were also known as Herodianic numerals because they were first described in a 2nd-century manuscript by Herodian . They are also known as acrophonic numerals because all of the symbols used derive from the first letters of the words that the symbols represent: 'one', 'five', 'ten', 'hundred', 'thousand' and 'ten thousand'.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-9", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "They are also known as acrophonic numerals because all of the symbols used derive from the first letters of the words that the symbols represent: 'one', 'five', 'ten', 'hundred', 'thousand' and 'ten thousand'. The system used in classical antiquity was slightly modified in the Middle Ages to produce the system we use today. It is based on certain letters which are given values as numerals. Unicode has a number of characters specifically designated as Roman numerals, as part of the Number Forms range from U+2160 to U+2188. This range includes both upper- and lowercase numerals, as well as pre-combined characters for numbers up to 12 (XII).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-10", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "This range includes both upper- and lowercase numerals, as well as pre-combined characters for numbers up to 12 (XII). One reason for the existence of pre-combined numbers is to facilitate the setting of multiple-letter numbers (such as VIII) on a single horizontal line in Asian vertical text. The small reversed c, ↄ, is not intended to be used in Roman numerals, but as lower case Claudian letter Ↄ. If using blackletter or script typefaces, Roman numerals are set in Roman type . Such typefaces may contain Roman numerals matching the style of the typeface in the Unicode range U+2160–217F; if they don't exist, a matching Antiqua typeface is used for Roman numerals.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-11", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Such typefaces may contain Roman numerals matching the style of the typeface in the Unicode range U+2160–217F; if they don't exist, a matching Antiqua typeface is used for Roman numerals. There are nine \"horizontal\" digits (U+1D360 to U+1D368) and nine \"vertical\" digits (U+1D369 to U+1D371), the horizontal digits are used for odd powers of ten and the vertical digits for even powers of ten. Zero should be represented by U+3007 (〇, ideographic number zero) and the negative sign should be represented by U+20E5 (combining reverse solidus overlay). As these were recently added to the character set and are not in the BMP, font support may still be limited.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-12", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "As these were recently added to the character set and are not in the BMP, font support may still be limited. edit ] Number Forms (Unicode block) edit ] ^ It is unknown which constant this is supposed to be. ^ Unicode Charts: Ancient Greek Numbers ^ Unicode Number Forms ^ The Unicode Standard, Version 6.0 – Electronic edition (PDF) , Unicode, Inc., 2011, p. Perry: Proposal to Add Additional Ancient Roman Characters to UCS ^ For the first two rows ^ Unicode Ancient Symbols ^ The Unicode Standard, Version 5.0 – Electronic edition (PDF) , Unicode, Inc., 2006, pp.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Numerals_in_Unicode-13", "source": "https://en.wikipedia.org/wiki/Numerals_in_Unicode", "title": "Numerals in Unicode", "text": "Perry: Proposal to Add Additional Ancient Roman Characters to UCS ^ For the first two rows ^ Unicode Ancient Symbols ^ The Unicode Standard, Version 5.0 – Electronic edition (PDF) , Unicode, Inc., 2006, pp.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-0", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "To imitate a bold typeface on a typewriter , a character can be typed over itself (called double-striking ); symbols thus produced are called double-struck , and this name is sometimes adopted for blackboard bold symbols, for instance in Unicode grapheme names. In typography , a typeface with characters that are not solid is called inline , handtooled , or open face . To produce a bold effect on a typewriter, a character can be double-struck with or without a small offset. While this method makes a character bolder, and can effectively emphasize words or passages, in isolation a double-struck character is not always clearly different from its single-struck counterpart.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-1", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "While this method makes a character bolder, and can effectively emphasize words or passages, in isolation a double-struck character is not always clearly different from its single-struck counterpart. Blackboard bold originated from the attempt to write bold symbols on typewriters and blackboards that were legible but distinct, perhaps starting in the late 1950s in France, and then taking hold at the Princeton University mathematics department in the early 1960s. Mathematical authors began typing faux-bold letters by double-striking them with a significant offset or over-striking them with the letter I , creating new symbols such as IR , IN , CC , or ZZ ; at the blackboard, lecturers began writing bold symbols with certain doubled strokes.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-2", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "Mathematical authors began typing faux-bold letters by double-striking them with a significant offset or over-striking them with the letter I , creating new symbols such as IR , IN , CC , or ZZ ; at the blackboard, lecturers began writing bold symbols with certain doubled strokes. The notation caught on: blackboard bold spread from classroom to classroom and is now used around the world. A page from Loomis & Sternberg (1968), showing an early example of \"blackboard bold\" style R and C in a printed book The style made its way into print starting in the mid-1960s.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-3", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "In 1979, Wiley recommended its authors avoid \"double-backed shadow or outline letters, sometimes called blackboard bold\", because they could not always be printed; in 1982, Wiley refused to include blackboard bold characters in mathematical books because the type was difficult and expensive to obtain. Donald Knuth preferred boldface to blackboard bold and so did not include blackboard bold in the Computer Modern typeface that he created for the TeX mathematical typesetting system he first released in 1978. Not all mathematical authors were satisfied with such workarounds. The American Mathematical Society created a simple chalk-style blackboard bold typeface in 1985 to go with the AMS-TeX package created by Michael Spivak , accessed using the \\Bbb command (for \"blackboard bold\"); in 1990, the AMS released an update with a new inline-style blackboard bold font intended to better match the Times New Roman font.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-4", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "The American Mathematical Society created a simple chalk-style blackboard bold typeface in 1985 to go with the AMS-TeX package created by Michael Spivak , accessed using the \\Bbb command (for \"blackboard bold\"); in 1990, the AMS released an update with a new inline-style blackboard bold font intended to better match the Times New Roman font. Since then, a variety of other blackboard bold typefaces have been created, some following the style of traditional inline typefaces and others closer in form to letters drawn with chalk. Unicode included the most common blackboard bold letters among the \" Letterlike Symbols \" in version 1.0 (1991), inherited from the Xerox Character Code Standard .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-5", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "Unicode included the most common blackboard bold letters among the \" Letterlike Symbols \" in version 1.0 (1991), inherited from the Xerox Character Code Standard . Later versions of Unicode extended this set to all uppercase and lowercase Latin letters and a variety of other symbols, among the \" Mathematical Alphanumeric Symbols \". In professionally typeset books, publishers and authors have gradually adopted blackboard bold, and its use is now commonplace, but some still use ordinary bold symbols. Some authors use blackboard bold letters on the blackboard or in manuscripts, but prefer an ordinary bold typeface in print; for example, Jean-Pierre Serre has used blackboard bold in lectures, but has consistently used ordinary bold for the same symbols in his published works.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-6", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "Some authors use blackboard bold letters on the blackboard or in manuscripts, but prefer an ordinary bold typeface in print; for example, Jean-Pierre Serre has used blackboard bold in lectures, but has consistently used ordinary bold for the same symbols in his published works. The Chicago Manual of Style ' s recommendation has evolved over time: In 1993, for the 14th edition, it advised that \"blackboard bold should be confined to the classroom\" (13.14); In 2003, for the 15th edition, it stated that \"open-faced (blackboard) symbols are reserved for familiar systems of numbers\" (14.12). In Unicode , a few of the more common blackboard bold characters (ℂ, ℍ, ℕ, ℙ, ℚ, ℝ, and ℤ) are encoded in the Basic Multilingual Plane (BMP) in the Letterlike Symbols (2100–214F) area, named DOUBLE-STRUCK CAPITAL C etc.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-7", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "In Unicode , a few of the more common blackboard bold characters (ℂ, ℍ, ℕ, ℙ, ℚ, ℝ, and ℤ) are encoded in the Basic Multilingual Plane (BMP) in the Letterlike Symbols (2100–214F) area, named DOUBLE-STRUCK CAPITAL C etc. The rest, however, are encoded outside the BMP, in Mathematical Alphanumeric Symbols (1D400–1D7FF), specifically from 1D538–1D550 (uppercase, excluding those encoded in the BMP), 1D552–1D56B (lowercase), and 1D7D8–1D7E1 (digits). Blackboard bold Arabic letters are encoded in Arabic Mathematical Alphabetic Symbols (1EE00–1EEFF), specifically 1EEA1–1EEBB. The third column shows the Unicode symbol itself (which will only display correctly on browsers that support Unicode and have access to a suitable typeface).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-8", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "The third column shows the Unicode symbol itself (which will only display correctly on browsers that support Unicode and have access to a suitable typeface). The fourth column describes some typical usage in mathematical texts. In addition, a blackboard-bold μ n (not found in Unicode or amsmath LaTeX) is sometimes used by number theorists and algebraic geometers to designate the group scheme of n -th roots of unity . Inline : A letter in which the inner portions of the main strokes have been carved away, leaving the edges more or less intact. The sign for bold type is a wavy line beneath the words or symbols in question; for security the word 'bold' may be added in the margin.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Blackboard_bold-9", "source": "https://en.wikipedia.org/wiki/Blackboard_bold", "title": "Blackboard bold", "text": "The sign for bold type is a wavy line beneath the words or symbols in question; for security the word 'bold' may be added in the margin. ^ An example of double-struck type produced by an impact printer of the early 1980s can be found in: Waite, Mitchell; Arca, Julie (1982). This usenet post (as mirrored by The Math Forum ) seems to have been one of the for Webb 2018 ; see p. The later revised edition is available from Sternberg's website . For example, some users may have fairly strong preferences regarding such details as to whether the stem or the diagonal of the letter 'N' is double-struck.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-0", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "700 BCE to present Descendants Ə Æ Œ € ℮ Ǝ ∈ ℯ ℇ ℰ ℥ & Sisters Е Э Є Ё Ә Һ ה ه ܗ Ɛ Ե ե Է է Ը ը ࠄ 𐎅 Ⲉ Other Associated graphs ee , e(x) , e(x)(y) Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . E ( minuscule : e ) is the fifth letter and the second vowel letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-1", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "E ( minuscule : e ) is the fifth letter and the second vowel letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other western European languages and others worldwide. Its name in English is e (pronounced / ˈ iː / ); plural es , Es , or E's . It is the most commonly used letter in many languages, including Czech , Danish , Dutch , English , French , German , Hungarian , Latin , Latvian , Norwegian , Spanish , and Swedish . Pronunciation of the name of the letter ⟨e⟩ in European languages History The Latin letter 'E' differs little from its source, the Greek letter epsilon , 'Ε'.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-2", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "Pronunciation of the name of the letter ⟨e⟩ in European languages History The Latin letter 'E' differs little from its source, the Greek letter epsilon , 'Ε'. This in turn comes from the Semitic letter hê , which has been suggested to have started as a praying or calling human figure ( hillul , 'jubilation'), and was most likely based on a similar Egyptian hieroglyph that indicated a different pronunciation. In Semitic, the letter represented /h/ (and /e/ in foreign words); in Greek , hê became the letter epsilon , used to represent /e/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-3", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "In Semitic, the letter represented /h/ (and /e/ in foreign words); in Greek , hê became the letter epsilon , used to represent /e/ . Use in writing systems English Although Middle English spelling used ⟨e⟩ to represent long and short / e / , the Great Vowel Shift changed long /eː/ (as in me or bee ) to /iː/ while short / ɛ / (as in met or bed ) remained a mid vowel . In unstressed syllables, this letter is usually pronounced either as / ɪ / or / ə / . In other cases, the letter is silent , generally at the end of words like queue .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-4", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "In unstressed syllables, this letter is usually pronounced either as / ɪ / or / ə / . In other cases, the letter is silent , generally at the end of words like queue . Digraphs with ⟨e⟩ are common to indicate either diphthongs or monophthongs , such as ⟨ea⟩ or ⟨ee⟩ for /iː/ or /eɪ/ in English, ⟨ei⟩ for /aɪ/ in German , and ⟨eu⟩ for /ø/ in French or /ɔɪ/ in German. Other systems The International Phonetic Alphabet uses ⟨ e ⟩ for the close-mid front unrounded vowel or the mid front unrounded vowel .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-5", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "Other systems The International Phonetic Alphabet uses ⟨ e ⟩ for the close-mid front unrounded vowel or the mid front unrounded vowel . Frequency E is the most common (or highest- frequency ) letter in the English language alphabet and several other European languages , which has implications in both cryptography and data compression . ℮: estimated sign (used on prepackaged goods for sale within the European Union ). Other representations Computing Other In British Sign Language (BSL), the letter 'e' is signed by extending the index finger of the right hand touching the tip of index on the left hand, with all fingers of left hand open.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E-6", "source": "https://en.wikipedia.org/wiki/E", "title": "E", "text": "Other representations Computing Other In British Sign Language (BSL), the letter 'e' is signed by extending the index finger of the right hand touching the tip of index on the left hand, with all fingers of left hand open.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-0", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Here, e is the unique number larger than 1 that makes the shaded area under the curve equal to 1. The number e is a mathematical constant , approximately equal to 2.71828, that is the base of the natural logarithm and exponential function . Alternatively, e can be called Napier's constant after John Napier . The number e is of great importance in mathematics, alongside 0, 1, π , and i . e is irrational , meaning that it cannot be represented as a ratio of integers. Moreover, like the constant π , it is transcendental , meaning that it is not a root of any non-zero polynomial with rational coefficients.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-1", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Moreover, like the constant π , it is transcendental , meaning that it is not a root of any non-zero polynomial with rational coefficients. The number e can also be characterized in terms of an integral : ∫ 1 e d x x = 1. It is assumed that the table was written by William Oughtred . In 1661, Christiaan Huygens studied how to compute logarithms by geometrical methods and calculated a quantity that, in retrospect, is the base-10 logarithm of e , but he did not recognize e itself as a quantity of interest.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-2", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "In 1661, Christiaan Huygens studied how to compute logarithms by geometrical methods and calculated a quantity that, in retrospect, is the base-10 logarithm of e , but he did not recognize e itself as a quantity of interest. The constant itself was introduced by Jacob Bernoulli in 1683, for solving the problem of continuous compounding of interest. The first symbol used for this constant was the letter b by Gottfried Leibniz in letters to Christiaan Huygens in 1690 and 1691. Leonhard Euler started to use the letter e for the constant in 1727 or 1728, in an unpublished paper on explosive forces in cannons, and in a letter to Christian Goldbach on 25 November 1731.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-3", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Leonhard Euler started to use the letter e for the constant in 1727 or 1728, in an unpublished paper on explosive forces in cannons, and in a letter to Christian Goldbach on 25 November 1731. The first of e in a printed publication was in Euler's Mechanica (1736). Although some researchers used the letter c in the subsequent years, the letter e was more common and eventually became standard. Euler proved that e is the sum of the infinite series e = ∑ n = 0 ∞ 1 n ! The equivalence of the two characterizations using the limit and the infinite series can be proved via the binomial theorem .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-4", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "The equivalence of the two characterizations using the limit and the infinite series can be proved via the binomial theorem . Jacob Bernoulli discovered this constant in 1683, while studying a question about compound interest : An account starts with $1.00 and pays 100 percent interest per year. If the interest is credited once, at the end of the year, the value of the account at year-end will be $2.00. What happens if the interest is computed and credited more frequently during the year? If the interest is credited twice in the year, the interest rate for each 6 months will be 50%, so the initial $1 is multiplied by 1.5 twice, yielding $1.00 × 1.5 = $2.25 at the end of the year.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-5", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "If the interest is credited twice in the year, the interest rate for each 6 months will be 50%, so the initial $1 is multiplied by 1.5 twice, yielding $1.00 × 1.5 = $2.25 at the end of the year. If there are n compounding intervals, the interest for each interval will be 100%/ n and the value at the end of the year will be $1.00 × (1 + 1/ n ) . The limit as n grows large is the number that came to be known as e . That is, with continuous compounding, the account value will reach $2.718281828...", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-6", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "The limit as n grows large is the number that came to be known as e . That is, with continuous compounding, the account value will reach $2.718281828... More generally, an account that starts at $1 and offers an annual interest rate of R will, after t years, yield e dollars with continuous compounding. Here, R is the decimal equivalent of the rate of interest expressed as a percentage , so for 5% interest, R = 5/100 = 0.05 . The number e itself also has applications in probability theory , in a way that is not obviously related to exponential growth.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-7", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "The number e itself also has applications in probability theory , in a way that is not obviously related to exponential growth. Suppose that a gambler plays a slot machine that pays out with a probability of one in n and plays it n times. As n increases, the probability that gambler will lose all n bets approaches 1/ e , which is approximately 36.79%. This is an example of a Bernoulli trial process. Each time the gambler plays the slots, there is a one in n chance of winning. Playing n times is modeled by the binomial distribution , which is closely related to the binomial theorem and Pascal's triangle .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-8", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Playing n times is modeled by the binomial distribution , which is closely related to the binomial theorem and Pascal's triangle . It occurs when the instantaneous rate of change (that is, the derivative ) of a quantity with respect to time is proportional to the quantity itself. Described as a function, a quantity undergoing exponential growth is an exponential function of time, that is, the variable representing time is the exponent (in contrast to other types of growth, such as quadratic growth ). If the constant of proportionality is negative, then the quantity decreases over time, and is said to be undergoing exponential decay instead.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-9", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "If the constant of proportionality is negative, then the quantity decreases over time, and is said to be undergoing exponential decay instead. The law of exponential growth can be written in different but mathematically equivalent forms, by using a different base , for which the number e is a common and convenient choice: x ( t ) = x 0 ⋅ e k t = x 0 ⋅ e t / τ . The problem of de Montmort is to find the probability that none of the hats gets put into the right box. Furthermore, the number of ways the hats can be placed into the boxes so that none of the hats are in the right box is n !/ e , rounded to the nearest integer, for every positive n .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-10", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Furthermore, the number of ways the hats can be placed into the boxes so that none of the hats are in the right box is n !/ e , rounded to the nearest integer, for every positive n . This is useful in the problem of a stick of length L that is broken into n equal parts. An example is Stirling's formula for the asymptotics of the factorial function , in which both the numbers e and π appear: n ! They all pass through the point (0,1) , but the red line (which has slope 1 ) is tangent to only e there.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-11", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "They all pass through the point (0,1) , but the red line (which has slope 1 ) is tangent to only e there. The principal motivation for introducing the number e , particularly in calculus , is to perform differential and integral calculus with exponential functions and logarithms . Thus, when the value of a is set to e , this limit is equal to 1 , and so one arrives at the following simple identity: d d x e x = e x . Choosing e (as opposed to some other number) as the base of the exponential function makes calculations involving the derivatives much simpler.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-12", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Choosing e (as opposed to some other number) as the base of the exponential function makes calculations involving the derivatives much simpler. The base- a logarithm of e is 1, if a equals e . Thus, there are two ways of selecting such special numbers a . One way is to set the derivative of the exponential function a equal to a , and solve for a . The other way is to set the derivative of the base a logarithm to 1/ x and solve for a . It turns out that these two solutions for a are actually the same : the number e .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-13", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "It turns out that these two solutions for a are actually the same : the number e . The five colored regions are of equal area, and define units of hyperbolic angle along the hyperbola x y = 1. It follows that e is the unique positive real number such that ∫ 1 e 1 t d t = 1. The number e is the unique base such that y = e intersects only at x = 0 . Furthermore, e is the unique base of the exponential for which the inequality a ≥ x + 1 holds for all x .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-14", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Furthermore, e is the unique base of the exponential for which the inequality a ≥ x + 1 holds for all x . This is a limiting case of Bernoulli's inequality . (One can check that the derivative of ln f ( x ) is zero only for this value of x .) Similarly, x = 1/ e is where the global minimum occurs for the function f ( x ) = x x . ( Fourier 's proof that e is irrational .) Furthermore, by the Lindemann–Weierstrass theorem , e is transcendental , meaning that it is not a solution of any non-zero polynomial equation with rational coefficients.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-15", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "( Fourier 's proof that e is irrational .) Furthermore, by the Lindemann–Weierstrass theorem , e is transcendental , meaning that it is not a solution of any non-zero polynomial equation with rational coefficients. It was the first number to be proved transcendental without having been specifically constructed for this purpose (compare with Liouville number ); the proof was given by Charles Hermite in 1873. An unsolved problem thus far is the question of whether or not the numbers e and π are algebraically independent . It is conjectured that e is normal , meaning that when e is expressed in any base the possible digits in that base are uniformly distributed (occur with equal probability in any sequence of given length).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-16", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "It is conjectured that e is normal , meaning that when e is expressed in any base the possible digits in that base are uniformly distributed (occur with equal probability in any sequence of given length). In algebraic geometry , a period is a number that can be expressed as an integral of an algebraic function over an algebraic domain . The constant π is a period, but it is conjectured that e is not. In addition, it is directly used in a proof that π is transcendental , which implies the impossibility of squaring the circle .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-17", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "In addition, it is directly used in a proof that π is transcendental , which implies the impossibility of squaring the circle . Moreover, the identity implies that, in the principal branch of the logarithm, ln ⁡ ( − 1 ) = i π . Using the natural logarithm gives entropy units in nats (as opposed, for example, to the use of the base-2 logarithm giving entropy in bits ). Since around 2010, the proliferation of modern high-speed desktop computers has made it feasible for amateurs to compute trillions of digits of e within acceptable amounts of time.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-18", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Since around 2010, the proliferation of modern high-speed desktop computers has made it feasible for amateurs to compute trillions of digits of e within acceptable amounts of time. This method uses binary splitting to compute e with fewer single-digit arithmetic operations and thus reduced bit complexity . In another instance, the IPO filing for Google in 2004, rather than a typical round-number amount of money, the company announced its intention to raise 2,718,281,828 USD , which is e billion dollars rounded to the nearest dollar. Google was also responsible for a billboard that appeared in the heart of Silicon Valley , and later in Cambridge, Massachusetts ; Seattle, Washington ; and Austin, Texas .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-19", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Google was also responsible for a billboard that appeared in the heart of Silicon Valley , and later in Cambridge, Massachusetts ; Seattle, Washington ; and Austin, Texas . Solving this problem and visiting the advertised (now defunct) website led to an even more difficult problem to solve, which consisted of finding the fifth term in the sequence 7182818284, 8182845904, 8747135266, 7427466391. The fifth term in the sequence is 5966290435, which starts at the 127th digit. Solving this second problem finally led to a Google Labs webpage where the visitor was invited to submit a résumé.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-20", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "Solving this second problem finally led to a Google Labs webpage where the visitor was invited to submit a résumé. Most implementations of the exponential function use range reduction, lookup tables, and polynomial or rational approximations (such as Padé approximants or Taylor expansions) to achieve accurate results across a wide range of inputs. At very high precision, methods based on elliptic functions and fast convergence of the AGM and Newton's method can be used to compute the exponential function. 1685\" (Some questions about interest, with a solution of a problem about games of chance, proposed in the Journal des Savants ( Ephemerides Eruditorum Gallicanæ ), in the year (anno) 1685.**), Acta eruditorum , pp.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-21", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "1685\" (Some questions about interest, with a solution of a problem about games of chance, proposed in the Journal des Savants ( Ephemerides Eruditorum Gallicanæ ), in the year (anno) 1685.**), Acta eruditorum , pp. Scribatur pro numero cujus logarithmus est unitas, e, qui est 2,7182817… (English: Written for the number of which the logarithm has the unit, e, that is 2,7182817...\") ^ Lettre XV. Fuss, ed., Correspondance Mathématique et Physique de Quelques Célèbres Géomètres du XVIIIeme Siècle … (Mathematical and physical correspondence of some famous geometers of the 18th century), vol. A Course Of Modern Analysis: An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions (4th ed.).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-22", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "A Course Of Modern Analysis: An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions (4th ed.). ^ Dinov, ID (2007) Estimating e using SOCR simulation ; Archived 2020-03-15 at the Wayback Machine , SOCR Hands-on Activities ( . and Gourdon, X.; The constant e and its computation ^ Gourdon, X.; Reported large computations with PiFast ^ Roger Cotes (1714) \"Logometria,\" Philosophical Transactions of the Royal Society of London , 29 (338) : 5–45; see especially the bottom of page 10. ^ William Shanks (1871) \"On the numerical values of e , log e 2 , log e 3 , log e 5 , and log e 10 , also on the numerical value of M the modulus of the common system of logarithms, all to 205 decimals,\" Proceedings of the Royal Society of London , 20 : 27–29.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29-23", "source": "https://en.wikipedia.org/wiki/E_%28mathematical_constant%29", "title": "E (mathematical constant)", "text": "^ William Shanks (1871) \"On the numerical values of e , log e 2 , log e 3 , log e 5 , and log e 10 , also on the numerical value of M the modulus of the common system of logarithms, all to 205 decimals,\" Proceedings of the Royal Society of London , 20 : 27–29. \"Being the King Kong of algorithmic culture is a tough job after all: Google's regimes of justification and the meanings of Glass\" . The number e to 1 million places and NASA.gov 2 and 5 million places e Approximations – Wolfram MathWorld Earliest Uses of Symbols for Constants Jan.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-0", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "In mathematics , the exponential function is the unique real function which maps zero to one and has a derivative everywhere equal to its value. It is called exponential because its argument can be seen as an exponent to which a constant number e ≈ 2.718 , the base, is raised. There are several other definitions of the exponential function, which are all equivalent although being of very different nature. The exponential function is occasionally called the natural exponential function , matching the name natural logarithm , for distinguishing it from some other functions that are also commonly called exponential functions .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-1", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "The exponential function is occasionally called the natural exponential function , matching the name natural logarithm , for distinguishing it from some other functions that are also commonly called exponential functions . The exponential function can be generalized to accept complex numbers as arguments. The exponential function can be even further generalized to accept other types of arguments, such as matrices and elements of Lie algebras . The graph always lies above the x -axis, but becomes arbitrarily close to it for large negative x ; thus, the x -axis is a horizontal asymptote .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-2", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "The graph always lies above the x -axis, but becomes arbitrarily close to it for large negative x ; thus, the x -axis is a horizontal asymptote . Since the derivative is the slope of the tangent, this implies that all green right triangles have a base length of 1. The exponential function is the unique differentiable function that equals its derivative , and takes the value 1 for the value 0 of its variable. This definition requires a uniqueness proof and an existence proof, but it allows an easy derivation of the main properties of the exponential function.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-3", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "This definition requires a uniqueness proof and an existence proof, but it allows an easy derivation of the main properties of the exponential function. Among these functions, the exponential function is characterized by the property that its derivative at 0 is 1 . Since the exponential function equals its derivative, this implies that the exponential function is monotonically increasing . The exponential function and the natural logarithm being the inverse each of the other, one has b = exp ⁡ ( ln ⁡ b ) . These most general exponential functions are the differentiable functions that satisfy the following equivalent characterizations.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-4", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "The exponential function and the natural logarithm being the inverse each of the other, one has b = exp ⁡ ( ln ⁡ b ) . These most general exponential functions are the differentiable functions that satisfy the following equivalent characterizations. Exponential growth or exponential decay —where the variable change is proportional to the variable value—are thus modeled with exponential functions. Examples are unlimited population growth leading to Malthusian catastrophe , continuously compounded interest , and radioactive decay . The exponential function is involved as follows in the computation of continuously compounded interests . If a principal amount of 1 earns interest at an annual rate of x compounded monthly, then the interest earned each month is ⁠ x / 12 ⁠ times the current value, so each month the total value is multiplied by (1 + ⁠ x / 12 ⁠ ) , and the value at the end of the year is (1 + ⁠ x / 12 ⁠ ) .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-5", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "If a principal amount of 1 earns interest at an annual rate of x compounded monthly, then the interest earned each month is ⁠ x / 12 ⁠ times the current value, so each month the total value is multiplied by (1 + ⁠ x / 12 ⁠ ) , and the value at the end of the year is (1 + ⁠ x / 12 ⁠ ) . If instead interest is compounded daily, this becomes (1 + ⁠ x / 365 ⁠ ) . The exponential functions can be defined as solutions of differential equations .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-6", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "If instead interest is compounded daily, this becomes (1 + ⁠ x / 365 ⁠ ) . The exponential functions can be defined as solutions of differential equations . More generally, the solutions of every linear differential equation with constant coefficients can be expressed in terms of exponential functions and, when they are not homogeneous, antiderivatives. The exponential function can be naturally extended to a complex function , which is a function with the complex numbers as domain and codomain , such that its restriction to the reals is the above-defined exponential function, called real exponential function in what follows.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-7", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "The exponential function can be naturally extended to a complex function , which is a function with the complex numbers as domain and codomain , such that its restriction to the reals is the above-defined exponential function, called real exponential function in what follows. For distinguishing the complex case from the real one, the extended function is also called complex exponential function or simply complex exponential . Most of the definitions of the exponential function can be used verbatim for definiting the complex exponential function, and the proof of their equivalence is the same as in the real case.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-8", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "Most of the definitions of the exponential function can be used verbatim for definiting the complex exponential function, and the proof of their equivalence is the same as in the real case. The complex exponential function can be defined in several equivalent ways that are the same as in the real case. So, the complex exponential is an entire function . The complex logarithm is a right-inverse function of the complex exponential: e log ⁡ z = z . On the opposite, this is the complex logarithm that is often defined from the complex exponential.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-9", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "The complex logarithm is a right-inverse function of the complex exponential: e log ⁡ z = z . On the opposite, this is the complex logarithm that is often defined from the complex exponential. The complex conjugate of the complex exponential is e z ¯ = e z ¯ . These formulas may be used to define trigonometric functions of a complex variable. A much more difficult result is that the base e of the natural exponential function is a transcendental number , see the Lindemann–Weierstrass theorem . Following a proposal by William Kahan , it may thus be useful to have a dedicated routine, often called expm1 , which computes e − 1 directly, bypassing computation of e .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-10", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "Following a proposal by William Kahan , it may thus be useful to have a dedicated routine, often called expm1 , which computes e − 1 directly, bypassing computation of e . A similar approach has been used for the logarithm; see log1p . In this setting, e = 1 , and e is invertible with inverse e for any x in B . If xy = yx , then e = e e , but this identity can fail for noncommuting x and y . In fact, since R is the Lie algebra of the Lie group of all positive real numbers under multiplication, the ordinary exponential function for real arguments is a special case of the Lie algebra situation.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-11", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "In fact, since R is the Lie algebra of the Lie group of all positive real numbers under multiplication, the ordinary exponential function for real arguments is a special case of the Lie algebra situation. Similarly, since the Lie group GL( n , R ) of invertible n × n matrices has as Lie algebra M( n , R ) , the space of all n × n matrices, the exponential function for square matrices is a special case of the Lie algebra exponential map. Harnett, Calculus 1 , 1998, Functions continued: \"General exponential functions have the property that the ratio of two outputs depends only on the difference of inputs.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Exponential_function-12", "source": "https://en.wikipedia.org/wiki/Exponential_function", "title": "Exponential function", "text": "Harnett, Calculus 1 , 1998, Functions continued: \"General exponential functions have the property that the ratio of two outputs depends only on the difference of inputs. The ratio of outputs for a unit change in input is the base.\" ^ G. Harnett, Calculus 1 , 1998; Functions continued / Exponentials & logarithms: \"The ratio of outputs for a unit change in input is the base of a general exponential function.\" ^ Serway, Raymond A.; Moses, Clement J.; Moyer, Curt A.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-0", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Other types of electrical equipment also produce an emf, such as batteries , which convert chemical energy , and generators , which convert mechanical energy . This energy conversion is achieved by physical forces applying physical work on electric charges . An electronic–hydraulic analogy may view emf as the mechanical work done to water by a pump , which results in a pressure difference (analogous to voltage) . In electromagnetic induction , emf can be defined around a closed loop of a conductor as the electromagnetic work that would be done on an elementary electric charge (such as an electron ) if it travels once around the loop.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-1", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "In electromagnetic induction , emf can be defined around a closed loop of a conductor as the electromagnetic work that would be done on an elementary electric charge (such as an electron ) if it travels once around the loop. For two- terminal devices modeled as a Thévenin equivalent circuit , an equivalent emf can be measured as the open-circuit voltage between the two terminals. This emf can drive an electric current if an external circuit is attached to the terminals, in which case the device becomes the voltage source of that circuit. Although an emf gives rise to a voltage and can be measured as a voltage and may sometimes informally be called a \"voltage\", they are not the same phenomenon (see § Distinction with potential difference ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-2", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Although an emf gives rise to a voltage and can be measured as a voltage and may sometimes informally be called a \"voltage\", they are not the same phenomenon (see § Distinction with potential difference ). In nature, emf is generated when magnetic field fluctuations occur through a surface. For example, the shifting of the Earth's magnetic field during a geomagnetic storm induces currents in an electrical grid as the lines of the magnetic field are shifted about and cut across the conductors. In a battery, the charge separation that gives rise to a potential difference ( voltage ) between the terminals is accomplished by chemical reactions at the electrodes that convert chemical potential energy into electromagnetic potential energy.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-3", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "In a battery, the charge separation that gives rise to a potential difference ( voltage ) between the terminals is accomplished by chemical reactions at the electrodes that convert chemical potential energy into electromagnetic potential energy. A voltaic cell can be thought of as having a \"charge pump\" of atomic dimensions at each electrode, that is: A (chemical) source of emf can be thought of as a kind of charge pump that acts to move positive charges from a point of low potential through its interior to a point of high potential. In an electrical generator, a time-varying magnetic field inside the generator creates an electric field via electromagnetic induction , which creates a potential difference between the generator terminals.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-4", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "In an electrical generator, a time-varying magnetic field inside the generator creates an electric field via electromagnetic induction , which creates a potential difference between the generator terminals. Charge separation takes place within the generator because electrons flow away from one terminal toward the other, until, in the open-circuit case, an electric field is developed that makes further charge separation impossible. The emf is countered by the electrical voltage due to charge separation. If a load is attached, this voltage can drive a current. The general principle governing the emf in such electrical machines is Faraday's law of induction .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-5", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "If a load is attached, this voltage can drive a current. The general principle governing the emf in such electrical machines is Faraday's law of induction . Around 1830, Michael Faraday established that chemical reactions at each of two electrode–electrolyte interfaces provide the \"seat of emf\" for the voltaic cell. That is, these reactions drive the current and are not an endless source of energy as the earlier obsolete theory thought. In the open-circuit case, charge separation continues until the electrical field from the separated charges is sufficient to arrest the reactions. Years earlier, Alessandro Volta , who had measured a contact potential difference at the metal–metal (electrode–electrode) interface of his cells, held the incorrect opinion that contact alone (without taking into account a chemical reaction) was the origin of the emf.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-6", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Years earlier, Alessandro Volta , who had measured a contact potential difference at the metal–metal (electrode–electrode) interface of his cells, held the incorrect opinion that contact alone (without taking into account a chemical reaction) was the origin of the emf. It is independent of size of the cell but depends on the nature of the electrolyte used. The standard unit of emf in the International System of Units (SI) is the volt (V) . Like other measures of energy per charge, emf uses the SI unit volt , which is equivalent to a joule (SI unit of energy) per coulomb (SI unit of charge).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-7", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Like other measures of energy per charge, emf uses the SI unit volt , which is equivalent to a joule (SI unit of energy) per coulomb (SI unit of charge). Electromotive force in electrostatic units is the statvolt (in the centimeter gram second system of units equal in amount to an erg per electrostatic unit of charge). The electrostatic field does not contribute to the net emf around a circuit because the electrostatic portion of the electric field is conservative (i.e., the work done against the field around a closed path is zero, by Kirchhoff's voltage law , which is valid, as long as the circuit elements remain at rest and radiation is ignored).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-8", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The electrostatic field does not contribute to the net emf around a circuit because the electrostatic portion of the electric field is conservative (i.e., the work done against the field around a closed path is zero, by Kirchhoff's voltage law , which is valid, as long as the circuit elements remain at rest and radiation is ignored). That is, the \"induced emf\" (like the emf of a battery connected to a load) is not a \"voltage\" in the sense of a difference in the electric scalar potential. If in addition, the loop includes a coil that extends from point 1 to 2, such that the magnetic flux is largely localized to that region, it is customary to speak of that region as an inductor , and to consider that its emf is localized to that region.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-9", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "If in addition, the loop includes a coil that extends from point 1 to 2, such that the magnetic flux is largely localized to that region, it is customary to speak of that region as an inductor , and to consider that its emf is localized to that region. The latter is closely related to the reaction entropy of the electrochemical reaction that lends the battery its power. The quantities on the right are all directly measurable. In a circuit of a voltage source and a resistor, the sum of the source's applied voltage plus the ohmic voltage drop through the resistor is zero.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-10", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "In a circuit of a voltage source and a resistor, the sum of the source's applied voltage plus the ohmic voltage drop through the resistor is zero. But the resistor provides no emf, only the voltage source does: For a circuit using a battery source, the emf is due solely to the chemical forces in the battery. For a circuit using an electric generator, the emf is due solely to a time-varying magnetic forces within the generator. In the case of an open circuit, the electric charge that has been separated by the mechanism generating the emf creates an electric field opposing the separation mechanism.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-11", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "In the case of an open circuit, the electric charge that has been separated by the mechanism generating the emf creates an electric field opposing the separation mechanism. For example, the chemical reaction in a voltaic cell stops when the opposing electric field at each electrode is strong enough to arrest the reactions. A larger opposing field can reverse the reactions in what are called reversible cells. The electric charge that has been separated creates an electric potential difference that can (in many cases) be measured with a voltmeter between the terminals of the device, when not connected to a load.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-12", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The electric charge that has been separated creates an electric potential difference that can (in many cases) be measured with a voltmeter between the terminals of the device, when not connected to a load. The magnitude of the emf for the battery (or other source) is the value of this open-circuit voltage. When the battery is charging or discharging, the emf itself cannot be measured directly using the external voltage because some voltage is lost inside the source. The potential difference (difference in the electric scalar potential) between two points A and B is independent of the path we take from A to B .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-13", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The potential difference (difference in the electric scalar potential) between two points A and B is independent of the path we take from A to B . If a voltmeter always measured the potential difference between A and B , then the position of the voltmeter would make no difference. However, it is quite possible for the measurement by a voltmeter between points A and B to depend on the position of the voltmeter, if a time-dependent magnetic field is present. For example, consider an infinitely long solenoid using an AC current to generate a varying flux in the interior of the solenoid.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-14", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "For example, consider an infinitely long solenoid using an AC current to generate a varying flux in the interior of the solenoid. The resistor on the left is 100 Ω and the one on the right is 20 Ω , they are connected at the top and bottom at points A and B . If charge separation is involved, this energy difference can result in an emf. Galvanic cell using a salt bridge The question of how batteries (galvanic cells) generate an emf occupied scientists for most of the 19th century. The \"seat of the electromotive force\" was eventually determined in 1889 by Walther Nernst to be primarily at the interfaces between the electrodes and the electrolyte .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-15", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The \"seat of the electromotive force\" was eventually determined in 1889 by Walther Nernst to be primarily at the interfaces between the electrodes and the electrolyte . Atoms in molecules or solids are held together by chemical bonding , which stabilizes the molecule or solid (i.e. When molecules or solids of relatively high energy are brought together, a spontaneous chemical reaction can occur that rearranges the bonding and reduces the (free) energy of the system. In batteries, coupled half-reactions, often involving metals and their ions, occur in tandem, with a gain of electrons (termed \"reduction\") by one conductive electrode and loss of electrons (termed \"oxidation\") by another (reduction-oxidation or redox reactions ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-16", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "In batteries, coupled half-reactions, often involving metals and their ions, occur in tandem, with a gain of electrons (termed \"reduction\") by one conductive electrode and loss of electrons (termed \"oxidation\") by another (reduction-oxidation or redox reactions ). The spontaneous overall reaction can only occur if electrons move through an external wire between the electrodes. The electrical energy given off is the free energy lost by the chemical reaction system. As an example, a Daniell cell consists of a zinc anode (an electron collector) that is oxidized as it dissolves into a zinc sulfate solution. The difference of excess electrons on the anode and deficit of electrons on the cathode creates an electrical potential between the two electrodes.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-17", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The difference of excess electrons on the anode and deficit of electrons on the cathode creates an electrical potential between the two electrodes. If the cathode and anode are connected by an external conductor, electrons pass through that external circuit (light bulb in figure), while ions pass through the salt bridge to maintain charge balance until the anode and cathode reach electrical equilibrium of zero volts as chemical equilibrium is reached in the cell. In the process the zinc anode is dissolved while the copper electrode is plated with copper. The salt bridge has to close the electrical circuit while preventing the copper ions from moving to the zinc electrode and being reduced there without generating an external current.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-18", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The salt bridge has to close the electrical circuit while preventing the copper ions from moving to the zinc electrode and being reduced there without generating an external current. It is not made of salt but of material able to wick cations and anions (a dissociated salt) into the solutions. The flow of positively charged cations along the bridge is equivalent to the same number of negative charges flowing in the opposite direction. If the light bulb is removed (open circuit) the emf between the electrodes is opposed by the electric field due to the charge separation, and the reactions stop.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-19", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "If the light bulb is removed (open circuit) the emf between the electrodes is opposed by the electric field due to the charge separation, and the reactions stop. Volta's law about opposing electrode emfs implies that, given ten electrodes (for example, zinc and nine other materials), 45 unique combinations of voltaic cells (10 × 9/2) can be created. The figures quoted below are nominal, because emf varies according to the size of the load and the state of exhaustion of the cell. A time-dependent magnetic field can be produced either by motion of a magnet relative to a circuit, by motion of a circuit relative to another circuit (at least one of these must be carrying an electric current), or by changing the electric current in a fixed circuit.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-20", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "A time-dependent magnetic field can be produced either by motion of a magnet relative to a circuit, by motion of a circuit relative to another circuit (at least one of these must be carrying an electric current), or by changing the electric current in a fixed circuit. The effect on the circuit itself, of changing the electric current, is known as self-induction; the effect on another circuit is known as mutual induction . For a given circuit, the electromagnetically induced emf is determined purely by the rate of change of the magnetic flux through the circuit according to Faraday's law of induction .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-21", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "For a given circuit, the electromagnetically induced emf is determined purely by the rate of change of the magnetic flux through the circuit according to Faraday's law of induction . An emf is induced in a coil or conductor whenever there is change in the flux linkages . Depending on the way in which the changes are brought about, there are two types: When the conductor is moved in a stationary magnetic field to procure a change in the flux linkage, the emf is statically induced . The electromotive force generated by motion is often referred to as motional emf .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-22", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Depending on the way in which the changes are brought about, there are two types: When the conductor is moved in a stationary magnetic field to procure a change in the flux linkage, the emf is statically induced . The electromotive force generated by motion is often referred to as motional emf . When the change in flux linkage arises from a change in the magnetic field around the stationary conductor, the emf is dynamically induced. The electromotive force generated by a time-varying magnetic field is often referred to as transformer emf . Dissimilar metals in contact produce what is known also as a contact electromotive force or Galvani potential .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-23", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Dissimilar metals in contact produce what is known also as a contact electromotive force or Galvani potential . The magnitude of this potential difference is often expressed as a difference in Fermi levels in the two solids when they are at charge neutrality, where the Fermi level (a name for the chemical potential of an electron system ) describes the energy necessary to remove an electron from the body to some common point (such as ground). If there is an energy advantage in taking an electron from one body to the other, such a transfer will occur.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-24", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "If there is an energy advantage in taking an electron from one body to the other, such a transfer will occur. This charge transfer causes a potential difference between the bodies, which partly cancels the potential originating from the contact, and eventually equilibrium is reached. At thermodynamic equilibrium, the Fermi levels are equal (the electron removal energy is identical) and there is now a built-in electrostatic potential between the bodies. The original difference in Fermi levels, before contact, is referred to as the emf. The contact potential cannot drive steady current through a load attached to its terminals because that current would involve a charge transfer.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-25", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The contact potential cannot drive steady current through a load attached to its terminals because that current would involve a charge transfer. No mechanism exists to continue such transfer and, hence, maintain a current, once equilibrium is attained. One might inquire why the contact potential does not appear in Kirchhoff's voltage law as one contribution to the sum of potential drops. The customary answer is that any circuit involves not only a particular diode or junction, but also all the contact potentials due to wiring and so forth around the entire circuit. The sum of all the contact potentials is zero, and so they may be ignored in Kirchhoff's law.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-26", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The sum of all the contact potentials is zero, and so they may be ignored in Kirchhoff's law. Operation of a solar cell can be understood from its equivalent circuit . This electric field is created from a built-in potential , which arises from the contact potential between the two different materials in the junction. The charge separation between positive holes and negative electrons across the p–n diode yields a forward voltage , the photo voltage , between the illuminated diode terminals, which drives current through any attached load. Photo voltage is sometimes referred to as the photo emf , distinguishing between the effect and the cause.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-27", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "Photo voltage is sometimes referred to as the photo emf , distinguishing between the effect and the cause. When the output is short-circuited, the output voltage is zeroed, and so the voltage across the diode is smallest. Approximately this same current is obtained for forward voltages up to the point where the diode conduction becomes significant. The current delivered by the illuminated diode to the external circuit can be simplified (based on certain assumptions) to: I = I L − I 0 ( e V m V T − 1 ) . Their emf is the voltage at their y-axis intercept.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-28", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "The current delivered by the illuminated diode to the external circuit can be simplified (based on certain assumptions) to: I = I L − I 0 ( e V m V T − 1 ) . Their emf is the voltage at their y-axis intercept. For silicon junctions, it is typically not much more than 0.5 volts . While for high-quality silicon panels it can exceed 0.7 volts in direct sunlight. ^ Only the electric field that results from charge separation caused by the emf is counted. While a solar cell has an electric field that results from a contact potential (see §§ Contact potentials ​ and Solar cell ) , this electric field component is not included in the integral.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/Electromotive_force-29", "source": "https://en.wikipedia.org/wiki/Electromotive_force", "title": "Electromotive force", "text": "While a solar cell has an electric field that results from a contact potential (see §§ Contact potentials ​ and Solar cell ) , this electric field component is not included in the integral. Only the electric field that results from charge separation caused by photon energy is included. ^ The brave reader can find an extensive discussion for organic electrochemistry in Amatore, Christian (2000). Nuova Voltiana:Studies on Volta and His Times . Theodore William Richards and Gustavus Edward Behr, jr., \"The electromotive force of iron under varying conditions, and the effect of occluded hydrogen\".", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/N-0", "source": "https://en.wikipedia.org/wiki/N", "title": "N", "text": "700 BCE to present Descendants ₦ Ƞ Ŋ ɧ ʩ Sisters Н Ң Ӊ Ӈ Ԋ נ , ן , ن , ܢ ނ Ն ն Մ մ ࠍ ነ ᚾ Ꮋ Ꮑ Ꮓ Other Associated graphs n(x) , nh , ng , ny Writing direction Left-to-right This article contains phonetic transcriptions in the International Phonetic Alphabet (IPA) . N ( minuscule : n ) is the fourteenth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other Western European languages , and others worldwide. Its name in English is en (pronounced / ˈ ɛ n / ), plural ens .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/N-1", "source": "https://en.wikipedia.org/wiki/N", "title": "N", "text": "N ( minuscule : n ) is the fourteenth letter of the Latin alphabet , used in the modern English alphabet , the alphabets of other Western European languages , and others worldwide. Its name in English is en (pronounced / ˈ ɛ n / ), plural ens . History One of the most common hieroglyphs , snake , was used in Egyptian writing to stand for a sound like the English ⟨ J ⟩ , because the Egyptian word for \"snake\" was djet . It is speculated by some, such as archeologist Douglas Petrovich, that Semitic speakers working in Egypt adapted hieroglyphs to create the first alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/N-2", "source": "https://en.wikipedia.org/wiki/N", "title": "N", "text": "It is speculated by some, such as archeologist Douglas Petrovich, that Semitic speakers working in Egypt adapted hieroglyphs to create the first alphabet . Some hold that they used the same snake symbol to represent N, with a great proponent of this theory being Alan Gardiner , because their word for \"snake\" may have begun with n (an example of a possible word being nahash ). The name for the letter in the Phoenician , Hebrew , Aramaic , and Arabic alphabets is nun , which means \" fish \" in some of these languages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/N-3", "source": "https://en.wikipedia.org/wiki/N", "title": "N", "text": "The name for the letter in the Phoenician , Hebrew , Aramaic , and Arabic alphabets is nun , which means \" fish \" in some of these languages. The sound value of the letter was /n/ —as in Greek , Etruscan , Latin , and modern languages. Use in writing systems English In English , ⟨n⟩ usually represents a voiced alveolar nasal /n/ , but can represent other nasal consonants due to assimilation . ⟨n⟩ is generally silent when it is preceded by an ⟨m⟩ at the end of words, as in hymn ; however, it is pronounced in this combination when occurring word medially, as in hymnal .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/N-4", "source": "https://en.wikipedia.org/wiki/N", "title": "N", "text": "⟨n⟩ is generally silent when it is preceded by an ⟨m⟩ at the end of words, as in hymn ; however, it is pronounced in this combination when occurring word medially, as in hymnal . Other consonants are often silent when they precede an ⟨n⟩ at the beginning of an English word. The letter N is the sixth-most common letter and the second-most commonly used consonant in the English language (after ⟨t⟩ ). Other languages The letter ⟨n⟩ represents a voiced dental nasal /n̪/ or voiced alveolar nasal /n/ in virtually all languages that use the Latin alphabet.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/N-5", "source": "https://en.wikipedia.org/wiki/N", "title": "N", "text": "Other languages The letter ⟨n⟩ represents a voiced dental nasal /n̪/ or voiced alveolar nasal /n/ in virtually all languages that use the Latin alphabet. The Portuguese and Vietnamese spelling for this sound is ⟨nh⟩ , while Spanish , Breton , and a few other languages use the letter ⟨ ñ ⟩ . A common digraph with ⟨n⟩ is ⟨ng⟩ , which represents a voiced velar nasal /ŋ/ in a variety of languages.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-0", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "The origin dates back to medieval Spanish , when the Latin digraph ⟨nn⟩ began to be abbreviated using a single ⟨n⟩ with a roughly wavy line above it, and it eventually became part of the Spanish alphabet in the eighteenth century, when it was first formally defined. Since then, it has been adopted by other languages, such as Galician , Asturian , Aragonese , Basque , Chavacano , several Philippine languages (especially Filipino and the Bisayan group), Chamorro , Guarani , Quechua , Mapudungun , Mandinka , Papiamento , and Tetun . Unlike many other letters that use diacritics (such as ⟨ ü ⟩ in Catalan and Spanish and ⟨ ç ⟩ in Catalan ), ⟨ñ⟩ in Spanish , Galician , Basque , Asturian , Leonese , Guarani and Filipino is considered a letter in its own right, has its own name (Spanish: eñe ), and its own place in the alphabet (after ⟨n⟩ ).", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-1", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "Unlike many other letters that use diacritics (such as ⟨ ü ⟩ in Catalan and Spanish and ⟨ ç ⟩ in Catalan ), ⟨ñ⟩ in Spanish , Galician , Basque , Asturian , Leonese , Guarani and Filipino is considered a letter in its own right, has its own name (Spanish: eñe ), and its own place in the alphabet (after ⟨n⟩ ). Its alphabetical independence is similar to the Germanic ⟨ w ⟩ , which came from a doubled ⟨ v ⟩ . It was engraved in Alhambra after Reconquista by the Catholic Monarchs , meaning that both Queen Isabella I of Castile and King Ferdinand II of Aragon were equivalent in power (\" Tanto monta, monta tanto, Isabel como Fernando \").", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-2", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "It was engraved in Alhambra after Reconquista by the Catholic Monarchs , meaning that both Queen Isabella I of Castile and King Ferdinand II of Aragon were equivalent in power (\" Tanto monta, monta tanto, Isabel como Fernando \"). Historically, ⟨ñ⟩ arose as a ligature of ⟨nn⟩ ; the tilde was shorthand for the second ⟨n⟩ , written over the first; compare umlaut , of analogous origin. It is a letter in the Spanish alphabet that is used for many words—for example, the Spanish word año \"year\" ( ⟨anno⟩ in Old Spanish ) derived from Latin : annus .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-3", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "It is a letter in the Spanish alphabet that is used for many words—for example, the Spanish word año \"year\" ( ⟨anno⟩ in Old Spanish ) derived from Latin : annus . Other languages used the macron over an ⟨n⟩ or ⟨m⟩ to indicate simple doubling. Already in medieval Latin palaeography, the sign that in Spanish came to be called virgulilla (\"little comma\") was used over a vowel to indicate a following nasal consonant ( ⟨n⟩ or ⟨m⟩ ) that had been omitted, as in tãtus for tantus or quã for quam . This usage was passed on to other languages using the Latin alphabet although it was subsequently dropped by most.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-4", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "This usage was passed on to other languages using the Latin alphabet although it was subsequently dropped by most. Spanish retained it, however, in some specific cases, particularly to indicate the palatal nasal , the sound that is now spelt as ⟨ñ⟩ . The word tilde comes from Spanish, derived by metathesis of the word título as tidlo , this originally from Latin TITVLVS \"title\" or \"heading\"; compare cabildo with Latin CAPITULUM . From spellings of anno abbreviated as año , as explained above, the tilde was thenceforth transferred to the ⟨n⟩ and kept as a useful expedient to indicate the new palatal nasal sound that Spanish had developed in that position: año .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-5", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "From spellings of anno abbreviated as año , as explained above, the tilde was thenceforth transferred to the ⟨n⟩ and kept as a useful expedient to indicate the new palatal nasal sound that Spanish had developed in that position: año . The sign was also adopted for the same palatal nasal in all other cases, even when it did not derive from an original ⟨nn⟩ , as in leña (from Latin ligna ) or señor (from Latin SENIOR ). Other Romance languages have different spellings for this sound: Italian and French use ⟨gn⟩ , a consonant cluster that had evolved from Latin, whereas Occitan and Portuguese chose ⟨nh⟩ and Catalan ⟨ny⟩ even though these digraphs had no etymological precedent.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-6", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "Other Romance languages have different spellings for this sound: Italian and French use ⟨gn⟩ , a consonant cluster that had evolved from Latin, whereas Occitan and Portuguese chose ⟨nh⟩ and Catalan ⟨ny⟩ even though these digraphs had no etymological precedent. When Morse code was extended to cover languages other than English, a sequence ( — — · — — ) was allotted for this character. Although ⟨ñ⟩ is used by other languages whose spellings were influenced by Spanish, it originated in Spanish and has become a distinctive symbol of the language's identity. This is also the case of Philippine languages , Aymara , Basque , Bubi language , Chamorro , Guarani , Leonese , Mapudungún , Quechua , and Yavapai , whose orthographies have some basis in that of Spanish as their areas were controlled by Spain at one point.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-7", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "This is also the case of Philippine languages , Aymara , Basque , Bubi language , Chamorro , Guarani , Leonese , Mapudungún , Quechua , and Yavapai , whose orthographies have some basis in that of Spanish as their areas were controlled by Spain at one point. It is also used in Tetum and Iñupiaq with the same phonetic value. Senegal is unique among countries of West Africa in using this letter. In Tetum , it was adopted to represent the same sound in Portuguese loanwords represented by ⟨nh⟩ , although this is also used in Tetum, as is ⟨ny⟩ , influenced by Indonesian .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-8", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "In Tetum , it was adopted to represent the same sound in Portuguese loanwords represented by ⟨nh⟩ , although this is also used in Tetum, as is ⟨ny⟩ , influenced by Indonesian . In Tagalog , Visayan , and other Philippine languages , most Spanish terms that include ⟨ñ⟩ are respelled with ⟨ny⟩ . The conventional exceptions (with considerable variations) are proper names, which usually retain ⟨ñ⟩ and their original Spanish or Hispanicised spelling ( Santo Niño , Parañaque , Mañalac , Malacañan ). It is collated as the 15th letter of the Filipino alphabet .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-9", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "The conventional exceptions (with considerable variations) are proper names, which usually retain ⟨ñ⟩ and their original Spanish or Hispanicised spelling ( Santo Niño , Parañaque , Mañalac , Malacañan ). It is collated as the 15th letter of the Filipino alphabet . The form ⟨ñg⟩ became a more common way to represent ⟨n͠g⟩ until the early 20th century, mainly because it was more readily available in typesets than the tilde spanning both letters. It is also used to represent the velar nasal in Crimean Tatar and Nauruan . In Malay , the Congress Spelling System (1957–1972) formerly used it for /ŋ/ before /ɡ/ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-10", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "It is also used to represent the velar nasal in Crimean Tatar and Nauruan . In Malay , the Congress Spelling System (1957–1972) formerly used it for /ŋ/ before /ɡ/ . In Latin-script writing of the Tatar language and Lule Sámi language , ⟨ñ⟩ is sometimes used as a substitute for ꞑ (Tatar) or ŋ (Lule Sámi), which is not available on many computer systems. In the Breton language , it nasalises the preceding vowel, as in Jañ /ʒã/ , which corresponds to the French name Jean and has the same pronunciation. It is used in a number of English terms of Spanish origin, such as jalapeño , piña colada , piñata , and El Niño .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-11", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "It is used in a number of English terms of Spanish origin, such as jalapeño , piña colada , piñata , and El Niño . The Spanish word cañón , however, became naturalized as canyon (though in British English it is occasionally spelt cañon ). Until the middle of the 20th century, adapting it as nn was more common in English, as in the phrase \" Battle of Corunna \" . Latin publisher Bill Teck labeled Hispanic culture and its influence on the United States \"Generation Ñ\" and later started a magazine with that name.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-12", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "Latin publisher Bill Teck labeled Hispanic culture and its influence on the United States \"Generation Ñ\" and later started a magazine with that name. Organizations such as the Instituto Cervantes and the National Association of Hispanic Journalists have adopted the letter as their mark for Hispanic heritage. It was used in the Spanish Republican Air Force for aircraft identification. The circumstances surrounding the crash of serial 'Ñ' Potez 540 plane that was shot down over the Sierra de Gúdar range of the Sistema Ibérico near Valdelinares inspired French writer André Malraux to write the novel L'Espoir (1937), translated into English as Man's Hope and made into the movie named Espoir: Sierra de Teruel .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-13", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "The circumstances surrounding the crash of serial 'Ñ' Potez 540 plane that was shot down over the Sierra de Gúdar range of the Sistema Ibérico near Valdelinares inspired French writer André Malraux to write the novel L'Espoir (1937), translated into English as Man's Hope and made into the movie named Espoir: Sierra de Teruel . In 1991, a European Community report recommended the repeal of a regulation preventing the sale in Spain of computer products not supporting \"all the characteristics of the Spanish writing system,\" claiming that it was a protectionist measure against the principles of the free market.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-14", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "In 1991, a European Community report recommended the repeal of a regulation preventing the sale in Spain of computer products not supporting \"all the characteristics of the Spanish writing system,\" claiming that it was a protectionist measure against the principles of the free market. The Real Academia Española stated that the matter was a serious attack against the language. The replacement of ⟨ñ⟩ with another letter alters the pronunciation and meaning of a word or name, in the same manner that replacing any letter in a given word with another one would. For example, Peña is a common Spanish surname and a common noun that means \"rocky hill\"; it is often anglicized as Pena , changing the name to the Spanish word for \"pity\", often used in terms of sorrow.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-15", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "For example, Peña is a common Spanish surname and a common noun that means \"rocky hill\"; it is often anglicized as Pena , changing the name to the Spanish word for \"pity\", often used in terms of sorrow. When Federico Peña was first running for mayor of Denver in 1983, the Denver Post printed his name without the tilde as \"Pena.\" After he won the election, they began printing his name with the tilde. As Peña's administration had many critics, their objections were sometimes whimsically expressed as \"ÑO.\" Since 2011, CNN's Spanish-language news channel incorporates a new logo wherein a tilde is placed over both ⟨n⟩ .", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-16", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "As Peña's administration had many critics, their objections were sometimes whimsically expressed as \"ÑO.\" Since 2011, CNN's Spanish-language news channel incorporates a new logo wherein a tilde is placed over both ⟨n⟩ . Another news channel, TLN en Español , has ⟨tlñ⟩ , with ⟨ñ⟩ taking the place of the expected ⟨n⟩ , as its logo. As part of April Fool's Day , in 2013, Puerto Rican linguistics professor Aida Vergne penned a mock newspaper article stating that the Royal Spanish Academy had opted to eliminate ⟨ñ⟩ from Spanish, instead being replaced by the original ⟨nn⟩ in Old Spanish.", "tags": [] }, { "id": "https://en.wikipedia.org/wiki/%C3%91-17", "source": "https://en.wikipedia.org/wiki/%C3%91", "title": "Ñ", "text": "As part of April Fool's Day , in 2013, Puerto Rican linguistics professor Aida Vergne penned a mock newspaper article stating that the Royal Spanish Academy had opted to eliminate ⟨ñ⟩ from Spanish, instead being replaced by the original ⟨nn⟩ in Old Spanish. As the Academy had previously eliminated letters such as ⟨ ch ⟩ and ⟨ ll ⟩ , such an allegation was taken seriously and occasionally the Academy has to resort to deny and clarify the allegation. ^ Forging Man's Fate in Spain , The Nation , 20 March 1937 ^ \"El Triunfo De La Ñ – Afirmación De Hispanoamerica | Blog De Luis Durán Rojo\" .", "tags": [] } ], "stats": { "chunks": 1020, "terms": 6287 }, "chat_turns": [ { "user": "Artificial intelligence is", "assistant": "I think artificial intelligence (AI) is the capability of computational systems to perform tasks typically associated with human intelligence, such as learning, reasoning, problem-solving, perception, and decision-making.\n\nKey ideas:\n- Philosophy Philosophy of artificial intelligence Philosophical debates have historically sought to determine the nature of intelligence and how to make intelligent machines.\n- Existential risk Existential risk from artificial intelligence Recent public debates in artificial intelligence have increasingly focused on its broader societal and ethical implications.\n- General intelligence A machine with artificial general intelligence would be able to solve a wide variety of problems with breadth and versatility similar to human intelligence. Quick version: the answer above is compiled from the cleanest matching memory I found.", "time": 1779839661.2163925 }, { "user": "yo", "assistant": "Yo, what’s up?", "time": 1779839669.0719552 }, { "user": "how are you?", "assistant": "I’m not sure from memory yet. Add a page about that, then ask again.", "time": 1779839675.6703973 }, { "user": "what is space?", "assistant": "Which one do you mean by space: outer space, physical space, mathematical space, computer storage space?", "time": 1779839687.8857322 }, { "user": "outer space", "assistant": "The space of possible future actions and situations is typically intractably large, so the agents must take actions and evaluate situations while being uncertain of what the outcome will be.\n\nKey ideas:\n- Simple exhaustive searches are rarely sufficient for most real-world problems: the search space (the number of places to search) quickly grows to astronomical numbers.\n- Search and optimization There are two different kinds of search used in AI: state space search and local search.\n- Techniques AI research uses a wide variety of techniques to accomplish the goals above. Quick version: the answer above is compiled from the cleanest matching memory I found.", "time": 1779839701.1641803 }, { "user": "what is ai?", "assistant": "Yeah — basically, many other topics in philosophy are relevant to AI, such as epistemology and free will.\n\nKey ideas:\n- Artificial intelligence (AI) is the capability of computational systems to perform tasks typically associated with human intelligence, such as learning, reasoning, problem-solving, perception, and decision-making.\n- Techniques AI research uses a wide variety of techniques to accomplish the goals above.\n- Search and optimization There are two different kinds of search used in AI: state space search and local search. Quick version: it is about making computers act more intelligently instead of only following fixed step-by-step instructions.", "time": 1779841204.7060652 } ], "learned_notes": [ { "text": "Artificial intelligence is", "keywords": [ "artificial", "intelligence" ], "time": 1779839661.2163985 } ], "recent_topic": "artificial intelligence", "user_preferences": { "answer_length": "short" } }