搜索结果：infinite

Let C_1, C_2, ... be a sequence of separable unital C*-algebras, equipped with faithful tracial states and satisfying a mild condition. Let A be a unital direct limit of one dimensional NCCW complexes, also equipped with a faithful tracial state. Suppose there is a unital trace preserving embedding of A in the Jiang-Su algebra which is an isomorphism on K-theory. (For example, A could be C([0,1]) with Lebesgue measure, or the Jiang-Su algebra itself.) Let D be the infinite reduced free product of the algebras C_n. Then the reduced free product A*D is isomorphic to D. If D is exact and the factors satisfy a blockwise real rank zero condition, then in place of A we can use C(X) for any contractible compact metric space X and any faithful tracial state on C(X). An example consequence is that the reduced free product of infinitely many copies of C([0,1]), with Lebesgue measure, is isomorphic to the reduced free product of infinitely many copies of the Jiang-Su algebra.

We show that the infinite product defined by \[ P(z) = -\prod_{n=1}^{\infty} (Φ_n(z))^{-1/n}, \] where \( Φ_n(z) \) is the \( n \)-th cyclotomic polynomial, is constant inside the unit disk. The proof translates a result of Ramanujan on Ramanujan sums, equivalent to the prime number theorem, to the setting of infinite products. We also show that similar identities proved by Ramanujan lead to additional results on infinite cyclotomic products.

Large-scale articulated objects with high quality are desperately needed for multiple tasks related to embodied AI. Most existing methods for creating articulated objects are either data-driven or simulation based, which are limited by the scale and quality of the training data or the fidelity and heavy labour of the simulation. In this paper, we propose Infinite Mobility, a novel method for synthesizing high-fidelity articulated objects through procedural generation. User study and quantitative evaluation demonstrate that our method can produce results that excel current state-of-the-art methods and are comparable to human-annotated datasets in both physics property and mesh quality. Furthermore, we show that our synthetic data can be used as training data for generative models, enabling next-step scaling up. Code is available at https://github.com/Intern-Nexus/Infinite-Mobility

We introduce the game of infinite Hex, extending the familiar finite game to natural play on the infinite hexagonal lattice. Whereas the finite game is a win for the first player, we prove in contrast that infinite Hex is a draw -- both players have drawing strategies. Meanwhile, the transfinite game-value phenomenon, now abundantly exhibited in infinite chess and infinite draughts, regrettably does not arise in infinite Hex; only finite game values occur. Indeed, every game-valued position in infinite Hex is intrinsically local, meaning that winning play depends only on a fixed finite region of the board. This latter fact is proved under very general hypotheses, establishing the conclusion for all simple stone-placing games.

The aim of this note is to introduce a notion of dynamical entropy, which we call infinite-product entropy, for probability measures on (countable) infinite cartesian product of any measurable space with itself. The idea behind the definition is that any infinite product space may be considered as a type of dynamical object. We have considered in a previous note a similar idea in topological dynamics to define a notion of dynamical entropy for arbitrary subsets of infinite products of compact topological spaces. We consider some basic properties of infinite-product entropy, e.g. shift invariance, convexity, subadditivity with respect to product of probability measures, the behavior with respect to dilation and restriction. We show that for a translation invariant probability measure the infinite-product entropy coincides with the usual entropy of a shift transformation. We consider some basic examples and computations. We also consider a variational inequality related to infinite-product entropy and topological entropy of subsets of infinite product spaces.

We develop a form Thompson sampling for online learning under full feedback - also known as prediction with expert advice - where the learner's prior is defined over the space of an adversary's future actions, rather than the space of experts. We show regret decomposes into regret the learner expected a priori, plus a prior-robustness-type term we call excess regret. In the classical finite-expert setting, this recovers optimal rates. As an initial step towards practical online learning in settings with a potentially-uncountably-infinite number of experts, we show that Thompson sampling over the $d$-dimensional unit cube, using a certain Gaussian process prior widely-used in the Bayesian optimization literature, has a $\mathcal{O}\Big(β\sqrt{Td\log(1+\sqrt{d}\fracλβ)}\Big)$ rate against a $β$-bounded $λ$-Lipschitz adversary.

We introduce the concept of a generative infinite game, a video game that transcends the traditional boundaries of finite, hard-coded systems by using generative models. Inspired by James P. Carse's distinction between finite and infinite games, we leverage recent advances in generative AI to create Unbounded: a game of character life simulation that is fully encapsulated in generative models. Specifically, Unbounded draws inspiration from sandbox life simulations and allows you to interact with your autonomous virtual character in a virtual world by feeding, playing with and guiding it - with open-ended mechanics generated by an LLM, some of which can be emergent. In order to develop Unbounded, we propose technical innovations in both the LLM and visual generation domains. Specifically, we present: (1) a specialized, distilled large language model (LLM) that dynamically generates game mechanics, narratives, and character interactions in real-time, and (2) a new dynamic regional image prompt Adapter (IP-Adapter) for vision models that ensures consistent yet flexible visual generation of a character across multiple environments. We evaluate our system through both qualitative and qu

Given any separable complex Hilbert space, any trace-class operator $B$ which does not have purely imaginary trace, and any generator $L$ of a norm-continuous one-parameter semigroup of completely positive maps we prove that there exists a unique bounded operator $K$ and a unique completely positive map $Φ$ such that (i) $L=K(\cdot)+(\cdot)K^*+Φ$, (ii) the superoperator $Φ(B^*(\cdot)B)$ is trace class and has vanishing trace, and (iii) ${\rm tr}(B^*K)$ is a real number. Central to our proof is a modified version of the Choi formalism which relates completely positive maps to positive semi-definite operators. We characterize when this correspondence is injective and surjective, respectively, which in turn explains why the proof idea of our main result cannot extend to non-separable Hilbert spaces. In particular, we find examples of positive semi-definite operators which have empty pre-image under the Choi formalism as soon as the underlying Hilbert space is infinite-dimensional.

We show that if $\mathbb{R}^{n}$ is equipped with certain non-doubling metric and an Orlicz-Sobolev inequality holds for a special family of Young functions $Φ$, then weak solutions to quasilinear infinitely degenerate elliptic divergence equations of the form $$\mathrm{div}\mathcal{A}\left( x,u\right) abla u=φ_{0}-\mathrm{div}_{A} \vecφ_{1}$$ are locally bounded. Furthermore, we establish a maximum principle for solutions whenever a global Orlicz-Soblev estimate is available. We obtain these results via the implementation of a Moser iteration method, what constitutes the first instance of such technique applied to infinite degenerate equations. These results partially extend previously known estimates for solutions of these equations but for which the right hand side did not have a drift term. We also obtain bounds for small negative powers of nonnegative solutions; these will be applied to obtain continuity of solutions in a subsequent paper.

We investigate the transfinite game values arising in infinite chess, providing both upper and lower bounds on the supremum of these values---the omega one of chess---with two senses depending on whether one considers only finite positions or also positions with infinitely many pieces. For lower bounds, we present specific infinite positions with transfinite game values of omega, omega^2, omega^2 times k, and omega^3. By embedding trees into chess, we show that there is a computable infinite chess position that is a win for white if the players are required to play according to a deterministic computable strategy, but which is a draw without that restriction. Finally, we prove that every countable ordinal arises as the game value of a position in infinite three-dimensional chess, and consequently the omega one of infinite three-dimensional chess is as large as it can be, namely, true omega one.

We study the scaling limit of statistical mechanics models with non-convex Hamiltonians that are gradient perturbations of Gaussian measures. Characterising features of our gradient models are the imposed boundary tilt and the surface tension (free energy) as a function of tilt. In the regime of low temperatures and bounded tilt, we prove the scaling limit with respect to infinite volume Gibbs states for macroscopic functions on the continuum, and we show that the limit is a continuum Gaussian Free Field with covariance (diffusion) matrix given as the Hessian of surface tension. Our proof of this longstanding conjecture for non-convex energy complements recent studies in [Hil16, ABKM], as well as the proof for strictly convex Hamiltonians in [AW22].

The object of this study are countably infinite games with perfect information that allow players to choose among arbitrarily many moves in a turn; in particular, we focus on the generalisations of the finite board games of Hex and Draughts. In chapter 1 we develop the theory of transfinite ordinal game values for open infinite games following Evans and Hamkins (arXiv:1302.4377), and we focus on the properties of the omega one, that is the supremum of the possible game values, of classes of open games; we moreover design the class of climbing-through-T games as a tool to study the omega one of given game classes. The original contributions of this research are presented in the following two chapters. In chapter 2 we prove classical results about finite Hex and present Infinite Hex, a well-defined infinite generalisation of Hex. We then introduce the class of stone-placing games, which captures the key features of Infinite Hex and further generalises the class of positional games already studied in the literature within the finite setting of Combinatorial Game Theory. The main result of this research is the characterization of open stone-placing games in terms of the property of ess

I consider the natural infinitary variations of the games Wordle and Mastermind, as well as their game-theoretic variations Absurdle and Madstermind, considering these games with infinitely long words and infinite color sequences and allowing transfinite game play. For each game, a secret codeword is hidden, which the codebreaker attempts to discover by making a series of guesses and receiving feedback as to their accuracy. In Wordle with words of any size from a finite alphabet of $n$ letters, including infinite words or even uncountable words, the codebreaker can nevertheless always win in $n$ steps. Meanwhile, the mastermind number, defined as the smallest winning set of guesses in infinite Mastermind for sequences of length $ω$ over a countable set of colors without duplication, is uncountable, but the exact value turns out to be independent of ZFC, for it is provably equal to the eventually different number $\frak{d}({ eq^*})$, which is the same as the covering number of the meager ideal $\text{cov}(\mathcal{M})$. I thus place all the various mastermind numbers, defined for the natural variations of the game, into the hierarchy of cardinal characteristics of the continuum.

We address two questions about the past for infinitely cyclic cosmology. The first is whether it can contain an infinite length null geodesic into the past in view of the Borde-Guth-Vilenkin (BGV) "no-go" theorem, The second is whether, given that a small fraction of spawned universes fail to cycle, there is an adequate probability for a successful universe after an infinite time. We give positive answers to both questions then show that in infinite cyclicity the total number of universes has been infinite for an arbitrarily long time.

In a recent paper, Altenbernd, Thomas and Wöhrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the Büchi and Muller ones, firstly used for infinite words. The authors asked for comparing the tiling system acceptance with an acceptance of pictures row by row using an automaton model over ordinal words of length $ω^2$. We give in this paper a solution to this problem, showing that all languages of infinite pictures which are accepted row by row by Büchi or Choueka automata reading words of length $ω^2$ are Büchi recognized by a finite tiling system, but the converse is not true. We give also the answer to two other questions which were raised by Altenbernd, Thomas and Wöhrle, showing that it is undecidable whether a Büchi recognizable language of infinite pictures is E-recognizable (respectively, A-recognizable).

Infinite determinantal measures introduced in this note are inductive limits of determinantal measures on an exhausting family of subsets of the phase space. Alternatively, an infinite determinantal measure can be described as a product of a determinantal process and a convergent, but not integrable, multiplicative functional. Theorem 2, the main result announced in this note, gives an explicit description for the ergodic decomposition of infinite Pickrell measures on the spaces of infinite complex matrices in terms of infinite determinantal measures obtained by finite-rank perturbations of Bessel point processes.

The purpose of this paper is to suggest the construction and study properties of semi-infinite induction, which relates to semi-infinite cohomology the same way induction relates to homology and coinduction to cohomology. We prove a version of the Shapiro Lemma, relating the semi-infinite cohomology of a module with that of the semi-infinitely induced module. A practical outcome of our construction is a simple construction of Wakimoto modules, highest-weight modules used in double-sided BGG resolutions of irreducible modules.

Consider the infinite Atlas model: a semi-infinite collection of particles driven by independent standard Brownian motions with zero drifts, except for the bottom-ranked particle which receives unit drift. We derive a continuum one-parameter family of product-of-exponentials stationary gap distributions, with exponentially growing density at infinity. This result shows that there are infinitely many stationary gap distributions for the Atlas model, and hence resolves a conjecture of Pal and Pitman (2008) in the negative. This result is further generalized for infinite systems of competing Brownian particles with generic rank-based drifts.

We prove that the classical normal distribution is infinitely divisible with respect to the free additive convolution. We study the Voiculescu transform first by giving a survey of its combinatorial implications and then analytically, including a proof of free infinite divisibility. In fact we prove that a subfamily Askey-Wimp-Kerov distributions are freely infinitely divisible, of which the normal distribution is a special case. At the time of this writing this is only the third example known to us of a nontrivial distribution that is infinitely divisible with respect to both classical and free convolution, the others being the Cauchy distribution and the free 1/2-stable distribution.